Boost-Commit :

Date view	Thread view	Subject view	Author view

Subject: [Boost-commit] svn:boost r73292 - in sandbox/move/libs: container/doc container/doc/html container/doc/html/boost/container container/doc/html/container container/test intrusive intrusive/doc intrusive/doc/html intrusive/doc/html/images intrusive/example intrusive/perf intrusive/proj/vc7ide intrusive/proj/vc7ide/_intrusivelib intrusive/proj/vc7ide/any_test intrusive/proj/vc7ide/avl_multiset intrusive/proj/vc7ide/avl_set intrusive/proj/vc7ide/custom_bucket_traits intrusive/proj/vc7ide/default_hook intrusive/proj/vc7ide/external_value_traits intrusive/proj/vc7ide/list intrusive/proj/vc7ide/make_functions intrusive/proj/vc7ide/multiset intrusive/proj/vc7ide/perf_test intrusive/proj/vc7ide/set intrusive/proj/vc7ide/sg_multiset intrusive/proj/vc7ide/sg_set intrusive/proj/vc7ide/slist intrusive/proj/vc7ide/splay_multiset intrusive/proj/vc7ide/splay_set intrusive/proj/vc7ide/stateful_value_traits intrusive/proj/vc7ide/treap_multiset intrusive/proj/vc7ide/treap_set intrusive/proj/vc7ide/unordered_multiset intrusive/proj/vc7ide/unordered_set intrusive/proj/vc7ide/virtual_base intrusive/test move/doc move/doc/html move/doc/html/boost move/doc/html/images move/doc/html/move move/example move/proj/vc7ide move/test
From: igaztanaga_at_[hidden]
Date: 2011-07-21 19:08:20

Author: igaztanaga
Date: 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
New Revision: 73292
URL: http://svn.boost.org/trac/boost/changeset/73292

Log:
Updated Container to latest version
Added:
   sandbox/move/libs/container/doc/html/boost/container/ordered_unique_range_im_id293621.html (contents, props changed)
   sandbox/move/libs/container/doc/html/boost/container/ordered_unique_range_im_id358162.html (contents, props changed)
   sandbox/move/libs/container/doc/html/boost/container/ordered_unique_range_im_id367403.html (contents, props changed)
   sandbox/move/libs/container/doc/html/boost/container/ordered_unique_range_im_id367446.html (contents, props changed)
   sandbox/move/libs/container/doc/html/boost/container/ordered_unique_range_im_id368672.html (contents, props changed)
   sandbox/move/libs/container/doc/html/boost/container/ordered_unique_range_im_id370119.html (contents, props changed)
   sandbox/move/libs/container/doc/html/boost/container/ordered_unique_range_im_id371369.html (contents, props changed)
   sandbox/move/libs/container/doc/html/boost/container/ordered_unique_range_im_id377276.html (contents, props changed)
   sandbox/move/libs/container/doc/html/boost/container/ordered_unique_range_im_id378857.html (contents, props changed)
Removed:
   sandbox/move/libs/container/test/boost_interprocess_check.hpp
   sandbox/move/libs/intrusive/CMakeLists.txt
   sandbox/move/libs/intrusive/doc/Jamfile.v2
   sandbox/move/libs/intrusive/doc/html/boostbook.css
   sandbox/move/libs/intrusive/doc/html/images/blank.png
   sandbox/move/libs/intrusive/doc/html/images/caution.png
   sandbox/move/libs/intrusive/doc/html/images/draft.png
   sandbox/move/libs/intrusive/doc/html/images/home.png
   sandbox/move/libs/intrusive/doc/html/images/important.png
   sandbox/move/libs/intrusive/doc/html/images/next.png
   sandbox/move/libs/intrusive/doc/html/images/note.png
   sandbox/move/libs/intrusive/doc/html/images/prev.png
   sandbox/move/libs/intrusive/doc/html/images/tip.png
   sandbox/move/libs/intrusive/doc/html/images/toc-blank.png
   sandbox/move/libs/intrusive/doc/html/images/toc-minus.png
   sandbox/move/libs/intrusive/doc/html/images/toc-plus.png
   sandbox/move/libs/intrusive/doc/html/images/up.png
   sandbox/move/libs/intrusive/doc/html/images/warning.png
   sandbox/move/libs/intrusive/doc/html/reference.css
   sandbox/move/libs/intrusive/doc/intrusive.qbk
   sandbox/move/libs/intrusive/example/Jamfile.v2
   sandbox/move/libs/intrusive/example/doc_advanced_value_traits.cpp
   sandbox/move/libs/intrusive/example/doc_advanced_value_traits2.cpp
   sandbox/move/libs/intrusive/example/doc_any_hook.cpp
   sandbox/move/libs/intrusive/example/doc_assoc_optimized_code.cpp
   sandbox/move/libs/intrusive/example/doc_auto_unlink.cpp
   sandbox/move/libs/intrusive/example/doc_avl_set.cpp
   sandbox/move/libs/intrusive/example/doc_avltree_algorithms.cpp
   sandbox/move/libs/intrusive/example/doc_bucket_traits.cpp
   sandbox/move/libs/intrusive/example/doc_clone_from.cpp
   sandbox/move/libs/intrusive/example/doc_entity.cpp
   sandbox/move/libs/intrusive/example/doc_erasing_and_disposing.cpp
   sandbox/move/libs/intrusive/example/doc_external_value_traits.cpp
   sandbox/move/libs/intrusive/example/doc_how_to_use.cpp
   sandbox/move/libs/intrusive/example/doc_iterator_from_value.cpp
   sandbox/move/libs/intrusive/example/doc_list.cpp
   sandbox/move/libs/intrusive/example/doc_list_algorithms.cpp
   sandbox/move/libs/intrusive/example/doc_offset_ptr.cpp
   sandbox/move/libs/intrusive/example/doc_positional_insertion.cpp
   sandbox/move/libs/intrusive/example/doc_rbtree_algorithms.cpp
   sandbox/move/libs/intrusive/example/doc_set.cpp
   sandbox/move/libs/intrusive/example/doc_sg_set.cpp
   sandbox/move/libs/intrusive/example/doc_slist.cpp
   sandbox/move/libs/intrusive/example/doc_slist_algorithms.cpp
   sandbox/move/libs/intrusive/example/doc_splay_algorithms.cpp
   sandbox/move/libs/intrusive/example/doc_splay_set.cpp
   sandbox/move/libs/intrusive/example/doc_splaytree_algorithms.cpp
   sandbox/move/libs/intrusive/example/doc_stateful_value_traits.cpp
   sandbox/move/libs/intrusive/example/doc_treap_algorithms.cpp
   sandbox/move/libs/intrusive/example/doc_treap_set.cpp
   sandbox/move/libs/intrusive/example/doc_unordered_set.cpp
   sandbox/move/libs/intrusive/example/doc_value_traits.cpp
   sandbox/move/libs/intrusive/example/doc_window.cpp
   sandbox/move/libs/intrusive/index.html
   sandbox/move/libs/intrusive/module.cmake
   sandbox/move/libs/intrusive/perf/Jamfile.v2
   sandbox/move/libs/intrusive/perf/perf_list.cpp
   sandbox/move/libs/intrusive/proj/vc7ide/Intrusive.sln
   sandbox/move/libs/intrusive/proj/vc7ide/Intrusive.vcproj
   sandbox/move/libs/intrusive/proj/vc7ide/_intrusivelib/_intrusivelib.vcproj
   sandbox/move/libs/intrusive/proj/vc7ide/any_test/any_test.vcproj
   sandbox/move/libs/intrusive/proj/vc7ide/avl_multiset/avl_multiset.vcproj
   sandbox/move/libs/intrusive/proj/vc7ide/avl_set/avl_set.vcproj
   sandbox/move/libs/intrusive/proj/vc7ide/custom_bucket_traits/custom_bucket_traits.vcproj
   sandbox/move/libs/intrusive/proj/vc7ide/default_hook/default_hook.vcproj
   sandbox/move/libs/intrusive/proj/vc7ide/external_value_traits/external_value_traits.vcproj
   sandbox/move/libs/intrusive/proj/vc7ide/list/list.vcproj
   sandbox/move/libs/intrusive/proj/vc7ide/make_functions/make_functions.vcproj
   sandbox/move/libs/intrusive/proj/vc7ide/multiset/multiset.vcproj
   sandbox/move/libs/intrusive/proj/vc7ide/perf_test/perf_test.vcproj
   sandbox/move/libs/intrusive/proj/vc7ide/set/set.vcproj
   sandbox/move/libs/intrusive/proj/vc7ide/sg_multiset/sg_multiset.vcproj
   sandbox/move/libs/intrusive/proj/vc7ide/sg_set/sg_set.vcproj
   sandbox/move/libs/intrusive/proj/vc7ide/slist/slist.vcproj
   sandbox/move/libs/intrusive/proj/vc7ide/splay_multiset/splay_multiset.vcproj
   sandbox/move/libs/intrusive/proj/vc7ide/splay_set/splay_set.vcproj
   sandbox/move/libs/intrusive/proj/vc7ide/stateful_value_traits/stateful_value_traits.vcproj
   sandbox/move/libs/intrusive/proj/vc7ide/to-do.txt
   sandbox/move/libs/intrusive/proj/vc7ide/treap_multiset/treap_multiset.vcproj
   sandbox/move/libs/intrusive/proj/vc7ide/treap_set/treap_set.vcproj
   sandbox/move/libs/intrusive/proj/vc7ide/unordered_multiset/unordered_multiset.vcproj
   sandbox/move/libs/intrusive/proj/vc7ide/unordered_set/unordered_set.vcproj
   sandbox/move/libs/intrusive/proj/vc7ide/virtual_base/virtual_base.vcproj
   sandbox/move/libs/intrusive/test/Jamfile.v2
   sandbox/move/libs/intrusive/test/any_test.cpp
   sandbox/move/libs/intrusive/test/avl_multiset_test.cpp
   sandbox/move/libs/intrusive/test/avl_set_test.cpp
   sandbox/move/libs/intrusive/test/common_functors.hpp
   sandbox/move/libs/intrusive/test/custom_bucket_traits_test.cpp
   sandbox/move/libs/intrusive/test/default_hook_test.cpp
   sandbox/move/libs/intrusive/test/external_value_traits_test.cpp
   sandbox/move/libs/intrusive/test/generic_assoc_test.hpp
   sandbox/move/libs/intrusive/test/generic_multiset_test.hpp
   sandbox/move/libs/intrusive/test/generic_set_test.hpp
   sandbox/move/libs/intrusive/test/itestvalue.hpp
   sandbox/move/libs/intrusive/test/list_test.cpp
   sandbox/move/libs/intrusive/test/make_functions_test.cpp
   sandbox/move/libs/intrusive/test/multiset_test.cpp
   sandbox/move/libs/intrusive/test/set_test.cpp
   sandbox/move/libs/intrusive/test/sg_multiset_test.cpp
   sandbox/move/libs/intrusive/test/sg_set_test.cpp
   sandbox/move/libs/intrusive/test/slist_test.cpp
   sandbox/move/libs/intrusive/test/smart_ptr.hpp
   sandbox/move/libs/intrusive/test/splay_multiset_test.cpp
   sandbox/move/libs/intrusive/test/splay_set_test.cpp
   sandbox/move/libs/intrusive/test/stateful_value_traits_test.cpp
   sandbox/move/libs/intrusive/test/test_container.hpp
   sandbox/move/libs/intrusive/test/test_macros.hpp
   sandbox/move/libs/intrusive/test/treap_multiset_test.cpp
   sandbox/move/libs/intrusive/test/treap_set_test.cpp
   sandbox/move/libs/intrusive/test/unordered_multiset_test.cpp
   sandbox/move/libs/intrusive/test/unordered_set_test.cpp
   sandbox/move/libs/intrusive/test/virtual_base_test.cpp
   sandbox/move/libs/move/doc/Jamfile.v2
   sandbox/move/libs/move/doc/html/BOOST_COPYABLE_AND_MOVABLE.html
   sandbox/move/libs/move/doc/html/BOOST_COPY_ASSIGN_REF.html
   sandbox/move/libs/move/doc/html/BOOST_FWD_REF.html
   sandbox/move/libs/move/doc/html/BOOST_MOVABLE_BUT_NOT_COPYABLE.html
   sandbox/move/libs/move/doc/html/BOOST_MOVE_OPTIMIZED_EMULATION.html
   sandbox/move/libs/move/doc/html/BOOST_RV_REF.html
   sandbox/move/libs/move/doc/html/boost/back_move_insert_iterator.html
   sandbox/move/libs/move/doc/html/boost/back_move_inserter.html
   sandbox/move/libs/move/doc/html/boost/forward.html
   sandbox/move/libs/move/doc/html/boost/front_move_insert_iterator.html
   sandbox/move/libs/move/doc/html/boost/front_move_inserter.html
   sandbox/move/libs/move/doc/html/boost/has_nothrow_move.html
   sandbox/move/libs/move/doc/html/boost/has_trivial_destructor__id336849.html
   sandbox/move/libs/move/doc/html/boost/has_trivial_destructor__id339034.html
   sandbox/move/libs/move/doc/html/boost/is_movable.html
   sandbox/move/libs/move/doc/html/boost/make_move_iterator.html
   sandbox/move/libs/move/doc/html/boost/move_backward.html
   sandbox/move/libs/move/doc/html/boost/move_id336863.html
   sandbox/move/libs/move/doc/html/boost/move_id337012.html
   sandbox/move/libs/move/doc/html/boost/move_id339048.html
   sandbox/move/libs/move/doc/html/boost/move_id339197.html
   sandbox/move/libs/move/doc/html/boost/move_insert_iterator.html
   sandbox/move/libs/move/doc/html/boost/move_inserter.html
   sandbox/move/libs/move/doc/html/boost/move_iterator.html
   sandbox/move/libs/move/doc/html/boost/uninitialized_copy_or_move.html
   sandbox/move/libs/move/doc/html/boost/uninitialized_move.html
   sandbox/move/libs/move/doc/html/boostbook.css
   sandbox/move/libs/move/doc/html/images/blank.png
   sandbox/move/libs/move/doc/html/images/caution.png
   sandbox/move/libs/move/doc/html/images/draft.png
   sandbox/move/libs/move/doc/html/images/home.png
   sandbox/move/libs/move/doc/html/images/important.png
   sandbox/move/libs/move/doc/html/images/next.png
   sandbox/move/libs/move/doc/html/images/note.png
   sandbox/move/libs/move/doc/html/images/prev.png
   sandbox/move/libs/move/doc/html/images/tip.png
   sandbox/move/libs/move/doc/html/images/toc-blank.png
   sandbox/move/libs/move/doc/html/images/toc-minus.png
   sandbox/move/libs/move/doc/html/images/toc-plus.png
   sandbox/move/libs/move/doc/html/images/up.png
   sandbox/move/libs/move/doc/html/images/warning.png
   sandbox/move/libs/move/doc/html/index.html
   sandbox/move/libs/move/doc/html/move/composition_inheritance.html
   sandbox/move/libs/move/doc/html/move/construct_forwarding.html
   sandbox/move/libs/move/doc/html/move/emulation_limitations.html
   sandbox/move/libs/move/doc/html/move/how_the_emulation_works.html
   sandbox/move/libs/move/doc/html/move/implementing_movable_classes.html
   sandbox/move/libs/move/doc/html/move/introduction.html
   sandbox/move/libs/move/doc/html/move/movable_only_classes.html
   sandbox/move/libs/move/doc/html/move/move_algorithms.html
   sandbox/move/libs/move/doc/html/move/move_and_containers.html
   sandbox/move/libs/move/doc/html/move/move_inserters.html
   sandbox/move/libs/move/doc/html/move/move_iterator.html
   sandbox/move/libs/move/doc/html/move/reference.html
   sandbox/move/libs/move/doc/html/move/thanks_to.html
   sandbox/move/libs/move/doc/html/move/two_emulation_modes.html
   sandbox/move/libs/move/doc/html/reference.css
   sandbox/move/libs/move/doc/move.qbk
   sandbox/move/libs/move/example/Jamfile.v2
   sandbox/move/libs/move/example/copymovable.hpp
   sandbox/move/libs/move/example/doc_clone_ptr.cpp
   sandbox/move/libs/move/example/doc_construct_forward.cpp
   sandbox/move/libs/move/example/doc_file_descriptor.cpp
   sandbox/move/libs/move/example/doc_how_works.cpp
   sandbox/move/libs/move/example/doc_move_algorithms.cpp
   sandbox/move/libs/move/example/doc_move_inserter.cpp
   sandbox/move/libs/move/example/doc_move_iterator.cpp
   sandbox/move/libs/move/example/movable.hpp
   sandbox/move/libs/move/proj/vc7ide/Move.sln
   sandbox/move/libs/move/proj/vc7ide/back_move_inserter_test.vcproj
   sandbox/move/libs/move/proj/vc7ide/construct_forward_test.vcproj
   sandbox/move/libs/move/proj/vc7ide/copy_elision_test.vcproj
   sandbox/move/libs/move/proj/vc7ide/copy_move_optimization.vcproj
   sandbox/move/libs/move/proj/vc7ide/doc_clone_ptr.vcproj
   sandbox/move/libs/move/proj/vc7ide/doc_construct_forward.vcproj
   sandbox/move/libs/move/proj/vc7ide/doc_file_descriptor.vcproj
   sandbox/move/libs/move/proj/vc7ide/doc_how_works.vcproj
   sandbox/move/libs/move/proj/vc7ide/doc_move_algorithms.vcproj
   sandbox/move/libs/move/proj/vc7ide/doc_move_inserter.vcproj
   sandbox/move/libs/move/proj/vc7ide/doc_move_iterator.vcproj
   sandbox/move/libs/move/proj/vc7ide/move_algorithm.vcproj
   sandbox/move/libs/move/proj/vc7ide/move_iterator_test.vcproj
   sandbox/move/libs/move/proj/vc7ide/move_test.vcproj
   sandbox/move/libs/move/test/Jamfile.v2
   sandbox/move/libs/move/test/back_move_inserter.cpp
   sandbox/move/libs/move/test/construct_forward.cpp
   sandbox/move/libs/move/test/copy_elision_test.cpp
   sandbox/move/libs/move/test/copy_move_optimization.cpp
   sandbox/move/libs/move/test/move.cpp
   sandbox/move/libs/move/test/move_algorithm.cpp
   sandbox/move/libs/move/test/move_iterator.cpp
Text files modified:
   sandbox/move/libs/container/doc/Jamfile.v2 | 3
   sandbox/move/libs/container/doc/container.qbk | 6
   sandbox/move/libs/container/doc/html/boost/container/basic_string.html | 559 ++++++++++++-------------
   sandbox/move/libs/container/doc/html/boost/container/deque.html | 513 +++++++++++++++++------
   sandbox/move/libs/container/doc/html/boost/container/flat_map.html | 334 +++++++-------
   sandbox/move/libs/container/doc/html/boost/container/flat_multimap.html | 304 +++++++-------
   sandbox/move/libs/container/doc/html/boost/container/flat_multiset.html | 308 +++++++-------
   sandbox/move/libs/container/doc/html/boost/container/flat_set.html | 304 +++++++-------
   sandbox/move/libs/container/doc/html/boost/container/list.html | 353 +++++++---------
   sandbox/move/libs/container/doc/html/boost/container/map.html | 322 +++++++-------
   sandbox/move/libs/container/doc/html/boost/container/multimap.html | 310 +++++++------
   sandbox/move/libs/container/doc/html/boost/container/multiset.html | 292 ++++++------
   sandbox/move/libs/container/doc/html/boost/container/ordered_range.html | 20
   sandbox/move/libs/container/doc/html/boost/container/ordered_range_impl_t.html | 24
   sandbox/move/libs/container/doc/html/boost/container/ordered_unique_range.html | 18
   sandbox/move/libs/container/doc/html/boost/container/set.html | 286 ++++++------
   sandbox/move/libs/container/doc/html/boost/container/slist.html | 358 ++++++++--------
   sandbox/move/libs/container/doc/html/boost/container/stable_vector.html | 554 ++++++++++++++++++------
   sandbox/move/libs/container/doc/html/boost/container/string.html | 20
   sandbox/move/libs/container/doc/html/boost/container/vector.html | 332 +++++++--------
   sandbox/move/libs/container/doc/html/boost/container/wstring.html | 20
   sandbox/move/libs/container/doc/html/boost_container_reference.html | 864 ++++++++++++++++++++--------------------
   sandbox/move/libs/container/doc/html/container/acknowledgements_notes.html | 28
   sandbox/move/libs/container/doc/html/container/emplace.html | 28
   sandbox/move/libs/container/doc/html/container/intro.html | 99 ++--
   sandbox/move/libs/container/doc/html/container/move_containers.html | 28
   sandbox/move/libs/container/doc/html/container/other_features.html | 40
   sandbox/move/libs/container/doc/html/container/recursive_containers.html | 30
   sandbox/move/libs/container/doc/html/container/release_notes.html | 20
   sandbox/move/libs/container/doc/html/index.html | 46 +-
   sandbox/move/libs/container/test/check_equal_containers.hpp | 36
   sandbox/move/libs/container/test/deque_test.cpp | 3
   sandbox/move/libs/container/test/emplace_test.hpp | 15
   sandbox/move/libs/container/test/flat_tree_test.cpp | 114 ++--
   sandbox/move/libs/container/test/list_test.cpp | 2
   sandbox/move/libs/container/test/list_test.hpp | 156 +++---
   sandbox/move/libs/container/test/map_test.hpp | 234 +++++-----
   sandbox/move/libs/container/test/movable_int.hpp | 29 +
   sandbox/move/libs/container/test/print_container.hpp | 12
   sandbox/move/libs/container/test/set_test.hpp | 298 ++++++------
   sandbox/move/libs/container/test/slist_test.cpp | 2
   sandbox/move/libs/container/test/string_test.cpp | 110 ++--
   sandbox/move/libs/container/test/tree_test.cpp | 88 ++--
   sandbox/move/libs/container/test/vector_test.hpp | 153 +++---
   44 files changed, 4076 insertions(+), 3599 deletions(-)

Modified: sandbox/move/libs/container/doc/Jamfile.v2
==============================================================================
--- sandbox/move/libs/container/doc/Jamfile.v2 (original)
+++ sandbox/move/libs/container/doc/Jamfile.v2 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
@@ -1,6 +1,6 @@
# Boost.Container library documentation Jamfile ---------------------------------
#
-# Copyright Ion Gaztanaga 2009. Use, modification and
+# Copyright Ion Gaztanaga 2009-2011. Use, modification and
# distribution is subject to the Boost Software License, Version
# 1.0. (See accompanying file LICENSE_1_0.txt or copy at
# http://www.boost.org/LICENSE_1_0.txt)
@@ -22,7 +22,6 @@
 <doxygen:param>MACRO_EXPANSION=YES
 <doxygen:param>"PREDEFINED=\"insert_const_ref_type= const T&\" \\
 \"BOOST_CONTAINER_DOXYGEN_INVOKED\" \\
- \"BOOST_ENABLE_MOVE_EMULATION(a)= \" \\
 \"BOOST_RV_REF(T)=T &&\" \\
 \"BOOST_COPY_ASSIGN_REF(T)=const T &\" \\
 \"BOOST_RV_REF_2_TEMPL_ARGS(T,a,b)=T<a, b> &&\" \\

Modified: sandbox/move/libs/container/doc/container.qbk
==============================================================================
--- sandbox/move/libs/container/doc/container.qbk (original)
+++ sandbox/move/libs/container/doc/container.qbk 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
@@ -1,5 +1,5 @@
[/
- / Copyright (c) 2009-2010 Ion Gaztanaga
+ / Copyright (c) 2009-2011 Ion Gaztanaga
  /
  / Distributed under the Boost Software License, Version 1.0. (See accompanying
  / file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
@@ -8,7 +8,7 @@
[library Boost.Container
     [quickbook 1.4]
     [authors [Gaztanaga, Ion]]
- [copyright 2009-2010 Ion Gaztanaga]
+ [copyright 2009-2011 Ion Gaztanaga]
     [id container]
     [dirname container]
     [purpose Containers library]
@@ -104,7 +104,7 @@

All containers offered by [*Boost.Container] can be used in recursive data
structures, something that is not guaranteed by the standard. Programmers
-can write the following data structures:
+can write the following data structure:

[import ../example/doc_recursive_containers.cpp]
[doc_recursive_containers]

Modified: sandbox/move/libs/container/doc/html/boost/container/basic_string.html
==============================================================================
--- sandbox/move/libs/container/doc/html/boost/container/basic_string.html (original)
+++ sandbox/move/libs/container/doc/html/boost/container/basic_string.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
@@ -1,10 +1,10 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Class template basic_string</title>
-<link rel="stylesheet" href="../../boostbook.css" type="text/css">
+<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
-<link rel="start" href="../../index.html" title="Chapter 1. Boost.Container">
+<link rel="start" href="../../index.html" title="Chapter 1. Boost.Container">
<link rel="up" href="../../boost_container_reference.html#header.boost.container.string_hpp" title="Header <boost/container/string.hpp>">
<link rel="prev" href="stable_vector.html" title="Class template stable_vector">
<link rel="next" href="string.html" title="Type definition string">
@@ -20,7 +20,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="stable_vector.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.string_hpp"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="string.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="stable_vector.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.string_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="string.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="refentry" lang="en">
<a name="boost.container.basic_string"></a><div class="titlepage"></div>
@@ -29,153 +29,150 @@
boost::container::basic_string — 
</div>
<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2>
-<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/container/string.hpp>
+<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/container/string.hpp>

-template<typename CharT, typename Traits, typename A>
-class basic_string {
-public:
- // types
- typedef A allocator_type;
- typedef allocator_type <a name="boost.container.basic_string.stored_allocator_type"></a>stored_allocator_type; // The stored allocator type. 
- typedef CharT <a name="boost.container.basic_string.value_type"></a>value_type; // The type of object, CharT, stored in the string. 
- typedef Traits <a name="boost.container.basic_string.traits_type"></a>traits_type; // The second template parameter Traits. 
- typedef A::pointer <a name="boost.container.basic_string.pointer"></a>pointer; // Pointer to CharT. 
- typedef A::const_pointer <a name="boost.container.basic_string.const_pointer"></a>const_pointer; // Const pointer to CharT. 
- typedef A::reference <a name="boost.container.basic_string.reference"></a>reference; // Reference to CharT. 
- typedef A::const_reference <a name="boost.container.basic_string.const_reference"></a>const_reference; // Const reference to CharT. 
- typedef A::size_type <a name="boost.container.basic_string.size_type"></a>size_type; // An unsigned integral type. 
- typedef A::difference_type <a name="boost.container.basic_string.difference_type"></a>difference_type; // A signed integral type. 
- typedef pointer <a name="boost.container.basic_string.iterator"></a>iterator; // Iterator used to iterate through a string. It's a Random Access Iterator. 
- typedef const_pointer <a name="boost.container.basic_string.const_iterator"></a>const_iterator; // Const iterator used to iterate through a string. It's a Random Access Iterator. 
- typedef std::reverse_iterator< iterator > <a name="boost.container.basic_string.reverse_iterator"></a>reverse_iterator; // Iterator used to iterate backwards through a string. 
- typedef std::reverse_iterator< const_iterator > <a name="boost.container.basic_string.const_reverse_iterator"></a>const_reverse_iterator; // Const iterator used to iterate backwards through a string. 
+template<typename CharT, typename Traits, typename A>
+class basic_string {
+public:
+ // types
+ typedef A allocator_type;
+ typedef allocator_type <a name="boost.container.basic_string.stored_allocator_type"></a>stored_allocator_type; // The stored allocator type. 
+ typedef CharT <a name="boost.container.basic_string.value_type"></a>value_type; // The type of object, CharT, stored in the string. 
+ typedef Traits <a name="boost.container.basic_string.traits_type"></a>traits_type; // The second template parameter Traits. 
+ typedef A::pointer <a name="boost.container.basic_string.pointer"></a>pointer; // Pointer to CharT. 
+ typedef A::const_pointer <a name="boost.container.basic_string.const_pointer"></a>const_pointer; // Const pointer to CharT. 
+ typedef A::reference <a name="boost.container.basic_string.reference"></a>reference; // Reference to CharT. 
+ typedef A::const_reference <a name="boost.container.basic_string.const_reference"></a>const_reference; // Const reference to CharT. 
+ typedef A::size_type <a name="boost.container.basic_string.size_type"></a>size_type; // An unsigned integral type. 
+ typedef A::difference_type <a name="boost.container.basic_string.difference_type"></a>difference_type; // A signed integral type. 
+ typedef pointer <a name="boost.container.basic_string.iterator"></a>iterator; // Iterator used to iterate through a string. It's a Random Access Iterator. 
+ typedef const_pointer <a name="boost.container.basic_string.const_iterator"></a>const_iterator; // Const iterator used to iterate through a string. It's a Random Access Iterator. 
+ typedef std::reverse_iterator< iterator > <a name="boost.container.basic_string.reverse_iterator"></a>reverse_iterator; // Iterator used to iterate backwards through a string. 
+ typedef std::reverse_iterator< const_iterator > <a name="boost.container.basic_string.const_reverse_iterator"></a>const_reverse_iterator; // Const iterator used to iterate backwards through a string. 

- // construct/copy/destruct
- basic_string(reserve_t, std::size_t,
- const allocator_type & = allocator_type());
- basic_string(const allocator_type & = allocator_type());
- basic_string(const basic_string &);
- basic_string(basic_string &&);
- basic_string(const basic_string &, size_type, size_type = npos,
- const allocator_type & = allocator_type());
- basic_string(const CharT *, size_type,
- const allocator_type & = allocator_type());
- basic_string(const CharT *, const allocator_type & = allocator_type());
- basic_string(size_type, CharT, const allocator_type & = allocator_type());
- template<typename InputIterator>
- basic_string(InputIterator, InputIterator,
- const allocator_type & = allocator_type());
- basic_string& operator=(const basic_string &);
- basic_string& operator=(basic_string &&);
- basic_string& operator=(const CharT *);
- basic_string& operator=(CharT);
- ~basic_string();
+ // construct/copy/destruct
+ basic_string(const allocator_type & = allocator_type());
+ basic_string(const basic_string &);
+ basic_string(basic_string &&);
+ basic_string(const basic_string &, size_type, size_type = npos,
+ const allocator_type & = allocator_type());
+ basic_string(const CharT *, size_type,
+ const allocator_type & = allocator_type());
+ basic_string(const CharT *, const allocator_type & = allocator_type());
+ basic_string(size_type, CharT, const allocator_type & = allocator_type());
+ template<typename InputIterator>
+ basic_string(InputIterator, InputIterator,
+ const allocator_type & = allocator_type());
+ basic_string& operator=(const basic_string &);
+ basic_string& operator=(basic_string &&);
+ basic_string& operator=(const CharT *);
+ basic_string& operator=(CharT);
+ ~basic_string();

- // public member functions
- iterator begin() ;
- const_iterator begin() const;
- iterator end() ;
- const_iterator end() const;
- reverse_iterator rbegin() ;
- const_reverse_iterator rbegin() const;
- reverse_iterator rend() ;
- const_reverse_iterator rend() const;
- allocator_type get_allocator() const;
- size_type size() const;
- size_type length() const;
- size_type max_size() const;
- void resize(size_type, CharT) ;
- void resize(size_type) ;
- void reserve(size_type) ;
- size_type capacity() const;
- void clear() ;
- bool empty() const;
- reference operator[](size_type) ;
- const_reference operator[](size_type) const;
- reference at(size_type) ;
- const_reference at(size_type) const;
- basic_string & operator+=(const basic_string &) ;
- basic_string & operator+=(const CharT *) ;
- basic_string & operator+=(CharT) ;
- basic_string & append(const basic_string &) ;
- basic_string & append(const basic_string &, size_type, size_type) ;
- basic_string & append(const CharT *, size_type) ;
- basic_string & append(const CharT *) ;
- basic_string & append(size_type, CharT) ;
- template<typename InputIter> basic_string & append(InputIter, InputIter) ;
- void push_back(CharT) ;
- void pop_back() ;
- basic_string & assign(const basic_string &) ;
- basic_string & assign(basic_string &&) ;
- basic_string & assign(const basic_string &, size_type, size_type) ;
- basic_string & assign(const CharT *, size_type) ;
- basic_string & assign(const CharT *) ;
- basic_string & assign(size_type, CharT) ;
- template<typename InputIter> basic_string & assign(InputIter, InputIter) ;
- basic_string & assign(const CharT *, const CharT *) ;
- basic_string & insert(size_type, const basic_string &) ;
- basic_string &
- insert(size_type, const basic_string &, size_type, size_type) ;
- basic_string & insert(size_type, const CharT *, size_type) ;
- basic_string & insert(size_type, const CharT *) ;
- basic_string & insert(size_type, size_type, CharT) ;
- iterator insert(iterator, CharT) ;
- void insert(iterator, std::size_t, CharT) ;
- template<typename InputIter> void insert(iterator, InputIter, InputIter) ;
- basic_string & erase(size_type = 0, size_type = npos) ;
- iterator erase(iterator) ;
- iterator erase(iterator, iterator) ;
- basic_string & replace(size_type, size_type, const basic_string &) ;
- basic_string &
- replace(size_type, size_type, const basic_string &, size_type, size_type) ;
- basic_string & replace(size_type, size_type, const CharT *, size_type) ;
- basic_string & replace(size_type, size_type, const CharT *) ;
- basic_string & replace(size_type, size_type, size_type, CharT) ;
- basic_string & replace(iterator, iterator, const basic_string &) ;
- basic_string & replace(iterator, iterator, const CharT *, size_type) ;
- basic_string & replace(iterator, iterator, const CharT *) ;
- basic_string & replace(iterator, iterator, size_type, CharT) ;
- template<typename InputIter>
- basic_string & replace(iterator, iterator, InputIter, InputIter) ;
- size_type copy(CharT *, size_type, size_type = 0) const;
- void swap(basic_string &) ;
- const CharT * c_str() const;
- const CharT * data() const;
- size_type find(const basic_string &, size_type = 0) const;
- size_type find(const CharT *, size_type = 0) const;
- size_type find(const CharT *, size_type, size_type) const;
- size_type find(CharT, size_type = 0) const;
- size_type rfind(const basic_string &, size_type = npos) const;
- size_type rfind(const CharT *, size_type = npos) const;
- size_type rfind(const CharT *, size_type, size_type) const;
- size_type rfind(CharT, size_type = npos) const;
- size_type find_first_of(const basic_string &, size_type = 0) const;
- size_type find_first_of(const CharT *, size_type = 0) const;
- size_type find_first_of(const CharT *, size_type, size_type) const;
- size_type find_first_of(CharT, size_type = 0) const;
- size_type find_last_of(const basic_string &, size_type = npos) const;
- size_type find_last_of(const CharT *, size_type = npos) const;
- size_type find_last_of(const CharT *, size_type, size_type) const;
- size_type find_last_of(CharT, size_type = npos) const;
- size_type find_first_not_of(const basic_string &, size_type = 0) const;
- size_type find_first_not_of(const CharT *, size_type = 0) const;
- size_type find_first_not_of(const CharT *, size_type, size_type) const;
- size_type find_first_not_of(CharT, size_type = 0) const;
- size_type find_last_not_of(const basic_string &, size_type = npos) const;
- size_type find_last_not_of(const CharT *, size_type = npos) const;
- size_type find_last_not_of(const CharT *, size_type, size_type) const;
- size_type find_last_not_of(CharT, size_type = npos) const;
- basic_string substr(size_type = 0, size_type = npos) const;
- int compare(const basic_string &) const;
- int compare(size_type, size_type, const basic_string &) const;
- int compare(size_type, size_type, const basic_string &, size_type,
- size_type) const;
- int compare(const CharT *) const;
- int compare(size_type, size_type, const CharT *, size_type = npos) const;
- static const size_type npos; // The largest possible value of type size_type. That is, size_type(-1). 
-};</pre></div>
+ // public member functions
+ iterator begin();
+ const_iterator begin() const;
+ iterator end();
+ const_iterator end() const;
+ reverse_iterator rbegin();
+ const_reverse_iterator rbegin() const;
+ reverse_iterator rend();
+ const_reverse_iterator rend() const;
+ allocator_type get_allocator() const;
+ size_type size() const;
+ size_type length() const;
+ size_type max_size() const;
+ void resize(size_type, CharT);
+ void resize(size_type);
+ void reserve(size_type);
+ size_type capacity() const;
+ void clear();
+ bool empty() const;
+ reference operator[](size_type);
+ const_reference operator[](size_type) const;
+ reference at(size_type);
+ const_reference at(size_type) const;
+ basic_string & operator+=(const basic_string &);
+ basic_string & operator+=(const CharT *);
+ basic_string & operator+=(CharT);
+ basic_string & append(const basic_string &);
+ basic_string & append(const basic_string &, size_type, size_type);
+ basic_string & append(const CharT *, size_type);
+ basic_string & append(const CharT *);
+ basic_string & append(size_type, CharT);
+ template<typename InputIter> basic_string & append(InputIter, InputIter);
+ void push_back(CharT);
+ void pop_back();
+ basic_string & assign(const basic_string &);
+ basic_string & assign(basic_string &&);
+ basic_string & assign(const basic_string &, size_type, size_type);
+ basic_string & assign(const CharT *, size_type);
+ basic_string & assign(const CharT *);
+ basic_string & assign(size_type, CharT);
+ template<typename InputIter> basic_string & assign(InputIter, InputIter);
+ basic_string & assign(const CharT *, const CharT *);
+ basic_string & insert(size_type, const basic_string &);
+ basic_string & insert(size_type, const basic_string &, size_type, size_type);
+ basic_string & insert(size_type, const CharT *, size_type);
+ basic_string & insert(size_type, const CharT *);
+ basic_string & insert(size_type, size_type, CharT);
+ iterator insert(iterator, CharT);
+ void insert(iterator, size_type, CharT);
+ template<typename InputIter> void insert(iterator, InputIter, InputIter);
+ basic_string & erase(size_type = 0, size_type = npos);
+ iterator erase(iterator);
+ iterator erase(iterator, iterator);
+ basic_string & replace(size_type, size_type, const basic_string &);
+ basic_string &
+ replace(size_type, size_type, const basic_string &, size_type, size_type);
+ basic_string & replace(size_type, size_type, const CharT *, size_type);
+ basic_string & replace(size_type, size_type, const CharT *);
+ basic_string & replace(size_type, size_type, size_type, CharT);
+ basic_string & replace(iterator, iterator, const basic_string &);
+ basic_string & replace(iterator, iterator, const CharT *, size_type);
+ basic_string & replace(iterator, iterator, const CharT *);
+ basic_string & replace(iterator, iterator, size_type, CharT);
+ template<typename InputIter>
+ basic_string & replace(iterator, iterator, InputIter, InputIter);
+ size_type copy(CharT *, size_type, size_type = 0) const;
+ void swap(basic_string &);
+ const CharT * c_str() const;
+ const CharT * data() const;
+ size_type find(const basic_string &, size_type = 0) const;
+ size_type find(const CharT *, size_type = 0) const;
+ size_type find(const CharT *, size_type, size_type) const;
+ size_type find(CharT, size_type = 0) const;
+ size_type rfind(const basic_string &, size_type = npos) const;
+ size_type rfind(const CharT *, size_type = npos) const;
+ size_type rfind(const CharT *, size_type, size_type) const;
+ size_type rfind(CharT, size_type = npos) const;
+ size_type find_first_of(const basic_string &, size_type = 0) const;
+ size_type find_first_of(const CharT *, size_type = 0) const;
+ size_type find_first_of(const CharT *, size_type, size_type) const;
+ size_type find_first_of(CharT, size_type = 0) const;
+ size_type find_last_of(const basic_string &, size_type = npos) const;
+ size_type find_last_of(const CharT *, size_type = npos) const;
+ size_type find_last_of(const CharT *, size_type, size_type) const;
+ size_type find_last_of(CharT, size_type = npos) const;
+ size_type find_first_not_of(const basic_string &, size_type = 0) const;
+ size_type find_first_not_of(const CharT *, size_type = 0) const;
+ size_type find_first_not_of(const CharT *, size_type, size_type) const;
+ size_type find_first_not_of(CharT, size_type = 0) const;
+ size_type find_last_not_of(const basic_string &, size_type = npos) const;
+ size_type find_last_not_of(const CharT *, size_type = npos) const;
+ size_type find_last_not_of(const CharT *, size_type, size_type) const;
+ size_type find_last_not_of(CharT, size_type = npos) const;
+ basic_string substr(size_type = 0, size_type = npos) const;
+ int compare(const basic_string &) const;
+ int compare(size_type, size_type, const basic_string &) const;
+ int compare(size_type, size_type, const basic_string &, size_type,
+ size_type) const;
+ int compare(const CharT *) const;
+ int compare(size_type, size_type, const CharT *, size_type = npos) const;
+ static const size_type npos; // The largest possible value of type size_type. That is, size_type(-1). 
+};</pre></div>
<div class="refsect1" lang="en">
-<a name="id531627"></a><h2>Description</h2>
+<a name="id871628"></a><h2>Description</h2>
The basic_string class represents a Sequence of characters. It contains all the usual operations of a Sequence, and, additionally, it contains standard string operations such as search and concatenation.
The basic_string class is parameterized by character type, and by that type's Character Traits.
This class has performance characteristics very much like vector<>, meaning, for example, that it does not perform reference-count or copy-on-write, and that concatenation of two strings is an O(N) operation.
@@ -183,86 +180,84 @@
Note that the C++ standard does not specify the complexity of basic_string operations. In this implementation, basic_string has performance characteristics very similar to those of vector: access to a single character is O(1), while copy and concatenation are O(N).
In this implementation, begin(), end(), rbegin(), rend(), operator[], c_str(), and data() do not invalidate iterators. In this implementation, iterators are only invalidated by member functions that explicitly change the string's contents. 
<div class="refsect2" lang="en">
-<a name="id531645"></a><h3>
+<a name="id871646"></a><h3>
<a name="boost.container.basic_stringtypes"></a><code class="computeroutput">basic_string</code>
 public
 types</h3>
<div class="orderedlist"><ol type="1"><li>

-typedef A <a name="boost.container.basic_string.allocator_type"></a>allocator_type;
+typedef A <a name="boost.container.basic_string.allocator_type"></a>allocator_type;
The allocator type 
</li></ol></div>
</div>
<div class="refsect2" lang="en">
-<a name="id531673"></a><h3>
+<a name="id871684"></a><h3>
<a name="boost.container.basic_stringconstruct-copy-destruct"></a><code class="computeroutput">basic_string</code>
 public
 construct/copy/destruct</h3>
<div class="orderedlist"><ol type="1">
-<li><pre class="literallayout"><a name="id326030-bb"></a>basic_string(reserve_t, std::size_t n,
- const allocator_type & a = allocator_type());</pre></li>
<li>
-<pre class="literallayout"><a name="id326048-bb"></a>basic_string(const allocator_type & a = allocator_type());</pre>
+<pre class="literallayout"><a name="id406498-bb"></a>basic_string(const allocator_type & a = allocator_type());</pre>
Effects: Constructs a basic_string taking the allocator as parameter.
Throws: If allocator_type's copy constructor throws. 
</li>
<li>
-<pre class="literallayout"><a name="id326071-bb"></a>basic_string(const basic_string & s);</pre>
+<pre class="literallayout"><a name="id406521-bb"></a>basic_string(const basic_string & s);</pre>
Effects: Copy constructs a basic_string.
Postcondition: x == *this.
Throws: If allocator_type's default constructor or copy constructor throws. 
</li>
<li>
-<pre class="literallayout"><a name="id326100-bb"></a>basic_string(basic_string && s);</pre>
+<pre class="literallayout"><a name="id406550-bb"></a>basic_string(basic_string && s);</pre>
Effects: Move constructor. Moves mx's resources to *this.
Throws: If allocator_type's copy constructor throws.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout"><a name="id326128-bb"></a>basic_string(const basic_string & s, size_type pos, size_type n = npos,
- const allocator_type & a = allocator_type());</pre>
+<pre class="literallayout"><a name="id406578-bb"></a>basic_string(const basic_string & s, size_type pos, size_type n = npos,
+ const allocator_type & a = allocator_type());</pre>
Effects: Constructs a basic_string taking the allocator as parameter, and is initialized by a specific number of characters of the s string. 
</li>
<li>
-<pre class="literallayout"><a name="id326164-bb"></a>basic_string(const CharT * s, size_type n,
- const allocator_type & a = allocator_type());</pre>
+<pre class="literallayout"><a name="id406614-bb"></a>basic_string(const CharT * s, size_type n,
+ const allocator_type & a = allocator_type());</pre>
Effects: Constructs a basic_string taking the allocator as parameter, and is initialized by a specific number of characters of the s c-string. 
</li>
<li>
-<pre class="literallayout"><a name="id326189-bb"></a>basic_string(const CharT * s, const allocator_type & a = allocator_type());</pre>
+<pre class="literallayout"><a name="id406639-bb"></a>basic_string(const CharT * s, const allocator_type & a = allocator_type());</pre>
Effects: Constructs a basic_string taking the allocator as parameter, and is initialized by the null-terminated s c-string. 
</li>
<li>
-<pre class="literallayout"><a name="id326209-bb"></a>basic_string(size_type n, CharT c,
- const allocator_type & a = allocator_type());</pre>
+<pre class="literallayout"><a name="id406659-bb"></a>basic_string(size_type n, CharT c,
+ const allocator_type & a = allocator_type());</pre>
Effects: Constructs a basic_string taking the allocator as parameter, and is initialized by n copies of c. 
</li>
<li>
-<pre class="literallayout">template<typename InputIterator>
- <a name="id326234-bb"></a>basic_string(InputIterator f, InputIterator l,
- const allocator_type & a = allocator_type());</pre>
+<pre class="literallayout">template<typename InputIterator>
+ <a name="id406684-bb"></a>basic_string(InputIterator f, InputIterator l,
+ const allocator_type & a = allocator_type());</pre>
Effects: Constructs a basic_string taking the allocator as parameter, and a range of iterators. 
</li>
<li>
-<pre class="literallayout">basic_string& <a name="id326287-bb"></a>operator=(const basic_string & s);</pre>
+<pre class="literallayout">basic_string& <a name="id406737-bb"></a>operator=(const basic_string & s);</pre>
Effects: Copy constructs a string.
Postcondition: x == *this.
Complexity: Linear to the elements x contains. 
</li>
<li>
-<pre class="literallayout">basic_string& <a name="id326316-bb"></a>operator=(basic_string && ms);</pre>
+<pre class="literallayout">basic_string& <a name="id406766-bb"></a>operator=(basic_string && ms);</pre>
Effects: Move constructor. Moves mx's resources to *this.
Throws: If allocator_type's copy constructor throws.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">basic_string& <a name="id326344-bb"></a>operator=(const CharT * s);</pre>
+<pre class="literallayout">basic_string& <a name="id406794-bb"></a>operator=(const CharT * s);</pre>
Effects: Assignment from a null-terminated c-string. </li>
<li>
-<pre class="literallayout">basic_string& <a name="id326356-bb"></a>operator=(CharT c);</pre>
+<pre class="literallayout">basic_string& <a name="id406806-bb"></a>operator=(CharT c);</pre>
Effects: Assignment from character. </li>
<li>
-<pre class="literallayout"><a name="id326266-bb"></a>~basic_string();</pre>
+<pre class="literallayout"><a name="id406716-bb"></a>~basic_string();</pre>
Effects: Destroys the basic_string. All used memory is deallocated.
Throws: Nothing.
Complexity: Constant. 
@@ -270,405 +265,405 @@
</ol></div>
</div>
<div class="refsect2" lang="en">
-<a name="id532081"></a><h3>
-<a name="id321717-bb"></a><code class="computeroutput">basic_string</code> public member functions</h3>
+<a name="id872558"></a><h3>
+<a name="id403550-bb"></a><code class="computeroutput">basic_string</code> public member functions</h3>
<div class="orderedlist"><ol type="1">
<li>
-<pre class="literallayout">iterator <a name="id321719-bb"></a>begin() ;</pre>
+<pre class="literallayout">iterator <a name="id403553-bb"></a>begin();</pre>
Effects: Returns an iterator to the first element contained in the vector.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_iterator <a name="id321744-bb"></a>begin() const;</pre>
+<pre class="literallayout">const_iterator <a name="id403578-bb"></a>begin() const;</pre>
Effects: Returns a const_iterator to the first element contained in the vector.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id321770-bb"></a>end() ;</pre>
+<pre class="literallayout">iterator <a name="id403603-bb"></a>end();</pre>
Effects: Returns an iterator to the end of the vector.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_iterator <a name="id321795-bb"></a>end() const;</pre>
+<pre class="literallayout">const_iterator <a name="id403628-bb"></a>end() const;</pre>
Effects: Returns a const_iterator to the end of the vector.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">reverse_iterator <a name="id321820-bb"></a>rbegin() ;</pre>
+<pre class="literallayout">reverse_iterator <a name="id403653-bb"></a>rbegin();</pre>
Effects: Returns a reverse_iterator pointing to the beginning of the reversed vector.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_reverse_iterator <a name="id321845-bb"></a>rbegin() const;</pre>
+<pre class="literallayout">const_reverse_iterator <a name="id403679-bb"></a>rbegin() const;</pre>
Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed vector.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">reverse_iterator <a name="id321870-bb"></a>rend() ;</pre>
+<pre class="literallayout">reverse_iterator <a name="id403704-bb"></a>rend();</pre>
Effects: Returns a reverse_iterator pointing to the end of the reversed vector.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_reverse_iterator <a name="id321896-bb"></a>rend() const;</pre>
+<pre class="literallayout">const_reverse_iterator <a name="id403729-bb"></a>rend() const;</pre>
Effects: Returns a const_reverse_iterator pointing to the end of the reversed vector.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">allocator_type <a name="id321921-bb"></a>get_allocator() const;</pre>
+<pre class="literallayout">allocator_type <a name="id403754-bb"></a>get_allocator() const;</pre>
Effects: Returns a copy of the internal allocator.
Throws: If allocator's copy constructor throws.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">size_type <a name="id321946-bb"></a>size() const;</pre>
+<pre class="literallayout">size_type <a name="id403779-bb"></a>size() const;</pre>
Effects: Returns the number of the elements contained in the vector.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">size_type <a name="id321972-bb"></a>length() const;</pre>
+<pre class="literallayout">size_type <a name="id403806-bb"></a>length() const;</pre>
Effects: Returns the number of the elements contained in the vector.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">size_type <a name="id321999-bb"></a>max_size() const;</pre>
+<pre class="literallayout">size_type <a name="id403832-bb"></a>max_size() const;</pre>
Effects: Returns the largest possible size of the vector.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">void <a name="id322024-bb"></a>resize(size_type n, CharT c) ;</pre>
+<pre class="literallayout">void <a name="id403857-bb"></a>resize(size_type n, CharT c);</pre>
Effects: Inserts or erases elements at the end such that the size becomes n. New elements are copy constructed from x.
Throws: If memory allocation throws, or T's copy constructor throws.
Complexity: Linear to the difference between size() and new_size. 
</li>
<li>
-<pre class="literallayout">void <a name="id322061-bb"></a>resize(size_type n) ;</pre>
+<pre class="literallayout">void <a name="id403895-bb"></a>resize(size_type n);</pre>
Effects: Inserts or erases elements at the end such that the size becomes n. New elements are default constructed.
Throws: If memory allocation throws, or T's copy constructor throws.
Complexity: Linear to the difference between size() and new_size. 
</li>
<li>
-<pre class="literallayout">void <a name="id322094-bb"></a>reserve(size_type res_arg) ;</pre>
+<pre class="literallayout">void <a name="id403927-bb"></a>reserve(size_type res_arg);</pre>
Effects: If n is less than or equal to capacity(), this call has no effect. Otherwise, it is a request for allocation of additional memory. If the request is successful, then capacity() is greater than or equal to n; otherwise, capacity() is unchanged. In either case, size() is unchanged.
Throws: If memory allocation allocation throws or T's copy constructor throws. 
</li>
<li>
-<pre class="literallayout">size_type <a name="id322118-bb"></a>capacity() const;</pre>
+<pre class="literallayout">size_type <a name="id403951-bb"></a>capacity() const;</pre>
Effects: Number of elements for which memory has been allocated. capacity() is always greater than or equal to size().
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">void <a name="id322143-bb"></a>clear() ;</pre>
+<pre class="literallayout">void <a name="id403976-bb"></a>clear();</pre>
Effects: Erases all the elements of the vector.
Throws: Nothing.
Complexity: Linear to the number of elements in the vector. 
</li>
<li>
-<pre class="literallayout">bool <a name="id322168-bb"></a>empty() const;</pre>
+<pre class="literallayout">bool <a name="id404001-bb"></a>empty() const;</pre>
Effects: Returns true if the vector contains no elements.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">reference <a name="id322193-bb"></a>operator[](size_type n) ;</pre>
+<pre class="literallayout">reference <a name="id404027-bb"></a>operator[](size_type n);</pre>
Requires: size() < n.
Effects: Returns a reference to the nth element from the beginning of the container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_reference <a name="id322229-bb"></a>operator[](size_type n) const;</pre>
+<pre class="literallayout">const_reference <a name="id404063-bb"></a>operator[](size_type n) const;</pre>
Requires: size() < n.
Effects: Returns a const reference to the nth element from the beginning of the container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">reference <a name="id322265-bb"></a>at(size_type n) ;</pre>
+<pre class="literallayout">reference <a name="id404099-bb"></a>at(size_type n);</pre>
Requires: size() < n.
Effects: Returns a reference to the nth element from the beginning of the container.
Throws: std::range_error if n >= size()
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_reference <a name="id322301-bb"></a>at(size_type n) const;</pre>
+<pre class="literallayout">const_reference <a name="id404135-bb"></a>at(size_type n) const;</pre>
Requires: size() < n.
Effects: Returns a const reference to the nth element from the beginning of the container.
Throws: std::range_error if n >= size()
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">basic_string & <a name="id322337-bb"></a>operator+=(const basic_string & s) ;</pre>
+<pre class="literallayout">basic_string & <a name="id404171-bb"></a>operator+=(const basic_string & s);</pre>
Effects: Appends string s to *this. </li>
<li>
-<pre class="literallayout">basic_string & <a name="id322360-bb"></a>operator+=(const CharT * s) ;</pre>
+<pre class="literallayout">basic_string & <a name="id404193-bb"></a>operator+=(const CharT * s);</pre>
Effects: Appends c-string s to *this. </li>
<li>
-<pre class="literallayout">basic_string & <a name="id322379-bb"></a>operator+=(CharT c) ;</pre>
+<pre class="literallayout">basic_string & <a name="id404213-bb"></a>operator+=(CharT c);</pre>
Effects: Appends character c to *this. </li>
<li>
-<pre class="literallayout">basic_string & <a name="id322398-bb"></a>append(const basic_string & s) ;</pre>
+<pre class="literallayout">basic_string & <a name="id404232-bb"></a>append(const basic_string & s);</pre>
Effects: Appends string s to *this. </li>
<li>
-<pre class="literallayout">basic_string & <a name="id322421-bb"></a>append(const basic_string & s, size_type pos, size_type n) ;</pre>
+<pre class="literallayout">basic_string & <a name="id404255-bb"></a>append(const basic_string & s, size_type pos, size_type n);</pre>
Effects: Appends the range [pos, pos + n) from string s to *this. </li>
<li>
-<pre class="literallayout">basic_string & <a name="id322455-bb"></a>append(const CharT * s, size_type n) ;</pre>
+<pre class="literallayout">basic_string & <a name="id404288-bb"></a>append(const CharT * s, size_type n);</pre>
Effects: Appends the range [s, s + n) from c-string s to *this. </li>
<li>
-<pre class="literallayout">basic_string & <a name="id322480-bb"></a>append(const CharT * s) ;</pre>
+<pre class="literallayout">basic_string & <a name="id404313-bb"></a>append(const CharT * s);</pre>
Effects: Appends the c-string s to *this. </li>
<li>
-<pre class="literallayout">basic_string & <a name="id322499-bb"></a>append(size_type n, CharT c) ;</pre>
+<pre class="literallayout">basic_string & <a name="id404333-bb"></a>append(size_type n, CharT c);</pre>
Effects: Appends the n times the character c to *this. </li>
<li>
-<pre class="literallayout">template<typename InputIter>
- basic_string & <a name="id322523-bb"></a>append(InputIter first, InputIter last) ;</pre>
+<pre class="literallayout">template<typename InputIter>
+ basic_string & <a name="id404357-bb"></a>append(InputIter first, InputIter last);</pre>
Effects: Appends the range [first, last) *this. </li>
<li>
-<pre class="literallayout">void <a name="id322553-bb"></a>push_back(CharT c) ;</pre>
+<pre class="literallayout">void <a name="id404387-bb"></a>push_back(CharT c);</pre>
Effects: Inserts a copy of c at the end of the vector. </li>
<li>
-<pre class="literallayout">void <a name="id322570-bb"></a>pop_back() ;</pre>
+<pre class="literallayout">void <a name="id404403-bb"></a>pop_back();</pre>
Effects: Removes the last element from the vector. </li>
<li>
-<pre class="literallayout">basic_string & <a name="id322582-bb"></a>assign(const basic_string & s) ;</pre>
+<pre class="literallayout">basic_string & <a name="id404415-bb"></a>assign(const basic_string & s);</pre>
Effects: Assigns the value s to *this. </li>
<li>
-<pre class="literallayout">basic_string & <a name="id322605-bb"></a>assign(basic_string && ms) ;</pre>
+<pre class="literallayout">basic_string & <a name="id404438-bb"></a>assign(basic_string && ms);</pre>
Effects: Moves the resources from ms *this. </li>
<li>
-<pre class="literallayout">basic_string & <a name="id322626-bb"></a>assign(const basic_string & s, size_type pos, size_type n) ;</pre>
+<pre class="literallayout">basic_string & <a name="id404460-bb"></a>assign(const basic_string & s, size_type pos, size_type n);</pre>
Effects: Assigns the range [pos, pos + n) from s to *this. </li>
<li>
-<pre class="literallayout">basic_string & <a name="id322659-bb"></a>assign(const CharT * s, size_type n) ;</pre>
+<pre class="literallayout">basic_string & <a name="id404492-bb"></a>assign(const CharT * s, size_type n);</pre>
Effects: Assigns the range [s, s + n) from s to *this. </li>
<li>
-<pre class="literallayout">basic_string & <a name="id322683-bb"></a>assign(const CharT * s) ;</pre>
+<pre class="literallayout">basic_string & <a name="id404516-bb"></a>assign(const CharT * s);</pre>
Effects: Assigns the c-string s to *this. </li>
<li>
-<pre class="literallayout">basic_string & <a name="id322702-bb"></a>assign(size_type n, CharT c) ;</pre>
+<pre class="literallayout">basic_string & <a name="id404535-bb"></a>assign(size_type n, CharT c);</pre>
Effects: Assigns the character c n-times to *this. </li>
<li>
-<pre class="literallayout">template<typename InputIter>
- basic_string & <a name="id322726-bb"></a>assign(InputIter first, InputIter last) ;</pre>
+<pre class="literallayout">template<typename InputIter>
+ basic_string & <a name="id404559-bb"></a>assign(InputIter first, InputIter last);</pre>
Effects: Assigns the range [first, last) to *this. </li>
<li>
-<pre class="literallayout">basic_string & <a name="id322756-bb"></a>assign(const CharT * f, const CharT * l) ;</pre>
+<pre class="literallayout">basic_string & <a name="id404589-bb"></a>assign(const CharT * f, const CharT * l);</pre>
Effects: Assigns the range [f, l) to *this. </li>
<li>
-<pre class="literallayout">basic_string & <a name="id322780-bb"></a>insert(size_type pos, const basic_string & s) ;</pre>
+<pre class="literallayout">basic_string & <a name="id404613-bb"></a>insert(size_type pos, const basic_string & s);</pre>
Effects: Inserts the string s before pos. </li>
<li>
-<pre class="literallayout">basic_string &
-<a name="id322808-bb"></a>insert(size_type pos, const basic_string & s, size_type beg, size_type n) ;</pre>
+<pre class="literallayout">basic_string &
+<a name="id404641-bb"></a>insert(size_type pos, const basic_string & s, size_type beg, size_type n);</pre>
Effects: Inserts the range [pos, pos + n) from string s before pos. </li>
<li>
-<pre class="literallayout">basic_string & <a name="id322846-bb"></a>insert(size_type pos, const CharT * s, size_type n) ;</pre>
+<pre class="literallayout">basic_string & <a name="id404679-bb"></a>insert(size_type pos, const CharT * s, size_type n);</pre>
Effects: Inserts the range [s, s + n) before pos. </li>
<li>
-<pre class="literallayout">basic_string & <a name="id322875-bb"></a>insert(size_type pos, const CharT * s) ;</pre>
+<pre class="literallayout">basic_string & <a name="id404708-bb"></a>insert(size_type pos, const CharT * s);</pre>
Effects: Inserts the c-string s before pos. </li>
<li>
-<pre class="literallayout">basic_string & <a name="id322899-bb"></a>insert(size_type pos, size_type n, CharT c) ;</pre>
+<pre class="literallayout">basic_string & <a name="id404732-bb"></a>insert(size_type pos, size_type n, CharT c);</pre>
Effects: Inserts the character c n-times before pos. </li>
<li>
-<pre class="literallayout">iterator <a name="id322928-bb"></a>insert(iterator position, CharT c) ;</pre>
+<pre class="literallayout">iterator <a name="id404761-bb"></a>insert(iterator position, CharT c);</pre>
Effects: Inserts the character c before position. </li>
<li>
-<pre class="literallayout">void <a name="id322949-bb"></a>insert(iterator position, std::size_t n, CharT c) ;</pre>
+<pre class="literallayout">void <a name="id404783-bb"></a>insert(iterator position, size_type n, CharT c);</pre>
Effects: Inserts the character c n-times before position. </li>
<li>
-<pre class="literallayout">template<typename InputIter>
- void <a name="id322976-bb"></a>insert(iterator p, InputIter first, InputIter last) ;</pre>
+<pre class="literallayout">template<typename InputIter>
+ void <a name="id404809-bb"></a>insert(iterator p, InputIter first, InputIter last);</pre>
Effects: Inserts the range [first, last) before position. </li>
<li>
-<pre class="literallayout">basic_string & <a name="id323008-bb"></a>erase(size_type pos = 0, size_type n = npos) ;</pre>
+<pre class="literallayout">basic_string & <a name="id404841-bb"></a>erase(size_type pos = 0, size_type n = npos);</pre>
Effects: Inserts the range [pos, pos + n). </li>
<li>
-<pre class="literallayout">iterator <a name="id323037-bb"></a>erase(iterator position) ;</pre>
+<pre class="literallayout">iterator <a name="id404870-bb"></a>erase(iterator position);</pre>
Effects: Erases the character pointed by position. </li>
<li>
-<pre class="literallayout">iterator <a name="id323054-bb"></a>erase(iterator first, iterator last) ;</pre>
+<pre class="literallayout">iterator <a name="id404887-bb"></a>erase(iterator first, iterator last);</pre>
Effects: Erases the range [first, last). </li>
<li>
-<pre class="literallayout">basic_string & <a name="id323075-bb"></a>replace(size_type pos, size_type n, const basic_string & s) ;</pre>
+<pre class="literallayout">basic_string & <a name="id404909-bb"></a>replace(size_type pos, size_type n, const basic_string & s);</pre>
Effects: Replaces a substring of *this with the string s. </li>
<li>
-<pre class="literallayout">basic_string &
-<a name="id323108-bb"></a>replace(size_type pos1, size_type n1, const basic_string & s, size_type pos2,
- size_type n2) ;</pre>
+<pre class="literallayout">basic_string &
+<a name="id404941-bb"></a>replace(size_type pos1, size_type n1, const basic_string & s, size_type pos2,
+ size_type n2);</pre>
Effects: Replaces a substring of *this with a substring of s. </li>
<li>
-<pre class="literallayout">basic_string &
-<a name="id323150-bb"></a>replace(size_type pos, size_type n1, const CharT * s, size_type n2) ;</pre>
+<pre class="literallayout">basic_string &
+<a name="id404983-bb"></a>replace(size_type pos, size_type n1, const CharT * s, size_type n2);</pre>
Effects: Replaces a substring of *this with the first n1 characters of s. </li>
<li>
-<pre class="literallayout">basic_string & <a name="id323183-bb"></a>replace(size_type pos, size_type n1, const CharT * s) ;</pre>
+<pre class="literallayout">basic_string & <a name="id405017-bb"></a>replace(size_type pos, size_type n1, const CharT * s);</pre>
Effects: Replaces a substring of *this with a null-terminated character array. </li>
<li>
-<pre class="literallayout">basic_string & <a name="id323212-bb"></a>replace(size_type pos, size_type n1, size_type n2, CharT c) ;</pre>
+<pre class="literallayout">basic_string & <a name="id405410-bb"></a>replace(size_type pos, size_type n1, size_type n2, CharT c);</pre>
Effects: Replaces a substring of *this with n1 copies of c. </li>
<li>
-<pre class="literallayout">basic_string & <a name="id323246-bb"></a>replace(iterator first, iterator last, const basic_string & s) ;</pre>
+<pre class="literallayout">basic_string & <a name="id405444-bb"></a>replace(iterator first, iterator last, const basic_string & s);</pre>
Effects: Replaces a substring of *this with the string s. </li>
<li>
-<pre class="literallayout">basic_string &
-<a name="id323278-bb"></a>replace(iterator first, iterator last, const CharT * s, size_type n) ;</pre>
+<pre class="literallayout">basic_string &
+<a name="id405476-bb"></a>replace(iterator first, iterator last, const CharT * s, size_type n);</pre>
Effects: Replaces a substring of *this with the first n characters of s. </li>
<li>
-<pre class="literallayout">basic_string & <a name="id323312-bb"></a>replace(iterator first, iterator last, const CharT * s) ;</pre>
+<pre class="literallayout">basic_string & <a name="id405510-bb"></a>replace(iterator first, iterator last, const CharT * s);</pre>
Effects: Replaces a substring of *this with a null-terminated character array. </li>
<li>
-<pre class="literallayout">basic_string & <a name="id325070-bb"></a>replace(iterator first, iterator last, size_type n, CharT c) ;</pre>
+<pre class="literallayout">basic_string & <a name="id405538-bb"></a>replace(iterator first, iterator last, size_type n, CharT c);</pre>
Effects: Replaces a substring of *this with n copies of c. </li>
<li>
-<pre class="literallayout">template<typename InputIter>
- basic_string &
- <a name="id325104-bb"></a>replace(iterator first, iterator last, InputIter f, InputIter l) ;</pre>
+<pre class="literallayout">template<typename InputIter>
+ basic_string &
+ <a name="id405572-bb"></a>replace(iterator first, iterator last, InputIter f, InputIter l);</pre>
Effects: Replaces a substring of *this with the range [f, l) </li>
<li>
-<pre class="literallayout">size_type <a name="id325144-bb"></a>copy(CharT * s, size_type n, size_type pos = 0) const;</pre>
+<pre class="literallayout">size_type <a name="id405612-bb"></a>copy(CharT * s, size_type n, size_type pos = 0) const;</pre>
Effects: Copies a substring of *this to a buffer. </li>
<li>
-<pre class="literallayout">void <a name="id325172-bb"></a>swap(basic_string & x) ;</pre>
+<pre class="literallayout">void <a name="id405640-bb"></a>swap(basic_string & x);</pre>
Effects: Swaps the contents of two strings. </li>
<li>
-<pre class="literallayout">const CharT * <a name="id325192-bb"></a>c_str() const;</pre>
+<pre class="literallayout">const CharT * <a name="id405660-bb"></a>c_str() const;</pre>
Returns: Returns a pointer to a null-terminated array of characters representing the string's contents. For any string s it is guaranteed that the first s.size() characters in the array pointed to by s.c_str() are equal to the character in s, and that s.c_str()[s.size()] is a null character. Note, however, that it not necessarily the first null character. Characters within a string are permitted to be null. 
</li>
<li>
-<pre class="literallayout">const CharT * <a name="id325205-bb"></a>data() const;</pre>
+<pre class="literallayout">const CharT * <a name="id405673-bb"></a>data() const;</pre>
Returns: Returns a pointer to an array of characters, not necessarily null-terminated, representing the string's contents. data() is permitted, but not required, to be identical to c_str(). The first size() characters of that array are guaranteed to be identical to the characters in *this. The return value of data() is never a null pointer, even if size() is zero. 
</li>
<li>
-<pre class="literallayout">size_type <a name="id325218-bb"></a>find(const basic_string & s, size_type pos = 0) const;</pre>
+<pre class="literallayout">size_type <a name="id405686-bb"></a>find(const basic_string & s, size_type pos = 0) const;</pre>
Effects: Searches for s as a substring of *this, beginning at character pos of *this. 
</li>
<li>
-<pre class="literallayout">size_type <a name="id325247-bb"></a>find(const CharT * s, size_type pos = 0) const;</pre>
+<pre class="literallayout">size_type <a name="id405715-bb"></a>find(const CharT * s, size_type pos = 0) const;</pre>
Effects: Searches for a null-terminated character array as a substring of *this, beginning at character pos of *this. 
</li>
<li>
-<pre class="literallayout">size_type <a name="id325272-bb"></a>find(const CharT * s, size_type pos, size_type n) const;</pre>
+<pre class="literallayout">size_type <a name="id405740-bb"></a>find(const CharT * s, size_type pos, size_type n) const;</pre>
Effects: Searches for the first n characters of s as a substring of *this, beginning at character pos of *this. 
</li>
<li>
-<pre class="literallayout">size_type <a name="id325300-bb"></a>find(CharT c, size_type pos = 0) const;</pre>
+<pre class="literallayout">size_type <a name="id405768-bb"></a>find(CharT c, size_type pos = 0) const;</pre>
Effects: Searches for the character c, beginning at character position pos. 
</li>
<li>
-<pre class="literallayout">size_type <a name="id325325-bb"></a>rfind(const basic_string & s, size_type pos = npos) const;</pre>
+<pre class="literallayout">size_type <a name="id405793-bb"></a>rfind(const basic_string & s, size_type pos = npos) const;</pre>
Effects: Searches backward for s as a substring of *this, beginning at character position min(pos, size()) 
</li>
<li>
-<pre class="literallayout">size_type <a name="id325354-bb"></a>rfind(const CharT * s, size_type pos = npos) const;</pre>
+<pre class="literallayout">size_type <a name="id405822-bb"></a>rfind(const CharT * s, size_type pos = npos) const;</pre>
Effects: Searches backward for a null-terminated character array as a substring of *this, beginning at character min(pos, size()) 
</li>
<li>
-<pre class="literallayout">size_type <a name="id325379-bb"></a>rfind(const CharT * s, size_type pos, size_type n) const;</pre>
+<pre class="literallayout">size_type <a name="id405847-bb"></a>rfind(const CharT * s, size_type pos, size_type n) const;</pre>
Effects: Searches backward for the first n characters of s as a substring of *this, beginning at character position min(pos, size()). 
</li>
<li>
-<pre class="literallayout">size_type <a name="id325406-bb"></a>rfind(CharT c, size_type pos = npos) const;</pre>
+<pre class="literallayout">size_type <a name="id405874-bb"></a>rfind(CharT c, size_type pos = npos) const;</pre>
Effects: Searches backward for a null-terminated character array as a substring of *this, beginning at character min(pos, size()). 
</li>
<li>
-<pre class="literallayout">size_type <a name="id325432-bb"></a>find_first_of(const basic_string & s, size_type pos = 0) const;</pre>
+<pre class="literallayout">size_type <a name="id405900-bb"></a>find_first_of(const basic_string & s, size_type pos = 0) const;</pre>
Effects: Searches within *this, beginning at pos, for the first character that is equal to any character within s. 
</li>
<li>
-<pre class="literallayout">size_type <a name="id325460-bb"></a>find_first_of(const CharT * s, size_type pos = 0) const;</pre>
+<pre class="literallayout">size_type <a name="id405928-bb"></a>find_first_of(const CharT * s, size_type pos = 0) const;</pre>
Effects: Searches within *this, beginning at pos, for the first character that is equal to any character within s. 
</li>
<li>
-<pre class="literallayout">size_type <a name="id325486-bb"></a>find_first_of(const CharT * s, size_type pos, size_type n) const;</pre>
+<pre class="literallayout">size_type <a name="id405954-bb"></a>find_first_of(const CharT * s, size_type pos, size_type n) const;</pre>
Effects: Searches within *this, beginning at pos, for the first character that is equal to any character within the first n characters of s. 
</li>
<li>
-<pre class="literallayout">size_type <a name="id325513-bb"></a>find_first_of(CharT c, size_type pos = 0) const;</pre>
+<pre class="literallayout">size_type <a name="id405981-bb"></a>find_first_of(CharT c, size_type pos = 0) const;</pre>
Effects: Searches within *this, beginning at pos, for the first character that is equal to c. 
</li>
<li>
-<pre class="literallayout">size_type <a name="id325538-bb"></a>find_last_of(const basic_string & s, size_type pos = npos) const;</pre>
+<pre class="literallayout">size_type <a name="id406006-bb"></a>find_last_of(const basic_string & s, size_type pos = npos) const;</pre>
Effects: Searches backward within *this, beginning at min(pos, size()), for the first character that is equal to any character within s. 
</li>
<li>
-<pre class="literallayout">size_type <a name="id325567-bb"></a>find_last_of(const CharT * s, size_type pos = npos) const;</pre>
+<pre class="literallayout">size_type <a name="id406035-bb"></a>find_last_of(const CharT * s, size_type pos = npos) const;</pre>
Effects: Searches backward *this, beginning at min(pos, size()), for the first character that is equal to any character within s. 
</li>
<li>
-<pre class="literallayout">size_type <a name="id325592-bb"></a>find_last_of(const CharT * s, size_type pos, size_type n) const;</pre>
+<pre class="literallayout">size_type <a name="id406060-bb"></a>find_last_of(const CharT * s, size_type pos, size_type n) const;</pre>
Effects: Searches backward within *this, beginning at min(pos, size()), for the first character that is equal to any character within the first n characters of s. 
</li>
<li>
-<pre class="literallayout">size_type <a name="id325620-bb"></a>find_last_of(CharT c, size_type pos = npos) const;</pre>
+<pre class="literallayout">size_type <a name="id406088-bb"></a>find_last_of(CharT c, size_type pos = npos) const;</pre>
Effects: Searches backward *this, beginning at min(pos, size()), for the first character that is equal to c. 
</li>
<li>
-<pre class="literallayout">size_type <a name="id325645-bb"></a>find_first_not_of(const basic_string & s, size_type pos = 0) const;</pre>
+<pre class="literallayout">size_type <a name="id406113-bb"></a>find_first_not_of(const basic_string & s, size_type pos = 0) const;</pre>
Effects: Searches within *this, beginning at pos, for the first character that is not equal to any character within s. 
</li>
<li>
-<pre class="literallayout">size_type <a name="id325674-bb"></a>find_first_not_of(const CharT * s, size_type pos = 0) const;</pre>
+<pre class="literallayout">size_type <a name="id406142-bb"></a>find_first_not_of(const CharT * s, size_type pos = 0) const;</pre>
Effects: Searches within *this, beginning at pos, for the first character that is not equal to any character within s. 
</li>
<li>
-<pre class="literallayout">size_type <a name="id325699-bb"></a>find_first_not_of(const CharT * s, size_type pos, size_type n) const;</pre>
+<pre class="literallayout">size_type <a name="id406167-bb"></a>find_first_not_of(const CharT * s, size_type pos, size_type n) const;</pre>
Effects: Searches within *this, beginning at pos, for the first character that is not equal to any character within the first n characters of s. 
</li>
<li>
-<pre class="literallayout">size_type <a name="id325727-bb"></a>find_first_not_of(CharT c, size_type pos = 0) const;</pre>
+<pre class="literallayout">size_type <a name="id406195-bb"></a>find_first_not_of(CharT c, size_type pos = 0) const;</pre>
Effects: Searches within *this, beginning at pos, for the first character that is not equal to c. 
</li>
<li>
-<pre class="literallayout">size_type <a name="id325752-bb"></a>find_last_not_of(const basic_string & s, size_type pos = npos) const;</pre>
+<pre class="literallayout">size_type <a name="id406220-bb"></a>find_last_not_of(const basic_string & s, size_type pos = npos) const;</pre>
Effects: Searches backward within *this, beginning at min(pos, size()), for the first character that is not equal to any character within s. 
</li>
<li>
-<pre class="literallayout">size_type <a name="id325781-bb"></a>find_last_not_of(const CharT * s, size_type pos = npos) const;</pre>
+<pre class="literallayout">size_type <a name="id406249-bb"></a>find_last_not_of(const CharT * s, size_type pos = npos) const;</pre>
Effects: Searches backward *this, beginning at min(pos, size()), for the first character that is not equal to any character within s. 
</li>
<li>
-<pre class="literallayout">size_type <a name="id325806-bb"></a>find_last_not_of(const CharT * s, size_type pos, size_type n) const;</pre>
+<pre class="literallayout">size_type <a name="id406274-bb"></a>find_last_not_of(const CharT * s, size_type pos, size_type n) const;</pre>
Effects: Searches backward within *this, beginning at min(pos, size()), for the first character that is not equal to any character within the first n characters of s. 
</li>
<li>
-<pre class="literallayout">size_type <a name="id325834-bb"></a>find_last_not_of(CharT c, size_type pos = npos) const;</pre>
+<pre class="literallayout">size_type <a name="id406302-bb"></a>find_last_not_of(CharT c, size_type pos = npos) const;</pre>
Effects: Searches backward *this, beginning at min(pos, size()), for the first character that is not equal to c. 
</li>
<li>
-<pre class="literallayout">basic_string <a name="id325859-bb"></a>substr(size_type pos = 0, size_type n = npos) const;</pre>
+<pre class="literallayout">basic_string <a name="id406327-bb"></a>substr(size_type pos = 0, size_type n = npos) const;</pre>
Effects: Returns a substring of *this. </li>
<li>
-<pre class="literallayout">int <a name="id325886-bb"></a>compare(const basic_string & s) const;</pre>
+<pre class="literallayout">int <a name="id406354-bb"></a>compare(const basic_string & s) const;</pre>
Effects: Three-way lexicographical comparison of s and *this. </li>
<li>
-<pre class="literallayout">int <a name="id325907-bb"></a>compare(size_type pos1, size_type n1, const basic_string & s) const;</pre>
+<pre class="literallayout">int <a name="id406375-bb"></a>compare(size_type pos1, size_type n1, const basic_string & s) const;</pre>
Effects: Three-way lexicographical comparison of s and a substring of *this. 
</li>
<li>
-<pre class="literallayout">int <a name="id325938-bb"></a>compare(size_type pos1, size_type n1, const basic_string & s,
- size_type pos2, size_type n2) const;</pre>
+<pre class="literallayout">int <a name="id406406-bb"></a>compare(size_type pos1, size_type n1, const basic_string & s,
+ size_type pos2, size_type n2) const;</pre>
Effects: Three-way lexicographical comparison of a substring of s and a substring of *this. 
</li>
<li>
-<pre class="literallayout">int <a name="id325979-bb"></a>compare(const CharT * s) const;</pre>
+<pre class="literallayout">int <a name="id406447-bb"></a>compare(const CharT * s) const;</pre>
Effects: Three-way lexicographical comparison of s and *this. </li>
<li>
-<pre class="literallayout">int <a name="id325996-bb"></a>compare(size_type pos1, size_type n1, const CharT * s,
- size_type n2 = npos) const;</pre>
+<pre class="literallayout">int <a name="id406464-bb"></a>compare(size_type pos1, size_type n1, const CharT * s,
+ size_type n2 = npos) const;</pre>
Effects: Three-way lexicographical comparison of the first min(len, traits::length(s) characters of s and a substring of *this. 
</li>
</ol></div>
@@ -677,7 +672,7 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2009 -2010 Ion Gaztanaga
+<td align="right"><div class="copyright-footer">Copyright © 2009 -2011 Ion Gaztanaga
 Distributed under the Boost Software License, Version 1.0. (See accompanying
 file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
@@ -685,7 +680,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="stable_vector.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.string_hpp"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="string.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="stable_vector.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.string_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="string.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>

Modified: sandbox/move/libs/container/doc/html/boost/container/deque.html
==============================================================================
--- sandbox/move/libs/container/doc/html/boost/container/deque.html (original)
+++ sandbox/move/libs/container/doc/html/boost/container/deque.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
@@ -1,10 +1,10 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Class template deque</title>
-<link rel="stylesheet" href="../../boostbook.css" type="text/css">
+<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
-<link rel="start" href="../../index.html" title="Chapter 1. Boost.Container">
+<link rel="start" href="../../index.html" title="Chapter 1. Boost.Container">
<link rel="up" href="../../boost_container_reference.html#header.boost.container.deque_hpp" title="Header <boost/container/deque.hpp>">
<link rel="prev" href="ordered_unique_range.html" title="Global ordered_unique_range">
<link rel="next" href="flat_map.html" title="Class template flat_map">
@@ -20,7 +20,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="ordered_unique_range.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.deque_hpp"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="flat_map.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="ordered_unique_range.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.deque_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="flat_map.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="refentry" lang="en">
<a name="boost.container.deque"></a><div class="titlepage"></div>
@@ -29,158 +29,397 @@
boost::container::deque — 
</div>
<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2>
-<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/container/deque.hpp>
+<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/container/deque.hpp>

-template<typename T, typename Alloc>
-class deque {
-public:
- // types
- typedef Base::iterator <a name="boost.container.deque.iterator"></a>iterator;
- typedef Base::const_iterator <a name="boost.container.deque.const_iterator"></a>const_iterator;
- typedef std::reverse_iterator< const_iterator > <a name="boost.container.deque.const_reverse_iterator"></a>const_reverse_iterator;
- typedef std::reverse_iterator< iterator > <a name="boost.container.deque.reverse_iterator"></a>reverse_iterator;
+template<typename T, typename Alloc>
+class deque {
+public:
+ // types
+ typedef Base::iterator <a name="boost.container.deque.iterator"></a>iterator;
+ typedef Base::const_iterator <a name="boost.container.deque.const_iterator"></a>const_iterator;
+ typedef std::reverse_iterator< const_iterator > <a name="boost.container.deque.const_reverse_iterator"></a>const_reverse_iterator;
+ typedef std::reverse_iterator< iterator > <a name="boost.container.deque.reverse_iterator"></a>reverse_iterator;

- // construct/copy/destruct
- deque(const allocator_type & = allocator_type());
- deque(const deque &);
- deque(deque &&);
- deque(size_type, const value_type &,
- const allocator_type & = allocator_type());
- deque(size_type);
- template<typename InpIt>
- deque(InpIt, InpIt, const allocator_type & = allocator_type());
- deque& operator=(const deque &);
- deque& operator=(deque &&);
- ~deque();
+ // construct/copy/destruct
+ deque(const allocator_type & = allocator_type());
+ deque(size_type);
+ deque(size_type, const value_type &,
+ const allocator_type & = allocator_type());
+ deque(const deque &);
+ deque(deque &&);
+ template<typename InpIt>
+ deque(InpIt, InpIt, const allocator_type & = allocator_type());
+ deque& operator=(const deque &);
+ deque& operator=(deque &&);
+ ~deque();

- // public member functions
- allocator_type get_allocator() const;
- iterator begin() ;
- iterator end() ;
- const_iterator begin() const;
- const_iterator end() const;
- reverse_iterator rbegin() ;
- reverse_iterator rend() ;
- const_reverse_iterator rbegin() const;
- const_reverse_iterator rend() const;
- const_iterator cbegin() const;
- const_iterator cend() const;
- const_reverse_iterator crbegin() const;
- const_reverse_iterator crend() const;
- reference operator[](size_type) ;
- const_reference operator[](size_type) const;
- void priv_range_check(size_type) const;
- reference at(size_type) ;
- const_reference at(size_type) const;
- reference front() ;
- reference back() ;
- const_reference front() const;
- const_reference back() const;
- size_type size() const;
- size_type max_size() const;
- bool empty() const;
- void swap(deque &) ;
- void assign(size_type, const T &) ;
- template<typename InpIt> void assign(InpIt, InpIt) ;
- void push_back(const T &) ;
- void push_back(value_type &&) ;
- void push_front(const T &) ;
- void push_front(value_type &&) ;
- void pop_back() ;
- void pop_front() ;
- iterator insert(const_iterator, const T &) ;
- iterator insert(const_iterator, value_type &&) ;
- void insert(const_iterator, size_type, const value_type &) ;
- template<typename InpIt> void insert(const_iterator, InpIt, InpIt) ;
- template<class... Args> void emplace_back(Args &&...) ;
- template<class... Args> void emplace_front(Args &&...) ;
- template<class... Args> iterator emplace(const_iterator, Args &&...) ;
- void resize(size_type, const value_type &) ;
- void resize(size_type) ;
- iterator erase(const_iterator) ;
- iterator erase(const_iterator, const_iterator) ;
- void clear() ;
-};</pre></div>
+ // public member functions
+ allocator_type get_allocator() const;
+ iterator begin();
+ iterator end();
+ const_iterator begin() const;
+ const_iterator end() const;
+ reverse_iterator rbegin();
+ reverse_iterator rend();
+ const_reverse_iterator rbegin() const;
+ const_reverse_iterator rend() const;
+ const_iterator cbegin() const;
+ const_iterator cend() const;
+ const_reverse_iterator crbegin() const;
+ const_reverse_iterator crend() const;
+ reference operator[](size_type);
+ const_reference operator[](size_type) const;
+ reference at(size_type);
+ const_reference at(size_type) const;
+ reference front();
+ const_reference front() const;
+ reference back();
+ const_reference back() const;
+ size_type size() const;
+ size_type max_size() const;
+ bool empty() const;
+ void swap(deque &);
+ void assign(size_type, const T &);
+ template<typename InpIt> void assign(InpIt, InpIt);
+ void pop_back();
+ void pop_front();
+ void insert(const_iterator, size_type, const value_type &);
+ template<typename InpIt> void insert(const_iterator, InpIt, InpIt);
+ template<class... Args> void emplace_back(Args &&...);
+ template<class... Args> void emplace_front(Args &&...);
+ template<class... Args> iterator emplace(const_iterator, Args &&...);
+ void resize(size_type, const value_type &);
+ void resize(size_type);
+ iterator erase(const_iterator);
+ iterator erase(const_iterator, const_iterator);
+ void clear();
+};</pre></div>
<div class="refsect1" lang="en">
-<a name="id473130"></a><h2>Description</h2>
+<a name="id741801"></a><h2>Description</h2>
Deque class 
<div class="refsect2" lang="en">
-<a name="id473136"></a><h3>
+<a name="id741807"></a><h3>
<a name="boost.container.dequeconstruct-copy-destruct"></a><code class="computeroutput">deque</code>
 public
 construct/copy/destruct</h3>
<div class="orderedlist"><ol type="1">
-<li><pre class="literallayout"><a name="id294169-bb"></a>deque(const allocator_type & a = allocator_type());</pre></li>
-<li><pre class="literallayout"><a name="id294178-bb"></a>deque(const deque & x);</pre></li>
-<li><pre class="literallayout"><a name="id294187-bb"></a>deque(deque && mx);</pre></li>
-<li><pre class="literallayout"><a name="id294196-bb"></a>deque(size_type n, const value_type & value,
- const allocator_type & a = allocator_type());</pre></li>
-<li><pre class="literallayout"><a name="id294214-bb"></a>deque(size_type n);</pre></li>
-<li><pre class="literallayout">template<typename InpIt>
- <a name="id294220-bb"></a>deque(InpIt first, InpIt last, const allocator_type & a = allocator_type());</pre></li>
-<li><pre class="literallayout">deque& <a name="id294245-bb"></a>operator=(const deque & x);</pre></li>
-<li><pre class="literallayout">deque& <a name="id294254-bb"></a>operator=(deque && x);</pre></li>
-<li><pre class="literallayout"><a name="id294244-bb"></a>~deque();</pre></li>
+<li>
+<pre class="literallayout"><a name="id372806-bb"></a>deque(const allocator_type & a = allocator_type());</pre>
+Effects: Constructs a deque taking the allocator as parameter.
+Throws: If allocator_type's copy constructor throws.
+Complexity: Constant. 
+</li>
+<li>
+<pre class="literallayout"><a name="id372833-bb"></a>deque(size_type n);</pre>
+Effects: Constructs a deque that will use a copy of allocator a and inserts n default contructed values.
+Throws: If allocator_type's default constructor or copy constructor throws or T's default or copy constructor throws.
+Complexity: Linear to n. 
+</li>
+<li>
+<pre class="literallayout"><a name="id372858-bb"></a>deque(size_type n, const value_type & value,
+ const allocator_type & a = allocator_type());</pre>
+Effects: Constructs a deque that will use a copy of allocator a and inserts n copies of value.
+Throws: If allocator_type's default constructor or copy constructor throws or T's default or copy constructor throws.
+Complexity: Linear to n. 
+</li>
+<li>
+<pre class="literallayout"><a name="id372896-bb"></a>deque(const deque & x);</pre>
+Effects: Copy constructs a deque.
+Postcondition: x == *this.
+Complexity: Linear to the elements x contains. 
+</li>
+<li>
+<pre class="literallayout"><a name="id372924-bb"></a>deque(deque && mx);</pre>
+Effects: Move constructor. Moves mx's resources to *this.
+Throws: If allocator_type's copy constructor throws.
+Complexity: Constant. 
+</li>
+<li>
+<pre class="literallayout">template<typename InpIt>
+ <a name="id372952-bb"></a>deque(InpIt first, InpIt last, const allocator_type & a = allocator_type());</pre>
+Effects: Constructs a deque that will use a copy of allocator a and inserts a copy of the range [first, last) in the deque.
+Throws: If allocator_type's default constructor or copy constructor throws or T's constructor taking an dereferenced InIt throws.
+Complexity: Linear to the range [first, last). 
+</li>
+<li>
+<pre class="literallayout">deque& <a name="id373016-bb"></a>operator=(const deque & x);</pre>
+Effects: Makes *this contain the same elements as x.
+Postcondition: this->size() == x.size(). *this contains a copy of each of x's elements.
+Throws: If memory allocation throws or T's copy constructor throws.
+Complexity: Linear to the number of elements in x. 
+</li>
+<li>
+<pre class="literallayout">deque& <a name="id373052-bb"></a>operator=(deque && x);</pre>
+Effects: Move assignment. All mx's values are transferred to *this.
+Postcondition: x.empty(). *this contains a the elements x had before the function.
+Throws: If allocator_type's copy constructor throws.
+Complexity: Linear. 
+</li>
+<li>
+<pre class="literallayout"><a name="id372995-bb"></a>~deque();</pre>
+Effects: Destroys the deque. All stored values are destroyed and used memory is deallocated.
+Throws: Nothing.
+Complexity: Linear to the number of elements. 
+</li>
</ol></div>
</div>
<div class="refsect2" lang="en">
-<a name="id473303"></a><h3>
-<a name="id293688-bb"></a><code class="computeroutput">deque</code> public member functions</h3>
+<a name="id742423"></a><h3>
+<a name="id371436-bb"></a><code class="computeroutput">deque</code> public member functions</h3>
<div class="orderedlist"><ol type="1">
-<li><pre class="literallayout">allocator_type <a name="id293690-bb"></a>get_allocator() const;</pre></li>
-<li><pre class="literallayout">iterator <a name="id293696-bb"></a>begin() ;</pre></li>
-<li><pre class="literallayout">iterator <a name="id293702-bb"></a>end() ;</pre></li>
-<li><pre class="literallayout">const_iterator <a name="id293708-bb"></a>begin() const;</pre></li>
-<li><pre class="literallayout">const_iterator <a name="id293714-bb"></a>end() const;</pre></li>
-<li><pre class="literallayout">reverse_iterator <a name="id293720-bb"></a>rbegin() ;</pre></li>
-<li><pre class="literallayout">reverse_iterator <a name="id293726-bb"></a>rend() ;</pre></li>
-<li><pre class="literallayout">const_reverse_iterator <a name="id293732-bb"></a>rbegin() const;</pre></li>
-<li><pre class="literallayout">const_reverse_iterator <a name="id293738-bb"></a>rend() const;</pre></li>
-<li><pre class="literallayout">const_iterator <a name="id293744-bb"></a>cbegin() const;</pre></li>
-<li><pre class="literallayout">const_iterator <a name="id293750-bb"></a>cend() const;</pre></li>
-<li><pre class="literallayout">const_reverse_iterator <a name="id293756-bb"></a>crbegin() const;</pre></li>
-<li><pre class="literallayout">const_reverse_iterator <a name="id293762-bb"></a>crend() const;</pre></li>
-<li><pre class="literallayout">reference <a name="id293768-bb"></a>operator[](size_type n) ;</pre></li>
-<li><pre class="literallayout">const_reference <a name="id293779-bb"></a>operator[](size_type n) const;</pre></li>
-<li><pre class="literallayout">void <a name="id293790-bb"></a>priv_range_check(size_type n) const;</pre></li>
-<li><pre class="literallayout">reference <a name="id293801-bb"></a>at(size_type n) ;</pre></li>
-<li><pre class="literallayout">const_reference <a name="id293812-bb"></a>at(size_type n) const;</pre></li>
-<li><pre class="literallayout">reference <a name="id293822-bb"></a>front() ;</pre></li>
-<li><pre class="literallayout">reference <a name="id293828-bb"></a>back() ;</pre></li>
-<li><pre class="literallayout">const_reference <a name="id293834-bb"></a>front() const;</pre></li>
-<li><pre class="literallayout">const_reference <a name="id293840-bb"></a>back() const;</pre></li>
-<li><pre class="literallayout">size_type <a name="id293846-bb"></a>size() const;</pre></li>
-<li><pre class="literallayout">size_type <a name="id293852-bb"></a>max_size() const;</pre></li>
-<li><pre class="literallayout">bool <a name="id293858-bb"></a>empty() const;</pre></li>
-<li><pre class="literallayout">void <a name="id293864-bb"></a>swap(deque & x) ;</pre></li>
-<li><pre class="literallayout">void <a name="id293878-bb"></a>assign(size_type n, const T & val) ;</pre></li>
-<li><pre class="literallayout">template<typename InpIt> void <a name="id293893-bb"></a>assign(InpIt first, InpIt last) ;</pre></li>
-<li><pre class="literallayout">void <a name="id293915-bb"></a>push_back(const T & t) ;</pre></li>
-<li><pre class="literallayout">void <a name="id293926-bb"></a>push_back(value_type && t) ;</pre></li>
-<li><pre class="literallayout">void <a name="id293936-bb"></a>push_front(const T & t) ;</pre></li>
-<li><pre class="literallayout">void <a name="id293947-bb"></a>push_front(value_type && t) ;</pre></li>
-<li><pre class="literallayout">void <a name="id293958-bb"></a>pop_back() ;</pre></li>
-<li><pre class="literallayout">void <a name="id293964-bb"></a>pop_front() ;</pre></li>
-<li><pre class="literallayout">iterator <a name="id293970-bb"></a>insert(const_iterator position, const T & x) ;</pre></li>
-<li><pre class="literallayout">iterator <a name="id293986-bb"></a>insert(const_iterator position, value_type && mx) ;</pre></li>
-<li><pre class="literallayout">void <a name="id294001-bb"></a>insert(const_iterator pos, size_type n, const value_type & x) ;</pre></li>
-<li><pre class="literallayout">template<typename InpIt>
- void <a name="id294022-bb"></a>insert(const_iterator pos, InpIt first, InpIt last) ;</pre></li>
-<li><pre class="literallayout">template<class... Args> void <a name="id294048-bb"></a>emplace_back(Args &&... args) ;</pre></li>
-<li><pre class="literallayout">template<class... Args> void <a name="id294067-bb"></a>emplace_front(Args &&... args) ;</pre></li>
-<li><pre class="literallayout">template<class... Args> iterator <a name="id294086-bb"></a>emplace(const_iterator p, Args &&... args) ;</pre></li>
-<li><pre class="literallayout">void <a name="id294110-bb"></a>resize(size_type new_size, const value_type & x) ;</pre></li>
-<li><pre class="literallayout">void <a name="id294126-bb"></a>resize(size_type new_size) ;</pre></li>
-<li><pre class="literallayout">iterator <a name="id294137-bb"></a>erase(const_iterator pos) ;</pre></li>
-<li><pre class="literallayout">iterator <a name="id294148-bb"></a>erase(const_iterator first, const_iterator last) ;</pre></li>
-<li><pre class="literallayout">void <a name="id294163-bb"></a>clear() ;</pre></li>
+<li>
+<pre class="literallayout">allocator_type <a name="id371439-bb"></a>get_allocator() const;</pre>
+Effects: Returns a copy of the internal allocator.
+Throws: If allocator's copy constructor throws.
+Complexity: Constant. 
+</li>
+<li>
+<pre class="literallayout">iterator <a name="id371464-bb"></a>begin();</pre>
+Effects: Returns an iterator to the first element contained in the deque.
+Throws: Nothing.
+Complexity: Constant. 
+</li>
+<li>
+<pre class="literallayout">iterator <a name="id371489-bb"></a>end();</pre>
+Effects: Returns an iterator to the end of the deque.
+Throws: Nothing.
+Complexity: Constant. 
+</li>
+<li>
+<pre class="literallayout">const_iterator <a name="id371514-bb"></a>begin() const;</pre>
+Effects: Returns a const_iterator to the first element contained in the deque.
+Throws: Nothing.
+Complexity: Constant. 
+</li>
+<li>
+<pre class="literallayout">const_iterator <a name="id371540-bb"></a>end() const;</pre>
+Effects: Returns a const_iterator to the end of the deque.
+Throws: Nothing.
+Complexity: Constant. 
+</li>
+<li>
+<pre class="literallayout">reverse_iterator <a name="id371565-bb"></a>rbegin();</pre>
+Effects: Returns a reverse_iterator pointing to the beginning of the reversed deque.
+Throws: Nothing.
+Complexity: Constant. 
+</li>
+<li>
+<pre class="literallayout">reverse_iterator <a name="id371590-bb"></a>rend();</pre>
+Effects: Returns a reverse_iterator pointing to the end of the reversed deque.
+Throws: Nothing.
+Complexity: Constant. 
+</li>
+<li>
+<pre class="literallayout">const_reverse_iterator <a name="id371615-bb"></a>rbegin() const;</pre>
+Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed deque.
+Throws: Nothing.
+Complexity: Constant. 
+</li>
+<li>
+<pre class="literallayout">const_reverse_iterator <a name="id371640-bb"></a>rend() const;</pre>
+Effects: Returns a const_reverse_iterator pointing to the end of the reversed deque.
+Throws: Nothing.
+Complexity: Constant. 
+</li>
+<li>
+<pre class="literallayout">const_iterator <a name="id371666-bb"></a>cbegin() const;</pre>
+Effects: Returns a const_iterator to the first element contained in the deque.
+Throws: Nothing.
+Complexity: Constant. 
+</li>
+<li>
+<pre class="literallayout">const_iterator <a name="id371691-bb"></a>cend() const;</pre>
+Effects: Returns a const_iterator to the end of the deque.
+Throws: Nothing.
+Complexity: Constant. 
+</li>
+<li>
+<pre class="literallayout">const_reverse_iterator <a name="id371716-bb"></a>crbegin() const;</pre>
+Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed deque.
+Throws: Nothing.
+Complexity: Constant. 
+</li>
+<li>
+<pre class="literallayout">const_reverse_iterator <a name="id371741-bb"></a>crend() const;</pre>
+Effects: Returns a const_reverse_iterator pointing to the end of the reversed deque.
+Throws: Nothing.
+Complexity: Constant. 
+</li>
+<li>
+<pre class="literallayout">reference <a name="id371766-bb"></a>operator[](size_type n);</pre>
+Requires: size() < n.
+Effects: Returns a reference to the nth element from the beginning of the container.
+Throws: Nothing.
+Complexity: Constant. 
+</li>
+<li>
+<pre class="literallayout">const_reference <a name="id371802-bb"></a>operator[](size_type n) const;</pre>
+Requires: size() < n.
+Effects: Returns a const reference to the nth element from the beginning of the container.
+Throws: Nothing.
+Complexity: Constant. 
+</li>
+<li>
+<pre class="literallayout">reference <a name="id371838-bb"></a>at(size_type n);</pre>
+Requires: size() < n.
+Effects: Returns a reference to the nth element from the beginning of the container.
+Throws: std::range_error if n >= size()
+Complexity: Constant. 
+</li>
+<li>
+<pre class="literallayout">const_reference <a name="id372022-bb"></a>at(size_type n) const;</pre>
+Requires: size() < n.
+Effects: Returns a const reference to the nth element from the beginning of the container.
+Throws: std::range_error if n >= size()
+Complexity: Constant. 
+</li>
+<li>
+<pre class="literallayout">reference <a name="id372058-bb"></a>front();</pre>
+Requires: !empty()
+Effects: Returns a reference to the first element of the container.
+Throws: Nothing.
+Complexity: Constant. 
+</li>
+<li>
+<pre class="literallayout">const_reference <a name="id372090-bb"></a>front() const;</pre>
+Requires: !empty()
+Effects: Returns a const reference to the first element from the beginning of the container.
+Throws: Nothing.
+Complexity: Constant. 
+</li>
+<li>
+<pre class="literallayout">reference <a name="id372122-bb"></a>back();</pre>
+Requires: !empty()
+Effects: Returns a reference to the last element of the container.
+Throws: Nothing.
+Complexity: Constant. 
+</li>
+<li>
+<pre class="literallayout">const_reference <a name="id372154-bb"></a>back() const;</pre>
+Requires: !empty()
+Effects: Returns a const reference to the last element of the container.
+Throws: Nothing.
+Complexity: Constant. 
+</li>
+<li>
+<pre class="literallayout">size_type <a name="id372185-bb"></a>size() const;</pre>
+Effects: Returns the number of the elements contained in the deque.
+Throws: Nothing.
+Complexity: Constant. 
+</li>
+<li>
+<pre class="literallayout">size_type <a name="id372212-bb"></a>max_size() const;</pre>
+Effects: Returns the largest possible size of the deque.
+Throws: Nothing.
+Complexity: Constant. 
+</li>
+<li>
+<pre class="literallayout">bool <a name="id372237-bb"></a>empty() const;</pre>
+Effects: Returns true if the deque contains no elements.
+Throws: Nothing.
+Complexity: Constant. 
+</li>
+<li>
+<pre class="literallayout">void <a name="id372262-bb"></a>swap(deque & x);</pre>
+Effects: Swaps the contents of *this and x. If this->allocator_type() != x.allocator_type() allocators are also swapped.
+Throws: Nothing.
+Complexity: Constant. 
+</li>
+<li>
+<pre class="literallayout">void <a name="id372294-bb"></a>assign(size_type n, const T & val);</pre>
+Effects: Assigns the n copies of val to *this.
+Throws: If memory allocation throws or T's copy constructor throws.
+Complexity: Linear to n. 
+</li>
+<li>
+<pre class="literallayout">template<typename InpIt> void <a name="id372330-bb"></a>assign(InpIt first, InpIt last);</pre>
+Effects: Assigns the the range [first, last) to *this.
+Throws: If memory allocation throws or T's constructor from dereferencing InpIt throws.
+Complexity: Linear to n. 
+</li>
+<li>
+<pre class="literallayout">void <a name="id372371-bb"></a>pop_back();</pre>
+Effects: Removes the last element from the deque.
+Throws: Nothing.
+Complexity: Constant time. 
+</li>
+<li>
+<pre class="literallayout">void <a name="id372396-bb"></a>pop_front();</pre>
+Effects: Removes the first element from the deque.
+Throws: Nothing.
+Complexity: Constant time. 
+</li>
+<li>
+<pre class="literallayout">void <a name="id372422-bb"></a>insert(const_iterator pos, size_type n, const value_type & x);</pre>
+Requires: pos must be a valid iterator of *this.
+Effects: Insert n copies of x before pos.
+Throws: If memory allocation throws or T's copy constructor throws.
+Complexity: Linear to n. 
+</li>
+<li>
+<pre class="literallayout">template<typename InpIt>
+ void <a name="id372468-bb"></a>insert(const_iterator pos, InpIt first, InpIt last);</pre>
+Requires: pos must be a valid iterator of *this.
+Effects: Insert a copy of the [first, last) range before pos.
+Throws: If memory allocation throws, T's constructor from a dereferenced InpIt throws or T's copy constructor throws.
+Complexity: Linear to std::distance [first, last). 
+</li>
+<li>
+<pre class="literallayout">template<class... Args> void <a name="id372520-bb"></a>emplace_back(Args &&... args);</pre>
+Effects: Inserts an object of type T constructed with std::forward<Args>(args)... in the end of the deque.
+Throws: If memory allocation throws or the in-place constructor throws.
+Complexity: Amortized constant time 
+</li>
+<li>
+<pre class="literallayout">template<class... Args> void <a name="id372558-bb"></a>emplace_front(Args &&... args);</pre>
+Effects: Inserts an object of type T constructed with std::forward<Args>(args)... in the beginning of the deque.
+Throws: If memory allocation throws or the in-place constructor throws.
+Complexity: Amortized constant time 
+</li>
+<li>
+<pre class="literallayout">template<class... Args> iterator <a name="id372597-bb"></a>emplace(const_iterator p, Args &&... args);</pre>
+Requires: position must be a valid iterator of *this.
+Effects: Inserts an object of type T constructed with std::forward<Args>(args)... before position
+Throws: If memory allocation throws or the in-place constructor throws.
+Complexity: If position is end(), amortized constant time Linear time otherwise. 
+</li>
+<li>
+<pre class="literallayout">void <a name="id372646-bb"></a>resize(size_type new_size, const value_type & x);</pre>
+Effects: Inserts or erases elements at the end such that the size becomes n. New elements are copy constructed from x.
+Throws: If memory allocation throws, or T's copy constructor throws.
+Complexity: Linear to the difference between size() and new_size. 
+</li>
+<li>
+<pre class="literallayout">void <a name="id372683-bb"></a>resize(size_type new_size);</pre>
+Effects: Inserts or erases elements at the end such that the size becomes n. New elements are default constructed.
+Throws: If memory allocation throws, or T's copy constructor throws.
+Complexity: Linear to the difference between size() and new_size. 
+</li>
+<li>
+<pre class="literallayout">iterator <a name="id372716-bb"></a>erase(const_iterator pos);</pre>
+Effects: Erases the element at position pos.
+Throws: Nothing.
+Complexity: Linear to the elements between pos and the last element (if pos is near the end) or the first element if(pos is near the beginning). Constant if pos is the first or the last element. 
+</li>
+<li>
+<pre class="literallayout">iterator <a name="id372746-bb"></a>erase(const_iterator first, const_iterator last);</pre>
+Effects: Erases the elements pointed by [first, last).
+Throws: Nothing.
+Complexity: Linear to the distance between first and last plus the elements between pos and the last element (if pos is near the end) or the first element if(pos is near the beginning). 
+</li>
+<li>
+<pre class="literallayout">void <a name="id372780-bb"></a>clear();</pre>
+Effects: Erases all the elements of the deque.
+Throws: Nothing.
+Complexity: Linear to the number of elements in the deque. 
+</li>
</ol></div>
</div>
</div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2009 -2010 Ion Gaztanaga
+<td align="right"><div class="copyright-footer">Copyright © 2009 -2011 Ion Gaztanaga
 Distributed under the Boost Software License, Version 1.0. (See accompanying
 file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
@@ -188,7 +427,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="ordered_unique_range.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.deque_hpp"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="flat_map.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="ordered_unique_range.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.deque_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="flat_map.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>

Modified: sandbox/move/libs/container/doc/html/boost/container/flat_map.html
==============================================================================
--- sandbox/move/libs/container/doc/html/boost/container/flat_map.html (original)
+++ sandbox/move/libs/container/doc/html/boost/container/flat_map.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
@@ -1,10 +1,10 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Class template flat_map</title>
-<link rel="stylesheet" href="../../boostbook.css" type="text/css">
+<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
-<link rel="start" href="../../index.html" title="Chapter 1. Boost.Container">
+<link rel="start" href="../../index.html" title="Chapter 1. Boost.Container">
<link rel="up" href="../../boost_container_reference.html#header.boost.container.flat_map_hpp" title="Header <boost/container/flat_map.hpp>">
<link rel="prev" href="deque.html" title="Class template deque">
<link rel="next" href="flat_multimap.html" title="Class template flat_multimap">
@@ -20,7 +20,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="deque.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.flat_map_hpp"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="flat_multimap.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="deque.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.flat_map_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="flat_multimap.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="refentry" lang="en">
<a name="boost.container.flat_map"></a><div class="titlepage"></div>
@@ -29,152 +29,152 @@
boost::container::flat_map — 
</div>
<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2>
-<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/container/flat_map.hpp>
+<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/container/flat_map.hpp>

-template<typename Key, typename T, typename Pred, typename Alloc>
-class flat_map {
-public:
- // types
- typedef impl_tree_t::key_type <a name="boost.container.flat_map.key_type"></a>key_type;
- typedef T <a name="boost.container.flat_map.mapped_type"></a>mapped_type;
- typedef std::pair< key_type, mapped_type > <a name="boost.container.flat_map.value_type"></a>value_type;
- typedef Alloc::pointer <a name="boost.container.flat_map.pointer"></a>pointer;
- typedef Alloc::const_pointer <a name="boost.container.flat_map.const_pointer"></a>const_pointer;
- typedef Alloc::reference <a name="boost.container.flat_map.reference"></a>reference;
- typedef Alloc::const_reference <a name="boost.container.flat_map.const_reference"></a>const_reference;
- typedef unspecified <a name="boost.container.flat_map.value_compare"></a>value_compare;
- typedef Pred <a name="boost.container.flat_map.key_compare"></a>key_compare;
- typedef unspecified <a name="boost.container.flat_map.iterator"></a>iterator;
- typedef unspecified <a name="boost.container.flat_map.const_iterator"></a>const_iterator;
- typedef unspecified <a name="boost.container.flat_map.reverse_iterator"></a>reverse_iterator;
- typedef unspecified <a name="boost.container.flat_map.const_reverse_iterator"></a>const_reverse_iterator;
- typedef impl_tree_t::size_type <a name="boost.container.flat_map.size_type"></a>size_type;
- typedef impl_tree_t::difference_type <a name="boost.container.flat_map.difference_type"></a>difference_type;
- typedef Alloc <a name="boost.container.flat_map.allocator_type"></a>allocator_type;
- typedef Alloc <a name="boost.container.flat_map.stored_allocator_type"></a>stored_allocator_type;
+template<typename Key, typename T, typename Pred, typename Alloc>
+class flat_map {
+public:
+ // types
+ typedef impl_tree_t::key_type <a name="boost.container.flat_map.key_type"></a>key_type;
+ typedef T <a name="boost.container.flat_map.mapped_type"></a>mapped_type;
+ typedef std::pair< key_type, mapped_type > <a name="boost.container.flat_map.value_type"></a>value_type;
+ typedef Alloc::pointer <a name="boost.container.flat_map.pointer"></a>pointer;
+ typedef Alloc::const_pointer <a name="boost.container.flat_map.const_pointer"></a>const_pointer;
+ typedef Alloc::reference <a name="boost.container.flat_map.reference"></a>reference;
+ typedef Alloc::const_reference <a name="boost.container.flat_map.const_reference"></a>const_reference;
+ typedef unspecified <a name="boost.container.flat_map.value_compare"></a>value_compare;
+ typedef Pred <a name="boost.container.flat_map.key_compare"></a>key_compare;
+ typedef unspecified <a name="boost.container.flat_map.iterator"></a>iterator;
+ typedef unspecified <a name="boost.container.flat_map.const_iterator"></a>const_iterator;
+ typedef unspecified <a name="boost.container.flat_map.reverse_iterator"></a>reverse_iterator;
+ typedef unspecified <a name="boost.container.flat_map.const_reverse_iterator"></a>const_reverse_iterator;
+ typedef impl_tree_t::size_type <a name="boost.container.flat_map.size_type"></a>size_type;
+ typedef impl_tree_t::difference_type <a name="boost.container.flat_map.difference_type"></a>difference_type;
+ typedef Alloc <a name="boost.container.flat_map.allocator_type"></a>allocator_type;
+ typedef Alloc <a name="boost.container.flat_map.stored_allocator_type"></a>stored_allocator_type;

- // construct/copy/destruct
- flat_map(const Pred & = Pred(), const allocator_type & = allocator_type());
- template<typename InputIterator>
- flat_map(InputIterator, InputIterator, const Pred & = Pred(),
- const allocator_type & = allocator_type());
- template<typename InputIterator>
- flat_map(ordered_unique_range_t, InputIterator, InputIterator,
- const Pred & = Pred(),
- const allocator_type & = allocator_type());
- flat_map(const flat_map< Key, T, Pred, Alloc > &);
- flat_map(flat_map &&);
- flat_map& operator=(const flat_map &);
- flat_map& operator=(flat_map &&);
+ // construct/copy/destruct
+ flat_map(const Pred & = Pred(), const allocator_type & = allocator_type());
+ template<typename InputIterator>
+ flat_map(InputIterator, InputIterator, const Pred & = Pred(),
+ const allocator_type & = allocator_type());
+ template<typename InputIterator>
+ flat_map(ordered_unique_range_t, InputIterator, InputIterator,
+ const Pred & = Pred(),
+ const allocator_type & = allocator_type());
+ flat_map(const flat_map< Key, T, Pred, Alloc > &);
+ flat_map(flat_map &&);
+ flat_map& operator=(const flat_map &);
+ flat_map& operator=(flat_map &&);

- // public member functions
- key_compare key_comp() const;
- value_compare value_comp() const;
- allocator_type get_allocator() const;
- const stored_allocator_type & get_stored_allocator() const;
- stored_allocator_type & get_stored_allocator() ;
- iterator begin() ;
- const_iterator begin() const;
- const_iterator cbegin() const;
- iterator end() ;
- const_iterator end() const;
- const_iterator cend() const;
- reverse_iterator rbegin() ;
- const_reverse_iterator rbegin() const;
- const_reverse_iterator crbegin() const;
- reverse_iterator rend() ;
- const_reverse_iterator rend() const;
- const_reverse_iterator crend() const;
- bool empty() const;
- size_type size() const;
- size_type max_size() const;
- T & operator[](const key_type &) ;
- T & operator[](key_type &&) ;
- T & at(const key_type &) ;
- const T & at(const key_type &) const;
- void swap(flat_map &) ;
- std::pair< iterator, bool > insert(const value_type &) ;
- std::pair< iterator, bool > insert(value_type &&) ;
- std::pair< iterator, bool > insert(impl_value_type &&) ;
- iterator insert(const_iterator, const value_type &) ;
- iterator insert(const_iterator, value_type &&) ;
- iterator insert(const_iterator, impl_value_type &&) ;
- template<typename InputIterator> void insert(InputIterator, InputIterator) ;
- template<class... Args> iterator emplace(Args &&...) ;
- template<class... Args> iterator emplace_hint(const_iterator, Args &&...) ;
- iterator erase(const_iterator) ;
- size_type erase(const key_type &) ;
- iterator erase(const_iterator, const_iterator) ;
- void clear() ;
- void shrink_to_fit() ;
- iterator find(const key_type &) ;
- const_iterator find(const key_type &) const;
- size_type count(const key_type &) const;
- iterator lower_bound(const key_type &) ;
- const_iterator lower_bound(const key_type &) const;
- iterator upper_bound(const key_type &) ;
- const_iterator upper_bound(const key_type &) const;
- std::pair< iterator, iterator > equal_range(const key_type &) ;
- std::pair< const_iterator, const_iterator >
- equal_range(const key_type &) const;
- size_type capacity() const;
- void reserve(size_type) ;
-};</pre></div>
+ // public member functions
+ key_compare key_comp() const;
+ value_compare value_comp() const;
+ allocator_type get_allocator() const;
+ const stored_allocator_type & get_stored_allocator() const;
+ stored_allocator_type & get_stored_allocator();
+ iterator begin();
+ const_iterator begin() const;
+ const_iterator cbegin() const;
+ iterator end();
+ const_iterator end() const;
+ const_iterator cend() const;
+ reverse_iterator rbegin();
+ const_reverse_iterator rbegin() const;
+ const_reverse_iterator crbegin() const;
+ reverse_iterator rend();
+ const_reverse_iterator rend() const;
+ const_reverse_iterator crend() const;
+ bool empty() const;
+ size_type size() const;
+ size_type max_size() const;
+ T & operator[](const key_type &);
+ T & operator[](key_type &&);
+ T & at(const key_type &);
+ const T & at(const key_type &) const;
+ void swap(flat_map &);
+ std::pair< iterator, bool > insert(const value_type &);
+ std::pair< iterator, bool > insert(value_type &&);
+ std::pair< iterator, bool > insert(impl_value_type &&);
+ iterator insert(const_iterator, const value_type &);
+ iterator insert(const_iterator, value_type &&);
+ iterator insert(const_iterator, impl_value_type &&);
+ template<typename InputIterator> void insert(InputIterator, InputIterator);
+ template<class... Args> iterator emplace(Args &&...);
+ template<class... Args> iterator emplace_hint(const_iterator, Args &&...);
+ iterator erase(const_iterator);
+ size_type erase(const key_type &);
+ iterator erase(const_iterator, const_iterator);
+ void clear();
+ void shrink_to_fit();
+ iterator find(const key_type &);
+ const_iterator find(const key_type &) const;
+ size_type count(const key_type &) const;
+ iterator lower_bound(const key_type &);
+ const_iterator lower_bound(const key_type &) const;
+ iterator upper_bound(const key_type &);
+ const_iterator upper_bound(const key_type &) const;
+ std::pair< iterator, iterator > equal_range(const key_type &);
+ std::pair< const_iterator, const_iterator >
+ equal_range(const key_type &) const;
+ size_type capacity() const;
+ void reserve(size_type);
+};</pre></div>
<div class="refsect1" lang="en">
-<a name="id476024"></a><h2>Description</h2>
+<a name="id753002"></a><h2>Description</h2>
A flat_map is a kind of associative container that supports unique keys (contains at most one of each key value) and provides for fast retrieval of values of another type T based on the keys. The flat_map class supports random-access iterators.
A flat_map satisfies all of the requirements of a container and of a reversible container and of an associative container. A flat_map also provides most operations described for unique keys. For a flat_map<Key,T> the key_type is Key and the value_type is std::pair<Key,T> (unlike std::map<Key, T> which value_type is std::pair<const Key, T>).
-Pred is the ordering function for Keys (e.g. std::less<Key>).
-Alloc is the allocator to allocate the value_types (e.g. allocator< std::pair<Key, T> >).
+Pred is the ordering function for Keys (e.g. std::less<Key>).
+Alloc is the allocator to allocate the value_types (e.g. allocator< std::pair<Key, T> >).
flat_map is similar to std::map but it's implemented like an ordered vector. This means that inserting a new element into a flat_map invalidates previous iterators and references
Erasing an element of a flat_map invalidates iterators and references pointing to elements that come after (their keys are bigger) the erased element. 
<div class="refsect2" lang="en">
-<a name="id476047"></a><h3>
+<a name="id753034"></a><h3>
<a name="boost.container.flat_mapconstruct-copy-destruct"></a><code class="computeroutput">flat_map</code>
 public
 construct/copy/destruct</h3>
<div class="orderedlist"><ol type="1">
<li>
-<pre class="literallayout"><a name="id296127-bb"></a>flat_map(const Pred & comp = Pred(),
- const allocator_type & a = allocator_type());</pre>
+<pre class="literallayout"><a name="id376452-bb"></a>flat_map(const Pred & comp = Pred(),
+ const allocator_type & a = allocator_type());</pre>
Effects: Constructs an empty flat_map using the specified comparison object and allocator.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">template<typename InputIterator>
- <a name="id296156-bb"></a>flat_map(InputIterator first, InputIterator last,
- const Pred & comp = Pred(),
- const allocator_type & a = allocator_type());</pre>
+<pre class="literallayout">template<typename InputIterator>
+ <a name="id376480-bb"></a>flat_map(InputIterator first, InputIterator last,
+ const Pred & comp = Pred(),
+ const allocator_type & a = allocator_type());</pre>
Effects: Constructs an empty flat_map using the specified comparison object and allocator, and inserts elements from the range [first ,last ).
Complexity: Linear in N if the range [first ,last ) is already sorted using comp and otherwise N logN, where N is last - first. 
</li>
<li>
-<pre class="literallayout">template<typename InputIterator>
- <a name="id296200-bb"></a>flat_map(ordered_unique_range_t, InputIterator first, InputIterator last,
- const Pred & comp = Pred(),
- const allocator_type & a = allocator_type());</pre>
+<pre class="literallayout">template<typename InputIterator>
+ <a name="id376525-bb"></a>flat_map(ordered_unique_range_t, InputIterator first, InputIterator last,
+ const Pred & comp = Pred(),
+ const allocator_type & a = allocator_type());</pre>
Effects: Constructs an empty flat_map using the specified comparison object and allocator, and inserts elements from the ordered unique range [first ,last). This function is more efficient than the normal range creation for ordered ranges.
Requires: [first ,last) must be ordered according to the predicate and must be unique values.
Complexity: Linear in N. 
</li>
<li>
-<pre class="literallayout"><a name="id296255-bb"></a>flat_map(const flat_map< Key, T, Pred, Alloc > & x);</pre>
+<pre class="literallayout"><a name="id376580-bb"></a>flat_map(const flat_map< Key, T, Pred, Alloc > & x);</pre>
Effects: Copy constructs a flat_map.
Complexity: Linear in x.size(). 
</li>
<li>
-<pre class="literallayout"><a name="id296278-bb"></a>flat_map(flat_map && x);</pre>
+<pre class="literallayout"><a name="id376603-bb"></a>flat_map(flat_map && x);</pre>
Effects: Move constructs a flat_map. Constructs *this using x's resources.
Complexity: Construct.
Postcondition: x is emptied. 
</li>
<li>
-<pre class="literallayout">flat_map& <a name="id296306-bb"></a>operator=(const flat_map & x);</pre>
+<pre class="literallayout">flat_map& <a name="id376630-bb"></a>operator=(const flat_map & x);</pre>
Effects: Makes *this a copy of x.
Complexity: Linear in x.size(). 
</li>
<li>
-<pre class="literallayout">flat_map& <a name="id296328-bb"></a>operator=(flat_map && mx);</pre>
+<pre class="literallayout">flat_map& <a name="id376653-bb"></a>operator=(flat_map && mx);</pre>
Effects: Move constructs a flat_map. Constructs *this using x's resources.
Complexity: Construct.
Postcondition: x is emptied. 
@@ -182,292 +182,292 @@
</ol></div>
</div>
<div class="refsect2" lang="en">
-<a name="id476317"></a><h3>
-<a name="id294765-bb"></a><code class="computeroutput">flat_map</code> public member functions</h3>
+<a name="id753679"></a><h3>
+<a name="id373445-bb"></a><code class="computeroutput">flat_map</code> public member functions</h3>
<div class="orderedlist"><ol type="1">
<li>
-<pre class="literallayout">key_compare <a name="id294767-bb"></a>key_comp() const;</pre>
+<pre class="literallayout">key_compare <a name="id373448-bb"></a>key_comp() const;</pre>
Effects: Returns the comparison object out of which a was constructed.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">value_compare <a name="id294788-bb"></a>value_comp() const;</pre>
+<pre class="literallayout">value_compare <a name="id373468-bb"></a>value_comp() const;</pre>
Effects: Returns an object of value_compare constructed out of the comparison object.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">allocator_type <a name="id294807-bb"></a>get_allocator() const;</pre>
+<pre class="literallayout">allocator_type <a name="id373487-bb"></a>get_allocator() const;</pre>
Effects: Returns a copy of the Allocator that was passed to the object's constructor.
Complexity: Constant. 
</li>
-<li><pre class="literallayout">const stored_allocator_type & <a name="id294826-bb"></a>get_stored_allocator() const;</pre></li>
-<li><pre class="literallayout">stored_allocator_type & <a name="id294832-bb"></a>get_stored_allocator() ;</pre></li>
+<li><pre class="literallayout">const stored_allocator_type & <a name="id373506-bb"></a>get_stored_allocator() const;</pre></li>
+<li><pre class="literallayout">stored_allocator_type & <a name="id373512-bb"></a>get_stored_allocator();</pre></li>
<li>
-<pre class="literallayout">iterator <a name="id294838-bb"></a>begin() ;</pre>
+<pre class="literallayout">iterator <a name="id373518-bb"></a>begin();</pre>
Effects: Returns an iterator to the first element contained in the container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_iterator <a name="id294863-bb"></a>begin() const;</pre>
+<pre class="literallayout">const_iterator <a name="id373544-bb"></a>begin() const;</pre>
Effects: Returns a const_iterator to the first element contained in the container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_iterator <a name="id294888-bb"></a>cbegin() const;</pre>
+<pre class="literallayout">const_iterator <a name="id373569-bb"></a>cbegin() const;</pre>
Effects: Returns a const_iterator to the first element contained in the container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id294914-bb"></a>end() ;</pre>
+<pre class="literallayout">iterator <a name="id373594-bb"></a>end();</pre>
Effects: Returns an iterator to the end of the container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_iterator <a name="id294939-bb"></a>end() const;</pre>
+<pre class="literallayout">const_iterator <a name="id373619-bb"></a>end() const;</pre>
Effects: Returns a const_iterator to the end of the container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_iterator <a name="id294964-bb"></a>cend() const;</pre>
+<pre class="literallayout">const_iterator <a name="id373644-bb"></a>cend() const;</pre>
Effects: Returns a const_iterator to the end of the container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">reverse_iterator <a name="id294989-bb"></a>rbegin() ;</pre>
+<pre class="literallayout">reverse_iterator <a name="id373670-bb"></a>rbegin();</pre>
Effects: Returns a reverse_iterator pointing to the beginning of the reversed container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_reverse_iterator <a name="id295014-bb"></a>rbegin() const;</pre>
+<pre class="literallayout">const_reverse_iterator <a name="id373695-bb"></a>rbegin() const;</pre>
Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_reverse_iterator <a name="id295040-bb"></a>crbegin() const;</pre>
+<pre class="literallayout">const_reverse_iterator <a name="id373720-bb"></a>crbegin() const;</pre>
Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">reverse_iterator <a name="id295065-bb"></a>rend() ;</pre>
+<pre class="literallayout">reverse_iterator <a name="id373745-bb"></a>rend();</pre>
Effects: Returns a reverse_iterator pointing to the end of the reversed container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_reverse_iterator <a name="id295090-bb"></a>rend() const;</pre>
+<pre class="literallayout">const_reverse_iterator <a name="id373770-bb"></a>rend() const;</pre>
Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_reverse_iterator <a name="id295115-bb"></a>crend() const;</pre>
+<pre class="literallayout">const_reverse_iterator <a name="id373796-bb"></a>crend() const;</pre>
Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">bool <a name="id295140-bb"></a>empty() const;</pre>
+<pre class="literallayout">bool <a name="id373821-bb"></a>empty() const;</pre>
Effects: Returns true if the container contains no elements.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">size_type <a name="id295166-bb"></a>size() const;</pre>
+<pre class="literallayout">size_type <a name="id373846-bb"></a>size() const;</pre>
Effects: Returns the number of the elements contained in the container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">size_type <a name="id295191-bb"></a>max_size() const;</pre>
+<pre class="literallayout">size_type <a name="id373871-bb"></a>max_size() const;</pre>
Effects: Returns the largest possible size of the container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">T & <a name="id295216-bb"></a>operator[](const key_type & k) ;</pre>
+<pre class="literallayout">T & <a name="id373896-bb"></a>operator[](const key_type & k);</pre>
Effects: If there is no key equivalent to x in the flat_map, inserts value_type(x, T()) into the flat_map.
Returns: A reference to the mapped_type corresponding to x in *this.
Complexity: Logarithmic. 
</li>
<li>
-<pre class="literallayout">T & <a name="id295235-bb"></a>operator[](key_type && mk) ;</pre>
+<pre class="literallayout">T & <a name="id373916-bb"></a>operator[](key_type && mk);</pre>
Effects: If there is no key equivalent to x in the flat_map, inserts value_type(move(x), T()) into the flat_map (the key is move-constructed)
Returns: A reference to the mapped_type corresponding to x in *this.
Complexity: Logarithmic. 
</li>
<li>
-<pre class="literallayout">T & <a name="id295254-bb"></a>at(const key_type & k) ;</pre>
+<pre class="literallayout">T & <a name="id373935-bb"></a>at(const key_type & k);</pre>
Returns: A reference to the element whose key is equivalent to x. Throws: An exception object of type out_of_range if no such element is present. Complexity: logarithmic. 
</li>
<li>
-<pre class="literallayout">const T & <a name="id295269-bb"></a>at(const key_type & k) const;</pre>
+<pre class="literallayout">const T & <a name="id373949-bb"></a>at(const key_type & k) const;</pre>
Returns: A reference to the element whose key is equivalent to x. Throws: An exception object of type out_of_range if no such element is present. Complexity: logarithmic. 
</li>
<li>
-<pre class="literallayout">void <a name="id295283-bb"></a>swap(flat_map & x) ;</pre>
+<pre class="literallayout">void <a name="id373964-bb"></a>swap(flat_map & x);</pre>
Effects: Swaps the contents of *this and x. If this->allocator_type() != x.allocator_type() allocators are also swapped.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">std::pair< iterator, bool > <a name="id295316-bb"></a>insert(const value_type & x) ;</pre>
+<pre class="literallayout">std::pair< iterator, bool > <a name="id373996-bb"></a>insert(const value_type & x);</pre>
Effects: Inserts x if and only if there is no element in the container with key equivalent to the key of x.
Returns: The bool component of the returned pair is true if and only if the insertion takes place, and the iterator component of the pair points to the element with key equivalent to the key of x.
Complexity: Logarithmic search time plus linear insertion to the elements with bigger keys than x.
Note: If an element it's inserted it might invalidate elements. 
</li>
<li>
-<pre class="literallayout">std::pair< iterator, bool > <a name="id295353-bb"></a>insert(value_type && x) ;</pre>
+<pre class="literallayout">std::pair< iterator, bool > <a name="id374033-bb"></a>insert(value_type && x);</pre>
Effects: Inserts a new value_type move constructed from the pair if and only if there is no element in the container with key equivalent to the key of x.
Returns: The bool component of the returned pair is true if and only if the insertion takes place, and the iterator component of the pair points to the element with key equivalent to the key of x.
Complexity: Logarithmic search time plus linear insertion to the elements with bigger keys than x.
Note: If an element it's inserted it might invalidate elements. 
</li>
<li>
-<pre class="literallayout">std::pair< iterator, bool > <a name="id295390-bb"></a>insert(impl_value_type && x) ;</pre>
+<pre class="literallayout">std::pair< iterator, bool > <a name="id374070-bb"></a>insert(impl_value_type && x);</pre>
Effects: Inserts a new value_type move constructed from the pair if and only if there is no element in the container with key equivalent to the key of x.
Returns: The bool component of the returned pair is true if and only if the insertion takes place, and the iterator component of the pair points to the element with key equivalent to the key of x.
Complexity: Logarithmic search time plus linear insertion to the elements with bigger keys than x.
Note: If an element it's inserted it might invalidate elements. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id295427-bb"></a>insert(const_iterator position, const value_type & x) ;</pre>
+<pre class="literallayout">iterator <a name="id374108-bb"></a>insert(const_iterator position, const value_type & x);</pre>
Effects: Inserts a copy of x in the container if and only if there is no element in the container with key equivalent to the key of x. p is a hint pointing to where the insert should start to search.
Returns: An iterator pointing to the element with key equivalent to the key of x.
Complexity: Logarithmic search time (constant if x is inserted right before p) plus insertion linear to the elements with bigger keys than x.
Note: If an element it's inserted it might invalidate elements. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id295469-bb"></a>insert(const_iterator position, value_type && x) ;</pre>
+<pre class="literallayout">iterator <a name="id374150-bb"></a>insert(const_iterator position, value_type && x);</pre>
Effects: Inserts an element move constructed from x in the container. p is a hint pointing to where the insert should start to search.
Returns: An iterator pointing to the element with key equivalent to the key of x.
Complexity: Logarithmic search time (constant if x is inserted right before p) plus insertion linear to the elements with bigger keys than x.
Note: If an element it's inserted it might invalidate elements. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id295511-bb"></a>insert(const_iterator position, impl_value_type && x) ;</pre>
+<pre class="literallayout">iterator <a name="id375836-bb"></a>insert(const_iterator position, impl_value_type && x);</pre>
Effects: Inserts an element move constructed from x in the container. p is a hint pointing to where the insert should start to search.
Returns: An iterator pointing to the element with key equivalent to the key of x.
Complexity: Logarithmic search time (constant if x is inserted right before p) plus insertion linear to the elements with bigger keys than x.
Note: If an element it's inserted it might invalidate elements. 
</li>
<li>
-<pre class="literallayout">template<typename InputIterator>
- void <a name="id295553-bb"></a>insert(InputIterator first, InputIterator last) ;</pre>
+<pre class="literallayout">template<typename InputIterator>
+ void <a name="id375878-bb"></a>insert(InputIterator first, InputIterator last);</pre>
Requires: i, j are not iterators into *this.
Effects: inserts each element from the range [i,j) if and only if there is no element with key equivalent to the key of that element.
Complexity: N log(size()+N) (N is the distance from i to j) search time plus N*size() insertion time.
Note: If an element it's inserted it might invalidate elements. 
</li>
<li>
-<pre class="literallayout">template<class... Args> iterator <a name="id295601-bb"></a>emplace(Args &&... args) ;</pre>
+<pre class="literallayout">template<class... Args> iterator <a name="id375926-bb"></a>emplace(Args &&... args);</pre>
Effects: Inserts an object of type T constructed with std::forward<Args>(args)... if and only if there is no element in the container with key equivalent to the key of x.
Returns: The bool component of the returned pair is true if and only if the insertion takes place, and the iterator component of the pair points to the element with key equivalent to the key of x.
Complexity: Logarithmic search time plus linear insertion to the elements with bigger keys than x.
Note: If an element it's inserted it might invalidate elements. 
</li>
<li>
-<pre class="literallayout">template<class... Args>
- iterator <a name="id295647-bb"></a>emplace_hint(const_iterator hint, Args &&... args) ;</pre>
+<pre class="literallayout">template<class... Args>
+ iterator <a name="id375972-bb"></a>emplace_hint(const_iterator hint, Args &&... args);</pre>
Effects: Inserts an object of type T constructed with std::forward<Args>(args)... in the container if and only if there is no element in the container with key equivalent to the key of x. p is a hint pointing to where the insert should start to search.
Returns: An iterator pointing to the element with key equivalent to the key of x.
Complexity: Logarithmic search time (constant if x is inserted right before p) plus insertion linear to the elements with bigger keys than x.
Note: If an element it's inserted it might invalidate elements. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id295697-bb"></a>erase(const_iterator position) ;</pre>
+<pre class="literallayout">iterator <a name="id376022-bb"></a>erase(const_iterator position);</pre>
Effects: Erases the element pointed to by position.
Returns: Returns an iterator pointing to the element immediately following q prior to the element being erased. If no such element exists, returns end().
Complexity: Linear to the elements with keys bigger than position
Note: Invalidates elements with keys not less than the erased element. 
</li>
<li>
-<pre class="literallayout">size_type <a name="id295733-bb"></a>erase(const key_type & x) ;</pre>
+<pre class="literallayout">size_type <a name="id376058-bb"></a>erase(const key_type & x);</pre>
Effects: Erases all elements in the container with key equivalent to x.
Returns: Returns the number of erased elements.
Complexity: Logarithmic search time plus erasure time linear to the elements with bigger keys. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id295763-bb"></a>erase(const_iterator first, const_iterator last) ;</pre>
+<pre class="literallayout">iterator <a name="id376088-bb"></a>erase(const_iterator first, const_iterator last);</pre>
Effects: Erases all the elements in the range [first, last).
Returns: Returns last.
Complexity: size()*N where N is the distance from first to last.
Complexity: Logarithmic search time plus erasure time linear to the elements with bigger keys. 
</li>
<li>
-<pre class="literallayout">void <a name="id295804-bb"></a>clear() ;</pre>
+<pre class="literallayout">void <a name="id376129-bb"></a>clear();</pre>
Effects: erase(a.begin(),a.end()).
Postcondition: size() == 0.
Complexity: linear in size(). 
</li>
<li>
-<pre class="literallayout">void <a name="id295829-bb"></a>shrink_to_fit() ;</pre>
+<pre class="literallayout">void <a name="id376154-bb"></a>shrink_to_fit();</pre>
Effects: Tries to deallocate the excess of memory created Throws: If memory allocation throws, or T's copy constructor throws.
Complexity: Linear to size(). 
</li>
<li>
-<pre class="literallayout">iterator <a name="id295856-bb"></a>find(const key_type & x) ;</pre>
+<pre class="literallayout">iterator <a name="id376180-bb"></a>find(const key_type & x);</pre>
Returns: An iterator pointing to an element with the key equivalent to x, or end() if such an element is not found.
Complexity: Logarithmic. 
</li>
<li>
-<pre class="literallayout">const_iterator <a name="id295880-bb"></a>find(const key_type & x) const;</pre>
+<pre class="literallayout">const_iterator <a name="id376204-bb"></a>find(const key_type & x) const;</pre>
Returns: A const_iterator pointing to an element with the key equivalent to x, or end() if such an element is not found.
Complexity: Logarithmic.s 
</li>
<li>
-<pre class="literallayout">size_type <a name="id295904-bb"></a>count(const key_type & x) const;</pre>
+<pre class="literallayout">size_type <a name="id376228-bb"></a>count(const key_type & x) const;</pre>
Returns: The number of elements with key equivalent to x.
Complexity: log(size())+count(k) 
</li>
<li>
-<pre class="literallayout">iterator <a name="id295928-bb"></a>lower_bound(const key_type & x) ;</pre>
+<pre class="literallayout">iterator <a name="id376252-bb"></a>lower_bound(const key_type & x);</pre>
Returns: An iterator pointing to the first element with key not less than k, or a.end() if such an element is not found.
Complexity: Logarithmic 
</li>
<li>
-<pre class="literallayout">const_iterator <a name="id295952-bb"></a>lower_bound(const key_type & x) const;</pre>
+<pre class="literallayout">const_iterator <a name="id376276-bb"></a>lower_bound(const key_type & x) const;</pre>
Returns: A const iterator pointing to the first element with key not less than k, or a.end() if such an element is not found.
Complexity: Logarithmic 
</li>
<li>
-<pre class="literallayout">iterator <a name="id295976-bb"></a>upper_bound(const key_type & x) ;</pre>
+<pre class="literallayout">iterator <a name="id376300-bb"></a>upper_bound(const key_type & x);</pre>
Returns: An iterator pointing to the first element with key not less than x, or end() if such an element is not found.
Complexity: Logarithmic 
</li>
<li>
-<pre class="literallayout">const_iterator <a name="id296000-bb"></a>upper_bound(const key_type & x) const;</pre>
+<pre class="literallayout">const_iterator <a name="id376324-bb"></a>upper_bound(const key_type & x) const;</pre>
Returns: A const iterator pointing to the first element with key not less than x, or end() if such an element is not found.
Complexity: Logarithmic 
</li>
<li>
-<pre class="literallayout">std::pair< iterator, iterator > <a name="id296024-bb"></a>equal_range(const key_type & x) ;</pre>
+<pre class="literallayout">std::pair< iterator, iterator > <a name="id376348-bb"></a>equal_range(const key_type & x);</pre>
Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).
Complexity: Logarithmic 
</li>
<li>
-<pre class="literallayout">std::pair< const_iterator, const_iterator >
-<a name="id296048-bb"></a>equal_range(const key_type & x) const;</pre>
+<pre class="literallayout">std::pair< const_iterator, const_iterator >
+<a name="id376372-bb"></a>equal_range(const key_type & x) const;</pre>
Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).
Complexity: Logarithmic 
</li>
<li>
-<pre class="literallayout">size_type <a name="id296072-bb"></a>capacity() const;</pre>
+<pre class="literallayout">size_type <a name="id376396-bb"></a>capacity() const;</pre>
Effects: Number of elements for which memory has been allocated. capacity() is always greater than or equal to size().
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">void <a name="id296097-bb"></a>reserve(size_type count) ;</pre>
+<pre class="literallayout">void <a name="id376422-bb"></a>reserve(size_type count);</pre>
Effects: If n is less than or equal to capacity(), this call has no effect. Otherwise, it is a request for allocation of additional memory. If the request is successful, then capacity() is greater than or equal to n; otherwise, capacity() is unchanged. In either case, size() is unchanged.
Throws: If memory allocation allocation throws or T's copy constructor throws.
Note: If capacity() is less than "count", iterators and references to to values might be invalidated. 
@@ -478,7 +478,7 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2009 -2010 Ion Gaztanaga
+<td align="right"><div class="copyright-footer">Copyright © 2009 -2011 Ion Gaztanaga
 Distributed under the Boost Software License, Version 1.0. (See accompanying
 file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
@@ -486,7 +486,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="deque.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.flat_map_hpp"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="flat_multimap.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="deque.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.flat_map_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="flat_multimap.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>

Modified: sandbox/move/libs/container/doc/html/boost/container/flat_multimap.html
==============================================================================
--- sandbox/move/libs/container/doc/html/boost/container/flat_multimap.html (original)
+++ sandbox/move/libs/container/doc/html/boost/container/flat_multimap.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
@@ -1,10 +1,10 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Class template flat_multimap</title>
-<link rel="stylesheet" href="../../boostbook.css" type="text/css">
+<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
-<link rel="start" href="../../index.html" title="Chapter 1. Boost.Container">
+<link rel="start" href="../../index.html" title="Chapter 1. Boost.Container">
<link rel="up" href="../../boost_container_reference.html#header.boost.container.flat_map_hpp" title="Header <boost/container/flat_map.hpp>">
<link rel="prev" href="flat_map.html" title="Class template flat_map">
<link rel="next" href="flat_set.html" title="Class template flat_set">
@@ -20,7 +20,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="flat_map.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.flat_map_hpp"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="flat_set.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="flat_map.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.flat_map_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="flat_set.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="refentry" lang="en">
<a name="boost.container.flat_multimap"></a><div class="titlepage"></div>
@@ -29,387 +29,387 @@
boost::container::flat_multimap — 
</div>
<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2>
-<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/container/flat_map.hpp>
+<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/container/flat_map.hpp>

-template<typename Key, typename T, typename Pred, typename Alloc>
-class flat_multimap {
-public:
- // types
- typedef impl_tree_t::key_type <a name="boost.container.flat_multimap.key_type"></a>key_type;
- typedef T <a name="boost.container.flat_multimap.mapped_type"></a>mapped_type;
- typedef std::pair< key_type, mapped_type > <a name="boost.container.flat_multimap.value_type"></a>value_type;
- typedef Alloc::pointer <a name="boost.container.flat_multimap.pointer"></a>pointer;
- typedef Alloc::const_pointer <a name="boost.container.flat_multimap.const_pointer"></a>const_pointer;
- typedef Alloc::reference <a name="boost.container.flat_multimap.reference"></a>reference;
- typedef Alloc::const_reference <a name="boost.container.flat_multimap.const_reference"></a>const_reference;
- typedef unspecified <a name="boost.container.flat_multimap.value_compare"></a>value_compare;
- typedef Pred <a name="boost.container.flat_multimap.key_compare"></a>key_compare;
- typedef unspecified <a name="boost.container.flat_multimap.iterator"></a>iterator;
- typedef unspecified <a name="boost.container.flat_multimap.const_iterator"></a>const_iterator;
- typedef unspecified <a name="boost.container.flat_multimap.reverse_iterator"></a>reverse_iterator;
- typedef unspecified <a name="boost.container.flat_multimap.const_reverse_iterator"></a>const_reverse_iterator;
- typedef impl_tree_t::size_type <a name="boost.container.flat_multimap.size_type"></a>size_type;
- typedef impl_tree_t::difference_type <a name="boost.container.flat_multimap.difference_type"></a>difference_type;
- typedef Alloc <a name="boost.container.flat_multimap.allocator_type"></a>allocator_type;
- typedef Alloc <a name="boost.container.flat_multimap.stored_allocator_type"></a>stored_allocator_type;
+template<typename Key, typename T, typename Pred, typename Alloc>
+class flat_multimap {
+public:
+ // types
+ typedef impl_tree_t::key_type <a name="boost.container.flat_multimap.key_type"></a>key_type;
+ typedef T <a name="boost.container.flat_multimap.mapped_type"></a>mapped_type;
+ typedef std::pair< key_type, mapped_type > <a name="boost.container.flat_multimap.value_type"></a>value_type;
+ typedef Alloc::pointer <a name="boost.container.flat_multimap.pointer"></a>pointer;
+ typedef Alloc::const_pointer <a name="boost.container.flat_multimap.const_pointer"></a>const_pointer;
+ typedef Alloc::reference <a name="boost.container.flat_multimap.reference"></a>reference;
+ typedef Alloc::const_reference <a name="boost.container.flat_multimap.const_reference"></a>const_reference;
+ typedef unspecified <a name="boost.container.flat_multimap.value_compare"></a>value_compare;
+ typedef Pred <a name="boost.container.flat_multimap.key_compare"></a>key_compare;
+ typedef unspecified <a name="boost.container.flat_multimap.iterator"></a>iterator;
+ typedef unspecified <a name="boost.container.flat_multimap.const_iterator"></a>const_iterator;
+ typedef unspecified <a name="boost.container.flat_multimap.reverse_iterator"></a>reverse_iterator;
+ typedef unspecified <a name="boost.container.flat_multimap.const_reverse_iterator"></a>const_reverse_iterator;
+ typedef impl_tree_t::size_type <a name="boost.container.flat_multimap.size_type"></a>size_type;
+ typedef impl_tree_t::difference_type <a name="boost.container.flat_multimap.difference_type"></a>difference_type;
+ typedef Alloc <a name="boost.container.flat_multimap.allocator_type"></a>allocator_type;
+ typedef Alloc <a name="boost.container.flat_multimap.stored_allocator_type"></a>stored_allocator_type;

- // construct/copy/destruct
- flat_multimap(const Pred & = Pred(),
- const allocator_type & = allocator_type());
- template<typename InputIterator>
- flat_multimap(InputIterator, InputIterator, const Pred & = Pred(),
- const allocator_type & = allocator_type());
- template<typename InputIterator>
- flat_multimap(ordered_range_t, InputIterator, InputIterator,
- const Pred & = Pred(),
- const allocator_type & = allocator_type());
- flat_multimap(const flat_multimap< Key, T, Pred, Alloc > &);
- flat_multimap(flat_multimap &&);
- flat_multimap& operator=(const flat_multimap &);
- flat_multimap& operator=(flat_multimap &&);
+ // construct/copy/destruct
+ flat_multimap(const Pred & = Pred(),
+ const allocator_type & = allocator_type());
+ template<typename InputIterator>
+ flat_multimap(InputIterator, InputIterator, const Pred & = Pred(),
+ const allocator_type & = allocator_type());
+ template<typename InputIterator>
+ flat_multimap(ordered_range_t, InputIterator, InputIterator,
+ const Pred & = Pred(),
+ const allocator_type & = allocator_type());
+ flat_multimap(const flat_multimap< Key, T, Pred, Alloc > &);
+ flat_multimap(flat_multimap &&);
+ flat_multimap& operator=(const flat_multimap &);
+ flat_multimap& operator=(flat_multimap &&);

- // public member functions
- key_compare key_comp() const;
- value_compare value_comp() const;
- allocator_type get_allocator() const;
- const stored_allocator_type & get_stored_allocator() const;
- stored_allocator_type & get_stored_allocator() ;
- iterator begin() ;
- const_iterator begin() const;
- iterator end() ;
- const_iterator end() const;
- reverse_iterator rbegin() ;
- const_reverse_iterator rbegin() const;
- reverse_iterator rend() ;
- const_reverse_iterator rend() const;
- bool empty() const;
- size_type size() const;
- size_type max_size() const;
- void swap(flat_multimap &) ;
- iterator insert(const value_type &) ;
- iterator insert(value_type &&) ;
- iterator insert(impl_value_type &&) ;
- iterator insert(const_iterator, const value_type &) ;
- iterator insert(const_iterator, value_type &&) ;
- iterator insert(const_iterator, impl_value_type &&) ;
- template<typename InputIterator> void insert(InputIterator, InputIterator) ;
- template<class... Args> iterator emplace(Args &&...) ;
- template<class... Args> iterator emplace_hint(const_iterator, Args &&...) ;
- iterator erase(const_iterator) ;
- size_type erase(const key_type &) ;
- iterator erase(const_iterator, const_iterator) ;
- void clear() ;
- void shrink_to_fit() ;
- iterator find(const key_type &) ;
- const_iterator find(const key_type &) const;
- size_type count(const key_type &) const;
- iterator lower_bound(const key_type &) ;
- const_iterator lower_bound(const key_type &) const;
- iterator upper_bound(const key_type &) ;
- const_iterator upper_bound(const key_type &) const;
- std::pair< iterator, iterator > equal_range(const key_type &) ;
- std::pair< const_iterator, const_iterator >
- equal_range(const key_type &) const;
- size_type capacity() const;
- void reserve(size_type) ;
-};</pre></div>
+ // public member functions
+ key_compare key_comp() const;
+ value_compare value_comp() const;
+ allocator_type get_allocator() const;
+ const stored_allocator_type & get_stored_allocator() const;
+ stored_allocator_type & get_stored_allocator();
+ iterator begin();
+ const_iterator begin() const;
+ iterator end();
+ const_iterator end() const;
+ reverse_iterator rbegin();
+ const_reverse_iterator rbegin() const;
+ reverse_iterator rend();
+ const_reverse_iterator rend() const;
+ bool empty() const;
+ size_type size() const;
+ size_type max_size() const;
+ void swap(flat_multimap &);
+ iterator insert(const value_type &);
+ iterator insert(value_type &&);
+ iterator insert(impl_value_type &&);
+ iterator insert(const_iterator, const value_type &);
+ iterator insert(const_iterator, value_type &&);
+ iterator insert(const_iterator, impl_value_type &&);
+ template<typename InputIterator> void insert(InputIterator, InputIterator);
+ template<class... Args> iterator emplace(Args &&...);
+ template<class... Args> iterator emplace_hint(const_iterator, Args &&...);
+ iterator erase(const_iterator);
+ size_type erase(const key_type &);
+ iterator erase(const_iterator, const_iterator);
+ void clear();
+ void shrink_to_fit();
+ iterator find(const key_type &);
+ const_iterator find(const key_type &) const;
+ size_type count(const key_type &) const;
+ iterator lower_bound(const key_type &);
+ const_iterator lower_bound(const key_type &) const;
+ iterator upper_bound(const key_type &);
+ const_iterator upper_bound(const key_type &) const;
+ std::pair< iterator, iterator > equal_range(const key_type &);
+ std::pair< const_iterator, const_iterator >
+ equal_range(const key_type &) const;
+ size_type capacity() const;
+ void reserve(size_type);
+};</pre></div>
<div class="refsect1" lang="en">
-<a name="id480922"></a><h2>Description</h2>
+<a name="id760764"></a><h2>Description</h2>
A flat_multimap is a kind of associative container that supports equivalent keys (possibly containing multiple copies of the same key value) and provides for fast retrieval of values of another type T based on the keys. The flat_multimap class supports random-access iterators.
A flat_multimap satisfies all of the requirements of a container and of a reversible container and of an associative container. For a flat_multimap<Key,T> the key_type is Key and the value_type is std::pair<Key,T> (unlike std::multimap<Key, T> which value_type is std::pair<const Key, T>).
-Pred is the ordering function for Keys (e.g. std::less<Key>).
-Alloc is the allocator to allocate the value_types (e.g. allocator< std::pair<Key, T> >). 
+Pred is the ordering function for Keys (e.g. std::less<Key>).
+Alloc is the allocator to allocate the value_types (e.g. allocator< std::pair<Key, T> >). 
<div class="refsect2" lang="en">
-<a name="id480940"></a><h3>
+<a name="id760790"></a><h3>
<a name="boost.container.flat_multimapconstruct-copy-destruct"></a><code class="computeroutput">flat_multimap</code>
 public
 construct/copy/destruct</h3>
<div class="orderedlist"><ol type="1">
<li>
-<pre class="literallayout"><a name="id297787-bb"></a>flat_multimap(const Pred & comp = Pred(),
- const allocator_type & a = allocator_type());</pre>
+<pre class="literallayout"><a name="id377982-bb"></a>flat_multimap(const Pred & comp = Pred(),
+ const allocator_type & a = allocator_type());</pre>
Effects: Constructs an empty flat_multimap using the specified comparison object and allocator.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">template<typename InputIterator>
- <a name="id297816-bb"></a>flat_multimap(InputIterator first, InputIterator last,
- const Pred & comp = Pred(),
- const allocator_type & a = allocator_type());</pre>
+<pre class="literallayout">template<typename InputIterator>
+ <a name="id379400-bb"></a>flat_multimap(InputIterator first, InputIterator last,
+ const Pred & comp = Pred(),
+ const allocator_type & a = allocator_type());</pre>
Effects: Constructs an empty flat_multimap using the specified comparison object and allocator, and inserts elements from the range [first ,last ).
Complexity: Linear in N if the range [first ,last ) is already sorted using comp and otherwise N logN, where N is last - first. 
</li>
<li>
-<pre class="literallayout">template<typename InputIterator>
- <a name="id297860-bb"></a>flat_multimap(ordered_range_t, InputIterator first, InputIterator last,
- const Pred & comp = Pred(),
- const allocator_type & a = allocator_type());</pre>
+<pre class="literallayout">template<typename InputIterator>
+ <a name="id379444-bb"></a>flat_multimap(ordered_range_t, InputIterator first, InputIterator last,
+ const Pred & comp = Pred(),
+ const allocator_type & a = allocator_type());</pre>
Effects: Constructs an empty flat_multimap using the specified comparison object and allocator, and inserts elements from the ordered range [first ,last). This function is more efficient than the normal range creation for ordered ranges.
Requires: [first ,last) must be ordered according to the predicate.
Complexity: Linear in N. 
</li>
<li>
-<pre class="literallayout"><a name="id297916-bb"></a>flat_multimap(const flat_multimap< Key, T, Pred, Alloc > & x);</pre>
+<pre class="literallayout"><a name="id379501-bb"></a>flat_multimap(const flat_multimap< Key, T, Pred, Alloc > & x);</pre>
Effects: Copy constructs a flat_multimap.
Complexity: Linear in x.size(). 
</li>
<li>
-<pre class="literallayout"><a name="id297939-bb"></a>flat_multimap(flat_multimap && x);</pre>
+<pre class="literallayout"><a name="id379524-bb"></a>flat_multimap(flat_multimap && x);</pre>
Effects: Move constructs a flat_multimap. Constructs *this using x's resources.
Complexity: Construct.
Postcondition: x is emptied. 
</li>
<li>
-<pre class="literallayout">flat_multimap& <a name="id297967-bb"></a>operator=(const flat_multimap & x);</pre>
+<pre class="literallayout">flat_multimap& <a name="id379551-bb"></a>operator=(const flat_multimap & x);</pre>
Effects: Makes *this a copy of x.
Complexity: Linear in x.size(). 
</li>
<li>
-<pre class="literallayout">flat_multimap& <a name="id297990-bb"></a>operator=(flat_multimap && mx);</pre>
+<pre class="literallayout">flat_multimap& <a name="id379574-bb"></a>operator=(flat_multimap && mx);</pre>
Effects: this->swap(x.get()).
Complexity: Constant. 
</li>
</ol></div>
</div>
<div class="refsect2" lang="en">
-<a name="id481206"></a><h3>
-<a name="id296480-bb"></a><code class="computeroutput">flat_multimap</code> public member functions</h3>
+<a name="id761432"></a><h3>
+<a name="id376812-bb"></a><code class="computeroutput">flat_multimap</code> public member functions</h3>
<div class="orderedlist"><ol type="1">
<li>
-<pre class="literallayout">key_compare <a name="id296482-bb"></a>key_comp() const;</pre>
+<pre class="literallayout">key_compare <a name="id376814-bb"></a>key_comp() const;</pre>
Effects: Returns the comparison object out of which a was constructed.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">value_compare <a name="id296502-bb"></a>value_comp() const;</pre>
+<pre class="literallayout">value_compare <a name="id376834-bb"></a>value_comp() const;</pre>
Effects: Returns an object of value_compare constructed out of the comparison object.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">allocator_type <a name="id296522-bb"></a>get_allocator() const;</pre>
+<pre class="literallayout">allocator_type <a name="id376854-bb"></a>get_allocator() const;</pre>
Effects: Returns a copy of the Allocator that was passed to the object's constructor.
Complexity: Constant. 
</li>
-<li><pre class="literallayout">const stored_allocator_type & <a name="id296541-bb"></a>get_stored_allocator() const;</pre></li>
-<li><pre class="literallayout">stored_allocator_type & <a name="id296547-bb"></a>get_stored_allocator() ;</pre></li>
+<li><pre class="literallayout">const stored_allocator_type & <a name="id376873-bb"></a>get_stored_allocator() const;</pre></li>
+<li><pre class="literallayout">stored_allocator_type & <a name="id376879-bb"></a>get_stored_allocator();</pre></li>
<li>
-<pre class="literallayout">iterator <a name="id296553-bb"></a>begin() ;</pre>
+<pre class="literallayout">iterator <a name="id376885-bb"></a>begin();</pre>
Effects: Returns an iterator to the first element contained in the container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_iterator <a name="id296578-bb"></a>begin() const;</pre>
+<pre class="literallayout">const_iterator <a name="id376910-bb"></a>begin() const;</pre>
Effects: Returns a const_iterator to the first element contained in the container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id296603-bb"></a>end() ;</pre>
+<pre class="literallayout">iterator <a name="id376935-bb"></a>end();</pre>
Effects: Returns an iterator to the end of the container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_iterator <a name="id296628-bb"></a>end() const;</pre>
+<pre class="literallayout">const_iterator <a name="id376960-bb"></a>end() const;</pre>
Effects: Returns a const_iterator to the end of the container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">reverse_iterator <a name="id296654-bb"></a>rbegin() ;</pre>
+<pre class="literallayout">reverse_iterator <a name="id376986-bb"></a>rbegin();</pre>
Effects: Returns a reverse_iterator pointing to the beginning of the reversed container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_reverse_iterator <a name="id296679-bb"></a>rbegin() const;</pre>
+<pre class="literallayout">const_reverse_iterator <a name="id377011-bb"></a>rbegin() const;</pre>
Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">reverse_iterator <a name="id296704-bb"></a>rend() ;</pre>
+<pre class="literallayout">reverse_iterator <a name="id377036-bb"></a>rend();</pre>
Effects: Returns a reverse_iterator pointing to the end of the reversed container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_reverse_iterator <a name="id296729-bb"></a>rend() const;</pre>
+<pre class="literallayout">const_reverse_iterator <a name="id377061-bb"></a>rend() const;</pre>
Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">bool <a name="id296754-bb"></a>empty() const;</pre>
+<pre class="literallayout">bool <a name="id377086-bb"></a>empty() const;</pre>
Effects: Returns true if the container contains no elements.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">size_type <a name="id296780-bb"></a>size() const;</pre>
+<pre class="literallayout">size_type <a name="id377112-bb"></a>size() const;</pre>
Effects: Returns the number of the elements contained in the container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">size_type <a name="id296805-bb"></a>max_size() const;</pre>
+<pre class="literallayout">size_type <a name="id377137-bb"></a>max_size() const;</pre>
Effects: Returns the largest possible size of the container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">void <a name="id296830-bb"></a>swap(flat_multimap & x) ;</pre>
+<pre class="literallayout">void <a name="id377162-bb"></a>swap(flat_multimap & x);</pre>
Effects: Swaps the contents of *this and x. If this->allocator_type() != x.allocator_type() allocators are also swapped.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id296862-bb"></a>insert(const value_type & x) ;</pre>
+<pre class="literallayout">iterator <a name="id377194-bb"></a>insert(const value_type & x);</pre>
Effects: Inserts x and returns the iterator pointing to the newly inserted element.
Complexity: Logarithmic search time plus linear insertion to the elements with bigger keys than x.
Note: If an element it's inserted it might invalidate elements. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id296894-bb"></a>insert(value_type && x) ;</pre>
+<pre class="literallayout">iterator <a name="id377226-bb"></a>insert(value_type && x);</pre>
Effects: Inserts a new value move-constructed from x and returns the iterator pointing to the newly inserted element.
Complexity: Logarithmic search time plus linear insertion to the elements with bigger keys than x.
Note: If an element it's inserted it might invalidate elements. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id297062-bb"></a>insert(impl_value_type && x) ;</pre>
+<pre class="literallayout">iterator <a name="id377257-bb"></a>insert(impl_value_type && x);</pre>
Effects: Inserts a new value move-constructed from x and returns the iterator pointing to the newly inserted element.
Complexity: Logarithmic search time plus linear insertion to the elements with bigger keys than x.
Note: If an element it's inserted it might invalidate elements. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id297093-bb"></a>insert(const_iterator position, const value_type & x) ;</pre>
+<pre class="literallayout">iterator <a name="id377288-bb"></a>insert(const_iterator position, const value_type & x);</pre>
Effects: Inserts a copy of x in the container. p is a hint pointing to where the insert should start to search.
Returns: An iterator pointing to the element with key equivalent to the key of x.
Complexity: Logarithmic search time (constant time if the value is to be inserted before p) plus linear insertion to the elements with bigger keys than x.
Note: If an element it's inserted it might invalidate elements. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id297135-bb"></a>insert(const_iterator position, value_type && x) ;</pre>
+<pre class="literallayout">iterator <a name="id377330-bb"></a>insert(const_iterator position, value_type && x);</pre>
Effects: Inserts a value move constructed from x in the container. p is a hint pointing to where the insert should start to search.
Returns: An iterator pointing to the element with key equivalent to the key of x.
Complexity: Logarithmic search time (constant time if the value is to be inserted before p) plus linear insertion to the elements with bigger keys than x.
Note: If an element it's inserted it might invalidate elements. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id297177-bb"></a>insert(const_iterator position, impl_value_type && x) ;</pre>
+<pre class="literallayout">iterator <a name="id377372-bb"></a>insert(const_iterator position, impl_value_type && x);</pre>
Effects: Inserts a value move constructed from x in the container. p is a hint pointing to where the insert should start to search.
Returns: An iterator pointing to the element with key equivalent to the key of x.
Complexity: Logarithmic search time (constant time if the value is to be inserted before p) plus linear insertion to the elements with bigger keys than x.
Note: If an element it's inserted it might invalidate elements. 
</li>
<li>
-<pre class="literallayout">template<typename InputIterator>
- void <a name="id297219-bb"></a>insert(InputIterator first, InputIterator last) ;</pre>
+<pre class="literallayout">template<typename InputIterator>
+ void <a name="id377414-bb"></a>insert(InputIterator first, InputIterator last);</pre>
Requires: i, j are not iterators into *this.
Effects: inserts each element from the range [i,j) .
Complexity: N log(size()+N) (N is the distance from i to j) search time plus N*size() insertion time.
Note: If an element it's inserted it might invalidate elements. 
</li>
<li>
-<pre class="literallayout">template<class... Args> iterator <a name="id297267-bb"></a>emplace(Args &&... args) ;</pre>
+<pre class="literallayout">template<class... Args> iterator <a name="id377462-bb"></a>emplace(Args &&... args);</pre>
Effects: Inserts an object of type T constructed with std::forward<Args>(args)... and returns the iterator pointing to the newly inserted element.
Complexity: Logarithmic search time plus linear insertion to the elements with bigger keys than x.
Note: If an element it's inserted it might invalidate elements. 
</li>
<li>
-<pre class="literallayout">template<class... Args>
- iterator <a name="id297307-bb"></a>emplace_hint(const_iterator hint, Args &&... args) ;</pre>
+<pre class="literallayout">template<class... Args>
+ iterator <a name="id377502-bb"></a>emplace_hint(const_iterator hint, Args &&... args);</pre>
Effects: Inserts an object of type T constructed with std::forward<Args>(args)... in the container. p is a hint pointing to where the insert should start to search.
Returns: An iterator pointing to the element with key equivalent to the key of x.
Complexity: Logarithmic search time (constant time if the value is to be inserted before p) plus linear insertion to the elements with bigger keys than x.
Note: If an element it's inserted it might invalidate elements. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id297357-bb"></a>erase(const_iterator position) ;</pre>
+<pre class="literallayout">iterator <a name="id377552-bb"></a>erase(const_iterator position);</pre>
Effects: Erases the element pointed to by position.
Returns: Returns an iterator pointing to the element immediately following q prior to the element being erased. If no such element exists, returns end().
Complexity: Linear to the elements with keys bigger than position
Note: Invalidates elements with keys not less than the erased element. 
</li>
<li>
-<pre class="literallayout">size_type <a name="id297393-bb"></a>erase(const key_type & x) ;</pre>
+<pre class="literallayout">size_type <a name="id377588-bb"></a>erase(const key_type & x);</pre>
Effects: Erases all elements in the container with key equivalent to x.
Returns: Returns the number of erased elements.
Complexity: Logarithmic search time plus erasure time linear to the elements with bigger keys. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id297423-bb"></a>erase(const_iterator first, const_iterator last) ;</pre>
+<pre class="literallayout">iterator <a name="id377618-bb"></a>erase(const_iterator first, const_iterator last);</pre>
Effects: Erases all the elements in the range [first, last).
Returns: Returns last.
Complexity: size()*N where N is the distance from first to last.
Complexity: Logarithmic search time plus erasure time linear to the elements with bigger keys. 
</li>
<li>
-<pre class="literallayout">void <a name="id297464-bb"></a>clear() ;</pre>
+<pre class="literallayout">void <a name="id377659-bb"></a>clear();</pre>
Effects: erase(a.begin(),a.end()).
Postcondition: size() == 0.
Complexity: linear in size(). 
</li>
<li>
-<pre class="literallayout">void <a name="id297489-bb"></a>shrink_to_fit() ;</pre>
+<pre class="literallayout">void <a name="id377684-bb"></a>shrink_to_fit();</pre>
Effects: Tries to deallocate the excess of memory created Throws: If memory allocation throws, or T's copy constructor throws.
Complexity: Linear to size(). 
</li>
<li>
-<pre class="literallayout">iterator <a name="id297516-bb"></a>find(const key_type & x) ;</pre>
+<pre class="literallayout">iterator <a name="id377710-bb"></a>find(const key_type & x);</pre>
Returns: An iterator pointing to an element with the key equivalent to x, or end() if such an element is not found.
Complexity: Logarithmic. 
</li>
<li>
-<pre class="literallayout">const_iterator <a name="id297540-bb"></a>find(const key_type & x) const;</pre>
+<pre class="literallayout">const_iterator <a name="id377734-bb"></a>find(const key_type & x) const;</pre>
Returns: An const_iterator pointing to an element with the key equivalent to x, or end() if such an element is not found.
Complexity: Logarithmic. 
</li>
<li>
-<pre class="literallayout">size_type <a name="id297564-bb"></a>count(const key_type & x) const;</pre>
+<pre class="literallayout">size_type <a name="id377758-bb"></a>count(const key_type & x) const;</pre>
Returns: The number of elements with key equivalent to x.
Complexity: log(size())+count(k) 
</li>
<li>
-<pre class="literallayout">iterator <a name="id297588-bb"></a>lower_bound(const key_type & x) ;</pre>
+<pre class="literallayout">iterator <a name="id377782-bb"></a>lower_bound(const key_type & x);</pre>
Returns: An iterator pointing to the first element with key not less than k, or a.end() if such an element is not found.
Complexity: Logarithmic 
</li>
<li>
-<pre class="literallayout">const_iterator <a name="id297612-bb"></a>lower_bound(const key_type & x) const;</pre>
+<pre class="literallayout">const_iterator <a name="id377806-bb"></a>lower_bound(const key_type & x) const;</pre>
Returns: A const iterator pointing to the first element with key not less than k, or a.end() if such an element is not found.
Complexity: Logarithmic 
</li>
<li>
-<pre class="literallayout">iterator <a name="id297636-bb"></a>upper_bound(const key_type & x) ;</pre>
+<pre class="literallayout">iterator <a name="id377830-bb"></a>upper_bound(const key_type & x);</pre>
Returns: An iterator pointing to the first element with key not less than x, or end() if such an element is not found.
Complexity: Logarithmic 
</li>
<li>
-<pre class="literallayout">const_iterator <a name="id297660-bb"></a>upper_bound(const key_type & x) const;</pre>
+<pre class="literallayout">const_iterator <a name="id377854-bb"></a>upper_bound(const key_type & x) const;</pre>
Returns: A const iterator pointing to the first element with key not less than x, or end() if such an element is not found.
Complexity: Logarithmic 
</li>
<li>
-<pre class="literallayout">std::pair< iterator, iterator > <a name="id297684-bb"></a>equal_range(const key_type & x) ;</pre>
+<pre class="literallayout">std::pair< iterator, iterator > <a name="id377878-bb"></a>equal_range(const key_type & x);</pre>
Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).
Complexity: Logarithmic 
</li>
<li>
-<pre class="literallayout">std::pair< const_iterator, const_iterator >
-<a name="id297708-bb"></a>equal_range(const key_type & x) const;</pre>
+<pre class="literallayout">std::pair< const_iterator, const_iterator >
+<a name="id377902-bb"></a>equal_range(const key_type & x) const;</pre>
Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).
Complexity: Logarithmic 
</li>
<li>
-<pre class="literallayout">size_type <a name="id297732-bb"></a>capacity() const;</pre>
+<pre class="literallayout">size_type <a name="id377926-bb"></a>capacity() const;</pre>
Effects: Number of elements for which memory has been allocated. capacity() is always greater than or equal to size().
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">void <a name="id297757-bb"></a>reserve(size_type count) ;</pre>
+<pre class="literallayout">void <a name="id377952-bb"></a>reserve(size_type count);</pre>
Effects: If n is less than or equal to capacity(), this call has no effect. Otherwise, it is a request for allocation of additional memory. If the request is successful, then capacity() is greater than or equal to n; otherwise, capacity() is unchanged. In either case, size() is unchanged.
Throws: If memory allocation allocation throws or T's copy constructor throws.
Note: If capacity() is less than "count", iterators and references to to values might be invalidated. 
@@ -420,7 +420,7 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2009 -2010 Ion Gaztanaga
+<td align="right"><div class="copyright-footer">Copyright © 2009 -2011 Ion Gaztanaga
 Distributed under the Boost Software License, Version 1.0. (See accompanying
 file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
@@ -428,7 +428,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="flat_map.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.flat_map_hpp"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="flat_set.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="flat_map.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.flat_map_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="flat_set.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>

Modified: sandbox/move/libs/container/doc/html/boost/container/flat_multiset.html
==============================================================================
--- sandbox/move/libs/container/doc/html/boost/container/flat_multiset.html (original)
+++ sandbox/move/libs/container/doc/html/boost/container/flat_multiset.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
@@ -1,10 +1,10 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Class template flat_multiset</title>
-<link rel="stylesheet" href="../../boostbook.css" type="text/css">
+<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
-<link rel="start" href="../../index.html" title="Chapter 1. Boost.Container">
+<link rel="start" href="../../index.html" title="Chapter 1. Boost.Container">
<link rel="up" href="../../boost_container_reference.html#header.boost.container.flat_set_hpp" title="Header <boost/container/flat_set.hpp>">
<link rel="prev" href="flat_set.html" title="Class template flat_set">
<link rel="next" href="list.html" title="Class template list">
@@ -20,7 +20,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="flat_set.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.flat_set_hpp"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="list.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="flat_set.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.flat_set_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="list.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="refentry" lang="en">
<a name="boost.container.flat_multiset"></a><div class="titlepage"></div>
@@ -29,373 +29,373 @@
boost::container::flat_multiset — 
</div>
<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2>
-<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/container/flat_set.hpp>
+<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/container/flat_set.hpp>

-template<typename T, typename Pred, typename Alloc>
-class flat_multiset {
-public:
- // types
- typedef tree_t::key_type <a name="boost.container.flat_multiset.key_type"></a>key_type;
- typedef tree_t::value_type <a name="boost.container.flat_multiset.value_type"></a>value_type;
- typedef tree_t::pointer <a name="boost.container.flat_multiset.pointer"></a>pointer;
- typedef tree_t::const_pointer <a name="boost.container.flat_multiset.const_pointer"></a>const_pointer;
- typedef tree_t::reference <a name="boost.container.flat_multiset.reference"></a>reference;
- typedef tree_t::const_reference <a name="boost.container.flat_multiset.const_reference"></a>const_reference;
- typedef tree_t::key_compare <a name="boost.container.flat_multiset.key_compare"></a>key_compare;
- typedef tree_t::value_compare <a name="boost.container.flat_multiset.value_compare"></a>value_compare;
- typedef tree_t::iterator <a name="boost.container.flat_multiset.iterator"></a>iterator;
- typedef tree_t::const_iterator <a name="boost.container.flat_multiset.const_iterator"></a>const_iterator;
- typedef tree_t::reverse_iterator <a name="boost.container.flat_multiset.reverse_iterator"></a>reverse_iterator;
- typedef tree_t::const_reverse_iterator <a name="boost.container.flat_multiset.const_reverse_iterator"></a>const_reverse_iterator;
- typedef tree_t::size_type <a name="boost.container.flat_multiset.size_type"></a>size_type;
- typedef tree_t::difference_type <a name="boost.container.flat_multiset.difference_type"></a>difference_type;
- typedef tree_t::allocator_type <a name="boost.container.flat_multiset.allocator_type"></a>allocator_type;
- typedef tree_t::stored_allocator_type <a name="boost.container.flat_multiset.stored_allocator_type"></a>stored_allocator_type;
+template<typename T, typename Pred, typename Alloc>
+class flat_multiset {
+public:
+ // types
+ typedef tree_t::key_type <a name="boost.container.flat_multiset.key_type"></a>key_type;
+ typedef tree_t::value_type <a name="boost.container.flat_multiset.value_type"></a>value_type;
+ typedef tree_t::pointer <a name="boost.container.flat_multiset.pointer"></a>pointer;
+ typedef tree_t::const_pointer <a name="boost.container.flat_multiset.const_pointer"></a>const_pointer;
+ typedef tree_t::reference <a name="boost.container.flat_multiset.reference"></a>reference;
+ typedef tree_t::const_reference <a name="boost.container.flat_multiset.const_reference"></a>const_reference;
+ typedef tree_t::key_compare <a name="boost.container.flat_multiset.key_compare"></a>key_compare;
+ typedef tree_t::value_compare <a name="boost.container.flat_multiset.value_compare"></a>value_compare;
+ typedef tree_t::iterator <a name="boost.container.flat_multiset.iterator"></a>iterator;
+ typedef tree_t::const_iterator <a name="boost.container.flat_multiset.const_iterator"></a>const_iterator;
+ typedef tree_t::reverse_iterator <a name="boost.container.flat_multiset.reverse_iterator"></a>reverse_iterator;
+ typedef tree_t::const_reverse_iterator <a name="boost.container.flat_multiset.const_reverse_iterator"></a>const_reverse_iterator;
+ typedef tree_t::size_type <a name="boost.container.flat_multiset.size_type"></a>size_type;
+ typedef tree_t::difference_type <a name="boost.container.flat_multiset.difference_type"></a>difference_type;
+ typedef tree_t::allocator_type <a name="boost.container.flat_multiset.allocator_type"></a>allocator_type;
+ typedef tree_t::stored_allocator_type <a name="boost.container.flat_multiset.stored_allocator_type"></a>stored_allocator_type;

- // construct/copy/destruct
- flat_multiset(const Pred & = Pred(),
- const allocator_type & = allocator_type());
- template<typename InputIterator>
- flat_multiset(InputIterator, InputIterator, const Pred & = Pred(),
- const allocator_type & = allocator_type());
- template<typename InputIterator>
- flat_multiset(ordered_range_t, InputIterator, InputIterator,
- const Pred & = Pred(),
- const allocator_type & = allocator_type());
- flat_multiset(const flat_multiset< T, Pred, Alloc > &);
- flat_multiset(flat_multiset &&);
- flat_multiset& operator=(const flat_multiset &);
- flat_multiset& operator=(flat_multiset &&);
+ // construct/copy/destruct
+ flat_multiset(const Pred & = Pred(),
+ const allocator_type & = allocator_type());
+ template<typename InputIterator>
+ flat_multiset(InputIterator, InputIterator, const Pred & = Pred(),
+ const allocator_type & = allocator_type());
+ template<typename InputIterator>
+ flat_multiset(ordered_range_t, InputIterator, InputIterator,
+ const Pred & = Pred(),
+ const allocator_type & = allocator_type());
+ flat_multiset(const flat_multiset< T, Pred, Alloc > &);
+ flat_multiset(flat_multiset &&);
+ flat_multiset& operator=(const flat_multiset &);
+ flat_multiset& operator=(flat_multiset &&);

- // public member functions
- key_compare key_comp() const;
- value_compare value_comp() const;
- allocator_type get_allocator() const;
- const stored_allocator_type & get_stored_allocator() const;
- stored_allocator_type & get_stored_allocator() ;
- iterator begin() ;
- const_iterator begin() const;
- const_iterator cbegin() const;
- iterator end() ;
- const_iterator end() const;
- const_iterator cend() const;
- reverse_iterator rbegin() ;
- const_reverse_iterator rbegin() const;
- const_reverse_iterator crbegin() const;
- reverse_iterator rend() ;
- const_reverse_iterator rend() const;
- const_reverse_iterator crend() const;
- bool empty() const;
- size_type size() const;
- size_type max_size() const;
- void swap(flat_multiset &) ;
- iterator insert(const T &) ;
- iterator insert(value_type &&) ;
- iterator insert(const_iterator, const T &) ;
- iterator insert(const_iterator, value_type &&) ;
- template<typename InputIterator> void insert(InputIterator, InputIterator) ;
- template<class... Args> iterator emplace(Args &&...) ;
- template<class... Args> iterator emplace_hint(const_iterator, Args &&...) ;
- iterator erase(const_iterator) ;
- size_type erase(const key_type &) ;
- iterator erase(const_iterator, const_iterator) ;
- void clear() ;
- void shrink_to_fit() ;
- iterator find(const key_type &) ;
- const_iterator find(const key_type &) const;
- size_type count(const key_type &) const;
- iterator lower_bound(const key_type &) ;
- const_iterator lower_bound(const key_type &) const;
- iterator upper_bound(const key_type &) ;
- const_iterator upper_bound(const key_type &) const;
- std::pair< const_iterator, const_iterator >
- equal_range(const key_type &) const;
- std::pair< iterator, iterator > equal_range(const key_type &) ;
- size_type capacity() const;
- void reserve(size_type) ;
-};</pre></div>
+ // public member functions
+ key_compare key_comp() const;
+ value_compare value_comp() const;
+ allocator_type get_allocator() const;
+ const stored_allocator_type & get_stored_allocator() const;
+ stored_allocator_type & get_stored_allocator();
+ iterator begin();
+ const_iterator begin() const;
+ const_iterator cbegin() const;
+ iterator end();
+ const_iterator end() const;
+ const_iterator cend() const;
+ reverse_iterator rbegin();
+ const_reverse_iterator rbegin() const;
+ const_reverse_iterator crbegin() const;
+ reverse_iterator rend();
+ const_reverse_iterator rend() const;
+ const_reverse_iterator crend() const;
+ bool empty() const;
+ size_type size() const;
+ size_type max_size() const;
+ void swap(flat_multiset &);
+ iterator insert(const T &);
+ iterator insert(value_type &&);
+ iterator insert(const_iterator, const T &);
+ iterator insert(const_iterator, value_type &&);
+ template<typename InputIterator> void insert(InputIterator, InputIterator);
+ template<class... Args> iterator emplace(Args &&...);
+ template<class... Args> iterator emplace_hint(const_iterator, Args &&...);
+ iterator erase(const_iterator);
+ size_type erase(const key_type &);
+ iterator erase(const_iterator, const_iterator);
+ void clear();
+ void shrink_to_fit();
+ iterator find(const key_type &);
+ const_iterator find(const key_type &) const;
+ size_type count(const key_type &) const;
+ iterator lower_bound(const key_type &);
+ const_iterator lower_bound(const key_type &) const;
+ iterator upper_bound(const key_type &);
+ const_iterator upper_bound(const key_type &) const;
+ std::pair< const_iterator, const_iterator >
+ equal_range(const key_type &) const;
+ std::pair< iterator, iterator > equal_range(const key_type &);
+ size_type capacity() const;
+ void reserve(size_type);
+};</pre></div>
<div class="refsect1" lang="en">
-<a name="id489304"></a><h2>Description</h2>
+<a name="id779927"></a><h2>Description</h2>
flat_multiset is a Sorted Associative Container that stores objects of type Key. flat_multiset is a Simple Associative Container, meaning that its value type, as well as its key type, is Key. flat_Multiset can store multiple copies of the same key value.
flat_multiset is similar to std::multiset but it's implemented like an ordered vector. This means that inserting a new element into a flat_multiset invalidates previous iterators and references
Erasing an element of a flat_multiset invalidates iterators and references pointing to elements that come after (their keys are equal or bigger) the erased element. 
<div class="refsect2" lang="en">
-<a name="id489315"></a><h3>
+<a name="id779938"></a><h3>
<a name="boost.container.flat_multisetconstruct-copy-destruct"></a><code class="computeroutput">flat_multiset</code>
 public
 construct/copy/destruct</h3>
<div class="orderedlist"><ol type="1">
-<li><pre class="literallayout"><a name="id303371-bb"></a>flat_multiset(const Pred & comp = Pred(),
- const allocator_type & a = allocator_type());</pre></li>
-<li><pre class="literallayout">template<typename InputIterator>
- <a name="id303386-bb"></a>flat_multiset(InputIterator first, InputIterator last,
- const Pred & comp = Pred(),
- const allocator_type & a = allocator_type());</pre></li>
-<li>
-<pre class="literallayout">template<typename InputIterator>
- <a name="id303567-bb"></a>flat_multiset(ordered_range_t, InputIterator first, InputIterator last,
- const Pred & comp = Pred(),
- const allocator_type & a = allocator_type());</pre>
+<li><pre class="literallayout"><a name="id382992-bb"></a>flat_multiset(const Pred & comp = Pred(),
+ const allocator_type & a = allocator_type());</pre></li>
+<li><pre class="literallayout">template<typename InputIterator>
+ <a name="id383008-bb"></a>flat_multiset(InputIterator first, InputIterator last,
+ const Pred & comp = Pred(),
+ const allocator_type & a = allocator_type());</pre></li>
+<li>
+<pre class="literallayout">template<typename InputIterator>
+ <a name="id383039-bb"></a>flat_multiset(ordered_range_t, InputIterator first, InputIterator last,
+ const Pred & comp = Pred(),
+ const allocator_type & a = allocator_type());</pre>
Effects: Constructs an empty flat_multiset using the specified comparison object and allocator, and inserts elements from the ordered range [first ,last ). This function is more efficient than the normal range creation for ordered ranges.
Requires: [first ,last) must be ordered according to the predicate.
Complexity: Linear in N. 
</li>
-<li><pre class="literallayout"><a name="id303623-bb"></a>flat_multiset(const flat_multiset< T, Pred, Alloc > & x);</pre></li>
-<li><pre class="literallayout"><a name="id303633-bb"></a>flat_multiset(flat_multiset && x);</pre></li>
-<li><pre class="literallayout">flat_multiset& <a name="id303641-bb"></a>operator=(const flat_multiset & x);</pre></li>
-<li><pre class="literallayout">flat_multiset& <a name="id303651-bb"></a>operator=(flat_multiset && mx);</pre></li>
+<li><pre class="literallayout"><a name="id383096-bb"></a>flat_multiset(const flat_multiset< T, Pred, Alloc > & x);</pre></li>
+<li><pre class="literallayout"><a name="id383105-bb"></a>flat_multiset(flat_multiset && x);</pre></li>
+<li><pre class="literallayout">flat_multiset& <a name="id383114-bb"></a>operator=(const flat_multiset & x);</pre></li>
+<li><pre class="literallayout">flat_multiset& <a name="id383123-bb"></a>operator=(flat_multiset && mx);</pre></li>
</ol></div>
</div>
<div class="refsect2" lang="en">
-<a name="id490047"></a><h3>
-<a name="id302173-bb"></a><code class="computeroutput">flat_multiset</code> public member functions</h3>
+<a name="id780492"></a><h3>
+<a name="id381795-bb"></a><code class="computeroutput">flat_multiset</code> public member functions</h3>
<div class="orderedlist"><ol type="1">
<li>
-<pre class="literallayout">key_compare <a name="id302175-bb"></a>key_comp() const;</pre>
+<pre class="literallayout">key_compare <a name="id381797-bb"></a>key_comp() const;</pre>
Effects: Returns the comparison object out of which a was constructed.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">value_compare <a name="id302196-bb"></a>value_comp() const;</pre>
+<pre class="literallayout">value_compare <a name="id381818-bb"></a>value_comp() const;</pre>
Effects: Returns an object of value_compare constructed out of the comparison object.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">allocator_type <a name="id302215-bb"></a>get_allocator() const;</pre>
+<pre class="literallayout">allocator_type <a name="id381837-bb"></a>get_allocator() const;</pre>
Effects: Returns a copy of the Allocator that was passed to the object's constructor.
Complexity: Constant. 
</li>
-<li><pre class="literallayout">const stored_allocator_type & <a name="id302234-bb"></a>get_stored_allocator() const;</pre></li>
-<li><pre class="literallayout">stored_allocator_type & <a name="id302240-bb"></a>get_stored_allocator() ;</pre></li>
+<li><pre class="literallayout">const stored_allocator_type & <a name="id381856-bb"></a>get_stored_allocator() const;</pre></li>
+<li><pre class="literallayout">stored_allocator_type & <a name="id381862-bb"></a>get_stored_allocator();</pre></li>
<li>
-<pre class="literallayout">iterator <a name="id302246-bb"></a>begin() ;</pre>
+<pre class="literallayout">iterator <a name="id381868-bb"></a>begin();</pre>
Effects: Returns an iterator to the first element contained in the container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_iterator <a name="id302271-bb"></a>begin() const;</pre>
+<pre class="literallayout">const_iterator <a name="id381893-bb"></a>begin() const;</pre>
Effects: Returns a const_iterator to the first element contained in the container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_iterator <a name="id302297-bb"></a>cbegin() const;</pre>
+<pre class="literallayout">const_iterator <a name="id381918-bb"></a>cbegin() const;</pre>
Effects: Returns a const_iterator to the first element contained in the container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id302322-bb"></a>end() ;</pre>
+<pre class="literallayout">iterator <a name="id381944-bb"></a>end();</pre>
Effects: Returns an iterator to the end of the container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_iterator <a name="id302347-bb"></a>end() const;</pre>
+<pre class="literallayout">const_iterator <a name="id381969-bb"></a>end() const;</pre>
Effects: Returns a const_iterator to the end of the container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_iterator <a name="id302372-bb"></a>cend() const;</pre>
+<pre class="literallayout">const_iterator <a name="id381994-bb"></a>cend() const;</pre>
Effects: Returns a const_iterator to the end of the container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">reverse_iterator <a name="id302397-bb"></a>rbegin() ;</pre>
+<pre class="literallayout">reverse_iterator <a name="id382019-bb"></a>rbegin();</pre>
Effects: Returns a reverse_iterator pointing to the beginning of the reversed container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_reverse_iterator <a name="id302423-bb"></a>rbegin() const;</pre>
+<pre class="literallayout">const_reverse_iterator <a name="id382044-bb"></a>rbegin() const;</pre>
Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_reverse_iterator <a name="id302448-bb"></a>crbegin() const;</pre>
+<pre class="literallayout">const_reverse_iterator <a name="id382070-bb"></a>crbegin() const;</pre>
Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">reverse_iterator <a name="id302473-bb"></a>rend() ;</pre>
+<pre class="literallayout">reverse_iterator <a name="id382095-bb"></a>rend();</pre>
Effects: Returns a reverse_iterator pointing to the end of the reversed container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_reverse_iterator <a name="id302498-bb"></a>rend() const;</pre>
+<pre class="literallayout">const_reverse_iterator <a name="id382120-bb"></a>rend() const;</pre>
Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_reverse_iterator <a name="id302523-bb"></a>crend() const;</pre>
+<pre class="literallayout">const_reverse_iterator <a name="id382145-bb"></a>crend() const;</pre>
Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">bool <a name="id302549-bb"></a>empty() const;</pre>
+<pre class="literallayout">bool <a name="id382170-bb"></a>empty() const;</pre>
Effects: Returns true if the container contains no elements.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">size_type <a name="id302574-bb"></a>size() const;</pre>
+<pre class="literallayout">size_type <a name="id382196-bb"></a>size() const;</pre>
Effects: Returns the number of the elements contained in the container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">size_type <a name="id302599-bb"></a>max_size() const;</pre>
+<pre class="literallayout">size_type <a name="id382221-bb"></a>max_size() const;</pre>
Effects: Returns the largest possible size of the container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">void <a name="id302624-bb"></a>swap(flat_multiset & x) ;</pre>
+<pre class="literallayout">void <a name="id382246-bb"></a>swap(flat_multiset & x);</pre>
Effects: Swaps the contents of *this and x. If this->allocator_type() != x.allocator_type() allocators are also swapped.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id302657-bb"></a>insert(const T & x) ;</pre>
+<pre class="literallayout">iterator <a name="id382278-bb"></a>insert(const T & x);</pre>
Effects: Inserts x and returns the iterator pointing to the newly inserted element.
Complexity: Logarithmic search time plus linear insertion to the elements with bigger keys than x.
Note: If an element it's inserted it might invalidate elements. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id302688-bb"></a>insert(value_type && x) ;</pre>
+<pre class="literallayout">iterator <a name="id382310-bb"></a>insert(value_type && x);</pre>
Effects: Inserts a new value_type move constructed from x and returns the iterator pointing to the newly inserted element.
Complexity: Logarithmic search time plus linear insertion to the elements with bigger keys than x.
Note: If an element it's inserted it might invalidate elements. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id302719-bb"></a>insert(const_iterator p, const T & x) ;</pre>
+<pre class="literallayout">iterator <a name="id382341-bb"></a>insert(const_iterator p, const T & x);</pre>
Effects: Inserts a copy of x in the container. p is a hint pointing to where the insert should start to search.
Returns: An iterator pointing to the element with key equivalent to the key of x.
Complexity: Logarithmic search time (constant if x is inserted right before p) plus insertion linear to the elements with bigger keys than x.
Note: If an element it's inserted it might invalidate elements. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id302761-bb"></a>insert(const_iterator position, value_type && x) ;</pre>
+<pre class="literallayout">iterator <a name="id382383-bb"></a>insert(const_iterator position, value_type && x);</pre>
Effects: Inserts a new value move constructed from x in the container. p is a hint pointing to where the insert should start to search.
Returns: An iterator pointing to the element with key equivalent to the key of x.
Complexity: Logarithmic search time (constant if x is inserted right before p) plus insertion linear to the elements with bigger keys than x.
Note: If an element it's inserted it might invalidate elements. 
</li>
<li>
-<pre class="literallayout">template<typename InputIterator>
- void <a name="id302803-bb"></a>insert(InputIterator first, InputIterator last) ;</pre>
+<pre class="literallayout">template<typename InputIterator>
+ void <a name="id382425-bb"></a>insert(InputIterator first, InputIterator last);</pre>
Requires: i, j are not iterators into *this.
Effects: inserts each element from the range [i,j) .
Complexity: N log(size()+N) (N is the distance from i to j) search time plus N*size() insertion time.
Note: If an element it's inserted it might invalidate elements. 
</li>
<li>
-<pre class="literallayout">template<class... Args> iterator <a name="id302851-bb"></a>emplace(Args &&... args) ;</pre>
+<pre class="literallayout">template<class... Args> iterator <a name="id382473-bb"></a>emplace(Args &&... args);</pre>
Effects: Inserts an object of type T constructed with std::forward<Args>(args)... and returns the iterator pointing to the newly inserted element.
Complexity: Logarithmic search time plus linear insertion to the elements with bigger keys than x.
Note: If an element it's inserted it might invalidate elements. 
</li>
<li>
-<pre class="literallayout">template<class... Args>
- iterator <a name="id302891-bb"></a>emplace_hint(const_iterator hint, Args &&... args) ;</pre>
+<pre class="literallayout">template<class... Args>
+ iterator <a name="id382512-bb"></a>emplace_hint(const_iterator hint, Args &&... args);</pre>
Effects: Inserts an object of type T constructed with std::forward<Args>(args)... in the container. p is a hint pointing to where the insert should start to search.
Returns: An iterator pointing to the element with key equivalent to the key of x.
Complexity: Logarithmic search time (constant if x is inserted right before p) plus insertion linear to the elements with bigger keys than x.
Note: If an element it's inserted it might invalidate elements. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id302941-bb"></a>erase(const_iterator position) ;</pre>
+<pre class="literallayout">iterator <a name="id382563-bb"></a>erase(const_iterator position);</pre>
Effects: Erases the element pointed to by position.
Returns: Returns an iterator pointing to the element immediately following q prior to the element being erased. If no such element exists, returns end().
Complexity: Linear to the elements with keys bigger than position
Note: Invalidates elements with keys not less than the erased element. 
</li>
<li>
-<pre class="literallayout">size_type <a name="id302977-bb"></a>erase(const key_type & x) ;</pre>
+<pre class="literallayout">size_type <a name="id382599-bb"></a>erase(const key_type & x);</pre>
Effects: Erases all elements in the container with key equivalent to x.
Returns: Returns the number of erased elements.
Complexity: Logarithmic search time plus erasure time linear to the elements with bigger keys. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id303007-bb"></a>erase(const_iterator first, const_iterator last) ;</pre>
+<pre class="literallayout">iterator <a name="id382629-bb"></a>erase(const_iterator first, const_iterator last);</pre>
Effects: Erases all the elements in the range [first, last).
Returns: Returns last.
Complexity: size()*N where N is the distance from first to last.
Complexity: Logarithmic search time plus erasure time linear to the elements with bigger keys. 
</li>
<li>
-<pre class="literallayout">void <a name="id303048-bb"></a>clear() ;</pre>
+<pre class="literallayout">void <a name="id382670-bb"></a>clear();</pre>
Effects: erase(a.begin(),a.end()).
Postcondition: size() == 0.
Complexity: linear in size(). 
</li>
<li>
-<pre class="literallayout">void <a name="id303073-bb"></a>shrink_to_fit() ;</pre>
+<pre class="literallayout">void <a name="id382695-bb"></a>shrink_to_fit();</pre>
Effects: Tries to deallocate the excess of memory created Throws: If memory allocation throws, or T's copy constructor throws.
Complexity: Linear to size(). 
</li>
<li>
-<pre class="literallayout">iterator <a name="id303099-bb"></a>find(const key_type & x) ;</pre>
+<pre class="literallayout">iterator <a name="id382721-bb"></a>find(const key_type & x);</pre>
Returns: An iterator pointing to an element with the key equivalent to x, or end() if such an element is not found.
Complexity: Logarithmic. 
</li>
<li>
-<pre class="literallayout">const_iterator <a name="id303123-bb"></a>find(const key_type & x) const;</pre>
+<pre class="literallayout">const_iterator <a name="id382745-bb"></a>find(const key_type & x) const;</pre>
Returns: A const_iterator pointing to an element with the key equivalent to x, or end() if such an element is not found.
Complexity: Logarithmic.s 
</li>
<li>
-<pre class="literallayout">size_type <a name="id303147-bb"></a>count(const key_type & x) const;</pre>
+<pre class="literallayout">size_type <a name="id382769-bb"></a>count(const key_type & x) const;</pre>
Returns: The number of elements with key equivalent to x.
Complexity: log(size())+count(k) 
</li>
<li>
-<pre class="literallayout">iterator <a name="id303171-bb"></a>lower_bound(const key_type & x) ;</pre>
+<pre class="literallayout">iterator <a name="id382793-bb"></a>lower_bound(const key_type & x);</pre>
Returns: An iterator pointing to the first element with key not less than k, or a.end() if such an element is not found.
Complexity: Logarithmic 
</li>
<li>
-<pre class="literallayout">const_iterator <a name="id303195-bb"></a>lower_bound(const key_type & x) const;</pre>
+<pre class="literallayout">const_iterator <a name="id382817-bb"></a>lower_bound(const key_type & x) const;</pre>
Returns: A const iterator pointing to the first element with key not less than k, or a.end() if such an element is not found.
Complexity: Logarithmic 
</li>
<li>
-<pre class="literallayout">iterator <a name="id303219-bb"></a>upper_bound(const key_type & x) ;</pre>
+<pre class="literallayout">iterator <a name="id382841-bb"></a>upper_bound(const key_type & x);</pre>
Returns: An iterator pointing to the first element with key not less than x, or end() if such an element is not found.
Complexity: Logarithmic 
</li>
<li>
-<pre class="literallayout">const_iterator <a name="id303243-bb"></a>upper_bound(const key_type & x) const;</pre>
+<pre class="literallayout">const_iterator <a name="id382865-bb"></a>upper_bound(const key_type & x) const;</pre>
Returns: A const iterator pointing to the first element with key not less than x, or end() if such an element is not found.
Complexity: Logarithmic 
</li>
<li>
-<pre class="literallayout">std::pair< const_iterator, const_iterator >
-<a name="id303267-bb"></a>equal_range(const key_type & x) const;</pre>
+<pre class="literallayout">std::pair< const_iterator, const_iterator >
+<a name="id382889-bb"></a>equal_range(const key_type & x) const;</pre>
Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).
Complexity: Logarithmic 
</li>
<li>
-<pre class="literallayout">std::pair< iterator, iterator > <a name="id303291-bb"></a>equal_range(const key_type & x) ;</pre>
+<pre class="literallayout">std::pair< iterator, iterator > <a name="id382913-bb"></a>equal_range(const key_type & x);</pre>
Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).
Complexity: Logarithmic 
</li>
<li>
-<pre class="literallayout">size_type <a name="id303315-bb"></a>capacity() const;</pre>
+<pre class="literallayout">size_type <a name="id382937-bb"></a>capacity() const;</pre>
Effects: Number of elements for which memory has been allocated. capacity() is always greater than or equal to size().
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">void <a name="id303341-bb"></a>reserve(size_type count) ;</pre>
+<pre class="literallayout">void <a name="id382962-bb"></a>reserve(size_type count);</pre>
Effects: If n is less than or equal to capacity(), this call has no effect. Otherwise, it is a request for allocation of additional memory. If the request is successful, then capacity() is greater than or equal to n; otherwise, capacity() is unchanged. In either case, size() is unchanged.
Throws: If memory allocation allocation throws or T's copy constructor throws.
Note: If capacity() is less than "count", iterators and references to to values might be invalidated. 
@@ -406,7 +406,7 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2009 -2010 Ion Gaztanaga
+<td align="right"><div class="copyright-footer">Copyright © 2009 -2011 Ion Gaztanaga
 Distributed under the Boost Software License, Version 1.0. (See accompanying
 file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
@@ -414,7 +414,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="flat_set.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.flat_set_hpp"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="list.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="flat_set.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.flat_set_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="list.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>

Modified: sandbox/move/libs/container/doc/html/boost/container/flat_set.html
==============================================================================
--- sandbox/move/libs/container/doc/html/boost/container/flat_set.html (original)
+++ sandbox/move/libs/container/doc/html/boost/container/flat_set.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
@@ -1,10 +1,10 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Class template flat_set</title>
-<link rel="stylesheet" href="../../boostbook.css" type="text/css">
+<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
-<link rel="start" href="../../index.html" title="Chapter 1. Boost.Container">
+<link rel="start" href="../../index.html" title="Chapter 1. Boost.Container">
<link rel="up" href="../../boost_container_reference.html#header.boost.container.flat_set_hpp" title="Header <boost/container/flat_set.hpp>">
<link rel="prev" href="flat_multimap.html" title="Class template flat_multimap">
<link rel="next" href="flat_multiset.html" title="Class template flat_multiset">
@@ -20,7 +20,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="flat_multimap.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.flat_set_hpp"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="flat_multiset.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="flat_multimap.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.flat_set_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="flat_multiset.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="refentry" lang="en">
<a name="boost.container.flat_set"></a><div class="titlepage"></div>
@@ -29,400 +29,400 @@
boost::container::flat_set — 
</div>
<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2>
-<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/container/flat_set.hpp>
+<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/container/flat_set.hpp>

-template<typename T, typename Pred, typename Alloc>
-class flat_set {
-public:
- // types
- typedef tree_t::key_type <a name="boost.container.flat_set.key_type"></a>key_type;
- typedef tree_t::value_type <a name="boost.container.flat_set.value_type"></a>value_type;
- typedef tree_t::pointer <a name="boost.container.flat_set.pointer"></a>pointer;
- typedef tree_t::const_pointer <a name="boost.container.flat_set.const_pointer"></a>const_pointer;
- typedef tree_t::reference <a name="boost.container.flat_set.reference"></a>reference;
- typedef tree_t::const_reference <a name="boost.container.flat_set.const_reference"></a>const_reference;
- typedef tree_t::key_compare <a name="boost.container.flat_set.key_compare"></a>key_compare;
- typedef tree_t::value_compare <a name="boost.container.flat_set.value_compare"></a>value_compare;
- typedef tree_t::iterator <a name="boost.container.flat_set.iterator"></a>iterator;
- typedef tree_t::const_iterator <a name="boost.container.flat_set.const_iterator"></a>const_iterator;
- typedef tree_t::reverse_iterator <a name="boost.container.flat_set.reverse_iterator"></a>reverse_iterator;
- typedef tree_t::const_reverse_iterator <a name="boost.container.flat_set.const_reverse_iterator"></a>const_reverse_iterator;
- typedef tree_t::size_type <a name="boost.container.flat_set.size_type"></a>size_type;
- typedef tree_t::difference_type <a name="boost.container.flat_set.difference_type"></a>difference_type;
- typedef tree_t::allocator_type <a name="boost.container.flat_set.allocator_type"></a>allocator_type;
- typedef tree_t::stored_allocator_type <a name="boost.container.flat_set.stored_allocator_type"></a>stored_allocator_type;
+template<typename T, typename Pred, typename Alloc>
+class flat_set {
+public:
+ // types
+ typedef tree_t::key_type <a name="boost.container.flat_set.key_type"></a>key_type;
+ typedef tree_t::value_type <a name="boost.container.flat_set.value_type"></a>value_type;
+ typedef tree_t::pointer <a name="boost.container.flat_set.pointer"></a>pointer;
+ typedef tree_t::const_pointer <a name="boost.container.flat_set.const_pointer"></a>const_pointer;
+ typedef tree_t::reference <a name="boost.container.flat_set.reference"></a>reference;
+ typedef tree_t::const_reference <a name="boost.container.flat_set.const_reference"></a>const_reference;
+ typedef tree_t::key_compare <a name="boost.container.flat_set.key_compare"></a>key_compare;
+ typedef tree_t::value_compare <a name="boost.container.flat_set.value_compare"></a>value_compare;
+ typedef tree_t::iterator <a name="boost.container.flat_set.iterator"></a>iterator;
+ typedef tree_t::const_iterator <a name="boost.container.flat_set.const_iterator"></a>const_iterator;
+ typedef tree_t::reverse_iterator <a name="boost.container.flat_set.reverse_iterator"></a>reverse_iterator;
+ typedef tree_t::const_reverse_iterator <a name="boost.container.flat_set.const_reverse_iterator"></a>const_reverse_iterator;
+ typedef tree_t::size_type <a name="boost.container.flat_set.size_type"></a>size_type;
+ typedef tree_t::difference_type <a name="boost.container.flat_set.difference_type"></a>difference_type;
+ typedef tree_t::allocator_type <a name="boost.container.flat_set.allocator_type"></a>allocator_type;
+ typedef tree_t::stored_allocator_type <a name="boost.container.flat_set.stored_allocator_type"></a>stored_allocator_type;

- // construct/copy/destruct
- flat_set(const Pred & = Pred(), const allocator_type & = allocator_type());
- template<typename InputIterator>
- flat_set(InputIterator, InputIterator, const Pred & = Pred(),
- const allocator_type & = allocator_type());
- template<typename InputIterator>
- flat_set(ordered_unique_range_t, InputIterator, InputIterator,
- const Pred & = Pred(),
- const allocator_type & = allocator_type());
- flat_set(const flat_set< T, Pred, Alloc > &);
- flat_set(flat_set &&);
- flat_set& operator=(const flat_set &);
- flat_set& operator=(flat_set &&);
+ // construct/copy/destruct
+ flat_set(const Pred & = Pred(), const allocator_type & = allocator_type());
+ template<typename InputIterator>
+ flat_set(InputIterator, InputIterator, const Pred & = Pred(),
+ const allocator_type & = allocator_type());
+ template<typename InputIterator>
+ flat_set(ordered_unique_range_t, InputIterator, InputIterator,
+ const Pred & = Pred(),
+ const allocator_type & = allocator_type());
+ flat_set(const flat_set< T, Pred, Alloc > &);
+ flat_set(flat_set &&);
+ flat_set& operator=(const flat_set &);
+ flat_set& operator=(flat_set &&);

- // public member functions
- key_compare key_comp() const;
- value_compare value_comp() const;
- allocator_type get_allocator() const;
- const stored_allocator_type & get_stored_allocator() const;
- stored_allocator_type & get_stored_allocator() ;
- iterator begin() ;
- const_iterator begin() const;
- const_iterator cbegin() const;
- iterator end() ;
- const_iterator end() const;
- const_iterator cend() const;
- reverse_iterator rbegin() ;
- const_reverse_iterator rbegin() const;
- const_reverse_iterator crbegin() const;
- reverse_iterator rend() ;
- const_reverse_iterator rend() const;
- const_reverse_iterator crend() const;
- bool empty() const;
- size_type size() const;
- size_type max_size() const;
- void swap(flat_set &) ;
- std::pair< iterator, bool > insert(const T &) ;
- std::pair< iterator, bool > insert(value_type &&) ;
- iterator insert(const_iterator, const T &) ;
- iterator insert(const_iterator, value_type &&) ;
- template<typename InputIterator> void insert(InputIterator, InputIterator) ;
- template<class... Args> iterator emplace(Args &&...) ;
- template<class... Args> iterator emplace_hint(const_iterator, Args &&...) ;
- iterator erase(const_iterator) ;
- size_type erase(const key_type &) ;
- iterator erase(const_iterator, const_iterator) ;
- void clear() ;
- void shrink_to_fit() ;
- iterator find(const key_type &) ;
- const_iterator find(const key_type &) const;
- size_type count(const key_type &) const;
- iterator lower_bound(const key_type &) ;
- const_iterator lower_bound(const key_type &) const;
- iterator upper_bound(const key_type &) ;
- const_iterator upper_bound(const key_type &) const;
- std::pair< const_iterator, const_iterator >
- equal_range(const key_type &) const;
- std::pair< iterator, iterator > equal_range(const key_type &) ;
- size_type capacity() const;
- void reserve(size_type) ;
-};</pre></div>
+ // public member functions
+ key_compare key_comp() const;
+ value_compare value_comp() const;
+ allocator_type get_allocator() const;
+ const stored_allocator_type & get_stored_allocator() const;
+ stored_allocator_type & get_stored_allocator();
+ iterator begin();
+ const_iterator begin() const;
+ const_iterator cbegin() const;
+ iterator end();
+ const_iterator end() const;
+ const_iterator cend() const;
+ reverse_iterator rbegin();
+ const_reverse_iterator rbegin() const;
+ const_reverse_iterator crbegin() const;
+ reverse_iterator rend();
+ const_reverse_iterator rend() const;
+ const_reverse_iterator crend() const;
+ bool empty() const;
+ size_type size() const;
+ size_type max_size() const;
+ void swap(flat_set &);
+ std::pair< iterator, bool > insert(const T &);
+ std::pair< iterator, bool > insert(value_type &&);
+ iterator insert(const_iterator, const T &);
+ iterator insert(const_iterator, value_type &&);
+ template<typename InputIterator> void insert(InputIterator, InputIterator);
+ template<class... Args> iterator emplace(Args &&...);
+ template<class... Args> iterator emplace_hint(const_iterator, Args &&...);
+ iterator erase(const_iterator);
+ size_type erase(const key_type &);
+ iterator erase(const_iterator, const_iterator);
+ void clear();
+ void shrink_to_fit();
+ iterator find(const key_type &);
+ const_iterator find(const key_type &) const;
+ size_type count(const key_type &) const;
+ iterator lower_bound(const key_type &);
+ const_iterator lower_bound(const key_type &) const;
+ iterator upper_bound(const key_type &);
+ const_iterator upper_bound(const key_type &) const;
+ std::pair< const_iterator, const_iterator >
+ equal_range(const key_type &) const;
+ std::pair< iterator, iterator > equal_range(const key_type &);
+ size_type capacity() const;
+ void reserve(size_type);
+};</pre></div>
<div class="refsect1" lang="en">
-<a name="id484643"></a><h2>Description</h2>
+<a name="id770919"></a><h2>Description</h2>
flat_set is a Sorted Associative Container that stores objects of type Key. flat_set is a Simple Associative Container, meaning that its value type, as well as its key type, is Key. It is also a Unique Associative Container, meaning that no two elements are the same.
flat_set is similar to std::set but it's implemented like an ordered vector. This means that inserting a new element into a flat_set invalidates previous iterators and references
Erasing an element of a flat_set invalidates iterators and references pointing to elements that come after (their keys are bigger) the erased element. 
<div class="refsect2" lang="en">
-<a name="id484654"></a><h3>
+<a name="id770930"></a><h3>
<a name="boost.container.flat_setconstruct-copy-destruct"></a><code class="computeroutput">flat_set</code>
 public
 construct/copy/destruct</h3>
<div class="orderedlist"><ol type="1">
<li>
-<pre class="literallayout"><a name="id301848-bb"></a>flat_set(const Pred & comp = Pred(),
- const allocator_type & a = allocator_type());</pre>
+<pre class="literallayout"><a name="id381452-bb"></a>flat_set(const Pred & comp = Pred(),
+ const allocator_type & a = allocator_type());</pre>
Effects: Constructs an empty flat_map using the specified comparison object and allocator.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">template<typename InputIterator>
- <a name="id301877-bb"></a>flat_set(InputIterator first, InputIterator last,
- const Pred & comp = Pred(),
- const allocator_type & a = allocator_type());</pre>
+<pre class="literallayout">template<typename InputIterator>
+ <a name="id381481-bb"></a>flat_set(InputIterator first, InputIterator last,
+ const Pred & comp = Pred(),
+ const allocator_type & a = allocator_type());</pre>
Effects: Constructs an empty map using the specified comparison object and allocator, and inserts elements from the range [first ,last ).
Complexity: Linear in N if the range [first ,last ) is already sorted using comp and otherwise N logN, where N is last - first. 
</li>
<li>
-<pre class="literallayout">template<typename InputIterator>
- <a name="id301921-bb"></a>flat_set(ordered_unique_range_t, InputIterator first, InputIterator last,
- const Pred & comp = Pred(),
- const allocator_type & a = allocator_type());</pre>
+<pre class="literallayout">template<typename InputIterator>
+ <a name="id381525-bb"></a>flat_set(ordered_unique_range_t, InputIterator first, InputIterator last,
+ const Pred & comp = Pred(),
+ const allocator_type & a = allocator_type());</pre>
Effects: Constructs an empty flat_set using the specified comparison object and allocator, and inserts elements from the ordered unique range [first ,last). This function is more efficient than the normal range creation for ordered ranges.
Requires: [first ,last) must be ordered according to the predicate and must be unique values.
Complexity: Linear in N. 
</li>
<li>
-<pre class="literallayout"><a name="id301976-bb"></a>flat_set(const flat_set< T, Pred, Alloc > & x);</pre>
+<pre class="literallayout"><a name="id381598-bb"></a>flat_set(const flat_set< T, Pred, Alloc > & x);</pre>
Effects: Copy constructs a map.
Complexity: Linear in x.size(). 
</li>
<li>
-<pre class="literallayout"><a name="id301999-bb"></a>flat_set(flat_set && mx);</pre>
+<pre class="literallayout"><a name="id381621-bb"></a>flat_set(flat_set && mx);</pre>
Effects: Move constructs a map. Constructs *this using x's resources.
Complexity: Construct.
Postcondition: x is emptied. 
</li>
<li>
-<pre class="literallayout">flat_set& <a name="id302028-bb"></a>operator=(const flat_set & x);</pre>
+<pre class="literallayout">flat_set& <a name="id381650-bb"></a>operator=(const flat_set & x);</pre>
Effects: Makes *this a copy of x.
Complexity: Linear in x.size(). 
</li>
<li>
-<pre class="literallayout">flat_set& <a name="id302051-bb"></a>operator=(flat_set && mx);</pre>
+<pre class="literallayout">flat_set& <a name="id381672-bb"></a>operator=(flat_set && mx);</pre>
Effects: Makes *this a copy of x.
Complexity: Linear in x.size(). 
</li>
</ol></div>
</div>
<div class="refsect2" lang="en">
-<a name="id484919"></a><h3>
-<a name="id298652-bb"></a><code class="computeroutput">flat_set</code> public member functions</h3>
+<a name="id772655"></a><h3>
+<a name="id380236-bb"></a><code class="computeroutput">flat_set</code> public member functions</h3>
<div class="orderedlist"><ol type="1">
<li>
-<pre class="literallayout">key_compare <a name="id298654-bb"></a>key_comp() const;</pre>
+<pre class="literallayout">key_compare <a name="id380239-bb"></a>key_comp() const;</pre>
Effects: Returns the comparison object out of which a was constructed.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">value_compare <a name="id298675-bb"></a>value_comp() const;</pre>
+<pre class="literallayout">value_compare <a name="id380259-bb"></a>value_comp() const;</pre>
Effects: Returns an object of value_compare constructed out of the comparison object.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">allocator_type <a name="id298694-bb"></a>get_allocator() const;</pre>
+<pre class="literallayout">allocator_type <a name="id380278-bb"></a>get_allocator() const;</pre>
Effects: Returns a copy of the Allocator that was passed to the object's constructor.
Complexity: Constant. 
</li>
-<li><pre class="literallayout">const stored_allocator_type & <a name="id298713-bb"></a>get_stored_allocator() const;</pre></li>
-<li><pre class="literallayout">stored_allocator_type & <a name="id298719-bb"></a>get_stored_allocator() ;</pre></li>
+<li><pre class="literallayout">const stored_allocator_type & <a name="id380298-bb"></a>get_stored_allocator() const;</pre></li>
+<li><pre class="literallayout">stored_allocator_type & <a name="id380304-bb"></a>get_stored_allocator();</pre></li>
<li>
-<pre class="literallayout">iterator <a name="id298725-bb"></a>begin() ;</pre>
+<pre class="literallayout">iterator <a name="id380310-bb"></a>begin();</pre>
Effects: Returns an iterator to the first element contained in the container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_iterator <a name="id298750-bb"></a>begin() const;</pre>
+<pre class="literallayout">const_iterator <a name="id380335-bb"></a>begin() const;</pre>
Effects: Returns a const_iterator to the first element contained in the container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_iterator <a name="id298776-bb"></a>cbegin() const;</pre>
+<pre class="literallayout">const_iterator <a name="id380360-bb"></a>cbegin() const;</pre>
Effects: Returns a const_iterator to the first element contained in the container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id298801-bb"></a>end() ;</pre>
+<pre class="literallayout">iterator <a name="id380385-bb"></a>end();</pre>
Effects: Returns an iterator to the end of the container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_iterator <a name="id298826-bb"></a>end() const;</pre>
+<pre class="literallayout">const_iterator <a name="id380410-bb"></a>end() const;</pre>
Effects: Returns a const_iterator to the end of the container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_iterator <a name="id298851-bb"></a>cend() const;</pre>
+<pre class="literallayout">const_iterator <a name="id380436-bb"></a>cend() const;</pre>
Effects: Returns a const_iterator to the end of the container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">reverse_iterator <a name="id298876-bb"></a>rbegin() ;</pre>
+<pre class="literallayout">reverse_iterator <a name="id380461-bb"></a>rbegin();</pre>
Effects: Returns a reverse_iterator pointing to the beginning of the reversed container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_reverse_iterator <a name="id298902-bb"></a>rbegin() const;</pre>
+<pre class="literallayout">const_reverse_iterator <a name="id380486-bb"></a>rbegin() const;</pre>
Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_reverse_iterator <a name="id298927-bb"></a>crbegin() const;</pre>
+<pre class="literallayout">const_reverse_iterator <a name="id380511-bb"></a>crbegin() const;</pre>
Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">reverse_iterator <a name="id298952-bb"></a>rend() ;</pre>
+<pre class="literallayout">reverse_iterator <a name="id380536-bb"></a>rend();</pre>
Effects: Returns a reverse_iterator pointing to the end of the reversed container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_reverse_iterator <a name="id298977-bb"></a>rend() const;</pre>
+<pre class="literallayout">const_reverse_iterator <a name="id380562-bb"></a>rend() const;</pre>
Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_reverse_iterator <a name="id299002-bb"></a>crend() const;</pre>
+<pre class="literallayout">const_reverse_iterator <a name="id380587-bb"></a>crend() const;</pre>
Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">bool <a name="id299028-bb"></a>empty() const;</pre>
+<pre class="literallayout">bool <a name="id380612-bb"></a>empty() const;</pre>
Effects: Returns true if the container contains no elements.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">size_type <a name="id299053-bb"></a>size() const;</pre>
+<pre class="literallayout">size_type <a name="id380637-bb"></a>size() const;</pre>
Effects: Returns the number of the elements contained in the container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">size_type <a name="id299078-bb"></a>max_size() const;</pre>
+<pre class="literallayout">size_type <a name="id380662-bb"></a>max_size() const;</pre>
Effects: Returns the largest possible size of the container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">void <a name="id299103-bb"></a>swap(flat_set & x) ;</pre>
+<pre class="literallayout">void <a name="id380688-bb"></a>swap(flat_set & x);</pre>
Effects: Swaps the contents of *this and x. If this->allocator_type() != x.allocator_type() allocators are also swapped.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">std::pair< iterator, bool > <a name="id299136-bb"></a>insert(const T & x) ;</pre>
+<pre class="literallayout">std::pair< iterator, bool > <a name="id380720-bb"></a>insert(const T & x);</pre>
Effects: Inserts x if and only if there is no element in the container with key equivalent to the key of x.
Returns: The bool component of the returned pair is true if and only if the insertion takes place, and the iterator component of the pair points to the element with key equivalent to the key of x.
Complexity: Logarithmic search time plus linear insertion to the elements with bigger keys than x.
Note: If an element it's inserted it might invalidate elements. 
</li>
<li>
-<pre class="literallayout">std::pair< iterator, bool > <a name="id299173-bb"></a>insert(value_type && x) ;</pre>
+<pre class="literallayout">std::pair< iterator, bool > <a name="id380757-bb"></a>insert(value_type && x);</pre>
Effects: Inserts a new value_type move constructed from the pair if and only if there is no element in the container with key equivalent to the key of x.
Returns: The bool component of the returned pair is true if and only if the insertion takes place, and the iterator component of the pair points to the element with key equivalent to the key of x.
Complexity: Logarithmic search time plus linear insertion to the elements with bigger keys than x.
Note: If an element it's inserted it might invalidate elements. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id299210-bb"></a>insert(const_iterator p, const T & x) ;</pre>
+<pre class="literallayout">iterator <a name="id380794-bb"></a>insert(const_iterator p, const T & x);</pre>
Effects: Inserts a copy of x in the container if and only if there is no element in the container with key equivalent to the key of x. p is a hint pointing to where the insert should start to search.
Returns: An iterator pointing to the element with key equivalent to the key of x.
Complexity: Logarithmic search time (constant if x is inserted right before p) plus insertion linear to the elements with bigger keys than x.
Note: If an element it's inserted it might invalidate elements. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id301232-bb"></a>insert(const_iterator position, value_type && x) ;</pre>
+<pre class="literallayout">iterator <a name="id380836-bb"></a>insert(const_iterator position, value_type && x);</pre>
Effects: Inserts an element move constructed from x in the container. p is a hint pointing to where the insert should start to search.
Returns: An iterator pointing to the element with key equivalent to the key of x.
Complexity: Logarithmic search time (constant if x is inserted right before p) plus insertion linear to the elements with bigger keys than x.
Note: If an element it's inserted it might invalidate elements. 
</li>
<li>
-<pre class="literallayout">template<typename InputIterator>
- void <a name="id301274-bb"></a>insert(InputIterator first, InputIterator last) ;</pre>
+<pre class="literallayout">template<typename InputIterator>
+ void <a name="id380878-bb"></a>insert(InputIterator first, InputIterator last);</pre>
Requires: i, j are not iterators into *this.
Effects: inserts each element from the range [i,j) if and only if there is no element with key equivalent to the key of that element.
Complexity: N log(size()+N) (N is the distance from i to j) search time plus N*size() insertion time.
Note: If an element it's inserted it might invalidate elements. 
</li>
<li>
-<pre class="literallayout">template<class... Args> iterator <a name="id301322-bb"></a>emplace(Args &&... args) ;</pre>
+<pre class="literallayout">template<class... Args> iterator <a name="id380926-bb"></a>emplace(Args &&... args);</pre>
Effects: Inserts an object of type T constructed with std::forward<Args>(args)... if and only if there is no element in the container with key equivalent to the key of x.
Returns: The bool component of the returned pair is true if and only if the insertion takes place, and the iterator component of the pair points to the element with key equivalent to the key of x.
Complexity: Logarithmic search time plus linear insertion to the elements with bigger keys than x.
Note: If an element it's inserted it might invalidate elements. 
</li>
<li>
-<pre class="literallayout">template<class... Args>
- iterator <a name="id301368-bb"></a>emplace_hint(const_iterator hint, Args &&... args) ;</pre>
+<pre class="literallayout">template<class... Args>
+ iterator <a name="id380972-bb"></a>emplace_hint(const_iterator hint, Args &&... args);</pre>
Effects: Inserts an object of type T constructed with std::forward<Args>(args)... in the container if and only if there is no element in the container with key equivalent to the key of x. p is a hint pointing to where the insert should start to search.
Returns: An iterator pointing to the element with key equivalent to the key of x.
Complexity: Logarithmic search time (constant if x is inserted right before p) plus insertion linear to the elements with bigger keys than x.
Note: If an element it's inserted it might invalidate elements. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id301418-bb"></a>erase(const_iterator position) ;</pre>
+<pre class="literallayout">iterator <a name="id381022-bb"></a>erase(const_iterator position);</pre>
Effects: Erases the element pointed to by position.
Returns: Returns an iterator pointing to the element immediately following q prior to the element being erased. If no such element exists, returns end().
Complexity: Linear to the elements with keys bigger than position
Note: Invalidates elements with keys not less than the erased element. 
</li>
<li>
-<pre class="literallayout">size_type <a name="id301454-bb"></a>erase(const key_type & x) ;</pre>
+<pre class="literallayout">size_type <a name="id381058-bb"></a>erase(const key_type & x);</pre>
Effects: Erases all elements in the container with key equivalent to x.
Returns: Returns the number of erased elements.
Complexity: Logarithmic search time plus erasure time linear to the elements with bigger keys. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id301484-bb"></a>erase(const_iterator first, const_iterator last) ;</pre>
+<pre class="literallayout">iterator <a name="id381088-bb"></a>erase(const_iterator first, const_iterator last);</pre>
Effects: Erases all the elements in the range [first, last).
Returns: Returns last.
Complexity: size()*N where N is the distance from first to last.
Complexity: Logarithmic search time plus erasure time linear to the elements with bigger keys. 
</li>
<li>
-<pre class="literallayout">void <a name="id301525-bb"></a>clear() ;</pre>
+<pre class="literallayout">void <a name="id381129-bb"></a>clear();</pre>
Effects: erase(a.begin(),a.end()).
Postcondition: size() == 0.
Complexity: linear in size(). 
</li>
<li>
-<pre class="literallayout">void <a name="id301550-bb"></a>shrink_to_fit() ;</pre>
+<pre class="literallayout">void <a name="id381154-bb"></a>shrink_to_fit();</pre>
Effects: Tries to deallocate the excess of memory created Throws: If memory allocation throws, or T's copy constructor throws.
Complexity: Linear to size(). 
</li>
<li>
-<pre class="literallayout">iterator <a name="id301577-bb"></a>find(const key_type & x) ;</pre>
+<pre class="literallayout">iterator <a name="id381181-bb"></a>find(const key_type & x);</pre>
Returns: An iterator pointing to an element with the key equivalent to x, or end() if such an element is not found.
Complexity: Logarithmic. 
</li>
<li>
-<pre class="literallayout">const_iterator <a name="id301601-bb"></a>find(const key_type & x) const;</pre>
+<pre class="literallayout">const_iterator <a name="id381205-bb"></a>find(const key_type & x) const;</pre>
Returns: A const_iterator pointing to an element with the key equivalent to x, or end() if such an element is not found.
Complexity: Logarithmic.s 
</li>
<li>
-<pre class="literallayout">size_type <a name="id301625-bb"></a>count(const key_type & x) const;</pre>
+<pre class="literallayout">size_type <a name="id381229-bb"></a>count(const key_type & x) const;</pre>
Returns: The number of elements with key equivalent to x.
Complexity: log(size())+count(k) 
</li>
<li>
-<pre class="literallayout">iterator <a name="id301649-bb"></a>lower_bound(const key_type & x) ;</pre>
+<pre class="literallayout">iterator <a name="id381253-bb"></a>lower_bound(const key_type & x);</pre>
Returns: An iterator pointing to the first element with key not less than k, or a.end() if such an element is not found.
Complexity: Logarithmic 
</li>
<li>
-<pre class="literallayout">const_iterator <a name="id301673-bb"></a>lower_bound(const key_type & x) const;</pre>
+<pre class="literallayout">const_iterator <a name="id381277-bb"></a>lower_bound(const key_type & x) const;</pre>
Returns: A const iterator pointing to the first element with key not less than k, or a.end() if such an element is not found.
Complexity: Logarithmic 
</li>
<li>
-<pre class="literallayout">iterator <a name="id301697-bb"></a>upper_bound(const key_type & x) ;</pre>
+<pre class="literallayout">iterator <a name="id381301-bb"></a>upper_bound(const key_type & x);</pre>
Returns: An iterator pointing to the first element with key not less than x, or end() if such an element is not found.
Complexity: Logarithmic 
</li>
<li>
-<pre class="literallayout">const_iterator <a name="id301721-bb"></a>upper_bound(const key_type & x) const;</pre>
+<pre class="literallayout">const_iterator <a name="id381325-bb"></a>upper_bound(const key_type & x) const;</pre>
Returns: A const iterator pointing to the first element with key not less than x, or end() if such an element is not found.
Complexity: Logarithmic 
</li>
<li>
-<pre class="literallayout">std::pair< const_iterator, const_iterator >
-<a name="id301745-bb"></a>equal_range(const key_type & x) const;</pre>
+<pre class="literallayout">std::pair< const_iterator, const_iterator >
+<a name="id381349-bb"></a>equal_range(const key_type & x) const;</pre>
Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).
Complexity: Logarithmic 
</li>
<li>
-<pre class="literallayout">std::pair< iterator, iterator > <a name="id301769-bb"></a>equal_range(const key_type & x) ;</pre>
+<pre class="literallayout">std::pair< iterator, iterator > <a name="id381373-bb"></a>equal_range(const key_type & x);</pre>
Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).
Complexity: Logarithmic 
</li>
<li>
-<pre class="literallayout">size_type <a name="id301793-bb"></a>capacity() const;</pre>
+<pre class="literallayout">size_type <a name="id381397-bb"></a>capacity() const;</pre>
Effects: Number of elements for which memory has been allocated. capacity() is always greater than or equal to size().
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">void <a name="id301818-bb"></a>reserve(size_type count) ;</pre>
+<pre class="literallayout">void <a name="id381422-bb"></a>reserve(size_type count);</pre>
Effects: If n is less than or equal to capacity(), this call has no effect. Otherwise, it is a request for allocation of additional memory. If the request is successful, then capacity() is greater than or equal to n; otherwise, capacity() is unchanged. In either case, size() is unchanged.
Throws: If memory allocation allocation throws or T's copy constructor throws.
Note: If capacity() is less than "count", iterators and references to to values might be invalidated. 
@@ -433,7 +433,7 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2009 -2010 Ion Gaztanaga
+<td align="right"><div class="copyright-footer">Copyright © 2009 -2011 Ion Gaztanaga
 Distributed under the Boost Software License, Version 1.0. (See accompanying
 file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
@@ -441,7 +441,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="flat_multimap.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.flat_set_hpp"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="flat_multiset.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="flat_multimap.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.flat_set_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="flat_multiset.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>

Modified: sandbox/move/libs/container/doc/html/boost/container/list.html
==============================================================================
--- sandbox/move/libs/container/doc/html/boost/container/list.html (original)
+++ sandbox/move/libs/container/doc/html/boost/container/list.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
@@ -1,10 +1,10 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Class template list</title>
-<link rel="stylesheet" href="../../boostbook.css" type="text/css">
+<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
-<link rel="start" href="../../index.html" title="Chapter 1. Boost.Container">
+<link rel="start" href="../../index.html" title="Chapter 1. Boost.Container">
<link rel="up" href="../../boost_container_reference.html#header.boost.container.list_hpp" title="Header <boost/container/list.hpp>">
<link rel="prev" href="flat_multiset.html" title="Class template flat_multiset">
<link rel="next" href="map.html" title="Class template map">
@@ -20,7 +20,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="flat_multiset.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.list_hpp"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="map.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="flat_multiset.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.list_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="map.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="refentry" lang="en">
<a name="boost.container.list"></a><div class="titlepage"></div>
@@ -29,174 +29,167 @@
boost::container::list — 
</div>
<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2>
-<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/container/list.hpp>
+<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/container/list.hpp>

-template<typename T, typename A>
-class list {
-public:
- // types
- typedef T value_type;
- typedef A::pointer <a name="boost.container.list.pointer"></a>pointer; // Pointer to T. 
- typedef A::const_pointer <a name="boost.container.list.const_pointer"></a>const_pointer; // Const pointer to T. 
- typedef A::reference <a name="boost.container.list.reference"></a>reference; // Reference to T. 
- typedef A::const_reference <a name="boost.container.list.const_reference"></a>const_reference; // Const reference to T. 
- typedef A::size_type <a name="boost.container.list.size_type"></a>size_type; // An unsigned integral type. 
- typedef A::difference_type <a name="boost.container.list.difference_type"></a>difference_type; // A signed integral type. 
- typedef A <a name="boost.container.list.allocator_type"></a>allocator_type; // The allocator type. 
- typedef NodeAlloc <a name="boost.container.list.stored_allocator_type"></a>stored_allocator_type; // The stored allocator type. 
- typedef std::reverse_iterator< const_iterator > const_reverse_iterator;
+template<typename T, typename A>
+class list {
+public:
+ // types
+ typedef T value_type;
+ typedef A::pointer <a name="boost.container.list.pointer"></a>pointer; // Pointer to T. 
+ typedef A::const_pointer <a name="boost.container.list.const_pointer"></a>const_pointer; // Const pointer to T. 
+ typedef A::reference <a name="boost.container.list.reference"></a>reference; // Reference to T. 
+ typedef A::const_reference <a name="boost.container.list.const_reference"></a>const_reference; // Const reference to T. 
+ typedef A::size_type <a name="boost.container.list.size_type"></a>size_type; // An unsigned integral type. 
+ typedef A::difference_type <a name="boost.container.list.difference_type"></a>difference_type; // A signed integral type. 
+ typedef A <a name="boost.container.list.allocator_type"></a>allocator_type; // The allocator type. 
+ typedef NodeAlloc <a name="boost.container.list.stored_allocator_type"></a>stored_allocator_type; // The stored allocator type. 
+ typedef std::reverse_iterator< const_iterator > const_reverse_iterator;

- // construct/copy/destruct
- list(const allocator_type & = A());
- list(size_type);
- list(size_type, const T &, const A & = A());
- list(const list &);
- list(list &&);
- template<typename InpIt> list(InpIt, InpIt, const A & = A());
- list& operator=(const ThisType &);
- list& operator=(ThisType &&);
- ~list();
+ // construct/copy/destruct
+ list(const allocator_type & = A());
+ list(size_type);
+ list(size_type, const T &, const A & = A());
+ list(const list &);
+ list(list &&);
+ template<typename InpIt> list(InpIt, InpIt, const A & = A());
+ list& operator=(const ThisType &);
+ list& operator=(ThisType &&);
+ ~list();

- // public member functions
- allocator_type get_allocator() const;
- const stored_allocator_type & get_stored_allocator() const;
- stored_allocator_type & get_stored_allocator() ;
- void clear() ;
- iterator begin() ;
- const_iterator begin() const;
- iterator end() ;
- const_iterator end() const;
- reverse_iterator rbegin() ;
- const_reverse_iterator rbegin() const;
- reverse_iterator rend() ;
- const_reverse_iterator rend() const;
- const_iterator cbegin() const;
- const_iterator cend() const;
- const_reverse_iterator crbegin() const;
- const_reverse_iterator crend() const;
- bool empty() const;
- size_type size() const;
- size_type max_size() const;
- void push_front(const T &) ;
- void push_front(T &&) ;
- void push_back(const T &) ;
- void push_back(T &&) ;
- void pop_front() ;
- void pop_back() ;
- reference front() ;
- const_reference front() const;
- reference back() ;
- const_reference back() const;
- void resize(size_type, const T &) ;
- void resize(size_type) ;
- void swap(ThisType &) ;
- void insert(const_iterator, size_type, const T &) ;
- template<typename InpIt> void insert(const_iterator, InpIt, InpIt) ;
- iterator insert(const_iterator, const T &) ;
- iterator insert(const_iterator, T &&) ;
- template<class... Args> void emplace_back(Args &&...) ;
- template<class... Args> void emplace_front(Args &&...) ;
- template<class... Args> iterator emplace(const_iterator, Args &&...) ;
- iterator erase(const_iterator) ;
- iterator erase(const_iterator, const_iterator) ;
- void assign(size_type, const T &) ;
- template<typename InpIt> void assign(InpIt, InpIt) ;
- void splice(iterator, ThisType &) ;
- void splice(const_iterator, ThisType &, const_iterator) ;
- void splice(const_iterator, ThisType &, const_iterator, const_iterator) ;
- void splice(const_iterator, ThisType &, const_iterator, const_iterator,
- size_type) ;
- void reverse() ;
- void remove(const T &) ;
- template<typename Pred> void remove_if(Pred) ;
- void unique() ;
- template<typename BinaryPredicate> void unique(BinaryPredicate) ;
- void merge(list< T, A > &) ;
- template<typename StrictWeakOrdering>
- void merge(list &, StrictWeakOrdering) ;
- void sort() ;
- template<typename StrictWeakOrdering> void sort(StrictWeakOrdering) ;
-};</pre></div>
+ // public member functions
+ allocator_type get_allocator() const;
+ const stored_allocator_type & get_stored_allocator() const;
+ stored_allocator_type & get_stored_allocator();
+ void clear();
+ iterator begin();
+ const_iterator begin() const;
+ iterator end();
+ const_iterator end() const;
+ reverse_iterator rbegin();
+ const_reverse_iterator rbegin() const;
+ reverse_iterator rend();
+ const_reverse_iterator rend() const;
+ const_iterator cbegin() const;
+ const_iterator cend() const;
+ const_reverse_iterator crbegin() const;
+ const_reverse_iterator crend() const;
+ bool empty() const;
+ size_type size() const;
+ size_type max_size() const;
+ void pop_front();
+ void pop_back();
+ reference front();
+ const_reference front() const;
+ reference back();
+ const_reference back() const;
+ void resize(size_type, const T &);
+ void resize(size_type);
+ void swap(ThisType &);
+ void insert(const_iterator, size_type, const T &);
+ template<typename InpIt> void insert(const_iterator, InpIt, InpIt);
+ template<class... Args> void emplace_back(Args &&...);
+ template<class... Args> void emplace_front(Args &&...);
+ template<class... Args> iterator emplace(const_iterator, Args &&...);
+ iterator erase(const_iterator);
+ iterator erase(const_iterator, const_iterator);
+ void assign(size_type, const T &);
+ template<typename InpIt> void assign(InpIt, InpIt);
+ void splice(iterator, ThisType &);
+ void splice(const_iterator, ThisType &, const_iterator);
+ void splice(const_iterator, ThisType &, const_iterator, const_iterator);
+ void splice(const_iterator, ThisType &, const_iterator, const_iterator,
+ size_type);
+ void reverse();
+ void remove(const T &);
+ template<typename Pred> void remove_if(Pred);
+ void unique();
+ template<typename BinaryPredicate> void unique(BinaryPredicate);
+ void merge(list< T, A > &);
+ template<typename StrictWeakOrdering> void merge(list &, StrictWeakOrdering);
+ void sort();
+ template<typename StrictWeakOrdering> void sort(StrictWeakOrdering);
+};</pre></div>
<div class="refsect1" lang="en">
-<a name="id492978"></a><h2>Description</h2>
+<a name="id788152"></a><h2>Description</h2>
A list is a doubly linked list. That is, it is a Sequence that supports both forward and backward traversal, and (amortized) constant time insertion and removal of elements at the beginning or the end, or in the middle. Lists have the important property that insertion and splicing do not invalidate iterators to list elements, and that even removal invalidates only the iterators that point to the elements that are removed. The ordering of iterators may be changed (that is, list<T>::iterator might have a different predecessor or successor after a list operation than it did before), but the iterators themselves will not be invalidated or made to point to different elements unless that invalidation or mutation is explicit. 
<div class="refsect2" lang="en">
-<a name="id492984"></a><h3>
+<a name="id788158"></a><h3>
<a name="boost.container.listtypes"></a><code class="computeroutput">list</code>
 public
 types</h3>
<div class="orderedlist"><ol type="1">
<li>

-typedef T <a name="boost.container.list.value_type"></a>value_type;
+typedef T <a name="boost.container.list.value_type"></a>value_type;
The type of object, T, stored in the list 
</li>
<li>

-typedef std::reverse_iterator< const_iterator > <a name="boost.container.list.const_reverse_iterator"></a>const_reverse_iterator;
+typedef std::reverse_iterator< const_iterator > <a name="boost.container.list.const_reverse_iterator"></a>const_reverse_iterator;
Iterator used to iterate backwards through a list. Const iterator used to iterate backwards through a list. 
</li>
</ol></div>
</div>
<div class="refsect2" lang="en">
-<a name="id493026"></a><h3>
+<a name="id788242"></a><h3>
<a name="boost.container.listconstruct-copy-destruct"></a><code class="computeroutput">list</code>
 public
 construct/copy/destruct</h3>
<div class="orderedlist"><ol type="1">
<li>
-<pre class="literallayout"><a name="id307706-bb"></a>list(const allocator_type & a = A());</pre>
+<pre class="literallayout"><a name="id386818-bb"></a>list(const allocator_type & a = A());</pre>
Effects: Constructs a list taking the allocator as parameter.
Throws: If allocator_type's copy constructor throws.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout"><a name="id307734-bb"></a>list(size_type n);</pre>
+<pre class="literallayout"><a name="id386846-bb"></a>list(size_type n);</pre>
Effects: Constructs a list that will use a copy of allocator a and inserts n copies of value.
Throws: If allocator_type's default constructor or copy constructor throws or T's default or copy constructor throws.
Complexity: Linear to n. 
</li>
<li>
-<pre class="literallayout"><a name="id307759-bb"></a>list(size_type n, const T & value, const A & a = A());</pre>
+<pre class="literallayout"><a name="id386871-bb"></a>list(size_type n, const T & value, const A & a = A());</pre>
Effects: Constructs a list that will use a copy of allocator a and inserts n copies of value.
Throws: If allocator_type's default constructor or copy constructor throws or T's default or copy constructor throws.
Complexity: Linear to n. 
</li>
<li>
-<pre class="literallayout"><a name="id307796-bb"></a>list(const list & x);</pre>
+<pre class="literallayout"><a name="id386908-bb"></a>list(const list & x);</pre>
Effects: Copy constructs a list.
Postcondition: x == *this.
Throws: If allocator_type's default constructor or copy constructor throws.
Complexity: Linear to the elements x contains. 
</li>
<li>
-<pre class="literallayout"><a name="id307831-bb"></a>list(list && x);</pre>
+<pre class="literallayout"><a name="id386943-bb"></a>list(list && x);</pre>
Effects: Move constructor. Moves mx's resources to *this.
Throws: If allocator_type's copy constructor throws.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">template<typename InpIt> <a name="id307858-bb"></a>list(InpIt first, InpIt last, const A & a = A());</pre>
+<pre class="literallayout">template<typename InpIt> <a name="id386970-bb"></a>list(InpIt first, InpIt last, const A & a = A());</pre>
Effects: Constructs a list that will use a copy of allocator a and inserts a copy of the range [first, last) in the list.
Throws: If allocator_type's default constructor or copy constructor throws or T's constructor taking an dereferenced InIt throws.
Complexity: Linear to the range [first, last). 
</li>
<li>
-<pre class="literallayout">list& <a name="id307922-bb"></a>operator=(const ThisType & x);</pre>
+<pre class="literallayout">list& <a name="id387034-bb"></a>operator=(const ThisType & x);</pre>
Effects: Makes *this contain the same elements as x.
Postcondition: this->size() == x.size(). *this contains a copy of each of x's elements.
Throws: If memory allocation throws or T's copy constructor throws.
Complexity: Linear to the number of elements in x. 
</li>
<li>
-<pre class="literallayout">list& <a name="id307954-bb"></a>operator=(ThisType && mx);</pre>
+<pre class="literallayout">list& <a name="id387066-bb"></a>operator=(ThisType && mx);</pre>
Effects: Move assignment. All mx's values are transferred to *this.
Postcondition: x.empty(). *this contains a the elements x had before the function.
Throws: If allocator_type's copy constructor throws.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout"><a name="id307902-bb"></a>~list();</pre>
+<pre class="literallayout"><a name="id387014-bb"></a>~list();</pre>
Effects: Destroys the list. All stored values are destroyed and used memory is deallocated.
Throws: Nothing.
Complexity: Linear to the number of elements. 
@@ -204,270 +197,232 @@
</ol></div>
</div>
<div class="refsect2" lang="en">
-<a name="id493366"></a><h3>
-<a name="id304241-bb"></a><code class="computeroutput">list</code> public member functions</h3>
+<a name="id788864"></a><h3>
+<a name="id383714-bb"></a><code class="computeroutput">list</code> public member functions</h3>
<div class="orderedlist"><ol type="1">
<li>
-<pre class="literallayout">allocator_type <a name="id304244-bb"></a>get_allocator() const;</pre>
+<pre class="literallayout">allocator_type <a name="id383716-bb"></a>get_allocator() const;</pre>
Effects: Returns a copy of the internal allocator.
Throws: If allocator's copy constructor throws.
Complexity: Constant. 
</li>
-<li><pre class="literallayout">const stored_allocator_type & <a name="id304269-bb"></a>get_stored_allocator() const;</pre></li>
-<li><pre class="literallayout">stored_allocator_type & <a name="id304275-bb"></a>get_stored_allocator() ;</pre></li>
+<li><pre class="literallayout">const stored_allocator_type & <a name="id383741-bb"></a>get_stored_allocator() const;</pre></li>
+<li><pre class="literallayout">stored_allocator_type & <a name="id383747-bb"></a>get_stored_allocator();</pre></li>
<li>
-<pre class="literallayout">void <a name="id304281-bb"></a>clear() ;</pre>
+<pre class="literallayout">void <a name="id383753-bb"></a>clear();</pre>
Effects: Erases all the elements of the list.
Throws: Nothing.
Complexity: Linear to the number of elements in the list. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id304306-bb"></a>begin() ;</pre>
+<pre class="literallayout">iterator <a name="id385222-bb"></a>begin();</pre>
Effects: Returns an iterator to the first element contained in the list.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_iterator <a name="id304331-bb"></a>begin() const;</pre>
+<pre class="literallayout">const_iterator <a name="id385247-bb"></a>begin() const;</pre>
Effects: Returns a const_iterator to the first element contained in the list.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id304356-bb"></a>end() ;</pre>
+<pre class="literallayout">iterator <a name="id385272-bb"></a>end();</pre>
Effects: Returns an iterator to the end of the list.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_iterator <a name="id304382-bb"></a>end() const;</pre>
+<pre class="literallayout">const_iterator <a name="id385298-bb"></a>end() const;</pre>
Effects: Returns a const_iterator to the end of the list.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">reverse_iterator <a name="id304407-bb"></a>rbegin() ;</pre>
+<pre class="literallayout">reverse_iterator <a name="id385323-bb"></a>rbegin();</pre>
Effects: Returns a reverse_iterator pointing to the beginning of the reversed list.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_reverse_iterator <a name="id304432-bb"></a>rbegin() const;</pre>
+<pre class="literallayout">const_reverse_iterator <a name="id385348-bb"></a>rbegin() const;</pre>
Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed list.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">reverse_iterator <a name="id304457-bb"></a>rend() ;</pre>
+<pre class="literallayout">reverse_iterator <a name="id385373-bb"></a>rend();</pre>
Effects: Returns a reverse_iterator pointing to the end of the reversed list.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_reverse_iterator <a name="id304482-bb"></a>rend() const;</pre>
+<pre class="literallayout">const_reverse_iterator <a name="id385398-bb"></a>rend() const;</pre>
Effects: Returns a const_reverse_iterator pointing to the end of the reversed list.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_iterator <a name="id304508-bb"></a>cbegin() const;</pre>
+<pre class="literallayout">const_iterator <a name="id385424-bb"></a>cbegin() const;</pre>
Effects: Returns a const_iterator to the first element contained in the list.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_iterator <a name="id304533-bb"></a>cend() const;</pre>
+<pre class="literallayout">const_iterator <a name="id385449-bb"></a>cend() const;</pre>
Effects: Returns a const_iterator to the end of the list.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_reverse_iterator <a name="id304558-bb"></a>crbegin() const;</pre>
+<pre class="literallayout">const_reverse_iterator <a name="id385474-bb"></a>crbegin() const;</pre>
Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed list.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_reverse_iterator <a name="id304583-bb"></a>crend() const;</pre>
+<pre class="literallayout">const_reverse_iterator <a name="id385499-bb"></a>crend() const;</pre>
Effects: Returns a const_reverse_iterator pointing to the end of the reversed list.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">bool <a name="id304608-bb"></a>empty() const;</pre>
+<pre class="literallayout">bool <a name="id385524-bb"></a>empty() const;</pre>
Effects: Returns true if the list contains no elements.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">size_type <a name="id304634-bb"></a>size() const;</pre>
+<pre class="literallayout">size_type <a name="id385550-bb"></a>size() const;</pre>
Effects: Returns the number of the elements contained in the list.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">size_type <a name="id304660-bb"></a>max_size() const;</pre>
+<pre class="literallayout">size_type <a name="id385576-bb"></a>max_size() const;</pre>
Effects: Returns the largest possible size of the list.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">void <a name="id304685-bb"></a>push_front(const T & x) ;</pre>
-Effects: Inserts a copy of t in the beginning of the list.
-Throws: If memory allocation throws or T's copy constructor throws.
-Complexity: Amortized constant time. 
-</li>
-<li>
-<pre class="literallayout">void <a name="id304716-bb"></a>push_front(T && x) ;</pre>
-Effects: Constructs a new element in the beginning of the list and moves the resources of t to this new element.
-Throws: If memory allocation throws.
-Complexity: Amortized constant time. 
-</li>
-<li>
-<pre class="literallayout">void <a name="id304746-bb"></a>push_back(const T & x) ;</pre>
-Effects: Removes the last element from the list.
-Throws: Nothing.
-Complexity: Amortized constant time. 
-</li>
-<li>
-<pre class="literallayout">void <a name="id304776-bb"></a>push_back(T && x) ;</pre>
+<pre class="literallayout">void <a name="id385601-bb"></a>pop_front();</pre>
Effects: Removes the first element from the list.
Throws: Nothing.
Complexity: Amortized constant time. 
</li>
<li>
-<pre class="literallayout">void <a name="id304806-bb"></a>pop_front() ;</pre>
-Effects: Removes the first element from the list.
-Throws: Nothing.
-Complexity: Amortized constant time. 
-</li>
-<li>
-<pre class="literallayout">void <a name="id304832-bb"></a>pop_back() ;</pre>
+<pre class="literallayout">void <a name="id385626-bb"></a>pop_back();</pre>
Effects: Removes the last element from the list.
Throws: Nothing.
Complexity: Amortized constant time. 
</li>
<li>
-<pre class="literallayout">reference <a name="id304857-bb"></a>front() ;</pre>
+<pre class="literallayout">reference <a name="id385652-bb"></a>front();</pre>
Requires: !empty()
Effects: Returns a reference to the first element from the beginning of the container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_reference <a name="id304888-bb"></a>front() const;</pre>
+<pre class="literallayout">const_reference <a name="id385683-bb"></a>front() const;</pre>
Requires: !empty()
Effects: Returns a const reference to the first element from the beginning of the container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">reference <a name="id304919-bb"></a>back() ;</pre>
+<pre class="literallayout">reference <a name="id385714-bb"></a>back();</pre>
Requires: !empty()
Effects: Returns a reference to the first element from the beginning of the container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_reference <a name="id304950-bb"></a>back() const;</pre>
+<pre class="literallayout">const_reference <a name="id385745-bb"></a>back() const;</pre>
Requires: !empty()
Effects: Returns a const reference to the first element from the beginning of the container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">void <a name="id304982-bb"></a>resize(size_type new_size, const T & x) ;</pre>
+<pre class="literallayout">void <a name="id385776-bb"></a>resize(size_type new_size, const T & x);</pre>
Effects: Inserts or erases elements at the end such that the size becomes n. New elements are copy constructed from x.
Throws: If memory allocation throws, or T's copy constructor throws.
Complexity: Linear to the difference between size() and new_size. 
</li>
<li>
-<pre class="literallayout">void <a name="id305019-bb"></a>resize(size_type new_size) ;</pre>
+<pre class="literallayout">void <a name="id385814-bb"></a>resize(size_type new_size);</pre>
Effects: Inserts or erases elements at the end such that the size becomes n. New elements are default constructed.
Throws: If memory allocation throws, or T's copy constructor throws.
Complexity: Linear to the difference between size() and new_size. 
</li>
<li>
-<pre class="literallayout">void <a name="id305051-bb"></a>swap(ThisType & x) ;</pre>
+<pre class="literallayout">void <a name="id385846-bb"></a>swap(ThisType & x);</pre>
Effects: Swaps the contents of *this and x. If this->allocator_type() != x.allocator_type() allocators are also swapped.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">void <a name="id305081-bb"></a>insert(const_iterator p, size_type n, const T & x) ;</pre>
+<pre class="literallayout">void <a name="id385876-bb"></a>insert(const_iterator p, size_type n, const T & x);</pre>
Requires: p must be a valid iterator of *this.
Effects: Inserts n copies of x before p.
Throws: If memory allocation throws or T's copy constructor throws.
Complexity: Linear to n. 
</li>
<li>
-<pre class="literallayout">template<typename InpIt>
- void <a name="id305128-bb"></a>insert(const_iterator p, InpIt first, InpIt last) ;</pre>
+<pre class="literallayout">template<typename InpIt>
+ void <a name="id385923-bb"></a>insert(const_iterator p, InpIt first, InpIt last);</pre>
Requires: p must be a valid iterator of *this.
Effects: Insert a copy of the [first, last) range before p.
Throws: If memory allocation throws, T's constructor from a dereferenced InpIt throws.
Complexity: Linear to std::distance [first, last). 
</li>
<li>
-<pre class="literallayout">iterator <a name="id305180-bb"></a>insert(const_iterator position, const T & x) ;</pre>
-Requires: p must be a valid iterator of *this.
-Effects: Insert a copy of x before p.
-Throws: If memory allocation throws or x's copy constructor throws.
-Complexity: Amortized constant time. 
-</li>
-<li>
-<pre class="literallayout">iterator <a name="id305222-bb"></a>insert(const_iterator p, T && x) ;</pre>
-Requires: p must be a valid iterator of *this.
-Effects: Insert a new element before p with mx's resources.
-Throws: If memory allocation throws.
-Complexity: Amortized constant time. 
-</li>
-<li>
-<pre class="literallayout">template<class... Args> void <a name="id305262-bb"></a>emplace_back(Args &&... args) ;</pre>
+<pre class="literallayout">template<class... Args> void <a name="id385974-bb"></a>emplace_back(Args &&... args);</pre>
Effects: Inserts an object of type T constructed with std::forward<Args>(args)... in the end of the list.
Throws: If memory allocation throws or T's in-place constructor throws.
Complexity: Constant 
</li>
<li>
-<pre class="literallayout">template<class... Args> void <a name="id305301-bb"></a>emplace_front(Args &&... args) ;</pre>
+<pre class="literallayout">template<class... Args> void <a name="id386013-bb"></a>emplace_front(Args &&... args);</pre>
Effects: Inserts an object of type T constructed with std::forward<Args>(args)... in the beginning of the list.
Throws: If memory allocation throws or T's in-place constructor throws.
Complexity: Constant 
</li>
<li>
-<pre class="literallayout">template<class... Args> iterator <a name="id305339-bb"></a>emplace(const_iterator p, Args &&... args) ;</pre>
+<pre class="literallayout">template<class... Args> iterator <a name="id386051-bb"></a>emplace(const_iterator p, Args &&... args);</pre>
Effects: Inserts an object of type T constructed with std::forward<Args>(args)... before p.
Throws: If memory allocation throws or T's in-place constructor throws.
Complexity: Constant 
</li>
<li>
-<pre class="literallayout">iterator <a name="id305382-bb"></a>erase(const_iterator p) ;</pre>
+<pre class="literallayout">iterator <a name="id386094-bb"></a>erase(const_iterator p);</pre>
Requires: p must be a valid iterator of *this.
Effects: Erases the element at p p.
Throws: Nothing.
Complexity: Amortized constant time. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id305418-bb"></a>erase(const_iterator first, const_iterator last) ;</pre>
+<pre class="literallayout">iterator <a name="id386130-bb"></a>erase(const_iterator first, const_iterator last);</pre>
Requires: first and last must be valid iterator to elements in *this.
Effects: Erases the elements pointed by [first, last).
Throws: Nothing.
Complexity: Linear to the distance between first and last. 
</li>
<li>
-<pre class="literallayout">void <a name="id305460-bb"></a>assign(size_type n, const T & val) ;</pre>
+<pre class="literallayout">void <a name="id386172-bb"></a>assign(size_type n, const T & val);</pre>
Effects: Assigns the n copies of val to *this.
Throws: If memory allocation throws or T's copy constructor throws.
Complexity: Linear to n. 
</li>
<li>
-<pre class="literallayout">template<typename InpIt> void <a name="id305496-bb"></a>assign(InpIt first, InpIt last) ;</pre>
+<pre class="literallayout">template<typename InpIt> void <a name="id386208-bb"></a>assign(InpIt first, InpIt last);</pre>
Effects: Assigns the the range [first, last) to *this.
Throws: If memory allocation throws or T's constructor from dereferencing InpIt throws.
Complexity: Linear to n. 
</li>
<li>
-<pre class="literallayout">void <a name="id305537-bb"></a>splice(iterator p, ThisType & x) ;</pre>
+<pre class="literallayout">void <a name="id386249-bb"></a>splice(iterator p, ThisType & x);</pre>
Requires: p must point to an element contained by the list. x != *this
Effects: Transfers all the elements of list x to this list, before the the element pointed by p. No destructors or copy constructors are called.
Throws: std::runtime_error if this' allocator and x's allocator are not equal.
@@ -475,7 +430,7 @@
Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated. 
</li>
<li>
-<pre class="literallayout">void <a name="id305585-bb"></a>splice(const_iterator p, ThisType & x, const_iterator i) ;</pre>
+<pre class="literallayout">void <a name="id386297-bb"></a>splice(const_iterator p, ThisType & x, const_iterator i);</pre>
Requires: p must point to an element contained by this list. i must point to an element contained in list x.
Effects: Transfers the value pointed by i, from list x to this list, before the the element pointed by p. No destructors or copy constructors are called. If p == i or p == ++i, this function is a null operation.
Throws: std::runtime_error if this' allocator and x's allocator are not equal.
@@ -483,8 +438,8 @@
Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated. 
</li>
<li>
-<pre class="literallayout">void <a name="id305637-bb"></a>splice(const_iterator p, ThisType & x, const_iterator first,
- const_iterator last) ;</pre>
+<pre class="literallayout">void <a name="id386349-bb"></a>splice(const_iterator p, ThisType & x, const_iterator first,
+ const_iterator last);</pre>
Requires: p must point to an element contained by this list. first and last must point to elements contained in list x.
Effects: Transfers the range pointed by first and last from list x to this list, before the the element pointed by p. No destructors or copy constructors are called.
Throws: std::runtime_error if this' allocator and x's allocator are not equal.
@@ -492,8 +447,8 @@
Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated. 
</li>
<li>
-<pre class="literallayout">void <a name="id305693-bb"></a>splice(const_iterator p, ThisType & x, const_iterator first,
- const_iterator last, size_type n) ;</pre>
+<pre class="literallayout">void <a name="id386405-bb"></a>splice(const_iterator p, ThisType & x, const_iterator first,
+ const_iterator last, size_type n);</pre>
Requires: p must point to an element contained by this list. first and last must point to elements contained in list x. n == std::distance(first, last)
Effects: Transfers the range pointed by first and last from list x to this list, before the the element pointed by p. No destructors or copy constructors are called.
Throws: std::runtime_error if this' allocator and x's allocator are not equal.
@@ -501,50 +456,50 @@
Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated. 
</li>
<li>
-<pre class="literallayout">void <a name="id307354-bb"></a>reverse() ;</pre>
+<pre class="literallayout">void <a name="id386466-bb"></a>reverse();</pre>
Effects: Reverses the order of elements in the list.
Throws: Nothing.
Complexity: This function is linear time.
Note: Iterators and references are not invalidated 
</li>
<li>
-<pre class="literallayout">void <a name="id307386-bb"></a>remove(const T & value) ;</pre>
+<pre class="literallayout">void <a name="id386498-bb"></a>remove(const T & value);</pre>
Effects: Removes all the elements that compare equal to value.
Throws: Nothing.
Complexity: Linear time. It performs exactly size() comparisons for equality.
Note: The relative order of elements that are not removed is unchanged, and iterators to elements that are not removed remain valid. 
</li>
<li>
-<pre class="literallayout">template<typename Pred> void <a name="id307422-bb"></a>remove_if(Pred pred) ;</pre>
+<pre class="literallayout">template<typename Pred> void <a name="id386534-bb"></a>remove_if(Pred pred);</pre>
Effects: Removes all the elements for which a specified predicate is satisfied.
Throws: If pred throws.
Complexity: Linear time. It performs exactly size() calls to the predicate.
Note: The relative order of elements that are not removed is unchanged, and iterators to elements that are not removed remain valid. 
</li>
<li>
-<pre class="literallayout">void <a name="id307464-bb"></a>unique() ;</pre>
+<pre class="literallayout">void <a name="id386576-bb"></a>unique();</pre>
Effects: Removes adjacent duplicate elements or adjacent elements that are equal from the list.
Throws: Nothing.
Complexity: Linear time (size()-1 comparisons calls to pred()).
Note: The relative order of elements that are not removed is unchanged, and iterators to elements that are not removed remain valid. 
</li>
<li>
-<pre class="literallayout">template<typename BinaryPredicate> void <a name="id307495-bb"></a>unique(BinaryPredicate binary_pred) ;</pre>
+<pre class="literallayout">template<typename BinaryPredicate> void <a name="id386607-bb"></a>unique(BinaryPredicate binary_pred);</pre>
Effects: Removes adjacent duplicate elements or adjacent elements that satisfy some binary predicate from the list.
Throws: If pred throws.
Complexity: Linear time (size()-1 comparisons equality comparisons).
Note: The relative order of elements that are not removed is unchanged, and iterators to elements that are not removed remain valid. 
</li>
<li>
-<pre class="literallayout">void <a name="id307538-bb"></a>merge(list< T, A > & x) ;</pre>
+<pre class="literallayout">void <a name="id386650-bb"></a>merge(list< T, A > & x);</pre>
Requires: The lists x and *this must be distinct.
Effects: This function removes all of x's elements and inserts them in order into *this according to std::less<value_type>. The merge is stable; that is, if an element from *this is equivalent to one from x, then the element from *this will precede the one from x.
Throws: Nothing.
Complexity: This function is linear time: it performs at most size() + x.size() - 1 comparisons. 
</li>
<li>
-<pre class="literallayout">template<typename StrictWeakOrdering>
- void <a name="id307576-bb"></a>merge(list & x, StrictWeakOrdering comp) ;</pre>
+<pre class="literallayout">template<typename StrictWeakOrdering>
+ void <a name="id386688-bb"></a>merge(list & x, StrictWeakOrdering comp);</pre>
Requires: p must be a comparison function that induces a strict weak ordering and both *this and x must be sorted according to that ordering The lists x and *this must be distinct.
Effects: This function removes all of x's elements and inserts them in order into *this. The merge is stable; that is, if an element from *this is equivalent to one from x, then the element from *this will precede the one from x.
Throws: Nothing.
@@ -552,14 +507,14 @@
Note: Iterators and references to *this are not invalidated. 
</li>
<li>
-<pre class="literallayout">void <a name="id307633-bb"></a>sort() ;</pre>
+<pre class="literallayout">void <a name="id386745-bb"></a>sort();</pre>
Effects: This function sorts the list *this according to std::less<value_type>. The sort is stable, that is, the relative order of equivalent elements is preserved.
Throws: Nothing.
Notes: Iterators and references are not invalidated.
Complexity: The number of comparisons is approximately N log N, where N is the list's size. 
</li>
<li>
-<pre class="literallayout">template<typename StrictWeakOrdering> void <a name="id307664-bb"></a>sort(StrictWeakOrdering comp) ;</pre>
+<pre class="literallayout">template<typename StrictWeakOrdering> void <a name="id386776-bb"></a>sort(StrictWeakOrdering comp);</pre>
Effects: This function sorts the list *this according to std::less<value_type>. The sort is stable, that is, the relative order of equivalent elements is preserved.
Throws: Nothing.
Notes: Iterators and references are not invalidated.
@@ -571,7 +526,7 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2009 -2010 Ion Gaztanaga
+<td align="right"><div class="copyright-footer">Copyright © 2009 -2011 Ion Gaztanaga
 Distributed under the Boost Software License, Version 1.0. (See accompanying
 file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
@@ -579,7 +534,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="flat_multiset.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.list_hpp"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="map.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="flat_multiset.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.list_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="map.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>

Modified: sandbox/move/libs/container/doc/html/boost/container/map.html
==============================================================================
--- sandbox/move/libs/container/doc/html/boost/container/map.html (original)
+++ sandbox/move/libs/container/doc/html/boost/container/map.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
@@ -1,10 +1,10 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Class template map</title>
-<link rel="stylesheet" href="../../boostbook.css" type="text/css">
+<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
-<link rel="start" href="../../index.html" title="Chapter 1. Boost.Container">
+<link rel="start" href="../../index.html" title="Chapter 1. Boost.Container">
<link rel="up" href="../../boost_container_reference.html#header.boost.container.map_hpp" title="Header <boost/container/map.hpp>">
<link rel="prev" href="list.html" title="Class template list">
<link rel="next" href="multimap.html" title="Class template multimap">
@@ -20,7 +20,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="list.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.map_hpp"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="multimap.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="list.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.map_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="multimap.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="refentry" lang="en">
<a name="boost.container.map"></a><div class="titlepage"></div>
@@ -29,411 +29,411 @@
boost::container::map — 
</div>
<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2>
-<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/container/map.hpp>
+<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/container/map.hpp>

-template<typename Key, typename T, typename Pred, typename Alloc>
-class map {
-public:
- // types
- typedef tree_t::key_type <a name="boost.container.map.key_type"></a>key_type;
- typedef tree_t::value_type <a name="boost.container.map.value_type"></a>value_type;
- typedef tree_t::pointer <a name="boost.container.map.pointer"></a>pointer;
- typedef tree_t::const_pointer <a name="boost.container.map.const_pointer"></a>const_pointer;
- typedef tree_t::reference <a name="boost.container.map.reference"></a>reference;
- typedef tree_t::const_reference <a name="boost.container.map.const_reference"></a>const_reference;
- typedef T <a name="boost.container.map.mapped_type"></a>mapped_type;
- typedef Pred <a name="boost.container.map.key_compare"></a>key_compare;
- typedef tree_t::iterator <a name="boost.container.map.iterator"></a>iterator;
- typedef tree_t::const_iterator <a name="boost.container.map.const_iterator"></a>const_iterator;
- typedef tree_t::reverse_iterator <a name="boost.container.map.reverse_iterator"></a>reverse_iterator;
- typedef tree_t::const_reverse_iterator <a name="boost.container.map.const_reverse_iterator"></a>const_reverse_iterator;
- typedef tree_t::size_type <a name="boost.container.map.size_type"></a>size_type;
- typedef tree_t::difference_type <a name="boost.container.map.difference_type"></a>difference_type;
- typedef tree_t::allocator_type <a name="boost.container.map.allocator_type"></a>allocator_type;
- typedef tree_t::stored_allocator_type <a name="boost.container.map.stored_allocator_type"></a>stored_allocator_type;
- typedef std::pair< key_type, mapped_type > <a name="boost.container.map.nonconst_value_type"></a>nonconst_value_type;
- typedef unspecified <a name="boost.container.map.nonconst_impl_value_type"></a>nonconst_impl_value_type;
- typedef value_compare_impl <a name="boost.container.map.value_compare"></a>value_compare;
+template<typename Key, typename T, typename Pred, typename Alloc>
+class map {
+public:
+ // types
+ typedef tree_t::key_type <a name="boost.container.map.key_type"></a>key_type;
+ typedef tree_t::value_type <a name="boost.container.map.value_type"></a>value_type;
+ typedef tree_t::pointer <a name="boost.container.map.pointer"></a>pointer;
+ typedef tree_t::const_pointer <a name="boost.container.map.const_pointer"></a>const_pointer;
+ typedef tree_t::reference <a name="boost.container.map.reference"></a>reference;
+ typedef tree_t::const_reference <a name="boost.container.map.const_reference"></a>const_reference;
+ typedef T <a name="boost.container.map.mapped_type"></a>mapped_type;
+ typedef Pred <a name="boost.container.map.key_compare"></a>key_compare;
+ typedef tree_t::iterator <a name="boost.container.map.iterator"></a>iterator;
+ typedef tree_t::const_iterator <a name="boost.container.map.const_iterator"></a>const_iterator;
+ typedef tree_t::reverse_iterator <a name="boost.container.map.reverse_iterator"></a>reverse_iterator;
+ typedef tree_t::const_reverse_iterator <a name="boost.container.map.const_reverse_iterator"></a>const_reverse_iterator;
+ typedef tree_t::size_type <a name="boost.container.map.size_type"></a>size_type;
+ typedef tree_t::difference_type <a name="boost.container.map.difference_type"></a>difference_type;
+ typedef tree_t::allocator_type <a name="boost.container.map.allocator_type"></a>allocator_type;
+ typedef tree_t::stored_allocator_type <a name="boost.container.map.stored_allocator_type"></a>stored_allocator_type;
+ typedef std::pair< key_type, mapped_type > <a name="boost.container.map.nonconst_value_type"></a>nonconst_value_type;
+ typedef unspecified <a name="boost.container.map.nonconst_impl_value_type"></a>nonconst_impl_value_type;
+ typedef value_compare_impl <a name="boost.container.map.value_compare"></a>value_compare;

- // construct/copy/destruct
- map(const Pred & = Pred(), const allocator_type & = allocator_type());
- template<typename InputIterator>
- map(InputIterator, InputIterator, const Pred & = Pred(),
- const allocator_type & = allocator_type());
- template<typename InputIterator>
- map(ordered_unique_range_t, InputIterator, InputIterator,
- const Pred & = Pred(), const allocator_type & = allocator_type());
- map(const map< Key, T, Pred, Alloc > &);
- map(map &&);
- map& operator=(const map &);
- map& operator=(map &&);
+ // construct/copy/destruct
+ map(const Pred & = Pred(), const allocator_type & = allocator_type());
+ template<typename InputIterator>
+ map(InputIterator, InputIterator, const Pred & = Pred(),
+ const allocator_type & = allocator_type());
+ template<typename InputIterator>
+ map(ordered_unique_range_t, InputIterator, InputIterator,
+ const Pred & = Pred(), const allocator_type & = allocator_type());
+ map(const map< Key, T, Pred, Alloc > &);
+ map(map &&);
+ map& operator=(const map &);
+ map& operator=(map &&);

- // public member functions
- key_compare key_comp() const;
- value_compare value_comp() const;
- allocator_type get_allocator() const;
- const stored_allocator_type & get_stored_allocator() const;
- stored_allocator_type & get_stored_allocator() ;
- iterator begin() ;
- const_iterator begin() const;
- iterator end() ;
- const_iterator end() const;
- reverse_iterator rbegin() ;
- const_reverse_iterator rbegin() const;
- reverse_iterator rend() ;
- const_reverse_iterator rend() const;
- bool empty() const;
- size_type size() const;
- size_type max_size() const;
- T & operator[](const key_type &) ;
- T & operator[](key_type &&) ;
- T & at(const key_type &) ;
- const T & at(const key_type &) const;
- void swap(map &) ;
- std::pair< iterator, bool > insert(const value_type &) ;
- std::pair< iterator, bool > insert(const nonconst_value_type &) ;
- std::pair< iterator, bool > insert(nonconst_value_type &&) ;
- std::pair< iterator, bool > insert(nonconst_impl_value_type &&) ;
- std::pair< iterator, bool > insert(value_type &&) ;
- iterator insert(iterator, const value_type &) ;
- iterator insert(iterator, nonconst_value_type &&) ;
- iterator insert(iterator, nonconst_impl_value_type &&) ;
- iterator insert(iterator, const nonconst_value_type &) ;
- iterator insert(iterator, value_type &&) ;
- template<typename InputIterator> void insert(InputIterator, InputIterator) ;
- template<class... Args> iterator emplace(Args &&...) ;
- template<class... Args> iterator emplace_hint(const_iterator, Args &&...) ;
- iterator erase(const_iterator) ;
- size_type erase(const key_type &) ;
- iterator erase(const_iterator, const_iterator) ;
- void clear() ;
- iterator find(const key_type &) ;
- const_iterator find(const key_type &) const;
- size_type count(const key_type &) const;
- iterator lower_bound(const key_type &) ;
- const_iterator lower_bound(const key_type &) const;
- iterator upper_bound(const key_type &) ;
- const_iterator upper_bound(const key_type &) const;
- std::pair< iterator, iterator > equal_range(const key_type &) ;
- std::pair< const_iterator, const_iterator >
- equal_range(const key_type &) const;
-};</pre></div>
+ // public member functions
+ key_compare key_comp() const;
+ value_compare value_comp() const;
+ allocator_type get_allocator() const;
+ const stored_allocator_type & get_stored_allocator() const;
+ stored_allocator_type & get_stored_allocator();
+ iterator begin();
+ const_iterator begin() const;
+ iterator end();
+ const_iterator end() const;
+ reverse_iterator rbegin();
+ const_reverse_iterator rbegin() const;
+ reverse_iterator rend();
+ const_reverse_iterator rend() const;
+ bool empty() const;
+ size_type size() const;
+ size_type max_size() const;
+ T & operator[](const key_type &);
+ T & operator[](key_type &&);
+ T & at(const key_type &);
+ const T & at(const key_type &) const;
+ void swap(map &);
+ std::pair< iterator, bool > insert(const value_type &);
+ std::pair< iterator, bool > insert(const nonconst_value_type &);
+ std::pair< iterator, bool > insert(nonconst_value_type &&);
+ std::pair< iterator, bool > insert(nonconst_impl_value_type &&);
+ std::pair< iterator, bool > insert(value_type &&);
+ iterator insert(iterator, const value_type &);
+ iterator insert(iterator, nonconst_value_type &&);
+ iterator insert(iterator, nonconst_impl_value_type &&);
+ iterator insert(iterator, const nonconst_value_type &);
+ iterator insert(iterator, value_type &&);
+ template<typename InputIterator> void insert(InputIterator, InputIterator);
+ template<class... Args> iterator emplace(Args &&...);
+ template<class... Args> iterator emplace_hint(const_iterator, Args &&...);
+ iterator erase(const_iterator);
+ size_type erase(const key_type &);
+ iterator erase(const_iterator, const_iterator);
+ void clear();
+ iterator find(const key_type &);
+ const_iterator find(const key_type &) const;
+ size_type count(const key_type &) const;
+ iterator lower_bound(const key_type &);
+ const_iterator lower_bound(const key_type &) const;
+ iterator upper_bound(const key_type &);
+ const_iterator upper_bound(const key_type &) const;
+ std::pair< iterator, iterator > equal_range(const key_type &);
+ std::pair< const_iterator, const_iterator >
+ equal_range(const key_type &) const;
+};</pre></div>
<div class="refsect1" lang="en">
-<a name="id499592"></a><h2>Description</h2>
+<a name="id800948"></a><h2>Description</h2>
A map is a kind of associative container that supports unique keys (contains at most one of each key value) and provides for fast retrieval of values of another type T based on the keys. The map class supports bidirectional iterators.
A map satisfies all of the requirements of a container and of a reversible container and of an associative container. For a map<Key,T> the key_type is Key and the value_type is std::pair<const Key,T>.
-Pred is the ordering function for Keys (e.g. std::less<Key>).
-Alloc is the allocator to allocate the value_types (e.g. allocator< std::pair<const Key, T> > ). 
+Pred is the ordering function for Keys (e.g. std::less<Key>).
+Alloc is the allocator to allocate the value_types (e.g. allocator< std::pair<const Key, T> > ). 
<div class="refsect2" lang="en">
-<a name="id499605"></a><h3>
+<a name="id800970"></a><h3>
<a name="boost.container.mapconstruct-copy-destruct"></a><code class="computeroutput">map</code>
 public
 construct/copy/destruct</h3>
<div class="orderedlist"><ol type="1">
<li>
-<pre class="literallayout"><a name="id309781-bb"></a>map(const Pred & comp = Pred(), const allocator_type & a = allocator_type());</pre>
+<pre class="literallayout"><a name="id389446-bb"></a>map(const Pred & comp = Pred(), const allocator_type & a = allocator_type());</pre>
Effects: Constructs an empty map using the specified comparison object and allocator.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">template<typename InputIterator>
- <a name="id309810-bb"></a>map(InputIterator first, InputIterator last, const Pred & comp = Pred(),
- const allocator_type & a = allocator_type());</pre>
+<pre class="literallayout">template<typename InputIterator>
+ <a name="id389475-bb"></a>map(InputIterator first, InputIterator last, const Pred & comp = Pred(),
+ const allocator_type & a = allocator_type());</pre>
Effects: Constructs an empty map using the specified comparison object and allocator, and inserts elements from the range [first ,last ).
Complexity: Linear in N if the range [first ,last ) is already sorted using comp and otherwise N logN, where N is last - first. 
</li>
<li>
-<pre class="literallayout">template<typename InputIterator>
- <a name="id309854-bb"></a>map(ordered_unique_range_t, InputIterator first, InputIterator last,
- const Pred & comp = Pred(),
- const allocator_type & a = allocator_type());</pre>
+<pre class="literallayout">template<typename InputIterator>
+ <a name="id389519-bb"></a>map(ordered_unique_range_t, InputIterator first, InputIterator last,
+ const Pred & comp = Pred(),
+ const allocator_type & a = allocator_type());</pre>
Effects: Constructs an empty map using the specified comparison object and allocator, and inserts elements from the ordered unique range [first ,last). This function is more efficient than the normal range creation for ordered ranges.
Requires: [first ,last) must be ordered according to the predicate and must be unique values.
Complexity: Linear in N. 
</li>
<li>
-<pre class="literallayout"><a name="id309909-bb"></a>map(const map< Key, T, Pred, Alloc > & x);</pre>
+<pre class="literallayout"><a name="id389575-bb"></a>map(const map< Key, T, Pred, Alloc > & x);</pre>
Effects: Copy constructs a map.
Complexity: Linear in x.size(). 
</li>
<li>
-<pre class="literallayout"><a name="id309932-bb"></a>map(map && x);</pre>
+<pre class="literallayout"><a name="id389597-bb"></a>map(map && x);</pre>
Effects: Move constructs a map. Constructs *this using x's resources.
Complexity: Construct.
Postcondition: x is emptied. 
</li>
<li>
-<pre class="literallayout">map& <a name="id309961-bb"></a>operator=(const map & x);</pre>
+<pre class="literallayout">map& <a name="id389626-bb"></a>operator=(const map & x);</pre>
Effects: Makes *this a copy of x.
Complexity: Linear in x.size(). 
</li>
<li>
-<pre class="literallayout">map& <a name="id309984-bb"></a>operator=(map && x);</pre>
+<pre class="literallayout">map& <a name="id389649-bb"></a>operator=(map && x);</pre>
Effects: this->swap(x.get()).
Complexity: Constant. 
</li>
</ol></div>
</div>
<div class="refsect2" lang="en">
-<a name="id499872"></a><h3>
-<a name="id308334-bb"></a><code class="computeroutput">map</code> public member functions</h3>
+<a name="id802163"></a><h3>
+<a name="id388213-bb"></a><code class="computeroutput">map</code> public member functions</h3>
<div class="orderedlist"><ol type="1">
<li>
-<pre class="literallayout">key_compare <a name="id308336-bb"></a>key_comp() const;</pre>
+<pre class="literallayout">key_compare <a name="id388215-bb"></a>key_comp() const;</pre>
Effects: Returns the comparison object out of which a was constructed.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">value_compare <a name="id308356-bb"></a>value_comp() const;</pre>
+<pre class="literallayout">value_compare <a name="id388235-bb"></a>value_comp() const;</pre>
Effects: Returns an object of value_compare constructed out of the comparison object.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">allocator_type <a name="id308376-bb"></a>get_allocator() const;</pre>
+<pre class="literallayout">allocator_type <a name="id388255-bb"></a>get_allocator() const;</pre>
Effects: Returns a copy of the Allocator that was passed to the object's constructor.
Complexity: Constant. 
</li>
-<li><pre class="literallayout">const stored_allocator_type & <a name="id308395-bb"></a>get_stored_allocator() const;</pre></li>
-<li><pre class="literallayout">stored_allocator_type & <a name="id308401-bb"></a>get_stored_allocator() ;</pre></li>
+<li><pre class="literallayout">const stored_allocator_type & <a name="id388274-bb"></a>get_stored_allocator() const;</pre></li>
+<li><pre class="literallayout">stored_allocator_type & <a name="id388280-bb"></a>get_stored_allocator();</pre></li>
<li>
-<pre class="literallayout">iterator <a name="id308407-bb"></a>begin() ;</pre>
+<pre class="literallayout">iterator <a name="id388286-bb"></a>begin();</pre>
Effects: Returns an iterator to the first element contained in the container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_iterator <a name="id308432-bb"></a>begin() const;</pre>
+<pre class="literallayout">const_iterator <a name="id388311-bb"></a>begin() const;</pre>
Effects: Returns a const_iterator to the first element contained in the container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id308457-bb"></a>end() ;</pre>
+<pre class="literallayout">iterator <a name="id388336-bb"></a>end();</pre>
Effects: Returns an iterator to the end of the container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_iterator <a name="id308482-bb"></a>end() const;</pre>
+<pre class="literallayout">const_iterator <a name="id388361-bb"></a>end() const;</pre>
Effects: Returns a const_iterator to the end of the container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">reverse_iterator <a name="id308508-bb"></a>rbegin() ;</pre>
+<pre class="literallayout">reverse_iterator <a name="id388387-bb"></a>rbegin();</pre>
Effects: Returns a reverse_iterator pointing to the beginning of the reversed container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_reverse_iterator <a name="id308533-bb"></a>rbegin() const;</pre>
+<pre class="literallayout">const_reverse_iterator <a name="id388412-bb"></a>rbegin() const;</pre>
Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">reverse_iterator <a name="id308558-bb"></a>rend() ;</pre>
+<pre class="literallayout">reverse_iterator <a name="id388437-bb"></a>rend();</pre>
Effects: Returns a reverse_iterator pointing to the end of the reversed container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_reverse_iterator <a name="id308583-bb"></a>rend() const;</pre>
+<pre class="literallayout">const_reverse_iterator <a name="id388462-bb"></a>rend() const;</pre>
Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">bool <a name="id308608-bb"></a>empty() const;</pre>
+<pre class="literallayout">bool <a name="id388487-bb"></a>empty() const;</pre>
Effects: Returns true if the container contains no elements.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">size_type <a name="id308634-bb"></a>size() const;</pre>
+<pre class="literallayout">size_type <a name="id388513-bb"></a>size() const;</pre>
Effects: Returns the number of the elements contained in the container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">size_type <a name="id308659-bb"></a>max_size() const;</pre>
+<pre class="literallayout">size_type <a name="id388538-bb"></a>max_size() const;</pre>
Effects: Returns the largest possible size of the container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">T & <a name="id308684-bb"></a>operator[](const key_type & k) ;</pre>
+<pre class="literallayout">T & <a name="id388563-bb"></a>operator[](const key_type & k);</pre>
Effects: If there is no key equivalent to x in the map, inserts value_type(x, T()) into the map.
Returns: A reference to the mapped_type corresponding to x in *this.
Complexity: Logarithmic. 
</li>
<li>
-<pre class="literallayout">T & <a name="id308703-bb"></a>operator[](key_type && mk) ;</pre>
-Effects: If there is no key equivalent to x in the map, inserts value_type(BOOST_CONTAINER_MOVE_NAMESPACE::move(x), T()) into the map (the key is move-constructed)
+<pre class="literallayout">T & <a name="id388582-bb"></a>operator[](key_type && mk);</pre>
+Effects: If there is no key equivalent to x in the map, inserts value_type(boost::move(x), T()) into the map (the key is move-constructed)
Returns: A reference to the mapped_type corresponding to x in *this.
Complexity: Logarithmic. 
</li>
<li>
-<pre class="literallayout">T & <a name="id308722-bb"></a>at(const key_type & k) ;</pre>
+<pre class="literallayout">T & <a name="id388601-bb"></a>at(const key_type & k);</pre>
Returns: A reference to the element whose key is equivalent to x. Throws: An exception object of type out_of_range if no such element is present. Complexity: logarithmic. 
</li>
<li>
-<pre class="literallayout">const T & <a name="id308737-bb"></a>at(const key_type & k) const;</pre>
+<pre class="literallayout">const T & <a name="id388616-bb"></a>at(const key_type & k) const;</pre>
Returns: A reference to the element whose key is equivalent to x. Throws: An exception object of type out_of_range if no such element is present. Complexity: logarithmic. 
</li>
<li>
-<pre class="literallayout">void <a name="id308751-bb"></a>swap(map & x) ;</pre>
+<pre class="literallayout">void <a name="id388630-bb"></a>swap(map & x);</pre>
Effects: Swaps the contents of *this and x. If this->allocator_type() != x.allocator_type() allocators are also swapped.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">std::pair< iterator, bool > <a name="id308784-bb"></a>insert(const value_type & x) ;</pre>
+<pre class="literallayout">std::pair< iterator, bool > <a name="id388663-bb"></a>insert(const value_type & x);</pre>
Effects: Inserts x if and only if there is no element in the container with key equivalent to the key of x.
Returns: The bool component of the returned pair is true if and only if the insertion takes place, and the iterator component of the pair points to the element with key equivalent to the key of x.
Complexity: Logarithmic. 
</li>
<li>
-<pre class="literallayout">std::pair< iterator, bool > <a name="id308814-bb"></a>insert(const nonconst_value_type & x) ;</pre>
+<pre class="literallayout">std::pair< iterator, bool > <a name="id388693-bb"></a>insert(const nonconst_value_type & x);</pre>
Effects: Inserts a new value_type created from the pair if and only if there is no element in the container with key equivalent to the key of x.
Returns: The bool component of the returned pair is true if and only if the insertion takes place, and the iterator component of the pair points to the element with key equivalent to the key of x.
Complexity: Logarithmic. 
</li>
<li>
-<pre class="literallayout">std::pair< iterator, bool > <a name="id308844-bb"></a>insert(nonconst_value_type && x) ;</pre>
+<pre class="literallayout">std::pair< iterator, bool > <a name="id388723-bb"></a>insert(nonconst_value_type && x);</pre>
Effects: Inserts a new value_type move constructed from the pair if and only if there is no element in the container with key equivalent to the key of x.
Returns: The bool component of the returned pair is true if and only if the insertion takes place, and the iterator component of the pair points to the element with key equivalent to the key of x.
Complexity: Logarithmic. 
</li>
<li>
-<pre class="literallayout">std::pair< iterator, bool > <a name="id308874-bb"></a>insert(nonconst_impl_value_type && x) ;</pre>
+<pre class="literallayout">std::pair< iterator, bool > <a name="id388753-bb"></a>insert(nonconst_impl_value_type && x);</pre>
Effects: Inserts a new value_type move constructed from the pair if and only if there is no element in the container with key equivalent to the key of x.
Returns: The bool component of the returned pair is true if and only if the insertion takes place, and the iterator component of the pair points to the element with key equivalent to the key of x.
Complexity: Logarithmic. 
</li>
<li>
-<pre class="literallayout">std::pair< iterator, bool > <a name="id308904-bb"></a>insert(value_type && x) ;</pre>
+<pre class="literallayout">std::pair< iterator, bool > <a name="id388783-bb"></a>insert(value_type && x);</pre>
Effects: Move constructs a new value from x if and only if there is no element in the container with key equivalent to the key of x.
Returns: The bool component of the returned pair is true if and only if the insertion takes place, and the iterator component of the pair points to the element with key equivalent to the key of x.
Complexity: Logarithmic. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id308934-bb"></a>insert(iterator position, const value_type & x) ;</pre>
+<pre class="literallayout">iterator <a name="id388813-bb"></a>insert(iterator position, const value_type & x);</pre>
Effects: Inserts a copy of x in the container if and only if there is no element in the container with key equivalent to the key of x. p is a hint pointing to where the insert should start to search.
Returns: An iterator pointing to the element with key equivalent to the key of x.
Complexity: Logarithmic in general, but amortized constant if t is inserted right before p. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id308968-bb"></a>insert(iterator position, nonconst_value_type && x) ;</pre>
+<pre class="literallayout">iterator <a name="id388847-bb"></a>insert(iterator position, nonconst_value_type && x);</pre>
Effects: Move constructs a new value from x if and only if there is no element in the container with key equivalent to the key of x. p is a hint pointing to where the insert should start to search.
Returns: An iterator pointing to the element with key equivalent to the key of x.
Complexity: Logarithmic in general, but amortized constant if t is inserted right before p. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id309003-bb"></a>insert(iterator position, nonconst_impl_value_type && x) ;</pre>
+<pre class="literallayout">iterator <a name="id388882-bb"></a>insert(iterator position, nonconst_impl_value_type && x);</pre>
Effects: Move constructs a new value from x if and only if there is no element in the container with key equivalent to the key of x. p is a hint pointing to where the insert should start to search.
Returns: An iterator pointing to the element with key equivalent to the key of x.
Complexity: Logarithmic in general, but amortized constant if t is inserted right before p. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id309038-bb"></a>insert(iterator position, const nonconst_value_type & x) ;</pre>
+<pre class="literallayout">iterator <a name="id388917-bb"></a>insert(iterator position, const nonconst_value_type & x);</pre>
Effects: Inserts a copy of x in the container. p is a hint pointing to where the insert should start to search.
Returns: An iterator pointing to the element with key equivalent to the key of x.
Complexity: Logarithmic. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id309073-bb"></a>insert(iterator position, value_type && x) ;</pre>
+<pre class="literallayout">iterator <a name="id388952-bb"></a>insert(iterator position, value_type && x);</pre>
Effects: Inserts an element move constructed from x in the container. p is a hint pointing to where the insert should start to search.
Returns: An iterator pointing to the element with key equivalent to the key of x.
Complexity: Logarithmic. 
</li>
<li>
-<pre class="literallayout">template<typename InputIterator>
- void <a name="id309108-bb"></a>insert(InputIterator first, InputIterator last) ;</pre>
+<pre class="literallayout">template<typename InputIterator>
+ void <a name="id388987-bb"></a>insert(InputIterator first, InputIterator last);</pre>
Requires: i, j are not iterators into *this.
Effects: inserts each element from the range [i,j) if and only if there is no element with key equivalent to the key of that element.
Complexity: N log(size()+N) (N is the distance from i to j) 
</li>
<li>
-<pre class="literallayout">template<class... Args> iterator <a name="id309148-bb"></a>emplace(Args &&... args) ;</pre>
+<pre class="literallayout">template<class... Args> iterator <a name="id389027-bb"></a>emplace(Args &&... args);</pre>
Effects: Inserts an object of type T constructed with std::forward<Args>(args)... in the container if and only if there is no element in the container with an equivalent key. p is a hint pointing to where the insert should start to search.
Returns: An iterator pointing to the element with key equivalent to the key of x.
Complexity: Logarithmic in general, but amortized constant if t is inserted right before p. 
</li>
<li>
-<pre class="literallayout">template<class... Args>
- iterator <a name="id309187-bb"></a>emplace_hint(const_iterator hint, Args &&... args) ;</pre>
+<pre class="literallayout">template<class... Args>
+ iterator <a name="id389066-bb"></a>emplace_hint(const_iterator hint, Args &&... args);</pre>
Effects: Inserts an object of type T constructed with std::forward<Args>(args)... in the container if and only if there is no element in the container with an equivalent key. p is a hint pointing to where the insert should start to search.
Returns: An iterator pointing to the element with key equivalent to the key of x.
Complexity: Logarithmic in general, but amortized constant if t is inserted right before p. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id309230-bb"></a>erase(const_iterator position) ;</pre>
+<pre class="literallayout">iterator <a name="id389109-bb"></a>erase(const_iterator position);</pre>
Effects: Erases the element pointed to by position.
Returns: Returns an iterator pointing to the element immediately following q prior to the element being erased. If no such element exists, returns end().
Complexity: Amortized constant time 
</li>
<li>
-<pre class="literallayout">size_type <a name="id309260-bb"></a>erase(const key_type & x) ;</pre>
+<pre class="literallayout">size_type <a name="id389139-bb"></a>erase(const key_type & x);</pre>
Effects: Erases all elements in the container with key equivalent to x.
Returns: Returns the number of erased elements.
Complexity: log(size()) + count(k) 
</li>
<li>
-<pre class="literallayout">iterator <a name="id309290-bb"></a>erase(const_iterator first, const_iterator last) ;</pre>
+<pre class="literallayout">iterator <a name="id389169-bb"></a>erase(const_iterator first, const_iterator last);</pre>
Effects: Erases all the elements in the range [first, last).
Returns: Returns last.
Complexity: log(size())+N where N is the distance from first to last. 
</li>
<li>
-<pre class="literallayout">void <a name="id309326-bb"></a>clear() ;</pre>
+<pre class="literallayout">void <a name="id389205-bb"></a>clear();</pre>
Effects: erase(a.begin(),a.end()).
Postcondition: size() == 0.
Complexity: linear in size(). 
</li>
<li>
-<pre class="literallayout">iterator <a name="id309351-bb"></a>find(const key_type & x) ;</pre>
+<pre class="literallayout">iterator <a name="id389230-bb"></a>find(const key_type & x);</pre>
Returns: An iterator pointing to an element with the key equivalent to x, or end() if such an element is not found.
Complexity: Logarithmic. 
</li>
<li>
-<pre class="literallayout">const_iterator <a name="id309375-bb"></a>find(const key_type & x) const;</pre>
+<pre class="literallayout">const_iterator <a name="id389254-bb"></a>find(const key_type & x) const;</pre>
Returns: A const_iterator pointing to an element with the key equivalent to x, or end() if such an element is not found.
Complexity: Logarithmic. 
</li>
<li>
-<pre class="literallayout">size_type <a name="id309399-bb"></a>count(const key_type & x) const;</pre>
+<pre class="literallayout">size_type <a name="id389278-bb"></a>count(const key_type & x) const;</pre>
Returns: The number of elements with key equivalent to x.
Complexity: log(size())+count(k) 
</li>
<li>
-<pre class="literallayout">iterator <a name="id309423-bb"></a>lower_bound(const key_type & x) ;</pre>
+<pre class="literallayout">iterator <a name="id389302-bb"></a>lower_bound(const key_type & x);</pre>
Returns: An iterator pointing to the first element with key not less than k, or a.end() if such an element is not found.
Complexity: Logarithmic 
</li>
<li>
-<pre class="literallayout">const_iterator <a name="id309447-bb"></a>lower_bound(const key_type & x) const;</pre>
+<pre class="literallayout">const_iterator <a name="id389326-bb"></a>lower_bound(const key_type & x) const;</pre>
Returns: A const iterator pointing to the first element with key not less than k, or a.end() if such an element is not found.
Complexity: Logarithmic 
</li>
<li>
-<pre class="literallayout">iterator <a name="id309471-bb"></a>upper_bound(const key_type & x) ;</pre>
+<pre class="literallayout">iterator <a name="id389350-bb"></a>upper_bound(const key_type & x);</pre>
Returns: An iterator pointing to the first element with key not less than x, or end() if such an element is not found.
Complexity: Logarithmic 
</li>
<li>
-<pre class="literallayout">const_iterator <a name="id309495-bb"></a>upper_bound(const key_type & x) const;</pre>
+<pre class="literallayout">const_iterator <a name="id389374-bb"></a>upper_bound(const key_type & x) const;</pre>
Returns: A const iterator pointing to the first element with key not less than x, or end() if such an element is not found.
Complexity: Logarithmic 
</li>
<li>
-<pre class="literallayout">std::pair< iterator, iterator > <a name="id309733-bb"></a>equal_range(const key_type & x) ;</pre>
+<pre class="literallayout">std::pair< iterator, iterator > <a name="id389398-bb"></a>equal_range(const key_type & x);</pre>
Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).
Complexity: Logarithmic 
</li>
<li>
-<pre class="literallayout">std::pair< const_iterator, const_iterator >
-<a name="id309757-bb"></a>equal_range(const key_type & x) const;</pre>
+<pre class="literallayout">std::pair< const_iterator, const_iterator >
+<a name="id389422-bb"></a>equal_range(const key_type & x) const;</pre>
Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).
Complexity: Logarithmic 
</li>
@@ -443,7 +443,7 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2009 -2010 Ion Gaztanaga
+<td align="right"><div class="copyright-footer">Copyright © 2009 -2011 Ion Gaztanaga
 Distributed under the Boost Software License, Version 1.0. (See accompanying
 file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
@@ -451,7 +451,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="list.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.map_hpp"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="multimap.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="list.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.map_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="multimap.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>

Modified: sandbox/move/libs/container/doc/html/boost/container/multimap.html
==============================================================================
--- sandbox/move/libs/container/doc/html/boost/container/multimap.html (original)
+++ sandbox/move/libs/container/doc/html/boost/container/multimap.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
@@ -1,10 +1,10 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Class template multimap</title>
-<link rel="stylesheet" href="../../boostbook.css" type="text/css">
+<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
-<link rel="start" href="../../index.html" title="Chapter 1. Boost.Container">
+<link rel="start" href="../../index.html" title="Chapter 1. Boost.Container">
<link rel="up" href="../../boost_container_reference.html#header.boost.container.map_hpp" title="Header <boost/container/map.hpp>">
<link rel="prev" href="map.html" title="Class template map">
<link rel="next" href="set.html" title="Class template set">
@@ -20,7 +20,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="map.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.map_hpp"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="set.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="map.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.map_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="set.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="refentry" lang="en">
<a name="boost.container.multimap"></a><div class="titlepage"></div>
@@ -29,372 +29,380 @@
boost::container::multimap — 
</div>
<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2>
-<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/container/map.hpp>
+<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/container/map.hpp>

-template<typename Key, typename T, typename Pred, typename Alloc>
-class multimap {
-public:
- // types
- typedef tree_t::key_type <a name="boost.container.multimap.key_type"></a>key_type;
- typedef tree_t::value_type <a name="boost.container.multimap.value_type"></a>value_type;
- typedef tree_t::pointer <a name="boost.container.multimap.pointer"></a>pointer;
- typedef tree_t::const_pointer <a name="boost.container.multimap.const_pointer"></a>const_pointer;
- typedef tree_t::reference <a name="boost.container.multimap.reference"></a>reference;
- typedef tree_t::const_reference <a name="boost.container.multimap.const_reference"></a>const_reference;
- typedef T <a name="boost.container.multimap.mapped_type"></a>mapped_type;
- typedef Pred <a name="boost.container.multimap.key_compare"></a>key_compare;
- typedef tree_t::iterator <a name="boost.container.multimap.iterator"></a>iterator;
- typedef tree_t::const_iterator <a name="boost.container.multimap.const_iterator"></a>const_iterator;
- typedef tree_t::reverse_iterator <a name="boost.container.multimap.reverse_iterator"></a>reverse_iterator;
- typedef tree_t::const_reverse_iterator <a name="boost.container.multimap.const_reverse_iterator"></a>const_reverse_iterator;
- typedef tree_t::size_type <a name="boost.container.multimap.size_type"></a>size_type;
- typedef tree_t::difference_type <a name="boost.container.multimap.difference_type"></a>difference_type;
- typedef tree_t::allocator_type <a name="boost.container.multimap.allocator_type"></a>allocator_type;
- typedef tree_t::stored_allocator_type <a name="boost.container.multimap.stored_allocator_type"></a>stored_allocator_type;
- typedef std::pair< key_type, mapped_type > <a name="boost.container.multimap.nonconst_value_type"></a>nonconst_value_type;
- typedef unspecified <a name="boost.container.multimap.nonconst_impl_value_type"></a>nonconst_impl_value_type;
- typedef value_compare_impl <a name="boost.container.multimap.value_compare"></a>value_compare;
+template<typename Key, typename T, typename Pred, typename Alloc>
+class multimap {
+public:
+ // types
+ typedef tree_t::key_type <a name="boost.container.multimap.key_type"></a>key_type;
+ typedef tree_t::value_type <a name="boost.container.multimap.value_type"></a>value_type;
+ typedef tree_t::pointer <a name="boost.container.multimap.pointer"></a>pointer;
+ typedef tree_t::const_pointer <a name="boost.container.multimap.const_pointer"></a>const_pointer;
+ typedef tree_t::reference <a name="boost.container.multimap.reference"></a>reference;
+ typedef tree_t::const_reference <a name="boost.container.multimap.const_reference"></a>const_reference;
+ typedef T <a name="boost.container.multimap.mapped_type"></a>mapped_type;
+ typedef Pred <a name="boost.container.multimap.key_compare"></a>key_compare;
+ typedef tree_t::iterator <a name="boost.container.multimap.iterator"></a>iterator;
+ typedef tree_t::const_iterator <a name="boost.container.multimap.const_iterator"></a>const_iterator;
+ typedef tree_t::reverse_iterator <a name="boost.container.multimap.reverse_iterator"></a>reverse_iterator;
+ typedef tree_t::const_reverse_iterator <a name="boost.container.multimap.const_reverse_iterator"></a>const_reverse_iterator;
+ typedef tree_t::size_type <a name="boost.container.multimap.size_type"></a>size_type;
+ typedef tree_t::difference_type <a name="boost.container.multimap.difference_type"></a>difference_type;
+ typedef tree_t::allocator_type <a name="boost.container.multimap.allocator_type"></a>allocator_type;
+ typedef tree_t::stored_allocator_type <a name="boost.container.multimap.stored_allocator_type"></a>stored_allocator_type;
+ typedef std::pair< key_type, mapped_type > <a name="boost.container.multimap.nonconst_value_type"></a>nonconst_value_type;
+ typedef unspecified <a name="boost.container.multimap.nonconst_impl_value_type"></a>nonconst_impl_value_type;
+ typedef value_compare_impl <a name="boost.container.multimap.value_compare"></a>value_compare;

- // construct/copy/destruct
- multimap(const Pred & = Pred(), const allocator_type & = allocator_type());
- template<typename InputIterator>
- multimap(InputIterator, InputIterator, const Pred & = Pred(),
- const allocator_type & = allocator_type());
- template<typename InputIterator>
- multimap(ordered_range_t, InputIterator, InputIterator,
- const Pred & = Pred(),
- const allocator_type & = allocator_type());
- multimap(const multimap< Key, T, Pred, Alloc > &);
- multimap(multimap &&);
- multimap& operator=(const multimap &);
- multimap& operator=(multimap &&);
+ // construct/copy/destruct
+ multimap(const Pred & = Pred(), const allocator_type & = allocator_type());
+ template<typename InputIterator>
+ multimap(InputIterator, InputIterator, const Pred & = Pred(),
+ const allocator_type & = allocator_type());
+ template<typename InputIterator>
+ multimap(ordered_range_t, InputIterator, InputIterator,
+ const Pred & = Pred(),
+ const allocator_type & = allocator_type());
+ multimap(const multimap< Key, T, Pred, Alloc > &);
+ multimap(multimap &&);
+ multimap& operator=(const multimap &);
+ multimap& operator=(multimap &&);

- // public member functions
- key_compare key_comp() const;
- value_compare value_comp() const;
- allocator_type get_allocator() const;
- const stored_allocator_type & get_stored_allocator() const;
- stored_allocator_type & get_stored_allocator() ;
- iterator begin() ;
- const_iterator begin() const;
- iterator end() ;
- const_iterator end() const;
- reverse_iterator rbegin() ;
- const_reverse_iterator rbegin() const;
- reverse_iterator rend() ;
- const_reverse_iterator rend() const;
- bool empty() const;
- size_type size() const;
- size_type max_size() const;
- void swap(multimap &) ;
- iterator insert(const value_type &) ;
- iterator insert(const nonconst_value_type &) ;
- iterator insert(nonconst_value_type &&) ;
- iterator insert(nonconst_impl_value_type &&) ;
- iterator insert(iterator, const value_type &) ;
- iterator insert(iterator, const nonconst_value_type &) ;
- iterator insert(iterator, nonconst_value_type &&) ;
- iterator insert(iterator, nonconst_impl_value_type &&) ;
- template<typename InputIterator> void insert(InputIterator, InputIterator) ;
- template<class... Args> iterator emplace(Args &&...) ;
- template<class... Args> iterator emplace_hint(const_iterator, Args &&...) ;
- iterator erase(const_iterator) ;
- size_type erase(const key_type &) ;
- iterator erase(const_iterator, const_iterator) ;
- void clear() ;
- iterator find(const key_type &) ;
- const_iterator find(const key_type &) const;
- size_type count(const key_type &) const;
- iterator lower_bound(const key_type &) ;
- const_iterator lower_bound(const key_type &) const;
- iterator upper_bound(const key_type &) ;
- std::pair< iterator, iterator > equal_range(const key_type &) ;
- const_iterator upper_bound(const key_type &) const;
- std::pair< const_iterator, const_iterator >
- equal_range(const key_type &) const;
-};</pre></div>
+ // private member functions
+ BOOST_STATIC_ASSERT(unspecified);
+
+ // public member functions
+ key_compare key_comp() const;
+ value_compare value_comp() const;
+ allocator_type get_allocator() const;
+ const stored_allocator_type & get_stored_allocator() const;
+ stored_allocator_type & get_stored_allocator();
+ iterator begin();
+ const_iterator begin() const;
+ iterator end();
+ const_iterator end() const;
+ reverse_iterator rbegin();
+ const_reverse_iterator rbegin() const;
+ reverse_iterator rend();
+ const_reverse_iterator rend() const;
+ bool empty() const;
+ size_type size() const;
+ size_type max_size() const;
+ void swap(multimap &);
+ iterator insert(const value_type &);
+ iterator insert(const nonconst_value_type &);
+ iterator insert(nonconst_value_type &&);
+ iterator insert(nonconst_impl_value_type &&);
+ iterator insert(iterator, const value_type &);
+ iterator insert(iterator, const nonconst_value_type &);
+ iterator insert(iterator, nonconst_value_type &&);
+ iterator insert(iterator, nonconst_impl_value_type &&);
+ template<typename InputIterator> void insert(InputIterator, InputIterator);
+ template<class... Args> iterator emplace(Args &&...);
+ template<class... Args> iterator emplace_hint(const_iterator, Args &&...);
+ iterator erase(const_iterator);
+ size_type erase(const key_type &);
+ iterator erase(const_iterator, const_iterator);
+ void clear();
+ iterator find(const key_type &);
+ const_iterator find(const key_type &) const;
+ size_type count(const key_type &) const;
+ iterator lower_bound(const key_type &);
+ const_iterator lower_bound(const key_type &) const;
+ iterator upper_bound(const key_type &);
+ std::pair< iterator, iterator > equal_range(const key_type &);
+ const_iterator upper_bound(const key_type &) const;
+ std::pair< const_iterator, const_iterator >
+ equal_range(const key_type &) const;
+};</pre></div>
<div class="refsect1" lang="en">
-<a name="id503770"></a><h2>Description</h2>
+<a name="id809345"></a><h2>Description</h2>
A multimap is a kind of associative container that supports equivalent keys (possibly containing multiple copies of the same key value) and provides for fast retrieval of values of another type T based on the keys. The multimap class supports bidirectional iterators.
A multimap satisfies all of the requirements of a container and of a reversible container and of an associative container. For a map<Key,T> the key_type is Key and the value_type is std::pair<const Key,T>.
-Pred is the ordering function for Keys (e.g. std::less<Key>).
-Alloc is the allocator to allocate the value_types (e.g. allocator< std::pair<const Key, T> >). 
+Pred is the ordering function for Keys (e.g. std::less<Key>).
+Alloc is the allocator to allocate the value_types (e.g. allocator< std::pair<const Key, T> >). 
<div class="refsect2" lang="en">
-<a name="id503788"></a><h3>
+<a name="id809372"></a><h3>
<a name="boost.container.multimapconstruct-copy-destruct"></a><code class="computeroutput">multimap</code>
 public
 construct/copy/destruct</h3>
<div class="orderedlist"><ol type="1">
<li>
-<pre class="literallayout"><a name="id311211-bb"></a>multimap(const Pred & comp = Pred(),
- const allocator_type & a = allocator_type());</pre>
+<pre class="literallayout"><a name="id391444-bb"></a>multimap(const Pred & comp = Pred(),
+ const allocator_type & a = allocator_type());</pre>
Effects: Constructs an empty multimap using the specified comparison object and allocator.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">template<typename InputIterator>
- <a name="id311240-bb"></a>multimap(InputIterator first, InputIterator last,
- const Pred & comp = Pred(),
- const allocator_type & a = allocator_type());</pre>
+<pre class="literallayout">template<typename InputIterator>
+ <a name="id391472-bb"></a>multimap(InputIterator first, InputIterator last,
+ const Pred & comp = Pred(),
+ const allocator_type & a = allocator_type());</pre>
Effects: Constructs an empty multimap using the specified comparison object and allocator, and inserts elements from the range [first ,last ).
Complexity: Linear in N if the range [first ,last ) is already sorted using comp and otherwise N logN, where N is last - first. 
</li>
<li>
-<pre class="literallayout">template<typename InputIterator>
- <a name="id311285-bb"></a>multimap(ordered_range_t ordered_range, InputIterator first,
- InputIterator last, const Pred & comp = Pred(),
- const allocator_type & a = allocator_type());</pre>
+<pre class="literallayout">template<typename InputIterator>
+ <a name="id391517-bb"></a>multimap(ordered_range_t ordered_range, InputIterator first,
+ InputIterator last, const Pred & comp = Pred(),
+ const allocator_type & a = allocator_type());</pre>
Effects: Constructs an empty multimap using the specified comparison object and allocator, and inserts elements from the ordered range [first ,last). This function is more efficient than the normal range creation for ordered ranges.
Requires: [first ,last) must be ordered according to the predicate.
Complexity: Linear in N. 
</li>
<li>
-<pre class="literallayout"><a name="id311341-bb"></a>multimap(const multimap< Key, T, Pred, Alloc > & x);</pre>
+<pre class="literallayout"><a name="id391573-bb"></a>multimap(const multimap< Key, T, Pred, Alloc > & x);</pre>
Effects: Copy constructs a multimap.
Complexity: Linear in x.size(). 
</li>
<li>
-<pre class="literallayout"><a name="id311364-bb"></a>multimap(multimap && x);</pre>
+<pre class="literallayout"><a name="id391596-bb"></a>multimap(multimap && x);</pre>
Effects: Move constructs a multimap. Constructs *this using x's resources.
Complexity: Construct.
Postcondition: x is emptied. 
</li>
<li>
-<pre class="literallayout">multimap& <a name="id311391-bb"></a>operator=(const multimap & x);</pre>
+<pre class="literallayout">multimap& <a name="id391624-bb"></a>operator=(const multimap & x);</pre>
Effects: Makes *this a copy of x.
Complexity: Linear in x.size(). 
</li>
<li>
-<pre class="literallayout">multimap& <a name="id311414-bb"></a>operator=(multimap && x);</pre>
+<pre class="literallayout">multimap& <a name="id391646-bb"></a>operator=(multimap && x);</pre>
Effects: this->swap(x.get()).
Complexity: Constant. 
</li>
</ol></div>
</div>
<div class="refsect2" lang="en">
-<a name="id504055"></a><h3>
-<a name="id310134-bb"></a><code class="computeroutput">multimap</code> public member functions</h3>
+<a name="id810015"></a><h3>
+<a name="id389806-bb"></a><code class="computeroutput">multimap</code> private member functions</h3>
+<div class="orderedlist"><ol type="1"><li><pre class="literallayout"> <a name="id389809-bb"></a>BOOST_STATIC_ASSERT(unspecified);</pre></li></ol></div>
+</div>
+<div class="refsect2" lang="en">
+<a name="id810057"></a><h3>
+<a name="id389819-bb"></a><code class="computeroutput">multimap</code> public member functions</h3>
<div class="orderedlist"><ol type="1">
<li>
-<pre class="literallayout">key_compare <a name="id310136-bb"></a>key_comp() const;</pre>
+<pre class="literallayout">key_compare <a name="id389822-bb"></a>key_comp() const;</pre>
Effects: Returns the comparison object out of which a was constructed.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">value_compare <a name="id310157-bb"></a>value_comp() const;</pre>
+<pre class="literallayout">value_compare <a name="id389842-bb"></a>value_comp() const;</pre>
Effects: Returns an object of value_compare constructed out of the comparison object.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">allocator_type <a name="id310176-bb"></a>get_allocator() const;</pre>
+<pre class="literallayout">allocator_type <a name="id389861-bb"></a>get_allocator() const;</pre>
Effects: Returns a copy of the Allocator that was passed to the object's constructor.
Complexity: Constant. 
</li>
-<li><pre class="literallayout">const stored_allocator_type & <a name="id310195-bb"></a>get_stored_allocator() const;</pre></li>
-<li><pre class="literallayout">stored_allocator_type & <a name="id310201-bb"></a>get_stored_allocator() ;</pre></li>
+<li><pre class="literallayout">const stored_allocator_type & <a name="id389881-bb"></a>get_stored_allocator() const;</pre></li>
+<li><pre class="literallayout">stored_allocator_type & <a name="id389887-bb"></a>get_stored_allocator();</pre></li>
<li>
-<pre class="literallayout">iterator <a name="id310207-bb"></a>begin() ;</pre>
+<pre class="literallayout">iterator <a name="id389893-bb"></a>begin();</pre>
Effects: Returns an iterator to the first element contained in the container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_iterator <a name="id310232-bb"></a>begin() const;</pre>
+<pre class="literallayout">const_iterator <a name="id389918-bb"></a>begin() const;</pre>
Effects: Returns a const_iterator to the first element contained in the container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id310257-bb"></a>end() ;</pre>
+<pre class="literallayout">iterator <a name="id389943-bb"></a>end();</pre>
Effects: Returns an iterator to the end of the container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_iterator <a name="id310283-bb"></a>end() const;</pre>
+<pre class="literallayout">const_iterator <a name="id389968-bb"></a>end() const;</pre>
Effects: Returns a const_iterator to the end of the container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">reverse_iterator <a name="id310308-bb"></a>rbegin() ;</pre>
+<pre class="literallayout">reverse_iterator <a name="id389993-bb"></a>rbegin();</pre>
Effects: Returns a reverse_iterator pointing to the beginning of the reversed container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_reverse_iterator <a name="id310333-bb"></a>rbegin() const;</pre>
+<pre class="literallayout">const_reverse_iterator <a name="id390019-bb"></a>rbegin() const;</pre>
Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">reverse_iterator <a name="id310358-bb"></a>rend() ;</pre>
+<pre class="literallayout">reverse_iterator <a name="id390044-bb"></a>rend();</pre>
Effects: Returns a reverse_iterator pointing to the end of the reversed container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_reverse_iterator <a name="id310383-bb"></a>rend() const;</pre>
+<pre class="literallayout">const_reverse_iterator <a name="id390069-bb"></a>rend() const;</pre>
Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">bool <a name="id310409-bb"></a>empty() const;</pre>
+<pre class="literallayout">bool <a name="id390094-bb"></a>empty() const;</pre>
Effects: Returns true if the container contains no elements.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">size_type <a name="id310434-bb"></a>size() const;</pre>
+<pre class="literallayout">size_type <a name="id390119-bb"></a>size() const;</pre>
Effects: Returns the number of the elements contained in the container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">size_type <a name="id310459-bb"></a>max_size() const;</pre>
+<pre class="literallayout">size_type <a name="id390145-bb"></a>max_size() const;</pre>
Effects: Returns the largest possible size of the container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">void <a name="id310484-bb"></a>swap(multimap & x) ;</pre>
+<pre class="literallayout">void <a name="id390170-bb"></a>swap(multimap & x);</pre>
Effects: Swaps the contents of *this and x. If this->allocator_type() != x.allocator_type() allocators are also swapped.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id310517-bb"></a>insert(const value_type & x) ;</pre>
+<pre class="literallayout">iterator <a name="id390202-bb"></a>insert(const value_type & x);</pre>
Effects: Inserts x and returns the iterator pointing to the newly inserted element.
Complexity: Logarithmic. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id310541-bb"></a>insert(const nonconst_value_type & x) ;</pre>
+<pre class="literallayout">iterator <a name="id390226-bb"></a>insert(const nonconst_value_type & x);</pre>
Effects: Inserts a new value constructed from x and returns the iterator pointing to the newly inserted element.
Complexity: Logarithmic. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id310565-bb"></a>insert(nonconst_value_type && x) ;</pre>
+<pre class="literallayout">iterator <a name="id390250-bb"></a>insert(nonconst_value_type && x);</pre>
Effects: Inserts a new value move-constructed from x and returns the iterator pointing to the newly inserted element.
Complexity: Logarithmic. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id310589-bb"></a>insert(nonconst_impl_value_type && x) ;</pre>
+<pre class="literallayout">iterator <a name="id390274-bb"></a>insert(nonconst_impl_value_type && x);</pre>
Effects: Inserts a new value move-constructed from x and returns the iterator pointing to the newly inserted element.
Complexity: Logarithmic. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id310613-bb"></a>insert(iterator position, const value_type & x) ;</pre>
+<pre class="literallayout">iterator <a name="id390298-bb"></a>insert(iterator position, const value_type & x);</pre>
Effects: Inserts a copy of x in the container. p is a hint pointing to where the insert should start to search.
Returns: An iterator pointing to the element with key equivalent to the key of x.
Complexity: Logarithmic in general, but amortized constant if t is inserted right before p. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id310647-bb"></a>insert(iterator position, const nonconst_value_type & x) ;</pre>
+<pre class="literallayout">iterator <a name="id390333-bb"></a>insert(iterator position, const nonconst_value_type & x);</pre>
Effects: Inserts a new value constructed from x in the container. p is a hint pointing to where the insert should start to search.
Returns: An iterator pointing to the element with key equivalent to the key of x.
Complexity: Logarithmic in general, but amortized constant if t is inserted right before p. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id310682-bb"></a>insert(iterator position, nonconst_value_type && x) ;</pre>
+<pre class="literallayout">iterator <a name="id390914-bb"></a>insert(iterator position, nonconst_value_type && x);</pre>
Effects: Inserts a new value move constructed from x in the container. p is a hint pointing to where the insert should start to search.
Returns: An iterator pointing to the element with key equivalent to the key of x.
Complexity: Logarithmic in general, but amortized constant if t is inserted right before p. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id310717-bb"></a>insert(iterator position, nonconst_impl_value_type && x) ;</pre>
+<pre class="literallayout">iterator <a name="id390949-bb"></a>insert(iterator position, nonconst_impl_value_type && x);</pre>
Effects: Inserts a new value move constructed from x in the container. p is a hint pointing to where the insert should start to search.
Returns: An iterator pointing to the element with key equivalent to the key of x.
Complexity: Logarithmic in general, but amortized constant if t is inserted right before p. 
</li>
<li>
-<pre class="literallayout">template<typename InputIterator>
- void <a name="id310752-bb"></a>insert(InputIterator first, InputIterator last) ;</pre>
+<pre class="literallayout">template<typename InputIterator>
+ void <a name="id390984-bb"></a>insert(InputIterator first, InputIterator last);</pre>
Requires: i, j are not iterators into *this.
Effects: inserts each element from the range [i,j) .
Complexity: N log(size()+N) (N is the distance from i to j) 
</li>
<li>
-<pre class="literallayout">template<class... Args> iterator <a name="id310793-bb"></a>emplace(Args &&... args) ;</pre>
+<pre class="literallayout">template<class... Args> iterator <a name="id391025-bb"></a>emplace(Args &&... args);</pre>
Effects: Inserts an object of type T constructed with std::forward<Args>(args)... in the container. p is a hint pointing to where the insert should start to search.
Returns: An iterator pointing to the element with key equivalent to the key of x.
Complexity: Logarithmic in general, but amortized constant if t is inserted right before p. 
</li>
<li>
-<pre class="literallayout">template<class... Args>
- iterator <a name="id310831-bb"></a>emplace_hint(const_iterator hint, Args &&... args) ;</pre>
+<pre class="literallayout">template<class... Args>
+ iterator <a name="id391063-bb"></a>emplace_hint(const_iterator hint, Args &&... args);</pre>
Effects: Inserts an object of type T constructed with std::forward<Args>(args)... in the container. p is a hint pointing to where the insert should start to search.
Returns: An iterator pointing to the element with key equivalent to the key of x.
Complexity: Logarithmic in general, but amortized constant if t is inserted right before p. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id310874-bb"></a>erase(const_iterator position) ;</pre>
+<pre class="literallayout">iterator <a name="id391106-bb"></a>erase(const_iterator position);</pre>
Effects: Erases the element pointed to by position.
Returns: Returns an iterator pointing to the element immediately following q prior to the element being erased. If no such element exists, returns end().
Complexity: Amortized constant time 
</li>
<li>
-<pre class="literallayout">size_type <a name="id310904-bb"></a>erase(const key_type & x) ;</pre>
+<pre class="literallayout">size_type <a name="id391136-bb"></a>erase(const key_type & x);</pre>
Effects: Erases all elements in the container with key equivalent to x.
Returns: Returns the number of erased elements.
Complexity: log(size()) + count(k) 
</li>
<li>
-<pre class="literallayout">iterator <a name="id310934-bb"></a>erase(const_iterator first, const_iterator last) ;</pre>
+<pre class="literallayout">iterator <a name="id391166-bb"></a>erase(const_iterator first, const_iterator last);</pre>
Effects: Erases all the elements in the range [first, last).
Returns: Returns last.
Complexity: log(size())+N where N is the distance from first to last. 
</li>
<li>
-<pre class="literallayout">void <a name="id310970-bb"></a>clear() ;</pre>
+<pre class="literallayout">void <a name="id391202-bb"></a>clear();</pre>
Effects: erase(a.begin(),a.end()).
Postcondition: size() == 0.
Complexity: linear in size(). 
</li>
<li>
-<pre class="literallayout">iterator <a name="id310995-bb"></a>find(const key_type & x) ;</pre>
+<pre class="literallayout">iterator <a name="id391228-bb"></a>find(const key_type & x);</pre>
Returns: An iterator pointing to an element with the key equivalent to x, or end() if such an element is not found.
Complexity: Logarithmic. 
</li>
<li>
-<pre class="literallayout">const_iterator <a name="id311019-bb"></a>find(const key_type & x) const;</pre>
+<pre class="literallayout">const_iterator <a name="id391252-bb"></a>find(const key_type & x) const;</pre>
Returns: A const iterator pointing to an element with the key equivalent to x, or end() if such an element is not found.
Complexity: Logarithmic. 
</li>
<li>
-<pre class="literallayout">size_type <a name="id311043-bb"></a>count(const key_type & x) const;</pre>
+<pre class="literallayout">size_type <a name="id391276-bb"></a>count(const key_type & x) const;</pre>
Returns: The number of elements with key equivalent to x.
Complexity: log(size())+count(k) 
</li>
<li>
-<pre class="literallayout">iterator <a name="id311067-bb"></a>lower_bound(const key_type & x) ;</pre>
+<pre class="literallayout">iterator <a name="id391300-bb"></a>lower_bound(const key_type & x);</pre>
Returns: An iterator pointing to the first element with key not less than k, or a.end() if such an element is not found.
Complexity: Logarithmic 
</li>
<li>
-<pre class="literallayout">const_iterator <a name="id311091-bb"></a>lower_bound(const key_type & x) const;</pre>
+<pre class="literallayout">const_iterator <a name="id391324-bb"></a>lower_bound(const key_type & x) const;</pre>
Returns: A const iterator pointing to the first element with key not less than k, or a.end() if such an element is not found.
Complexity: Logarithmic 
</li>
<li>
-<pre class="literallayout">iterator <a name="id311115-bb"></a>upper_bound(const key_type & x) ;</pre>
+<pre class="literallayout">iterator <a name="id391348-bb"></a>upper_bound(const key_type & x);</pre>
Returns: An iterator pointing to the first element with key not less than x, or end() if such an element is not found.
Complexity: Logarithmic 
</li>
<li>
-<pre class="literallayout">std::pair< iterator, iterator > <a name="id311139-bb"></a>equal_range(const key_type & x) ;</pre>
+<pre class="literallayout">std::pair< iterator, iterator > <a name="id391372-bb"></a>equal_range(const key_type & x);</pre>
Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).
Complexity: Logarithmic 
</li>
<li>
-<pre class="literallayout">const_iterator <a name="id311163-bb"></a>upper_bound(const key_type & x) const;</pre>
+<pre class="literallayout">const_iterator <a name="id391396-bb"></a>upper_bound(const key_type & x) const;</pre>
Returns: A const iterator pointing to the first element with key not less than x, or end() if such an element is not found.
Complexity: Logarithmic 
</li>
<li>
-<pre class="literallayout">std::pair< const_iterator, const_iterator >
-<a name="id311187-bb"></a>equal_range(const key_type & x) const;</pre>
+<pre class="literallayout">std::pair< const_iterator, const_iterator >
+<a name="id391420-bb"></a>equal_range(const key_type & x) const;</pre>
Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).
Complexity: Logarithmic 
</li>
@@ -404,7 +412,7 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2009 -2010 Ion Gaztanaga
+<td align="right"><div class="copyright-footer">Copyright © 2009 -2011 Ion Gaztanaga
 Distributed under the Boost Software License, Version 1.0. (See accompanying
 file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
@@ -412,7 +420,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="map.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.map_hpp"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="set.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="map.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.map_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="set.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>

Modified: sandbox/move/libs/container/doc/html/boost/container/multiset.html
==============================================================================
--- sandbox/move/libs/container/doc/html/boost/container/multiset.html (original)
+++ sandbox/move/libs/container/doc/html/boost/container/multiset.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
@@ -1,10 +1,10 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Class template multiset</title>
-<link rel="stylesheet" href="../../boostbook.css" type="text/css">
+<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
-<link rel="start" href="../../index.html" title="Chapter 1. Boost.Container">
+<link rel="start" href="../../index.html" title="Chapter 1. Boost.Container">
<link rel="up" href="../../boost_container_reference.html#header.boost.container.set_hpp" title="Header <boost/container/set.hpp>">
<link rel="prev" href="set.html" title="Class template set">
<link rel="next" href="slist.html" title="Class template slist">
@@ -20,7 +20,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="set.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.set_hpp"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="slist.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="set.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.set_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="slist.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="refentry" lang="en">
<a name="boost.container.multiset"></a><div class="titlepage"></div>
@@ -29,369 +29,369 @@
boost::container::multiset — 
</div>
<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2>
-<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/container/set.hpp>
+<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/container/set.hpp>

-template<typename T, typename Pred, typename Alloc>
-class multiset {
-public:
- // types
- typedef tree_t::key_type <a name="boost.container.multiset.key_type"></a>key_type;
- typedef tree_t::value_type <a name="boost.container.multiset.value_type"></a>value_type;
- typedef tree_t::pointer <a name="boost.container.multiset.pointer"></a>pointer;
- typedef tree_t::const_pointer <a name="boost.container.multiset.const_pointer"></a>const_pointer;
- typedef tree_t::reference <a name="boost.container.multiset.reference"></a>reference;
- typedef tree_t::const_reference <a name="boost.container.multiset.const_reference"></a>const_reference;
- typedef Pred <a name="boost.container.multiset.key_compare"></a>key_compare;
- typedef Pred <a name="boost.container.multiset.value_compare"></a>value_compare;
- typedef tree_t::iterator <a name="boost.container.multiset.iterator"></a>iterator;
- typedef tree_t::const_iterator <a name="boost.container.multiset.const_iterator"></a>const_iterator;
- typedef tree_t::reverse_iterator <a name="boost.container.multiset.reverse_iterator"></a>reverse_iterator;
- typedef tree_t::const_reverse_iterator <a name="boost.container.multiset.const_reverse_iterator"></a>const_reverse_iterator;
- typedef tree_t::size_type <a name="boost.container.multiset.size_type"></a>size_type;
- typedef tree_t::difference_type <a name="boost.container.multiset.difference_type"></a>difference_type;
- typedef tree_t::allocator_type <a name="boost.container.multiset.allocator_type"></a>allocator_type;
- typedef tree_t::stored_allocator_type <a name="boost.container.multiset.stored_allocator_type"></a>stored_allocator_type;
+template<typename T, typename Pred, typename Alloc>
+class multiset {
+public:
+ // types
+ typedef tree_t::key_type <a name="boost.container.multiset.key_type"></a>key_type;
+ typedef tree_t::value_type <a name="boost.container.multiset.value_type"></a>value_type;
+ typedef tree_t::pointer <a name="boost.container.multiset.pointer"></a>pointer;
+ typedef tree_t::const_pointer <a name="boost.container.multiset.const_pointer"></a>const_pointer;
+ typedef tree_t::reference <a name="boost.container.multiset.reference"></a>reference;
+ typedef tree_t::const_reference <a name="boost.container.multiset.const_reference"></a>const_reference;
+ typedef Pred <a name="boost.container.multiset.key_compare"></a>key_compare;
+ typedef Pred <a name="boost.container.multiset.value_compare"></a>value_compare;
+ typedef tree_t::iterator <a name="boost.container.multiset.iterator"></a>iterator;
+ typedef tree_t::const_iterator <a name="boost.container.multiset.const_iterator"></a>const_iterator;
+ typedef tree_t::reverse_iterator <a name="boost.container.multiset.reverse_iterator"></a>reverse_iterator;
+ typedef tree_t::const_reverse_iterator <a name="boost.container.multiset.const_reverse_iterator"></a>const_reverse_iterator;
+ typedef tree_t::size_type <a name="boost.container.multiset.size_type"></a>size_type;
+ typedef tree_t::difference_type <a name="boost.container.multiset.difference_type"></a>difference_type;
+ typedef tree_t::allocator_type <a name="boost.container.multiset.allocator_type"></a>allocator_type;
+ typedef tree_t::stored_allocator_type <a name="boost.container.multiset.stored_allocator_type"></a>stored_allocator_type;

- // construct/copy/destruct
- multiset(const Pred & = Pred(), const allocator_type & = allocator_type());
- template<typename InputIterator>
- multiset(InputIterator, InputIterator, const Pred & = Pred(),
- const allocator_type & = allocator_type());
- template<typename InputIterator>
- multiset(ordered_range_t, InputIterator, InputIterator,
- const Pred & = Pred(),
- const allocator_type & = allocator_type());
- multiset(const multiset &);
- multiset(multiset &&);
- multiset& operator=(const multiset &);
- multiset& operator=(multiset &&);
+ // construct/copy/destruct
+ multiset(const Pred & = Pred(), const allocator_type & = allocator_type());
+ template<typename InputIterator>
+ multiset(InputIterator, InputIterator, const Pred & = Pred(),
+ const allocator_type & = allocator_type());
+ template<typename InputIterator>
+ multiset(ordered_range_t, InputIterator, InputIterator,
+ const Pred & = Pred(),
+ const allocator_type & = allocator_type());
+ multiset(const multiset &);
+ multiset(multiset &&);
+ multiset& operator=(const multiset &);
+ multiset& operator=(multiset &&);

- // public member functions
- key_compare key_comp() const;
- value_compare value_comp() const;
- allocator_type get_allocator() const;
- const stored_allocator_type & get_stored_allocator() const;
- stored_allocator_type & get_stored_allocator() ;
- iterator begin() ;
- const_iterator begin() const;
- iterator end() ;
- const_iterator end() const;
- reverse_iterator rbegin() ;
- const_reverse_iterator rbegin() const;
- reverse_iterator rend() ;
- const_reverse_iterator rend() const;
- const_iterator cbegin() const;
- const_iterator cend() const;
- const_reverse_iterator crbegin() const;
- const_reverse_iterator crend() const;
- bool empty() const;
- size_type size() const;
- size_type max_size() const;
- void swap(multiset &) ;
- iterator insert(const T &) ;
- iterator insert(value_type &&) ;
- iterator insert(const_iterator, const T &) ;
- iterator insert(const_iterator, value_type &&) ;
- template<typename InputIterator> void insert(InputIterator, InputIterator) ;
- template<class... Args> iterator emplace(Args &&...) ;
- template<class... Args> iterator emplace_hint(const_iterator, Args &&...) ;
- iterator erase(const_iterator) ;
- size_type erase(const key_type &) ;
- iterator erase(const_iterator, const_iterator) ;
- void clear() ;
- iterator find(const key_type &) ;
- const_iterator find(const key_type &) const;
- size_type count(const key_type &) const;
- iterator lower_bound(const key_type &) ;
- const_iterator lower_bound(const key_type &) const;
- iterator upper_bound(const key_type &) ;
- const_iterator upper_bound(const key_type &) const;
- std::pair< iterator, iterator > equal_range(const key_type &) ;
- std::pair< const_iterator, const_iterator >
- equal_range(const key_type &) const;
-};</pre></div>
+ // public member functions
+ key_compare key_comp() const;
+ value_compare value_comp() const;
+ allocator_type get_allocator() const;
+ const stored_allocator_type & get_stored_allocator() const;
+ stored_allocator_type & get_stored_allocator();
+ iterator begin();
+ const_iterator begin() const;
+ iterator end();
+ const_iterator end() const;
+ reverse_iterator rbegin();
+ const_reverse_iterator rbegin() const;
+ reverse_iterator rend();
+ const_reverse_iterator rend() const;
+ const_iterator cbegin() const;
+ const_iterator cend() const;
+ const_reverse_iterator crbegin() const;
+ const_reverse_iterator crend() const;
+ bool empty() const;
+ size_type size() const;
+ size_type max_size() const;
+ void swap(multiset &);
+ iterator insert(const T &);
+ iterator insert(value_type &&);
+ iterator insert(const_iterator, const T &);
+ iterator insert(const_iterator, value_type &&);
+ template<typename InputIterator> void insert(InputIterator, InputIterator);
+ template<class... Args> iterator emplace(Args &&...);
+ template<class... Args> iterator emplace_hint(const_iterator, Args &&...);
+ iterator erase(const_iterator);
+ size_type erase(const key_type &);
+ iterator erase(const_iterator, const_iterator);
+ void clear();
+ iterator find(const key_type &);
+ const_iterator find(const key_type &) const;
+ size_type count(const key_type &) const;
+ iterator lower_bound(const key_type &);
+ const_iterator lower_bound(const key_type &) const;
+ iterator upper_bound(const key_type &);
+ const_iterator upper_bound(const key_type &) const;
+ std::pair< iterator, iterator > equal_range(const key_type &);
+ std::pair< const_iterator, const_iterator >
+ equal_range(const key_type &) const;
+};</pre></div>
<div class="refsect1" lang="en">
-<a name="id514244"></a><h2>Description</h2>
+<a name="id828103"></a><h2>Description</h2>
A multiset is a kind of associative container that supports equivalent keys (possibly contains multiple copies of the same key value) and provides for fast retrieval of the keys themselves. Class multiset supports bidirectional iterators.
A multiset satisfies all of the requirements of a container and of a reversible container, and of an associative container). multiset also provides most operations described for duplicate keys. 
<div class="refsect2" lang="en">
-<a name="id514252"></a><h3>
+<a name="id828111"></a><h3>
<a name="boost.container.multisetconstruct-copy-destruct"></a><code class="computeroutput">multiset</code>
 public
 construct/copy/destruct</h3>
<div class="orderedlist"><ol type="1">
<li>
-<pre class="literallayout"><a name="id316653-bb"></a>multiset(const Pred & comp = Pred(),
- const allocator_type & a = allocator_type());</pre>
+<pre class="literallayout"><a name="id395924-bb"></a>multiset(const Pred & comp = Pred(),
+ const allocator_type & a = allocator_type());</pre>
Effects: Constructs an empty multiset using the specified comparison object and allocator.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">template<typename InputIterator>
- <a name="id316681-bb"></a>multiset(InputIterator first, InputIterator last,
- const Pred & comp = Pred(),
- const allocator_type & a = allocator_type());</pre>
+<pre class="literallayout">template<typename InputIterator>
+ <a name="id395953-bb"></a>multiset(InputIterator first, InputIterator last,
+ const Pred & comp = Pred(),
+ const allocator_type & a = allocator_type());</pre>
Effects: Constructs an empty multiset using the specified comparison object and allocator, and inserts elements from the range [first ,last ).
Complexity: Linear in N if the range [first ,last ) is already sorted using comp and otherwise N logN, where N is last - first. 
</li>
<li>
-<pre class="literallayout">template<typename InputIterator>
- <a name="id316726-bb"></a>multiset(ordered_range_t ordered_range, InputIterator first,
- InputIterator last, const Pred & comp = Pred(),
- const allocator_type & a = allocator_type());</pre>
+<pre class="literallayout">template<typename InputIterator>
+ <a name="id395997-bb"></a>multiset(ordered_range_t ordered_range, InputIterator first,
+ InputIterator last, const Pred & comp = Pred(),
+ const allocator_type & a = allocator_type());</pre>
Effects: Constructs an empty multiset using the specified comparison object and allocator, and inserts elements from the ordered range [first ,last ). This function is more efficient than the normal range creation for ordered ranges.
Requires: [first ,last) must be ordered according to the predicate.
Complexity: Linear in N. 
</li>
<li>
-<pre class="literallayout"><a name="id316782-bb"></a>multiset(const multiset & x);</pre>
+<pre class="literallayout"><a name="id396054-bb"></a>multiset(const multiset & x);</pre>
Effects: Copy constructs a multiset.
Complexity: Linear in x.size(). 
</li>
<li>
-<pre class="literallayout"><a name="id316805-bb"></a>multiset(multiset && x);</pre>
+<pre class="literallayout"><a name="id396076-bb"></a>multiset(multiset && x);</pre>
Effects: Move constructs a multiset. Constructs *this using x's resources.
Complexity: Construct.
Postcondition: x is emptied. 
</li>
<li>
-<pre class="literallayout">multiset& <a name="id316833-bb"></a>operator=(const multiset & x);</pre>
+<pre class="literallayout">multiset& <a name="id396104-bb"></a>operator=(const multiset & x);</pre>
Effects: Makes *this a copy of x.
Complexity: Linear in x.size(). 
</li>
<li>
-<pre class="literallayout">multiset& <a name="id316855-bb"></a>operator=(multiset && x);</pre>
+<pre class="literallayout">multiset& <a name="id396127-bb"></a>operator=(multiset && x);</pre>
Effects: this->swap(x.get()).
Complexity: Constant. 
</li>
</ol></div>
</div>
<div class="refsect2" lang="en">
-<a name="id514519"></a><h3>
-<a name="id314021-bb"></a><code class="computeroutput">multiset</code> public member functions</h3>
+<a name="id828716"></a><h3>
+<a name="id394863-bb"></a><code class="computeroutput">multiset</code> public member functions</h3>
<div class="orderedlist"><ol type="1">
<li>
-<pre class="literallayout">key_compare <a name="id314024-bb"></a>key_comp() const;</pre>
+<pre class="literallayout">key_compare <a name="id394866-bb"></a>key_comp() const;</pre>
Effects: Returns the comparison object out of which a was constructed.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">value_compare <a name="id314044-bb"></a>value_comp() const;</pre>
+<pre class="literallayout">value_compare <a name="id394886-bb"></a>value_comp() const;</pre>
Effects: Returns an object of value_compare constructed out of the comparison object.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">allocator_type <a name="id314063-bb"></a>get_allocator() const;</pre>
+<pre class="literallayout">allocator_type <a name="id394905-bb"></a>get_allocator() const;</pre>
Effects: Returns a copy of the Allocator that was passed to the object's constructor.
Complexity: Constant. 
</li>
-<li><pre class="literallayout">const stored_allocator_type & <a name="id314082-bb"></a>get_stored_allocator() const;</pre></li>
-<li><pre class="literallayout">stored_allocator_type & <a name="id314088-bb"></a>get_stored_allocator() ;</pre></li>
+<li><pre class="literallayout">const stored_allocator_type & <a name="id394924-bb"></a>get_stored_allocator() const;</pre></li>
+<li><pre class="literallayout">stored_allocator_type & <a name="id394930-bb"></a>get_stored_allocator();</pre></li>
<li>
-<pre class="literallayout">iterator <a name="id314094-bb"></a>begin() ;</pre>
+<pre class="literallayout">iterator <a name="id394936-bb"></a>begin();</pre>
Effects: Returns an iterator to the first element contained in the container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_iterator <a name="id314120-bb"></a>begin() const;</pre>
+<pre class="literallayout">const_iterator <a name="id394962-bb"></a>begin() const;</pre>
Effects: Returns a const_iterator to the first element contained in the container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id314145-bb"></a>end() ;</pre>
+<pre class="literallayout">iterator <a name="id394987-bb"></a>end();</pre>
Effects: Returns an iterator to the end of the container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_iterator <a name="id314170-bb"></a>end() const;</pre>
+<pre class="literallayout">const_iterator <a name="id395012-bb"></a>end() const;</pre>
Effects: Returns a const_iterator to the end of the container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">reverse_iterator <a name="id314195-bb"></a>rbegin() ;</pre>
+<pre class="literallayout">reverse_iterator <a name="id395037-bb"></a>rbegin();</pre>
Effects: Returns a reverse_iterator pointing to the beginning of the reversed container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_reverse_iterator <a name="id314220-bb"></a>rbegin() const;</pre>
+<pre class="literallayout">const_reverse_iterator <a name="id395062-bb"></a>rbegin() const;</pre>
Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">reverse_iterator <a name="id314246-bb"></a>rend() ;</pre>
+<pre class="literallayout">reverse_iterator <a name="id395088-bb"></a>rend();</pre>
Effects: Returns a reverse_iterator pointing to the end of the reversed container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_reverse_iterator <a name="id314271-bb"></a>rend() const;</pre>
+<pre class="literallayout">const_reverse_iterator <a name="id395113-bb"></a>rend() const;</pre>
Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_iterator <a name="id314296-bb"></a>cbegin() const;</pre>
+<pre class="literallayout">const_iterator <a name="id395138-bb"></a>cbegin() const;</pre>
Effects: Returns a const_iterator to the first element contained in the container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_iterator <a name="id314321-bb"></a>cend() const;</pre>
+<pre class="literallayout">const_iterator <a name="id395163-bb"></a>cend() const;</pre>
Effects: Returns a const_iterator to the end of the container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_reverse_iterator <a name="id314346-bb"></a>crbegin() const;</pre>
+<pre class="literallayout">const_reverse_iterator <a name="id395188-bb"></a>crbegin() const;</pre>
Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_reverse_iterator <a name="id314372-bb"></a>crend() const;</pre>
+<pre class="literallayout">const_reverse_iterator <a name="id395214-bb"></a>crend() const;</pre>
Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">bool <a name="id314397-bb"></a>empty() const;</pre>
+<pre class="literallayout">bool <a name="id395239-bb"></a>empty() const;</pre>
Effects: Returns true if the container contains no elements.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">size_type <a name="id314422-bb"></a>size() const;</pre>
+<pre class="literallayout">size_type <a name="id395264-bb"></a>size() const;</pre>
Effects: Returns the number of the elements contained in the container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">size_type <a name="id314447-bb"></a>max_size() const;</pre>
+<pre class="literallayout">size_type <a name="id395289-bb"></a>max_size() const;</pre>
Effects: Returns the largest possible size of the container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">void <a name="id314472-bb"></a>swap(multiset & x) ;</pre>
+<pre class="literallayout">void <a name="id395314-bb"></a>swap(multiset & x);</pre>
Effects: Swaps the contents of *this and x. If this->allocator_type() != x.allocator_type() allocators are also swapped.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id314505-bb"></a>insert(const T & x) ;</pre>
+<pre class="literallayout">iterator <a name="id395347-bb"></a>insert(const T & x);</pre>
Effects: Inserts x and returns the iterator pointing to the newly inserted element.
Complexity: Logarithmic. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id314529-bb"></a>insert(value_type && x) ;</pre>
+<pre class="literallayout">iterator <a name="id395371-bb"></a>insert(value_type && x);</pre>
Effects: Inserts a copy of x in the container.
Returns: An iterator pointing to the element with key equivalent to the key of x.
Complexity: Logarithmic in general, but amortized constant if t is inserted right before p. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id314559-bb"></a>insert(const_iterator p, const T & x) ;</pre>
+<pre class="literallayout">iterator <a name="id395401-bb"></a>insert(const_iterator p, const T & x);</pre>
Effects: Inserts a copy of x in the container. p is a hint pointing to where the insert should start to search.
Returns: An iterator pointing to the element with key equivalent to the key of x.
Complexity: Logarithmic in general, but amortized constant if t is inserted right before p. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id314594-bb"></a>insert(const_iterator p, value_type && x) ;</pre>
+<pre class="literallayout">iterator <a name="id395436-bb"></a>insert(const_iterator p, value_type && x);</pre>
Effects: Inserts a value move constructed from x in the container. p is a hint pointing to where the insert should start to search.
Returns: An iterator pointing to the element with key equivalent to the key of x.
Complexity: Logarithmic in general, but amortized constant if t is inserted right before p. 
</li>
<li>
-<pre class="literallayout">template<typename InputIterator>
- void <a name="id314628-bb"></a>insert(InputIterator first, InputIterator last) ;</pre>
+<pre class="literallayout">template<typename InputIterator>
+ void <a name="id395470-bb"></a>insert(InputIterator first, InputIterator last);</pre>
Requires: i, j are not iterators into *this.
Effects: inserts each element from the range [i,j) .
Complexity: N log(size()+N) (N is the distance from i to j) 
</li>
<li>
-<pre class="literallayout">template<class... Args> iterator <a name="id316240-bb"></a>emplace(Args &&... args) ;</pre>
+<pre class="literallayout">template<class... Args> iterator <a name="id395511-bb"></a>emplace(Args &&... args);</pre>
Effects: Inserts an object of type T constructed with std::forward<Args>(args)... and returns the iterator pointing to the newly inserted element.
Complexity: Logarithmic. 
</li>
<li>
-<pre class="literallayout">template<class... Args>
- iterator <a name="id316272-bb"></a>emplace_hint(const_iterator hint, Args &&... args) ;</pre>
+<pre class="literallayout">template<class... Args>
+ iterator <a name="id395544-bb"></a>emplace_hint(const_iterator hint, Args &&... args);</pre>
Effects: Inserts an object of type T constructed with std::forward<Args>(args)...
Returns: An iterator pointing to the element with key equivalent to the key of x.
Complexity: Logarithmic in general, but amortized constant if t is inserted right before p. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id316315-bb"></a>erase(const_iterator p) ;</pre>
+<pre class="literallayout">iterator <a name="id395587-bb"></a>erase(const_iterator p);</pre>
Effects: Erases the element pointed to by p.
Returns: Returns an iterator pointing to the element immediately following q prior to the element being erased. If no such element exists, returns end().
Complexity: Amortized constant time 
</li>
<li>
-<pre class="literallayout">size_type <a name="id316345-bb"></a>erase(const key_type & x) ;</pre>
+<pre class="literallayout">size_type <a name="id395617-bb"></a>erase(const key_type & x);</pre>
Effects: Erases all elements in the container with key equivalent to x.
Returns: Returns the number of erased elements.
Complexity: log(size()) + count(k) 
</li>
<li>
-<pre class="literallayout">iterator <a name="id316375-bb"></a>erase(const_iterator first, const_iterator last) ;</pre>
+<pre class="literallayout">iterator <a name="id395647-bb"></a>erase(const_iterator first, const_iterator last);</pre>
Effects: Erases all the elements in the range [first, last).
Returns: Returns last.
Complexity: log(size())+N where N is the distance from first to last. 
</li>
<li>
-<pre class="literallayout">void <a name="id316411-bb"></a>clear() ;</pre>
+<pre class="literallayout">void <a name="id395683-bb"></a>clear();</pre>
Effects: erase(a.begin(),a.end()).
Postcondition: size() == 0.
Complexity: linear in size(). 
</li>
<li>
-<pre class="literallayout">iterator <a name="id316437-bb"></a>find(const key_type & x) ;</pre>
+<pre class="literallayout">iterator <a name="id395708-bb"></a>find(const key_type & x);</pre>
Returns: An iterator pointing to an element with the key equivalent to x, or end() if such an element is not found.
Complexity: Logarithmic. 
</li>
<li>
-<pre class="literallayout">const_iterator <a name="id316461-bb"></a>find(const key_type & x) const;</pre>
+<pre class="literallayout">const_iterator <a name="id395732-bb"></a>find(const key_type & x) const;</pre>
Returns: A const iterator pointing to an element with the key equivalent to x, or end() if such an element is not found.
Complexity: Logarithmic. 
</li>
<li>
-<pre class="literallayout">size_type <a name="id316485-bb"></a>count(const key_type & x) const;</pre>
+<pre class="literallayout">size_type <a name="id395756-bb"></a>count(const key_type & x) const;</pre>
Returns: The number of elements with key equivalent to x.
Complexity: log(size())+count(k) 
</li>
<li>
-<pre class="literallayout">iterator <a name="id316509-bb"></a>lower_bound(const key_type & x) ;</pre>
+<pre class="literallayout">iterator <a name="id395780-bb"></a>lower_bound(const key_type & x);</pre>
Returns: An iterator pointing to the first element with key not less than k, or a.end() if such an element is not found.
Complexity: Logarithmic 
</li>
<li>
-<pre class="literallayout">const_iterator <a name="id316533-bb"></a>lower_bound(const key_type & x) const;</pre>
+<pre class="literallayout">const_iterator <a name="id395804-bb"></a>lower_bound(const key_type & x) const;</pre>
Returns: A const iterator pointing to the first element with key not less than k, or a.end() if such an element is not found.
Complexity: Logarithmic 
</li>
<li>
-<pre class="literallayout">iterator <a name="id316557-bb"></a>upper_bound(const key_type & x) ;</pre>
+<pre class="literallayout">iterator <a name="id395828-bb"></a>upper_bound(const key_type & x);</pre>
Returns: An iterator pointing to the first element with key not less than x, or end() if such an element is not found.
Complexity: Logarithmic 
</li>
<li>
-<pre class="literallayout">const_iterator <a name="id316581-bb"></a>upper_bound(const key_type & x) const;</pre>
+<pre class="literallayout">const_iterator <a name="id395852-bb"></a>upper_bound(const key_type & x) const;</pre>
Returns: A const iterator pointing to the first element with key not less than x, or end() if such an element is not found.
Complexity: Logarithmic 
</li>
<li>
-<pre class="literallayout">std::pair< iterator, iterator > <a name="id316605-bb"></a>equal_range(const key_type & x) ;</pre>
+<pre class="literallayout">std::pair< iterator, iterator > <a name="id395876-bb"></a>equal_range(const key_type & x);</pre>
Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).
Complexity: Logarithmic 
</li>
<li>
-<pre class="literallayout">std::pair< const_iterator, const_iterator >
-<a name="id316629-bb"></a>equal_range(const key_type & x) const;</pre>
+<pre class="literallayout">std::pair< const_iterator, const_iterator >
+<a name="id395900-bb"></a>equal_range(const key_type & x) const;</pre>
Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).
Complexity: Logarithmic 
</li>
@@ -401,7 +401,7 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2009 -2010 Ion Gaztanaga
+<td align="right"><div class="copyright-footer">Copyright © 2009 -2011 Ion Gaztanaga
 Distributed under the Boost Software License, Version 1.0. (See accompanying
 file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
@@ -409,7 +409,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="set.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.set_hpp"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="slist.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="set.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.set_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="slist.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>

Modified: sandbox/move/libs/container/doc/html/boost/container/ordered_range.html
==============================================================================
--- sandbox/move/libs/container/doc/html/boost/container/ordered_range.html (original)
+++ sandbox/move/libs/container/doc/html/boost/container/ordered_range.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
@@ -1,12 +1,12 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Global ordered_range</title>
-<link rel="stylesheet" href="../../boostbook.css" type="text/css">
+<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
-<link rel="start" href="../../index.html" title="Chapter 1. Boost.Container">
+<link rel="start" href="../../index.html" title="Chapter 1. Boost.Container">
<link rel="up" href="../../boost_container_reference.html#header.boost.container.container_fwd_hpp" title="Header <boost/container/container_fwd.hpp>">
-<link rel="prev" href="ordered_unique_range_im_id293621.html" title="Struct ordered_unique_range_impl_t">
+<link rel="prev" href="ordered_unique_range_im_id371369.html" title="Struct ordered_unique_range_impl_t">
<link rel="next" href="ordered_unique_range.html" title="Global ordered_unique_range">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
@@ -20,7 +20,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="ordered_unique_range_im_id293621.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.container_fwd_hpp"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="ordered_unique_range.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="ordered_unique_range_im_id371369.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.container_fwd_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="ordered_unique_range.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="refentry" lang="en">
<a name="boost.container.ordered_range"></a><div class="titlepage"></div>
@@ -29,17 +29,17 @@
boost::container::ordered_range — 
</div>
<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2>
-<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/container/container_fwd.hpp>
+<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/container/container_fwd.hpp>

-static const ordered_range_t ordered_range;</pre></div>
+static const ordered_range_t ordered_range;</pre></div>
<div class="refsect1" lang="en">
-<a name="id470823"></a><h2>Description</h2>
+<a name="id737794"></a><h2>Description</h2>
Value used to tag that the input range is guaranteed to be ordered 
</div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2009 -2010 Ion Gaztanaga
+<td align="right"><div class="copyright-footer">Copyright © 2009 -2011 Ion Gaztanaga
 Distributed under the Boost Software License, Version 1.0. (See accompanying
 file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
@@ -47,7 +47,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="ordered_unique_range_im_id293621.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.container_fwd_hpp"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="ordered_unique_range.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="ordered_unique_range_im_id371369.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.container_fwd_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="ordered_unique_range.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>

Modified: sandbox/move/libs/container/doc/html/boost/container/ordered_range_impl_t.html
==============================================================================
--- sandbox/move/libs/container/doc/html/boost/container/ordered_range_impl_t.html (original)
+++ sandbox/move/libs/container/doc/html/boost/container/ordered_range_impl_t.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
@@ -1,13 +1,13 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Struct ordered_range_impl_t</title>
-<link rel="stylesheet" href="../../boostbook.css" type="text/css">
+<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
-<link rel="start" href="../../index.html" title="Chapter 1. Boost.Container">
+<link rel="start" href="../../index.html" title="Chapter 1. Boost.Container">
<link rel="up" href="../../boost_container_reference.html#header.boost.container.container_fwd_hpp" title="Header <boost/container/container_fwd.hpp>">
<link rel="prev" href="../../boost_container_reference.html" title="Boost.Container Reference">
-<link rel="next" href="ordered_unique_range_im_id293621.html" title="Struct ordered_unique_range_impl_t">
+<link rel="next" href="ordered_unique_range_im_id371369.html" title="Struct ordered_unique_range_impl_t">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
@@ -20,7 +20,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="../../boost_container_reference.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.container_fwd_hpp"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="ordered_unique_range_im_id293621.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="../../boost_container_reference.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.container_fwd_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="ordered_unique_range_im_id371369.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="refentry" lang="en">
<a name="boost.container.ordered_range_impl_t"></a><div class="titlepage"></div>
@@ -29,19 +29,19 @@
boost::container::ordered_range_impl_t — 
</div>
<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2>
-<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/container/container_fwd.hpp>
+<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/container/container_fwd.hpp>

-
-struct ordered_range_impl_t {
-};</pre></div>
+
+struct ordered_range_impl_t {
+};</pre></div>
<div class="refsect1" lang="en">
-<a name="id470748"></a><h2>Description</h2>
+<a name="id737690"></a><h2>Description</h2>
Type used to tag that the input range is guaranteed to be ordered 
</div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2009 -2010 Ion Gaztanaga
+<td align="right"><div class="copyright-footer">Copyright © 2009 -2011 Ion Gaztanaga
 Distributed under the Boost Software License, Version 1.0. (See accompanying
 file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
@@ -49,7 +49,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="../../boost_container_reference.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.container_fwd_hpp"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="ordered_unique_range_im_id293621.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="../../boost_container_reference.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.container_fwd_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="ordered_unique_range_im_id371369.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>

Modified: sandbox/move/libs/container/doc/html/boost/container/ordered_unique_range.html
==============================================================================
--- sandbox/move/libs/container/doc/html/boost/container/ordered_unique_range.html (original)
+++ sandbox/move/libs/container/doc/html/boost/container/ordered_unique_range.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
@@ -1,10 +1,10 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Global ordered_unique_range</title>
-<link rel="stylesheet" href="../../boostbook.css" type="text/css">
+<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
-<link rel="start" href="../../index.html" title="Chapter 1. Boost.Container">
+<link rel="start" href="../../index.html" title="Chapter 1. Boost.Container">
<link rel="up" href="../../boost_container_reference.html#header.boost.container.container_fwd_hpp" title="Header <boost/container/container_fwd.hpp>">
<link rel="prev" href="ordered_range.html" title="Global ordered_range">
<link rel="next" href="deque.html" title="Class template deque">
@@ -20,7 +20,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="ordered_range.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.container_fwd_hpp"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="deque.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="ordered_range.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.container_fwd_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="deque.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="refentry" lang="en">
<a name="boost.container.ordered_unique_range"></a><div class="titlepage"></div>
@@ -29,17 +29,17 @@
boost::container::ordered_unique_range — 
</div>
<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2>
-<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/container/container_fwd.hpp>
+<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/container/container_fwd.hpp>

-static const ordered_unique_range_t ordered_unique_range;</pre></div>
+static const ordered_unique_range_t ordered_unique_range;</pre></div>
<div class="refsect1" lang="en">
-<a name="id470858"></a><h2>Description</h2>
+<a name="id737843"></a><h2>Description</h2>
Value used to tag that the input range is guaranteed to be ordered and unique 
</div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2009 -2010 Ion Gaztanaga
+<td align="right"><div class="copyright-footer">Copyright © 2009 -2011 Ion Gaztanaga
 Distributed under the Boost Software License, Version 1.0. (See accompanying
 file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
@@ -47,7 +47,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="ordered_range.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.container_fwd_hpp"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="deque.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="ordered_range.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.container_fwd_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="deque.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>

Added: sandbox/move/libs/container/doc/html/boost/container/ordered_unique_range_im_id293621.html
==============================================================================
--- (empty file)
+++ sandbox/move/libs/container/doc/html/boost/container/ordered_unique_range_im_id293621.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
@@ -0,0 +1,55 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<title>Struct ordered_unique_range_impl_t</title>
+<link rel="stylesheet" href="../../boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
+<link rel="start" href="../../index.html" title="Chapter 1. Boost.Container">
+<link rel="up" href="../../boost_container_reference.html#header.boost.container.container_fwd_hpp" title="Header <boost/container/container_fwd.hpp>">
+<link rel="prev" href="ordered_range_impl_t.html" title="Struct ordered_range_impl_t">
+<link rel="next" href="ordered_range.html" title="Global ordered_range">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
+<td align="center">Home</td>
+<td align="center">Libraries</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
+<td align="center">More</td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="ordered_range_impl_t.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.container_fwd_hpp"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="ordered_range.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="refentry" lang="en">
+<a name="boost.container.ordered_unique_range_im_id293621"></a><div class="titlepage"></div>
+<div class="refnamediv">
+<h2>Struct ordered_unique_range_impl_t</h2>
+boost::container::ordered_unique_range_impl_t — 
+</div>
+<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2>
+<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/container/container_fwd.hpp>
+
+
+struct ordered_unique_range_impl_t {
+};</pre></div>
+<div class="refsect1" lang="en">
+<a name="id470788"></a><h2>Description</h2>
+Type used to tag that the input range is guaranteed to be ordered and unique 
+</div>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 2009 -2010 Ion Gaztanaga
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="ordered_range_impl_t.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.container_fwd_hpp"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="ordered_range.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: sandbox/move/libs/container/doc/html/boost/container/ordered_unique_range_im_id358162.html
==============================================================================
--- (empty file)
+++ sandbox/move/libs/container/doc/html/boost/container/ordered_unique_range_im_id358162.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
@@ -0,0 +1,55 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Struct ordered_unique_range_impl_t</title>
+<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
+<link rel="start" href="../../index.html" title="Chapter 1. Boost.Container">
+<link rel="up" href="../../boost_container_reference.html#header.boost.container.container_fwd_hpp" title="Header <boost/container/container_fwd.hpp>">
+<link rel="prev" href="ordered_range_impl_t.html" title="Struct ordered_range_impl_t">
+<link rel="next" href="ordered_range.html" title="Global ordered_range">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
+<td align="center">Home</td>
+<td align="center">Libraries</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
+<td align="center">More</td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="ordered_range_impl_t.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.container_fwd_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="ordered_range.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="refentry" lang="en">
+<a name="boost.container.ordered_unique_range_im_id358162"></a><div class="titlepage"></div>
+<div class="refnamediv">
+<h2>Struct ordered_unique_range_impl_t</h2>
+boost::container::ordered_unique_range_impl_t — 
+</div>
+<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2>
+<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/container/container_fwd.hpp>
+
+
+struct ordered_unique_range_impl_t {
+};</pre></div>
+<div class="refsect1" lang="en">
+<a name="id767236"></a><h2>Description</h2>
+Type used to tag that the input range is guaranteed to be ordered and unique 
+</div>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 2009 -2010 Ion Gaztanaga
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="ordered_range_impl_t.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.container_fwd_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="ordered_range.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: sandbox/move/libs/container/doc/html/boost/container/ordered_unique_range_im_id367403.html
==============================================================================
--- (empty file)
+++ sandbox/move/libs/container/doc/html/boost/container/ordered_unique_range_im_id367403.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
@@ -0,0 +1,55 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Struct ordered_unique_range_impl_t</title>
+<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
+<link rel="start" href="../../index.html" title="Chapter 1. Boost.Container">
+<link rel="up" href="../../boost_container_reference.html#header.boost.container.container_fwd_hpp" title="Header <boost/container/container_fwd.hpp>">
+<link rel="prev" href="ordered_range_impl_t.html" title="Struct ordered_range_impl_t">
+<link rel="next" href="ordered_range.html" title="Global ordered_range">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
+<td align="center">Home</td>
+<td align="center">Libraries</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
+<td align="center">More</td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="ordered_range_impl_t.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.container_fwd_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="ordered_range.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="refentry" lang="en">
+<a name="boost.container.ordered_unique_range_im_id367403"></a><div class="titlepage"></div>
+<div class="refnamediv">
+<h2>Struct ordered_unique_range_impl_t</h2>
+boost::container::ordered_unique_range_impl_t — 
+</div>
+<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2>
+<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/container/container_fwd.hpp>
+
+
+struct ordered_unique_range_impl_t {
+};</pre></div>
+<div class="refsect1" lang="en">
+<a name="id739929"></a><h2>Description</h2>
+Type used to tag that the input range is guaranteed to be ordered and unique 
+</div>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 2009 -2010 Ion Gaztanaga
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="ordered_range_impl_t.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.container_fwd_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="ordered_range.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: sandbox/move/libs/container/doc/html/boost/container/ordered_unique_range_im_id367446.html
==============================================================================
--- (empty file)
+++ sandbox/move/libs/container/doc/html/boost/container/ordered_unique_range_im_id367446.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
@@ -0,0 +1,55 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Struct ordered_unique_range_impl_t</title>
+<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
+<link rel="start" href="../../index.html" title="Chapter 1. Boost.Container">
+<link rel="up" href="../../boost_container_reference.html#header.boost.container.container_fwd_hpp" title="Header <boost/container/container_fwd.hpp>">
+<link rel="prev" href="ordered_range_impl_t.html" title="Struct ordered_range_impl_t">
+<link rel="next" href="ordered_range.html" title="Global ordered_range">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
+<td align="center">Home</td>
+<td align="center">Libraries</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
+<td align="center">More</td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="ordered_range_impl_t.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.container_fwd_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="ordered_range.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="refentry" lang="en">
+<a name="boost.container.ordered_unique_range_im_id367446"></a><div class="titlepage"></div>
+<div class="refnamediv">
+<h2>Struct ordered_unique_range_impl_t</h2>
+boost::container::ordered_unique_range_impl_t — 
+</div>
+<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2>
+<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/container/container_fwd.hpp>
+
+
+struct ordered_unique_range_impl_t {
+};</pre></div>
+<div class="refsect1" lang="en">
+<a name="id735560"></a><h2>Description</h2>
+Type used to tag that the input range is guaranteed to be ordered and unique 
+</div>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 2009 -2010 Ion Gaztanaga
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="ordered_range_impl_t.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.container_fwd_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="ordered_range.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: sandbox/move/libs/container/doc/html/boost/container/ordered_unique_range_im_id368672.html
==============================================================================
--- (empty file)
+++ sandbox/move/libs/container/doc/html/boost/container/ordered_unique_range_im_id368672.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
@@ -0,0 +1,55 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Struct ordered_unique_range_impl_t</title>
+<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
+<link rel="start" href="../../index.html" title="Chapter 1. Boost.Container">
+<link rel="up" href="../../boost_container_reference.html#header.boost.container.container_fwd_hpp" title="Header <boost/container/container_fwd.hpp>">
+<link rel="prev" href="ordered_range_impl_t.html" title="Struct ordered_range_impl_t">
+<link rel="next" href="ordered_range.html" title="Global ordered_range">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
+<td align="center">Home</td>
+<td align="center">Libraries</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
+<td align="center">More</td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="ordered_range_impl_t.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.container_fwd_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="ordered_range.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="refentry" lang="en">
+<a name="boost.container.ordered_unique_range_im_id368672"></a><div class="titlepage"></div>
+<div class="refnamediv">
+<h2>Struct ordered_unique_range_impl_t</h2>
+boost::container::ordered_unique_range_impl_t — 
+</div>
+<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2>
+<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/container/container_fwd.hpp>
+
+
+struct ordered_unique_range_impl_t {
+};</pre></div>
+<div class="refsect1" lang="en">
+<a name="id738837"></a><h2>Description</h2>
+Type used to tag that the input range is guaranteed to be ordered and unique 
+</div>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 2009 -2010 Ion Gaztanaga
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="ordered_range_impl_t.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.container_fwd_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="ordered_range.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: sandbox/move/libs/container/doc/html/boost/container/ordered_unique_range_im_id370119.html
==============================================================================
--- (empty file)
+++ sandbox/move/libs/container/doc/html/boost/container/ordered_unique_range_im_id370119.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
@@ -0,0 +1,55 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Struct ordered_unique_range_impl_t</title>
+<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
+<link rel="start" href="../../index.html" title="Chapter 1. Boost.Container">
+<link rel="up" href="../../boost_container_reference.html#header.boost.container.container_fwd_hpp" title="Header <boost/container/container_fwd.hpp>">
+<link rel="prev" href="ordered_range_impl_t.html" title="Struct ordered_range_impl_t">
+<link rel="next" href="ordered_range.html" title="Global ordered_range">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
+<td align="center">Home</td>
+<td align="center">Libraries</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
+<td align="center">More</td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="ordered_range_impl_t.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.container_fwd_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="ordered_range.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="refentry" lang="en">
+<a name="boost.container.ordered_unique_range_im_id370119"></a><div class="titlepage"></div>
+<div class="refnamediv">
+<h2>Struct ordered_unique_range_impl_t</h2>
+boost::container::ordered_unique_range_impl_t — 
+</div>
+<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2>
+<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/container/container_fwd.hpp>
+
+
+struct ordered_unique_range_impl_t {
+};</pre></div>
+<div class="refsect1" lang="en">
+<a name="id725729"></a><h2>Description</h2>
+Type used to tag that the input range is guaranteed to be ordered and unique 
+</div>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 2009 -2010 Ion Gaztanaga
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="ordered_range_impl_t.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.container_fwd_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="ordered_range.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: sandbox/move/libs/container/doc/html/boost/container/ordered_unique_range_im_id371369.html
==============================================================================
--- (empty file)
+++ sandbox/move/libs/container/doc/html/boost/container/ordered_unique_range_im_id371369.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
@@ -0,0 +1,55 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Struct ordered_unique_range_impl_t</title>
+<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
+<link rel="start" href="../../index.html" title="Chapter 1. Boost.Container">
+<link rel="up" href="../../boost_container_reference.html#header.boost.container.container_fwd_hpp" title="Header <boost/container/container_fwd.hpp>">
+<link rel="prev" href="ordered_range_impl_t.html" title="Struct ordered_range_impl_t">
+<link rel="next" href="ordered_range.html" title="Global ordered_range">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
+<td align="center">Home</td>
+<td align="center">Libraries</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
+<td align="center">More</td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="ordered_range_impl_t.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.container_fwd_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="ordered_range.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="refentry" lang="en">
+<a name="boost.container.ordered_unique_range_im_id371369"></a><div class="titlepage"></div>
+<div class="refnamediv">
+<h2>Struct ordered_unique_range_impl_t</h2>
+boost::container::ordered_unique_range_impl_t — 
+</div>
+<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2>
+<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/container/container_fwd.hpp>
+
+
+struct ordered_unique_range_impl_t {
+};</pre></div>
+<div class="refsect1" lang="en">
+<a name="id737744"></a><h2>Description</h2>
+Type used to tag that the input range is guaranteed to be ordered and unique 
+</div>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 2009 -2011 Ion Gaztanaga
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="ordered_range_impl_t.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.container_fwd_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="ordered_range.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: sandbox/move/libs/container/doc/html/boost/container/ordered_unique_range_im_id377276.html
==============================================================================
--- (empty file)
+++ sandbox/move/libs/container/doc/html/boost/container/ordered_unique_range_im_id377276.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
@@ -0,0 +1,55 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Struct ordered_unique_range_impl_t</title>
+<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
+<link rel="start" href="../../index.html" title="Chapter 1. Boost.Container">
+<link rel="up" href="../../boost_container_reference.html#header.boost.container.container_fwd_hpp" title="Header <boost/container/container_fwd.hpp>">
+<link rel="prev" href="ordered_range_impl_t.html" title="Struct ordered_range_impl_t">
+<link rel="next" href="ordered_range.html" title="Global ordered_range">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
+<td align="center">Home</td>
+<td align="center">Libraries</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
+<td align="center">More</td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="ordered_range_impl_t.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.container_fwd_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="ordered_range.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="refentry" lang="en">
+<a name="boost.container.ordered_unique_range_im_id377276"></a><div class="titlepage"></div>
+<div class="refnamediv">
+<h2>Struct ordered_unique_range_impl_t</h2>
+boost::container::ordered_unique_range_impl_t — 
+</div>
+<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2>
+<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/container/container_fwd.hpp>
+
+
+struct ordered_unique_range_impl_t {
+};</pre></div>
+<div class="refsect1" lang="en">
+<a name="id735560"></a><h2>Description</h2>
+Type used to tag that the input range is guaranteed to be ordered and unique 
+</div>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 2009 -2010 Ion Gaztanaga
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="ordered_range_impl_t.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.container_fwd_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="ordered_range.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: sandbox/move/libs/container/doc/html/boost/container/ordered_unique_range_im_id378857.html
==============================================================================
--- (empty file)
+++ sandbox/move/libs/container/doc/html/boost/container/ordered_unique_range_im_id378857.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
@@ -0,0 +1,55 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Struct ordered_unique_range_impl_t</title>
+<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
+<link rel="start" href="../../index.html" title="Chapter 1. Boost.Container">
+<link rel="up" href="../../boost_container_reference.html#header.boost.container.container_fwd_hpp" title="Header <boost/container/container_fwd.hpp>">
+<link rel="prev" href="ordered_range_impl_t.html" title="Struct ordered_range_impl_t">
+<link rel="next" href="ordered_range.html" title="Global ordered_range">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
+<td align="center">Home</td>
+<td align="center">Libraries</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
+<td align="center">More</td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="ordered_range_impl_t.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.container_fwd_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="ordered_range.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="refentry" lang="en">
+<a name="boost.container.ordered_unique_range_im_id378857"></a><div class="titlepage"></div>
+<div class="refnamediv">
+<h2>Struct ordered_unique_range_impl_t</h2>
+boost::container::ordered_unique_range_impl_t — 
+</div>
+<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2>
+<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/container/container_fwd.hpp>
+
+
+struct ordered_unique_range_impl_t {
+};</pre></div>
+<div class="refsect1" lang="en">
+<a name="id759590"></a><h2>Description</h2>
+Type used to tag that the input range is guaranteed to be ordered and unique 
+</div>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 2009 -2011 Ion Gaztanaga
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="ordered_range_impl_t.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.container_fwd_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="ordered_range.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Modified: sandbox/move/libs/container/doc/html/boost/container/set.html
==============================================================================
--- sandbox/move/libs/container/doc/html/boost/container/set.html (original)
+++ sandbox/move/libs/container/doc/html/boost/container/set.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
@@ -1,10 +1,10 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Class template set</title>
-<link rel="stylesheet" href="../../boostbook.css" type="text/css">
+<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
-<link rel="start" href="../../index.html" title="Chapter 1. Boost.Container">
+<link rel="start" href="../../index.html" title="Chapter 1. Boost.Container">
<link rel="up" href="../../boost_container_reference.html#header.boost.container.set_hpp" title="Header <boost/container/set.hpp>">
<link rel="prev" href="multimap.html" title="Class template multimap">
<link rel="next" href="multiset.html" title="Class template multiset">
@@ -20,7 +20,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="multimap.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.set_hpp"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="multiset.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="multimap.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.set_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="multiset.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="refentry" lang="en">
<a name="boost.container.set"></a><div class="titlepage"></div>
@@ -29,368 +29,368 @@
boost::container::set — 
</div>
<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2>
-<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/container/set.hpp>
+<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/container/set.hpp>

-template<typename T, typename Pred, typename Alloc>
-class set {
-public:
- // types
- typedef tree_t::key_type <a name="boost.container.set.key_type"></a>key_type;
- typedef tree_t::value_type <a name="boost.container.set.value_type"></a>value_type;
- typedef tree_t::pointer <a name="boost.container.set.pointer"></a>pointer;
- typedef tree_t::const_pointer <a name="boost.container.set.const_pointer"></a>const_pointer;
- typedef tree_t::reference <a name="boost.container.set.reference"></a>reference;
- typedef tree_t::const_reference <a name="boost.container.set.const_reference"></a>const_reference;
- typedef Pred <a name="boost.container.set.key_compare"></a>key_compare;
- typedef Pred <a name="boost.container.set.value_compare"></a>value_compare;
- typedef tree_t::iterator <a name="boost.container.set.iterator"></a>iterator;
- typedef tree_t::const_iterator <a name="boost.container.set.const_iterator"></a>const_iterator;
- typedef tree_t::reverse_iterator <a name="boost.container.set.reverse_iterator"></a>reverse_iterator;
- typedef tree_t::const_reverse_iterator <a name="boost.container.set.const_reverse_iterator"></a>const_reverse_iterator;
- typedef tree_t::size_type <a name="boost.container.set.size_type"></a>size_type;
- typedef tree_t::difference_type <a name="boost.container.set.difference_type"></a>difference_type;
- typedef tree_t::allocator_type <a name="boost.container.set.allocator_type"></a>allocator_type;
- typedef tree_t::stored_allocator_type <a name="boost.container.set.stored_allocator_type"></a>stored_allocator_type;
+template<typename T, typename Pred, typename Alloc>
+class set {
+public:
+ // types
+ typedef tree_t::key_type <a name="boost.container.set.key_type"></a>key_type;
+ typedef tree_t::value_type <a name="boost.container.set.value_type"></a>value_type;
+ typedef tree_t::pointer <a name="boost.container.set.pointer"></a>pointer;
+ typedef tree_t::const_pointer <a name="boost.container.set.const_pointer"></a>const_pointer;
+ typedef tree_t::reference <a name="boost.container.set.reference"></a>reference;
+ typedef tree_t::const_reference <a name="boost.container.set.const_reference"></a>const_reference;
+ typedef Pred <a name="boost.container.set.key_compare"></a>key_compare;
+ typedef Pred <a name="boost.container.set.value_compare"></a>value_compare;
+ typedef tree_t::iterator <a name="boost.container.set.iterator"></a>iterator;
+ typedef tree_t::const_iterator <a name="boost.container.set.const_iterator"></a>const_iterator;
+ typedef tree_t::reverse_iterator <a name="boost.container.set.reverse_iterator"></a>reverse_iterator;
+ typedef tree_t::const_reverse_iterator <a name="boost.container.set.const_reverse_iterator"></a>const_reverse_iterator;
+ typedef tree_t::size_type <a name="boost.container.set.size_type"></a>size_type;
+ typedef tree_t::difference_type <a name="boost.container.set.difference_type"></a>difference_type;
+ typedef tree_t::allocator_type <a name="boost.container.set.allocator_type"></a>allocator_type;
+ typedef tree_t::stored_allocator_type <a name="boost.container.set.stored_allocator_type"></a>stored_allocator_type;

- // construct/copy/destruct
- set(const Pred & = Pred(), const allocator_type & = allocator_type());
- template<typename InputIterator>
- set(InputIterator, InputIterator, const Pred & = Pred(),
- const allocator_type & = allocator_type());
- template<typename InputIterator>
- set(ordered_unique_range_t, InputIterator, InputIterator,
- const Pred & = Pred(), const allocator_type & = allocator_type());
- set(const set &);
- set(set &&);
- set& operator=(const set &);
- set& operator=(set &&);
+ // construct/copy/destruct
+ set(const Pred & = Pred(), const allocator_type & = allocator_type());
+ template<typename InputIterator>
+ set(InputIterator, InputIterator, const Pred & = Pred(),
+ const allocator_type & = allocator_type());
+ template<typename InputIterator>
+ set(ordered_unique_range_t, InputIterator, InputIterator,
+ const Pred & = Pred(), const allocator_type & = allocator_type());
+ set(const set &);
+ set(set &&);
+ set& operator=(const set &);
+ set& operator=(set &&);

- // public member functions
- key_compare key_comp() const;
- value_compare value_comp() const;
- allocator_type get_allocator() const;
- const stored_allocator_type & get_stored_allocator() const;
- stored_allocator_type & get_stored_allocator() ;
- iterator begin() ;
- const_iterator begin() const;
- iterator end() ;
- const_iterator end() const;
- reverse_iterator rbegin() ;
- const_reverse_iterator rbegin() const;
- reverse_iterator rend() ;
- const_reverse_iterator rend() const;
- const_iterator cbegin() const;
- const_iterator cend() const;
- const_reverse_iterator crbegin() const;
- const_reverse_iterator crend() const;
- bool empty() const;
- size_type size() const;
- size_type max_size() const;
- void swap(set &) ;
- std::pair< iterator, bool > insert(const T &) ;
- std::pair< iterator, bool > insert(value_type &&) ;
- iterator insert(const_iterator, const T &) ;
- iterator insert(const_iterator, value_type &&) ;
- template<typename InputIterator> void insert(InputIterator, InputIterator) ;
- template<class... Args> iterator emplace(Args &&...) ;
- template<class... Args> iterator emplace_hint(const_iterator, Args &&...) ;
- iterator erase(const_iterator) ;
- size_type erase(const key_type &) ;
- iterator erase(const_iterator, const_iterator) ;
- void clear() ;
- iterator find(const key_type &) ;
- const_iterator find(const key_type &) const;
- size_type count(const key_type &) const;
- iterator lower_bound(const key_type &) ;
- const_iterator lower_bound(const key_type &) const;
- iterator upper_bound(const key_type &) ;
- const_iterator upper_bound(const key_type &) const;
- std::pair< iterator, iterator > equal_range(const key_type &) ;
- std::pair< const_iterator, const_iterator >
- equal_range(const key_type &) const;
-};</pre></div>
+ // public member functions
+ key_compare key_comp() const;
+ value_compare value_comp() const;
+ allocator_type get_allocator() const;
+ const stored_allocator_type & get_stored_allocator() const;
+ stored_allocator_type & get_stored_allocator();
+ iterator begin();
+ const_iterator begin() const;
+ iterator end();
+ const_iterator end() const;
+ reverse_iterator rbegin();
+ const_reverse_iterator rbegin() const;
+ reverse_iterator rend();
+ const_reverse_iterator rend() const;
+ const_iterator cbegin() const;
+ const_iterator cend() const;
+ const_reverse_iterator crbegin() const;
+ const_reverse_iterator crend() const;
+ bool empty() const;
+ size_type size() const;
+ size_type max_size() const;
+ void swap(set &);
+ std::pair< iterator, bool > insert(const T &);
+ std::pair< iterator, bool > insert(value_type &&);
+ iterator insert(const_iterator, const T &);
+ iterator insert(const_iterator, value_type &&);
+ template<typename InputIterator> void insert(InputIterator, InputIterator);
+ template<class... Args> iterator emplace(Args &&...);
+ template<class... Args> iterator emplace_hint(const_iterator, Args &&...);
+ iterator erase(const_iterator);
+ size_type erase(const key_type &);
+ iterator erase(const_iterator, const_iterator);
+ void clear();
+ iterator find(const key_type &);
+ const_iterator find(const key_type &) const;
+ size_type count(const key_type &) const;
+ iterator lower_bound(const key_type &);
+ const_iterator lower_bound(const key_type &) const;
+ iterator upper_bound(const key_type &);
+ const_iterator upper_bound(const key_type &) const;
+ std::pair< iterator, iterator > equal_range(const key_type &);
+ std::pair< const_iterator, const_iterator >
+ equal_range(const key_type &) const;
+};</pre></div>
<div class="refsect1" lang="en">
-<a name="id510581"></a><h2>Description</h2>
+<a name="id820438"></a><h2>Description</h2>
A set is a kind of associative container that supports unique keys (contains at most one of each key value) and provides for fast retrieval of the keys themselves. Class set supports bidirectional iterators.
A set satisfies all of the requirements of a container and of a reversible container , and of an associative container. A set also provides most operations described in for unique keys. 
<div class="refsect2" lang="en">
-<a name="id510589"></a><h3>
+<a name="id820446"></a><h3>
<a name="boost.container.setconstruct-copy-destruct"></a><code class="computeroutput">set</code>
 public
 construct/copy/destruct</h3>
<div class="orderedlist"><ol type="1">
<li>
-<pre class="literallayout"><a name="id313698-bb"></a>set(const Pred & comp = Pred(), const allocator_type & a = allocator_type());</pre>
+<pre class="literallayout"><a name="id394540-bb"></a>set(const Pred & comp = Pred(), const allocator_type & a = allocator_type());</pre>
Effects: Constructs an empty set using the specified comparison object and allocator.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">template<typename InputIterator>
- <a name="id313727-bb"></a>set(InputIterator first, InputIterator last, const Pred & comp = Pred(),
- const allocator_type & a = allocator_type());</pre>
+<pre class="literallayout">template<typename InputIterator>
+ <a name="id394569-bb"></a>set(InputIterator first, InputIterator last, const Pred & comp = Pred(),
+ const allocator_type & a = allocator_type());</pre>
Effects: Constructs an empty set using the specified comparison object and allocator, and inserts elements from the range [first ,last ).
Complexity: Linear in N if the range [first ,last ) is already sorted using comp and otherwise N logN, where N is last - first. 
</li>
<li>
-<pre class="literallayout">template<typename InputIterator>
- <a name="id313772-bb"></a>set(ordered_unique_range_t, InputIterator first, InputIterator last,
- const Pred & comp = Pred(),
- const allocator_type & a = allocator_type());</pre>
+<pre class="literallayout">template<typename InputIterator>
+ <a name="id394614-bb"></a>set(ordered_unique_range_t, InputIterator first, InputIterator last,
+ const Pred & comp = Pred(),
+ const allocator_type & a = allocator_type());</pre>
Effects: Constructs an empty set using the specified comparison object and allocator, and inserts elements from the ordered unique range [first ,last). This function is more efficient than the normal range creation for ordered ranges.
Requires: [first ,last) must be ordered according to the predicate and must be unique values.
Complexity: Linear in N. 
</li>
<li>
-<pre class="literallayout"><a name="id313827-bb"></a>set(const set & x);</pre>
+<pre class="literallayout"><a name="id394669-bb"></a>set(const set & x);</pre>
Effects: Copy constructs a set.
Complexity: Linear in x.size(). 
</li>
<li>
-<pre class="literallayout"><a name="id313850-bb"></a>set(set && x);</pre>
+<pre class="literallayout"><a name="id394692-bb"></a>set(set && x);</pre>
Effects: Move constructs a set. Constructs *this using x's resources.
Complexity: Construct.
Postcondition: x is emptied. 
</li>
<li>
-<pre class="literallayout">set& <a name="id313878-bb"></a>operator=(const set & x);</pre>
+<pre class="literallayout">set& <a name="id394720-bb"></a>operator=(const set & x);</pre>
Effects: Makes *this a copy of x.
Complexity: Linear in x.size(). 
</li>
<li>
-<pre class="literallayout">set& <a name="id313901-bb"></a>operator=(set && x);</pre>
+<pre class="literallayout">set& <a name="id394743-bb"></a>operator=(set && x);</pre>
Effects: this->swap(x.get()).
Complexity: Constant. 
</li>
</ol></div>
</div>
<div class="refsect2" lang="en">
-<a name="id510856"></a><h3>
-<a name="id312626-bb"></a><code class="computeroutput">set</code> public member functions</h3>
+<a name="id821050"></a><h3>
+<a name="id392306-bb"></a><code class="computeroutput">set</code> public member functions</h3>
<div class="orderedlist"><ol type="1">
<li>
-<pre class="literallayout">key_compare <a name="id312628-bb"></a>key_comp() const;</pre>
+<pre class="literallayout">key_compare <a name="id392309-bb"></a>key_comp() const;</pre>
Effects: Returns the comparison object out of which a was constructed.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">value_compare <a name="id312648-bb"></a>value_comp() const;</pre>
+<pre class="literallayout">value_compare <a name="id392329-bb"></a>value_comp() const;</pre>
Effects: Returns an object of value_compare constructed out of the comparison object.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">allocator_type <a name="id312668-bb"></a>get_allocator() const;</pre>
+<pre class="literallayout">allocator_type <a name="id392348-bb"></a>get_allocator() const;</pre>
Effects: Returns a copy of the Allocator that was passed to the object's constructor.
Complexity: Constant. 
</li>
-<li><pre class="literallayout">const stored_allocator_type & <a name="id312687-bb"></a>get_stored_allocator() const;</pre></li>
-<li><pre class="literallayout">stored_allocator_type & <a name="id312693-bb"></a>get_stored_allocator() ;</pre></li>
+<li><pre class="literallayout">const stored_allocator_type & <a name="id392368-bb"></a>get_stored_allocator() const;</pre></li>
+<li><pre class="literallayout">stored_allocator_type & <a name="id392374-bb"></a>get_stored_allocator();</pre></li>
<li>
-<pre class="literallayout">iterator <a name="id312699-bb"></a>begin() ;</pre>
+<pre class="literallayout">iterator <a name="id392380-bb"></a>begin();</pre>
Effects: Returns an iterator to the first element contained in the container.
Throws: Nothing.
Complexity: Constant 
</li>
<li>
-<pre class="literallayout">const_iterator <a name="id312724-bb"></a>begin() const;</pre>
+<pre class="literallayout">const_iterator <a name="id392405-bb"></a>begin() const;</pre>
Effects: Returns a const_iterator to the first element contained in the container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id312749-bb"></a>end() ;</pre>
+<pre class="literallayout">iterator <a name="id392430-bb"></a>end();</pre>
Effects: Returns an iterator to the end of the container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_iterator <a name="id312774-bb"></a>end() const;</pre>
+<pre class="literallayout">const_iterator <a name="id392455-bb"></a>end() const;</pre>
Effects: Returns a const_iterator to the end of the container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">reverse_iterator <a name="id312800-bb"></a>rbegin() ;</pre>
+<pre class="literallayout">reverse_iterator <a name="id392480-bb"></a>rbegin();</pre>
Effects: Returns a reverse_iterator pointing to the beginning of the reversed container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_reverse_iterator <a name="id312825-bb"></a>rbegin() const;</pre>
+<pre class="literallayout">const_reverse_iterator <a name="id392506-bb"></a>rbegin() const;</pre>
Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">reverse_iterator <a name="id312850-bb"></a>rend() ;</pre>
+<pre class="literallayout">reverse_iterator <a name="id392531-bb"></a>rend();</pre>
Effects: Returns a reverse_iterator pointing to the end of the reversed container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_reverse_iterator <a name="id312875-bb"></a>rend() const;</pre>
+<pre class="literallayout">const_reverse_iterator <a name="id392556-bb"></a>rend() const;</pre>
Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_iterator <a name="id312900-bb"></a>cbegin() const;</pre>
+<pre class="literallayout">const_iterator <a name="id392581-bb"></a>cbegin() const;</pre>
Effects: Returns a const_iterator to the first element contained in the container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_iterator <a name="id312926-bb"></a>cend() const;</pre>
+<pre class="literallayout">const_iterator <a name="id392606-bb"></a>cend() const;</pre>
Effects: Returns a const_iterator to the end of the container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_reverse_iterator <a name="id312951-bb"></a>crbegin() const;</pre>
+<pre class="literallayout">const_reverse_iterator <a name="id392632-bb"></a>crbegin() const;</pre>
Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_reverse_iterator <a name="id312976-bb"></a>crend() const;</pre>
+<pre class="literallayout">const_reverse_iterator <a name="id392657-bb"></a>crend() const;</pre>
Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">bool <a name="id313001-bb"></a>empty() const;</pre>
+<pre class="literallayout">bool <a name="id392682-bb"></a>empty() const;</pre>
Effects: Returns true if the container contains no elements.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">size_type <a name="id313026-bb"></a>size() const;</pre>
+<pre class="literallayout">size_type <a name="id392707-bb"></a>size() const;</pre>
Effects: Returns the number of the elements contained in the container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">size_type <a name="id313052-bb"></a>max_size() const;</pre>
+<pre class="literallayout">size_type <a name="id392732-bb"></a>max_size() const;</pre>
Effects: Returns the largest possible size of the container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">void <a name="id313077-bb"></a>swap(set & x) ;</pre>
+<pre class="literallayout">void <a name="id392758-bb"></a>swap(set & x);</pre>
Effects: Swaps the contents of *this and x. If this->allocator_type() != x.allocator_type() allocators are also swapped.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">std::pair< iterator, bool > <a name="id313109-bb"></a>insert(const T & x) ;</pre>
+<pre class="literallayout">std::pair< iterator, bool > <a name="id392790-bb"></a>insert(const T & x);</pre>
Effects: Inserts x if and only if there is no element in the container with key equivalent to the key of x.
Returns: The bool component of the returned pair is true if and only if the insertion takes place, and the iterator component of the pair points to the element with key equivalent to the key of x.
Complexity: Logarithmic. 
</li>
<li>
-<pre class="literallayout">std::pair< iterator, bool > <a name="id313139-bb"></a>insert(value_type && x) ;</pre>
+<pre class="literallayout">std::pair< iterator, bool > <a name="id392820-bb"></a>insert(value_type && x);</pre>
Effects: Move constructs a new value from x if and only if there is no element in the container with key equivalent to the key of x.
Returns: The bool component of the returned pair is true if and only if the insertion takes place, and the iterator component of the pair points to the element with key equivalent to the key of x.
Complexity: Logarithmic. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id313169-bb"></a>insert(const_iterator p, const T & x) ;</pre>
+<pre class="literallayout">iterator <a name="id392850-bb"></a>insert(const_iterator p, const T & x);</pre>
Effects: Inserts a copy of x in the container if and only if there is no element in the container with key equivalent to the key of x. p is a hint pointing to where the insert should start to search.
Returns: An iterator pointing to the element with key equivalent to the key of x.
Complexity: Logarithmic in general, but amortized constant if t is inserted right before p. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id313204-bb"></a>insert(const_iterator p, value_type && x) ;</pre>
+<pre class="literallayout">iterator <a name="id392885-bb"></a>insert(const_iterator p, value_type && x);</pre>
Effects: Inserts an element move constructed from x in the container. p is a hint pointing to where the insert should start to search.
Returns: An iterator pointing to the element with key equivalent to the key of x.
Complexity: Logarithmic. 
</li>
<li>
-<pre class="literallayout">template<typename InputIterator>
- void <a name="id313239-bb"></a>insert(InputIterator first, InputIterator last) ;</pre>
+<pre class="literallayout">template<typename InputIterator>
+ void <a name="id392920-bb"></a>insert(InputIterator first, InputIterator last);</pre>
Requires: i, j are not iterators into *this.
Effects: inserts each element from the range [i,j) if and only if there is no element with key equivalent to the key of that element.
Complexity: N log(size()+N) (N is the distance from i to j) 
</li>
<li>
-<pre class="literallayout">template<class... Args> iterator <a name="id313280-bb"></a>emplace(Args &&... args) ;</pre>
+<pre class="literallayout">template<class... Args> iterator <a name="id392960-bb"></a>emplace(Args &&... args);</pre>
Effects: Inserts an object of type T constructed with std::forward<Args>(args)... if and only if there is no element in the container with equivalent value. and returns the iterator pointing to the newly inserted element.
Throws: If memory allocation throws or T's in-place constructor throws.
Complexity: Logarithmic. 
</li>
<li>
-<pre class="literallayout">template<class... Args>
- iterator <a name="id313318-bb"></a>emplace_hint(const_iterator hint, Args &&... args) ;</pre>
+<pre class="literallayout">template<class... Args>
+ iterator <a name="id392999-bb"></a>emplace_hint(const_iterator hint, Args &&... args);</pre>
Effects: Inserts an object of type T constructed with std::forward<Args>(args)... if and only if there is no element in the container with equivalent value. p is a hint pointing to where the insert should start to search.
Returns: An iterator pointing to the element with key equivalent to the key of x.
Complexity: Logarithmic. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id313361-bb"></a>erase(const_iterator p) ;</pre>
+<pre class="literallayout">iterator <a name="id393042-bb"></a>erase(const_iterator p);</pre>
Effects: Erases the element pointed to by p.
Returns: Returns an iterator pointing to the element immediately following q prior to the element being erased. If no such element exists, returns end().
Complexity: Amortized constant time 
</li>
<li>
-<pre class="literallayout">size_type <a name="id313391-bb"></a>erase(const key_type & x) ;</pre>
+<pre class="literallayout">size_type <a name="id393072-bb"></a>erase(const key_type & x);</pre>
Effects: Erases all elements in the container with key equivalent to x.
Returns: Returns the number of erased elements.
Complexity: log(size()) + count(k) 
</li>
<li>
-<pre class="literallayout">iterator <a name="id313421-bb"></a>erase(const_iterator first, const_iterator last) ;</pre>
+<pre class="literallayout">iterator <a name="id394263-bb"></a>erase(const_iterator first, const_iterator last);</pre>
Effects: Erases all the elements in the range [first, last).
Returns: Returns last.
Complexity: log(size())+N where N is the distance from first to last. 
</li>
<li>
-<pre class="literallayout">void <a name="id313457-bb"></a>clear() ;</pre>
+<pre class="literallayout">void <a name="id394299-bb"></a>clear();</pre>
Effects: erase(a.begin(),a.end()).
Postcondition: size() == 0.
Complexity: linear in size(). 
</li>
<li>
-<pre class="literallayout">iterator <a name="id313482-bb"></a>find(const key_type & x) ;</pre>
+<pre class="literallayout">iterator <a name="id394324-bb"></a>find(const key_type & x);</pre>
Returns: An iterator pointing to an element with the key equivalent to x, or end() if such an element is not found.
Complexity: Logarithmic. 
</li>
<li>
-<pre class="literallayout">const_iterator <a name="id313506-bb"></a>find(const key_type & x) const;</pre>
+<pre class="literallayout">const_iterator <a name="id394348-bb"></a>find(const key_type & x) const;</pre>
Returns: A const_iterator pointing to an element with the key equivalent to x, or end() if such an element is not found.
Complexity: Logarithmic. 
</li>
<li>
-<pre class="literallayout">size_type <a name="id313530-bb"></a>count(const key_type & x) const;</pre>
+<pre class="literallayout">size_type <a name="id394372-bb"></a>count(const key_type & x) const;</pre>
Returns: The number of elements with key equivalent to x.
Complexity: log(size())+count(k) 
</li>
<li>
-<pre class="literallayout">iterator <a name="id313554-bb"></a>lower_bound(const key_type & x) ;</pre>
+<pre class="literallayout">iterator <a name="id394396-bb"></a>lower_bound(const key_type & x);</pre>
Returns: An iterator pointing to the first element with key not less than k, or a.end() if such an element is not found.
Complexity: Logarithmic 
</li>
<li>
-<pre class="literallayout">const_iterator <a name="id313578-bb"></a>lower_bound(const key_type & x) const;</pre>
+<pre class="literallayout">const_iterator <a name="id394420-bb"></a>lower_bound(const key_type & x) const;</pre>
Returns: A const iterator pointing to the first element with key not less than k, or a.end() if such an element is not found.
Complexity: Logarithmic 
</li>
<li>
-<pre class="literallayout">iterator <a name="id313602-bb"></a>upper_bound(const key_type & x) ;</pre>
+<pre class="literallayout">iterator <a name="id394444-bb"></a>upper_bound(const key_type & x);</pre>
Returns: An iterator pointing to the first element with key not less than x, or end() if such an element is not found.
Complexity: Logarithmic 
</li>
<li>
-<pre class="literallayout">const_iterator <a name="id313626-bb"></a>upper_bound(const key_type & x) const;</pre>
+<pre class="literallayout">const_iterator <a name="id394468-bb"></a>upper_bound(const key_type & x) const;</pre>
Returns: A const iterator pointing to the first element with key not less than x, or end() if such an element is not found.
Complexity: Logarithmic 
</li>
<li>
-<pre class="literallayout">std::pair< iterator, iterator > <a name="id313650-bb"></a>equal_range(const key_type & x) ;</pre>
+<pre class="literallayout">std::pair< iterator, iterator > <a name="id394492-bb"></a>equal_range(const key_type & x);</pre>
Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).
Complexity: Logarithmic 
</li>
<li>
-<pre class="literallayout">std::pair< const_iterator, const_iterator >
-<a name="id313674-bb"></a>equal_range(const key_type & x) const;</pre>
+<pre class="literallayout">std::pair< const_iterator, const_iterator >
+<a name="id394516-bb"></a>equal_range(const key_type & x) const;</pre>
Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).
Complexity: Logarithmic 
</li>
@@ -400,7 +400,7 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2009 -2010 Ion Gaztanaga
+<td align="right"><div class="copyright-footer">Copyright © 2009 -2011 Ion Gaztanaga
 Distributed under the Boost Software License, Version 1.0. (See accompanying
 file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
@@ -408,7 +408,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="multimap.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.set_hpp"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="multiset.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="multimap.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.set_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="multiset.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>

Modified: sandbox/move/libs/container/doc/html/boost/container/slist.html
==============================================================================
--- sandbox/move/libs/container/doc/html/boost/container/slist.html (original)
+++ sandbox/move/libs/container/doc/html/boost/container/slist.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
@@ -1,10 +1,10 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Class template slist</title>
-<link rel="stylesheet" href="../../boostbook.css" type="text/css">
+<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
-<link rel="start" href="../../index.html" title="Chapter 1. Boost.Container">
+<link rel="start" href="../../index.html" title="Chapter 1. Boost.Container">
<link rel="up" href="../../boost_container_reference.html#header.boost.container.slist_hpp" title="Header <boost/container/slist.hpp>">
<link rel="prev" href="multiset.html" title="Class template multiset">
<link rel="next" href="stable_vector.html" title="Class template stable_vector">
@@ -20,7 +20,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="multiset.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.slist_hpp"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="stable_vector.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="multiset.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.slist_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="stable_vector.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="refentry" lang="en">
<a name="boost.container.slist"></a><div class="titlepage"></div>
@@ -29,171 +29,171 @@
boost::container::slist — 
</div>
<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2>
-<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/container/slist.hpp>
+<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/container/slist.hpp>

-template<typename T, typename A>
-class slist {
-public:
- // types
- typedef T value_type;
- typedef A::pointer <a name="boost.container.slist.pointer"></a>pointer; // Pointer to T. 
- typedef A::const_pointer <a name="boost.container.slist.const_pointer"></a>const_pointer; // Const pointer to T. 
- typedef A::reference <a name="boost.container.slist.reference"></a>reference; // Reference to T. 
- typedef A::const_reference <a name="boost.container.slist.const_reference"></a>const_reference; // Const reference to T. 
- typedef A::size_type <a name="boost.container.slist.size_type"></a>size_type; // An unsigned integral type. 
- typedef A::difference_type <a name="boost.container.slist.difference_type"></a>difference_type; // A signed integral type. 
- typedef A <a name="boost.container.slist.allocator_type"></a>allocator_type; // The allocator type. 
- typedef NodeAlloc <a name="boost.container.slist.stored_allocator_type"></a>stored_allocator_type; // The stored allocator type. 
+template<typename T, typename A>
+class slist {
+public:
+ // types
+ typedef T value_type;
+ typedef A::pointer <a name="boost.container.slist.pointer"></a>pointer; // Pointer to T. 
+ typedef A::const_pointer <a name="boost.container.slist.const_pointer"></a>const_pointer; // Const pointer to T. 
+ typedef A::reference <a name="boost.container.slist.reference"></a>reference; // Reference to T. 
+ typedef A::const_reference <a name="boost.container.slist.const_reference"></a>const_reference; // Const reference to T. 
+ typedef A::size_type <a name="boost.container.slist.size_type"></a>size_type; // An unsigned integral type. 
+ typedef A::difference_type <a name="boost.container.slist.difference_type"></a>difference_type; // A signed integral type. 
+ typedef A <a name="boost.container.slist.allocator_type"></a>allocator_type; // The allocator type. 
+ typedef NodeAlloc <a name="boost.container.slist.stored_allocator_type"></a>stored_allocator_type; // The stored allocator type. 

- // construct/copy/destruct
- slist(const allocator_type & = allocator_type());
- slist(size_type);
- slist(size_type, const value_type &,
- const allocator_type & = allocator_type());
- template<typename InpIt>
- slist(InpIt, InpIt, const allocator_type & = allocator_type());
- slist(const slist &);
- slist(slist &&);
- slist& operator=(const slist &);
- slist& operator=(slist &&);
- ~slist();
+ // construct/copy/destruct
+ slist(const allocator_type & = allocator_type());
+ slist(size_type);
+ slist(size_type, const value_type &,
+ const allocator_type & = allocator_type());
+ template<typename InpIt>
+ slist(InpIt, InpIt, const allocator_type & = allocator_type());
+ slist(const slist &);
+ slist(slist &&);
+ slist& operator=(const slist &);
+ slist& operator=(slist &&);
+ ~slist();

- // public member functions
- allocator_type get_allocator() const;
- const stored_allocator_type & get_stored_allocator() const;
- stored_allocator_type & get_stored_allocator() ;
- void assign(size_type, const T &) ;
- template<typename InpIt> void assign(InpIt, InpIt) ;
- iterator begin() ;
- const_iterator begin() const;
- iterator end() ;
- const_iterator end() const;
- iterator before_begin() ;
- const_iterator before_begin() const;
- const_iterator cbegin() const;
- const_iterator cend() const;
- const_iterator cbefore_begin() const;
- size_type size() const;
- size_type max_size() const;
- bool empty() const;
- void swap(slist &) ;
- reference front() ;
- const_reference front() const;
- void push_front(const T &) ;
- void push_front(T &&) ;
- void pop_front() ;
- iterator previous(iterator) ;
- const_iterator previous(const_iterator) ;
- iterator insert_after(const_iterator, const T &) ;
- iterator insert_after(const_iterator, value_type &&) ;
- void insert_after(const_iterator, size_type, const value_type &) ;
- template<typename InIter> void insert_after(const_iterator, InIter, InIter) ;
- iterator insert(const_iterator, const T &) ;
- iterator insert(const_iterator, value_type &&) ;
- void insert(const_iterator, size_type, const value_type &) ;
- template<typename InIter> void insert(const_iterator, InIter, InIter) ;
- template<class... Args> void emplace_front(Args &&...) ;
- template<class... Args> iterator emplace(const_iterator, Args &&...) ;
- template<class... Args> iterator emplace_after(const_iterator, Args &&...) ;
- iterator erase_after(const_iterator) ;
- iterator erase_after(const_iterator, const_iterator) ;
- iterator erase(const_iterator) ;
- iterator erase(const_iterator, const_iterator) ;
- void resize(size_type, const T &) ;
- void resize(size_type) ;
- void clear() ;
- void splice_after(const_iterator, slist &) ;
- void splice_after(const_iterator, slist &, const_iterator) ;
- void splice_after(const_iterator, slist &, const_iterator, const_iterator) ;
- void splice_after(const_iterator, slist &, const_iterator, const_iterator,
- size_type) ;
- void splice(const_iterator, ThisType &) ;
- void splice(const_iterator, slist &, const_iterator) ;
- void splice(const_iterator, slist &, const_iterator, const_iterator) ;
- void reverse() ;
- void remove(const T &) ;
- template<typename Pred> void remove_if(Pred) ;
- void unique() ;
- template<typename Pred> void unique(Pred) ;
- void merge(slist &) ;
- template<typename StrictWeakOrdering>
- void merge(slist &, StrictWeakOrdering) ;
- void sort() ;
- template<typename StrictWeakOrdering> void sort(StrictWeakOrdering) ;
-};</pre></div>
+ // public member functions
+ allocator_type get_allocator() const;
+ const stored_allocator_type & get_stored_allocator() const;
+ stored_allocator_type & get_stored_allocator();
+ void assign(size_type, const T &);
+ template<typename InpIt> void assign(InpIt, InpIt);
+ iterator begin();
+ const_iterator begin() const;
+ iterator end();
+ const_iterator end() const;
+ iterator before_begin();
+ const_iterator before_begin() const;
+ const_iterator cbegin() const;
+ const_iterator cend() const;
+ const_iterator cbefore_begin() const;
+ size_type size() const;
+ size_type max_size() const;
+ bool empty() const;
+ void swap(slist &);
+ reference front();
+ const_reference front() const;
+ void push_front(const T &);
+ void push_front(T &&);
+ void pop_front();
+ iterator previous(iterator);
+ const_iterator previous(const_iterator);
+ iterator insert_after(const_iterator, const T &);
+ iterator insert_after(const_iterator, value_type &&);
+ void insert_after(const_iterator, size_type, const value_type &);
+ template<typename InIter> void insert_after(const_iterator, InIter, InIter);
+ iterator insert(const_iterator, const T &);
+ iterator insert(const_iterator, value_type &&);
+ void insert(const_iterator, size_type, const value_type &);
+ template<typename InIter> void insert(const_iterator, InIter, InIter);
+ template<class... Args> void emplace_front(Args &&...);
+ template<class... Args> iterator emplace(const_iterator, Args &&...);
+ template<class... Args> iterator emplace_after(const_iterator, Args &&...);
+ iterator erase_after(const_iterator);
+ iterator erase_after(const_iterator, const_iterator);
+ iterator erase(const_iterator);
+ iterator erase(const_iterator, const_iterator);
+ void resize(size_type, const T &);
+ void resize(size_type);
+ void clear();
+ void splice_after(const_iterator, slist &);
+ void splice_after(const_iterator, slist &, const_iterator);
+ void splice_after(const_iterator, slist &, const_iterator, const_iterator);
+ void splice_after(const_iterator, slist &, const_iterator, const_iterator,
+ size_type);
+ void splice(const_iterator, ThisType &);
+ void splice(const_iterator, slist &, const_iterator);
+ void splice(const_iterator, slist &, const_iterator, const_iterator);
+ void reverse();
+ void remove(const T &);
+ template<typename Pred> void remove_if(Pred);
+ void unique();
+ template<typename Pred> void unique(Pred);
+ void merge(slist &);
+ template<typename StrictWeakOrdering>
+ void merge(slist &, StrictWeakOrdering);
+ void sort();
+ template<typename StrictWeakOrdering> void sort(StrictWeakOrdering);
+};</pre></div>
<div class="refsect1" lang="en">
-<a name="id518203"></a><h2>Description</h2>
+<a name="id836638"></a><h2>Description</h2>
An slist is a singly linked list: a list where each element is linked to the next element, but not to the previous element. That is, it is a Sequence that supports forward but not backward traversal, and (amortized) constant time insertion and removal of elements. Slists, like lists, have the important property that insertion and splicing do not invalidate iterators to list elements, and that even removal invalidates only the iterators that point to the elements that are removed. The ordering of iterators may be changed (that is, slist<T>::iterator might have a different predecessor or successor after a list operation than it did before), but the iterators themselves will not be invalidated or made to point to different elements unless that invalidation or mutation is explicit.
The main difference between slist and list is that list's iterators are bidirectional iterators, while slist's iterators are forward iterators. This means that slist is less versatile than list; frequently, however, bidirectional iterators are unnecessary. You should usually use slist unless you actually need the extra functionality of list, because singly linked lists are smaller and faster than double linked lists.
Important performance note: like every other Sequence, slist defines the member functions insert and erase. Using these member functions carelessly, however, can result in disastrously slow programs. The problem is that insert's first argument is an iterator p, and that it inserts the new element(s) before p. This means that insert must find the iterator just before p; this is a constant-time operation for list, since list has bidirectional iterators, but for slist it must find that iterator by traversing the list from the beginning up to p. In other words: insert and erase are slow operations anywhere but near the beginning of the slist.
Slist provides the member functions insert_after and erase_after, which are constant time operations: you should always use insert_after and erase_after whenever possible. If you find that insert_after and erase_after aren't adequate for your needs, and that you often need to use insert and erase in the middle of the list, then you should probably use list instead of slist. 
<div class="refsect2" lang="en">
-<a name="id518217"></a><h3>
+<a name="id836651"></a><h3>
<a name="boost.container.slisttypes"></a><code class="computeroutput">slist</code>
 public
 types</h3>
<div class="orderedlist"><ol type="1"><li>

-typedef T <a name="boost.container.slist.value_type"></a>value_type;
+typedef T <a name="boost.container.slist.value_type"></a>value_type;
The type of object, T, stored in the list 
</li></ol></div>
</div>
<div class="refsect2" lang="en">
-<a name="id518244"></a><h3>
+<a name="id836690"></a><h3>
<a name="boost.container.slistconstruct-copy-destruct"></a><code class="computeroutput">slist</code>
 public
 construct/copy/destruct</h3>
<div class="orderedlist"><ol type="1">
<li>
-<pre class="literallayout"><a name="id319683-bb"></a>slist(const allocator_type & a = allocator_type());</pre>
+<pre class="literallayout"><a name="id399836-bb"></a>slist(const allocator_type & a = allocator_type());</pre>
Effects: Constructs a list taking the allocator as parameter.
Throws: If allocator_type's copy constructor throws.
Complexity: Constant. 
</li>
-<li><pre class="literallayout"><a name="id319710-bb"></a>slist(size_type n);</pre></li>
+<li><pre class="literallayout"><a name="id399863-bb"></a>slist(size_type n);</pre></li>
<li>
-<pre class="literallayout"><a name="id319716-bb"></a>slist(size_type n, const value_type & x,
- const allocator_type & a = allocator_type());</pre>
+<pre class="literallayout"><a name="id399869-bb"></a>slist(size_type n, const value_type & x,
+ const allocator_type & a = allocator_type());</pre>
Effects: Constructs a list that will use a copy of allocator a and inserts n copies of value.
Throws: If allocator_type's default constructor or copy constructor throws or T's default or copy constructor throws.
Complexity: Linear to n. 
</li>
<li>
-<pre class="literallayout">template<typename InpIt>
- <a name="id319754-bb"></a>slist(InpIt first, InpIt last, const allocator_type & a = allocator_type());</pre>
+<pre class="literallayout">template<typename InpIt>
+ <a name="id399907-bb"></a>slist(InpIt first, InpIt last, const allocator_type & a = allocator_type());</pre>
Effects: Constructs a list that will use a copy of allocator a and inserts a copy of the range [first, last) in the list.
Throws: If allocator_type's default constructor or copy constructor throws or T's constructor taking an dereferenced InIt throws.
Complexity: Linear to the range [first, last). 
</li>
<li>
-<pre class="literallayout"><a name="id319797-bb"></a>slist(const slist & x);</pre>
+<pre class="literallayout"><a name="id399950-bb"></a>slist(const slist & x);</pre>
Effects: Copy constructs a list.
Postcondition: x == *this.
Throws: If allocator_type's default constructor or copy constructor throws.
Complexity: Linear to the elements x contains. 
</li>
<li>
-<pre class="literallayout"><a name="id319832-bb"></a>slist(slist && x);</pre>
+<pre class="literallayout"><a name="id399985-bb"></a>slist(slist && x);</pre>
Effects: Move constructor. Moves mx's resources to *this.
Throws: If allocator_type's copy constructor throws.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">slist& <a name="id319859-bb"></a>operator=(const slist & x);</pre>
+<pre class="literallayout">slist& <a name="id400012-bb"></a>operator=(const slist & x);</pre>
Effects: Makes *this contain the same elements as x.
Postcondition: this->size() == x.size(). *this contains a copy of each of x's elements.
Throws: If memory allocation throws or T's copy constructor throws.
Complexity: Linear to the number of elements in x. 
</li>
<li>
-<pre class="literallayout">slist& <a name="id319895-bb"></a>operator=(slist && mx);</pre>
+<pre class="literallayout">slist& <a name="id400048-bb"></a>operator=(slist && mx);</pre>
Effects: Makes *this contain the same elements as x.
Postcondition: this->size() == x.size(). *this contains a copy of each of x's elements.
Throws: If memory allocation throws or T's copy constructor throws.
Complexity: Linear to the number of elements in x. 
</li>
<li>
-<pre class="literallayout"><a name="id319930-bb"></a>~slist();</pre>
+<pre class="literallayout"><a name="id400083-bb"></a>~slist();</pre>
Effects: Destroys the list. All stored values are destroyed and used memory is deallocated.
Throws: Nothing.
Complexity: Linear to the number of elements. 
@@ -201,153 +201,153 @@
</ol></div>
</div>
<div class="refsect2" lang="en">
-<a name="id518575"></a><h3>
-<a name="id317455-bb"></a><code class="computeroutput">slist</code> public member functions</h3>
+<a name="id838986"></a><h3>
+<a name="id396727-bb"></a><code class="computeroutput">slist</code> public member functions</h3>
<div class="orderedlist"><ol type="1">
<li>
-<pre class="literallayout">allocator_type <a name="id317458-bb"></a>get_allocator() const;</pre>
+<pre class="literallayout">allocator_type <a name="id396730-bb"></a>get_allocator() const;</pre>
Effects: Returns a copy of the internal allocator.
Throws: If allocator's copy constructor throws.
Complexity: Constant. 
</li>
-<li><pre class="literallayout">const stored_allocator_type & <a name="id317483-bb"></a>get_stored_allocator() const;</pre></li>
-<li><pre class="literallayout">stored_allocator_type & <a name="id317489-bb"></a>get_stored_allocator() ;</pre></li>
+<li><pre class="literallayout">const stored_allocator_type & <a name="id396755-bb"></a>get_stored_allocator() const;</pre></li>
+<li><pre class="literallayout">stored_allocator_type & <a name="id396761-bb"></a>get_stored_allocator();</pre></li>
<li>
-<pre class="literallayout">void <a name="id317495-bb"></a>assign(size_type n, const T & val) ;</pre>
+<pre class="literallayout">void <a name="id396767-bb"></a>assign(size_type n, const T & val);</pre>
Effects: Assigns the n copies of val to *this.
Throws: If memory allocation throws or T's copy constructor throws.
Complexity: Linear to n. 
</li>
<li>
-<pre class="literallayout">template<typename InpIt> void <a name="id317531-bb"></a>assign(InpIt first, InpIt last) ;</pre>
+<pre class="literallayout">template<typename InpIt> void <a name="id396803-bb"></a>assign(InpIt first, InpIt last);</pre>
Effects: Assigns the range [first, last) to *this.
Throws: If memory allocation throws or T's constructor from dereferencing InpIt throws.
Complexity: Linear to n. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id317572-bb"></a>begin() ;</pre>
+<pre class="literallayout">iterator <a name="id396844-bb"></a>begin();</pre>
Effects: Returns an iterator to the first element contained in the list.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_iterator <a name="id317597-bb"></a>begin() const;</pre>
+<pre class="literallayout">const_iterator <a name="id396869-bb"></a>begin() const;</pre>
Effects: Returns a const_iterator to the first element contained in the list.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id317622-bb"></a>end() ;</pre>
+<pre class="literallayout">iterator <a name="id396894-bb"></a>end();</pre>
Effects: Returns an iterator to the end of the list.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_iterator <a name="id317647-bb"></a>end() const;</pre>
+<pre class="literallayout">const_iterator <a name="id396919-bb"></a>end() const;</pre>
Effects: Returns a const_iterator to the end of the list.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id317673-bb"></a>before_begin() ;</pre>
+<pre class="literallayout">iterator <a name="id396944-bb"></a>before_begin();</pre>
Effects: Returns a non-dereferenceable iterator that, when incremented, yields begin(). This iterator may be used as the argument toinsert_after, erase_after, etc.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_iterator <a name="id317698-bb"></a>before_begin() const;</pre>
+<pre class="literallayout">const_iterator <a name="id396970-bb"></a>before_begin() const;</pre>
Effects: Returns a non-dereferenceable const_iterator that, when incremented, yields begin(). This iterator may be used as the argument toinsert_after, erase_after, etc.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_iterator <a name="id317723-bb"></a>cbegin() const;</pre>
+<pre class="literallayout">const_iterator <a name="id396995-bb"></a>cbegin() const;</pre>
Effects: Returns a const_iterator to the first element contained in the list.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_iterator <a name="id317748-bb"></a>cend() const;</pre>
+<pre class="literallayout">const_iterator <a name="id397020-bb"></a>cend() const;</pre>
Effects: Returns a const_iterator to the end of the list.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_iterator <a name="id317773-bb"></a>cbefore_begin() const;</pre>
+<pre class="literallayout">const_iterator <a name="id397045-bb"></a>cbefore_begin() const;</pre>
Effects: Returns a non-dereferenceable const_iterator that, when incremented, yields begin(). This iterator may be used as the argument toinsert_after, erase_after, etc.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">size_type <a name="id317799-bb"></a>size() const;</pre>
+<pre class="literallayout">size_type <a name="id397070-bb"></a>size() const;</pre>
Effects: Returns the number of the elements contained in the list.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">size_type <a name="id317825-bb"></a>max_size() const;</pre>
+<pre class="literallayout">size_type <a name="id397097-bb"></a>max_size() const;</pre>
Effects: Returns the largest possible size of the list.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">bool <a name="id317850-bb"></a>empty() const;</pre>
+<pre class="literallayout">bool <a name="id397122-bb"></a>empty() const;</pre>
Effects: Returns true if the list contains no elements.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">void <a name="id317875-bb"></a>swap(slist & x) ;</pre>
+<pre class="literallayout">void <a name="id397147-bb"></a>swap(slist & x);</pre>
Effects: Swaps the contents of *this and x. If this->allocator_type() != x.allocator_type() allocators are also swapped.
Throws: Nothing.
Complexity: Linear to the number of elements on *this and x. 
</li>
<li>
-<pre class="literallayout">reference <a name="id317908-bb"></a>front() ;</pre>
+<pre class="literallayout">reference <a name="id397180-bb"></a>front();</pre>
Requires: !empty()
Effects: Returns a reference to the first element from the beginning of the container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_reference <a name="id317939-bb"></a>front() const;</pre>
+<pre class="literallayout">const_reference <a name="id397211-bb"></a>front() const;</pre>
Requires: !empty()
Effects: Returns a const reference to the first element from the beginning of the container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">void <a name="id317970-bb"></a>push_front(const T & x) ;</pre>
+<pre class="literallayout">void <a name="id397242-bb"></a>push_front(const T & x);</pre>
Effects: Inserts a copy of t in the beginning of the list.
Throws: If memory allocation throws or T's copy constructor throws.
Complexity: Amortized constant time. 
</li>
<li>
-<pre class="literallayout">void <a name="id318001-bb"></a>push_front(T && x) ;</pre>
+<pre class="literallayout">void <a name="id397273-bb"></a>push_front(T && x);</pre>
Effects: Constructs a new element in the beginning of the list and moves the resources of t to this new element.
Throws: If memory allocation throws.
Complexity: Amortized constant time. 
</li>
<li>
-<pre class="literallayout">void <a name="id318031-bb"></a>pop_front() ;</pre>
+<pre class="literallayout">void <a name="id397303-bb"></a>pop_front();</pre>
Effects: Removes the first element from the list.
Throws: Nothing.
Complexity: Amortized constant time. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id318057-bb"></a>previous(iterator p) ;</pre>
+<pre class="literallayout">iterator <a name="id397328-bb"></a>previous(iterator p);</pre>
Returns: The iterator to the element before i in the sequence. Returns the end-iterator, if either i is the begin-iterator or the sequence is empty.
Throws: Nothing.
Complexity: Linear to the number of elements before i. 
</li>
<li>
-<pre class="literallayout">const_iterator <a name="id318087-bb"></a>previous(const_iterator p) ;</pre>
+<pre class="literallayout">const_iterator <a name="id397358-bb"></a>previous(const_iterator p);</pre>
Returns: The const_iterator to the element before i in the sequence. Returns the end-const_iterator, if either i is the begin-const_iterator or the sequence is empty.
Throws: Nothing.
Complexity: Linear to the number of elements before i. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id318117-bb"></a>insert_after(const_iterator prev_pos, const T & x) ;</pre>
+<pre class="literallayout">iterator <a name="id397388-bb"></a>insert_after(const_iterator prev_pos, const T & x);</pre>
Requires: p must be a valid iterator of *this.
Effects: Inserts a copy of the value after the p pointed by prev_p.
Returns: An iterator to the inserted element.
@@ -356,7 +356,7 @@
Note: Does not affect the validity of iterators and references of previous values. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id318172-bb"></a>insert_after(const_iterator prev_pos, value_type && x) ;</pre>
+<pre class="literallayout">iterator <a name="id397444-bb"></a>insert_after(const_iterator prev_pos, value_type && x);</pre>
Requires: prev_pos must be a valid iterator of *this.
Effects: Inserts a move constructed copy object from the value after the p pointed by prev_pos.
Returns: An iterator to the inserted element.
@@ -365,7 +365,7 @@
Note: Does not affect the validity of iterators and references of previous values. 
</li>
<li>
-<pre class="literallayout">void <a name="id318225-bb"></a>insert_after(const_iterator prev_pos, size_type n, const value_type & x) ;</pre>
+<pre class="literallayout">void <a name="id397496-bb"></a>insert_after(const_iterator prev_pos, size_type n, const value_type & x);</pre>
Requires: prev_pos must be a valid iterator of *this.
Effects: Inserts n copies of x after prev_pos.
Throws: If memory allocation throws or T's copy constructor throws.
@@ -373,8 +373,8 @@
Note: Does not affect the validity of iterators and references of previous values. 
</li>
<li>
-<pre class="literallayout">template<typename InIter>
- void <a name="id318277-bb"></a>insert_after(const_iterator prev_pos, InIter first, InIter last) ;</pre>
+<pre class="literallayout">template<typename InIter>
+ void <a name="id397549-bb"></a>insert_after(const_iterator prev_pos, InIter first, InIter last);</pre>
Requires: prev_pos must be a valid iterator of *this.
Effects: Inserts the range pointed by [first, last) after the p prev_pos.
Throws: If memory allocation throws, T's constructor from a dereferenced InpIt throws.
@@ -382,55 +382,55 @@
Note: Does not affect the validity of iterators and references of previous values. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id318335-bb"></a>insert(const_iterator position, const T & x) ;</pre>
+<pre class="literallayout">iterator <a name="id397607-bb"></a>insert(const_iterator position, const T & x);</pre>
Requires: p must be a valid iterator of *this.
Effects: Insert a copy of x before p.
Throws: If memory allocation throws or x's copy constructor throws.
Complexity: Linear to the elements before p. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id318377-bb"></a>insert(const_iterator p, value_type && x) ;</pre>
+<pre class="literallayout">iterator <a name="id397649-bb"></a>insert(const_iterator p, value_type && x);</pre>
Requires: p must be a valid iterator of *this.
Effects: Insert a new element before p with mx's resources.
Throws: If memory allocation throws.
Complexity: Linear to the elements before p. 
</li>
<li>
-<pre class="literallayout">void <a name="id318456-bb"></a>insert(const_iterator p, size_type n, const value_type & x) ;</pre>
+<pre class="literallayout">void <a name="id397690-bb"></a>insert(const_iterator p, size_type n, const value_type & x);</pre>
Requires: p must be a valid iterator of *this.
Effects: Inserts n copies of x before p.
Throws: If memory allocation throws or T's copy constructor throws.
Complexity: Linear to n plus linear to the elements before p. 
</li>
<li>
-<pre class="literallayout">template<typename InIter>
- void <a name="id318503-bb"></a>insert(const_iterator p, InIter first, InIter last) ;</pre>
+<pre class="literallayout">template<typename InIter>
+ void <a name="id397736-bb"></a>insert(const_iterator p, InIter first, InIter last);</pre>
Requires: p must be a valid iterator of *this.
Effects: Insert a copy of the [first, last) range before p.
Throws: If memory allocation throws, T's constructor from a dereferenced InpIt throws.
Complexity: Linear to std::distance [first, last) plus linear to the elements before p. 
</li>
<li>
-<pre class="literallayout">template<class... Args> void <a name="id318555-bb"></a>emplace_front(Args &&... args) ;</pre>
+<pre class="literallayout">template<class... Args> void <a name="id397788-bb"></a>emplace_front(Args &&... args);</pre>
Effects: Inserts an object of type T constructed with std::forward<Args>(args)... in the front of the list
Throws: If memory allocation throws or T's copy constructor throws.
Complexity: Amortized constant time. 
</li>
<li>
-<pre class="literallayout">template<class... Args> iterator <a name="id318594-bb"></a>emplace(const_iterator p, Args &&... args) ;</pre>
+<pre class="literallayout">template<class... Args> iterator <a name="id397828-bb"></a>emplace(const_iterator p, Args &&... args);</pre>
Effects: Inserts an object of type T constructed with std::forward<Args>(args)... before p
Throws: If memory allocation throws or T's in-place constructor throws.
Complexity: Linear to the elements before p 
</li>
<li>
-<pre class="literallayout">template<class... Args>
- iterator <a name="id318638-bb"></a>emplace_after(const_iterator prev, Args &&... args) ;</pre>
+<pre class="literallayout">template<class... Args>
+ iterator <a name="id397871-bb"></a>emplace_after(const_iterator prev, Args &&... args);</pre>
Effects: Inserts an object of type T constructed with std::forward<Args>(args)... after prev
Throws: If memory allocation throws or T's in-place constructor throws.
Complexity: Constant 
</li>
<li>
-<pre class="literallayout">iterator <a name="id318681-bb"></a>erase_after(const_iterator prev_pos) ;</pre>
+<pre class="literallayout">iterator <a name="id397914-bb"></a>erase_after(const_iterator prev_pos);</pre>
Effects: Erases the element after the element pointed by prev_pos of the list.
Returns: the first element remaining beyond the removed elements, or end() if no such element exists.
Throws: Nothing.
@@ -438,7 +438,7 @@
Note: Does not invalidate iterators or references to non erased elements. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id318723-bb"></a>erase_after(const_iterator before_first, const_iterator last) ;</pre>
+<pre class="literallayout">iterator <a name="id397956-bb"></a>erase_after(const_iterator before_first, const_iterator last);</pre>
Effects: Erases the range (before_first, last) from the list.
Returns: the first element remaining beyond the removed elements, or end() if no such element exists.
Throws: Nothing.
@@ -446,39 +446,39 @@
Note: Does not invalidate iterators or references to non erased elements. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id318770-bb"></a>erase(const_iterator p) ;</pre>
+<pre class="literallayout">iterator <a name="id398003-bb"></a>erase(const_iterator p);</pre>
Requires: p must be a valid iterator of *this.
Effects: Erases the element at p p.
Throws: Nothing.
Complexity: Linear to the number of elements before p. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id318806-bb"></a>erase(const_iterator first, const_iterator last) ;</pre>
+<pre class="literallayout">iterator <a name="id398039-bb"></a>erase(const_iterator first, const_iterator last);</pre>
Requires: first and last must be valid iterator to elements in *this.
Effects: Erases the elements pointed by [first, last).
Throws: Nothing.
Complexity: Linear to the distance between first and last plus linear to the elements before first. 
</li>
<li>
-<pre class="literallayout">void <a name="id318848-bb"></a>resize(size_type new_size, const T & x) ;</pre>
+<pre class="literallayout">void <a name="id398081-bb"></a>resize(size_type new_size, const T & x);</pre>
Effects: Inserts or erases elements at the end such that the size becomes n. New elements are copy constructed from x.
Throws: If memory allocation throws, or T's copy constructor throws.
Complexity: Linear to the difference between size() and new_size. 
</li>
<li>
-<pre class="literallayout">void <a name="id318885-bb"></a>resize(size_type new_size) ;</pre>
+<pre class="literallayout">void <a name="id398118-bb"></a>resize(size_type new_size);</pre>
Effects: Inserts or erases elements at the end such that the size becomes n. New elements are default constructed.
Throws: If memory allocation throws, or T's copy constructor throws.
Complexity: Linear to the difference between size() and new_size. 
</li>
<li>
-<pre class="literallayout">void <a name="id318917-bb"></a>clear() ;</pre>
+<pre class="literallayout">void <a name="id398150-bb"></a>clear();</pre>
Effects: Erases all the elements of the list.
Throws: Nothing.
Complexity: Linear to the number of elements in the list. 
</li>
<li>
-<pre class="literallayout">void <a name="id318942-bb"></a>splice_after(const_iterator prev_pos, slist & x) ;</pre>
+<pre class="literallayout">void <a name="id398176-bb"></a>splice_after(const_iterator prev_pos, slist & x);</pre>
Requires: p must point to an element contained by the list. x != *this
Effects: Transfers all the elements of list x to this list, after the the element pointed by p. No destructors or copy constructors are called.
Throws: std::runtime_error if this' allocator and x's allocator are not equal.
@@ -486,7 +486,7 @@
Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated. 
</li>
<li>
-<pre class="literallayout">void <a name="id318993-bb"></a>splice_after(const_iterator prev_pos, slist & x, const_iterator prev) ;</pre>
+<pre class="literallayout">void <a name="id398226-bb"></a>splice_after(const_iterator prev_pos, slist & x, const_iterator prev);</pre>
Requires: prev_pos must be a valid iterator of this. i must point to an element contained in list x.
Effects: Transfers the value pointed by i, from list x to this list, after the element pointed by prev_pos. If prev_pos == prev or prev_pos == ++prev, this function is a null operation.
Throws: std::runtime_error if this' allocator and x's allocator are not equal.
@@ -494,8 +494,8 @@
Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated. 
</li>
<li>
-<pre class="literallayout">void <a name="id319047-bb"></a>splice_after(const_iterator prev_pos, slist & x,
- const_iterator before_first, const_iterator before_last) ;</pre>
+<pre class="literallayout">void <a name="id398280-bb"></a>splice_after(const_iterator prev_pos, slist & x,
+ const_iterator before_first, const_iterator before_last);</pre>
Requires: prev_pos must be a valid iterator of this. before_first and before_last must be valid iterators of x. prev_pos must not be contained in [before_first, before_last) range.
Effects: Transfers the range [before_first + 1, before_last + 1) from list x to this list, after the element pointed by prev_pos.
Throws: std::runtime_error if this' allocator and x's allocator are not equal.
@@ -503,9 +503,9 @@
Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated. 
</li>
<li>
-<pre class="literallayout">void <a name="id319106-bb"></a>splice_after(const_iterator prev_pos, slist & x,
- const_iterator before_first, const_iterator before_last,
- size_type n) ;</pre>
+<pre class="literallayout">void <a name="id398339-bb"></a>splice_after(const_iterator prev_pos, slist & x,
+ const_iterator before_first, const_iterator before_last,
+ size_type n);</pre>
Requires: prev_pos must be a valid iterator of this. before_first and before_last must be valid iterators of x. prev_pos must not be contained in [before_first, before_last) range. n == std::distance(before_first, before_last)
Effects: Transfers the range [before_first + 1, before_last + 1) from list x to this list, after the element pointed by prev_pos.
Throws: std::runtime_error if this' allocator and x's allocator are not equal.
@@ -513,7 +513,7 @@
Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated. 
</li>
<li>
-<pre class="literallayout">void <a name="id319169-bb"></a>splice(const_iterator p, ThisType & x) ;</pre>
+<pre class="literallayout">void <a name="id398402-bb"></a>splice(const_iterator p, ThisType & x);</pre>
Requires: p must point to an element contained by the list. x != *this
Effects: Transfers all the elements of list x to this list, before the the element pointed by p. No destructors or copy constructors are called.
Throws: std::runtime_error if this' allocator and x's allocator are not equal.
@@ -521,7 +521,7 @@
Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated. 
</li>
<li>
-<pre class="literallayout">void <a name="id319218-bb"></a>splice(const_iterator p, slist & x, const_iterator i) ;</pre>
+<pre class="literallayout">void <a name="id398452-bb"></a>splice(const_iterator p, slist & x, const_iterator i);</pre>
Requires: p must point to an element contained by this list. i must point to an element contained in list x.
Effects: Transfers the value pointed by i, from list x to this list, before the the element pointed by p. No destructors or copy constructors are called. If p == i or p == ++i, this function is a null operation.
Throws: std::runtime_error if this' allocator and x's allocator are not equal.
@@ -529,8 +529,8 @@
Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated. 
</li>
<li>
-<pre class="literallayout">void <a name="id319272-bb"></a>splice(const_iterator p, slist & x, const_iterator first,
- const_iterator last) ;</pre>
+<pre class="literallayout">void <a name="id398506-bb"></a>splice(const_iterator p, slist & x, const_iterator first,
+ const_iterator last);</pre>
Requires: p must point to an element contained by this list. first and last must point to elements contained in list x.
Effects: Transfers the range pointed by first and last from list x to this list, before the the element pointed by p. No destructors or copy constructors are called.
Throws: std::runtime_error if this' allocator and x's allocator are not equal.
@@ -538,50 +538,50 @@
Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated. 
</li>
<li>
-<pre class="literallayout">void <a name="id319331-bb"></a>reverse() ;</pre>
+<pre class="literallayout">void <a name="id398564-bb"></a>reverse();</pre>
Effects: Reverses the order of elements in the list.
Throws: Nothing.
Complexity: This function is linear time.
Note: Iterators and references are not invalidated 
</li>
<li>
-<pre class="literallayout">void <a name="id319362-bb"></a>remove(const T & value) ;</pre>
+<pre class="literallayout">void <a name="id398596-bb"></a>remove(const T & value);</pre>
Effects: Removes all the elements that compare equal to value.
Throws: Nothing.
Complexity: Linear time. It performs exactly size() comparisons for equality.
Note: The relative order of elements that are not removed is unchanged, and iterators to elements that are not removed remain valid. 
</li>
<li>
-<pre class="literallayout">template<typename Pred> void <a name="id319398-bb"></a>remove_if(Pred pred) ;</pre>
+<pre class="literallayout">template<typename Pred> void <a name="id399551-bb"></a>remove_if(Pred pred);</pre>
Effects: Removes all the elements for which a specified predicate is satisfied.
Throws: If pred throws.
Complexity: Linear time. It performs exactly size() calls to the predicate.
Note: The relative order of elements that are not removed is unchanged, and iterators to elements that are not removed remain valid. 
</li>
<li>
-<pre class="literallayout">void <a name="id319440-bb"></a>unique() ;</pre>
+<pre class="literallayout">void <a name="id399593-bb"></a>unique();</pre>
Effects: Removes adjacent duplicate elements or adjacent elements that are equal from the list.
Throws: Nothing.
Complexity: Linear time (size()-1 comparisons calls to pred()).
Note: The relative order of elements that are not removed is unchanged, and iterators to elements that are not removed remain valid. 
</li>
<li>
-<pre class="literallayout">template<typename Pred> void <a name="id319472-bb"></a>unique(Pred pred) ;</pre>
+<pre class="literallayout">template<typename Pred> void <a name="id399625-bb"></a>unique(Pred pred);</pre>
Effects: Removes adjacent duplicate elements or adjacent elements that satisfy some binary predicate from the list.
Throws: If pred throws.
Complexity: Linear time (size()-1 comparisons equality comparisons).
Note: The relative order of elements that are not removed is unchanged, and iterators to elements that are not removed remain valid. 
</li>
<li>
-<pre class="literallayout">void <a name="id319515-bb"></a>merge(slist & x) ;</pre>
+<pre class="literallayout">void <a name="id399668-bb"></a>merge(slist & x);</pre>
Requires: The lists x and *this must be distinct.
Effects: This function removes all of x's elements and inserts them in order into *this according to std::less<value_type>. The merge is stable; that is, if an element from *this is equivalent to one from x, then the element from *this will precede the one from x.
Throws: Nothing.
Complexity: This function is linear time: it performs at most size() + x.size() - 1 comparisons. 
</li>
<li>
-<pre class="literallayout">template<typename StrictWeakOrdering>
- void <a name="id319553-bb"></a>merge(slist & x, StrictWeakOrdering comp) ;</pre>
+<pre class="literallayout">template<typename StrictWeakOrdering>
+ void <a name="id399706-bb"></a>merge(slist & x, StrictWeakOrdering comp);</pre>
Requires: p must be a comparison function that induces a strict weak ordering and both *this and x must be sorted according to that ordering The lists x and *this must be distinct.
Effects: This function removes all of x's elements and inserts them in order into *this. The merge is stable; that is, if an element from *this is equivalent to one from x, then the element from *this will precede the one from x.
Throws: Nothing.
@@ -589,14 +589,14 @@
Note: Iterators and references to *this are not invalidated. 
</li>
<li>
-<pre class="literallayout">void <a name="id319610-bb"></a>sort() ;</pre>
+<pre class="literallayout">void <a name="id399763-bb"></a>sort();</pre>
Effects: This function sorts the list *this according to std::less<value_type>. The sort is stable, that is, the relative order of equivalent elements is preserved.
Throws: Nothing.
Notes: Iterators and references are not invalidated.
Complexity: The number of comparisons is approximately N log N, where N is the list's size. 
</li>
<li>
-<pre class="literallayout">template<typename StrictWeakOrdering> void <a name="id319641-bb"></a>sort(StrictWeakOrdering comp) ;</pre>
+<pre class="literallayout">template<typename StrictWeakOrdering> void <a name="id399794-bb"></a>sort(StrictWeakOrdering comp);</pre>
Effects: This function sorts the list *this according to std::less<value_type>. The sort is stable, that is, the relative order of equivalent elements is preserved.
Throws: Nothing.
Notes: Iterators and references are not invalidated.
@@ -608,7 +608,7 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2009 -2010 Ion Gaztanaga
+<td align="right"><div class="copyright-footer">Copyright © 2009 -2011 Ion Gaztanaga
 Distributed under the Boost Software License, Version 1.0. (See accompanying
 file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
@@ -616,7 +616,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="multiset.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.slist_hpp"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="stable_vector.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="multiset.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.slist_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="stable_vector.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>

Modified: sandbox/move/libs/container/doc/html/boost/container/stable_vector.html
==============================================================================
--- sandbox/move/libs/container/doc/html/boost/container/stable_vector.html (original)
+++ sandbox/move/libs/container/doc/html/boost/container/stable_vector.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
@@ -1,10 +1,10 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Class template stable_vector</title>
-<link rel="stylesheet" href="../../boostbook.css" type="text/css">
+<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
-<link rel="start" href="../../index.html" title="Chapter 1. Boost.Container">
+<link rel="start" href="../../index.html" title="Chapter 1. Boost.Container">
<link rel="up" href="../../boost_container_reference.html#header.boost.container.stable_vector_hpp" title="Header <boost/container/stable_vector.hpp>">
<link rel="prev" href="slist.html" title="Class template slist">
<link rel="next" href="basic_string.html" title="Class template basic_string">
@@ -20,7 +20,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="slist.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.stable_vector_hpp"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="basic_string.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="slist.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.stable_vector_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="basic_string.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="refentry" lang="en">
<a name="boost.container.stable_vector"></a><div class="titlepage"></div>
@@ -29,179 +29,443 @@
boost::container::stable_vector — 
</div>
<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2>
-<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/container/stable_vector.hpp>
+<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/container/stable_vector.hpp>

-template<typename T, typename Allocator>
-class stable_vector {
-public:
- // types
- typedef Allocator::reference <a name="boost.container.stable_vector.reference"></a>reference;
- typedef Allocator::const_reference <a name="boost.container.stable_vector.const_reference"></a>const_reference;
- typedef Allocator::pointer <a name="boost.container.stable_vector.pointer"></a>pointer;
- typedef Allocator::const_pointer <a name="boost.container.stable_vector.const_pointer"></a>const_pointer;
- typedef unspecified <a name="boost.container.stable_vector.iterator"></a>iterator;
- typedef unspecified <a name="boost.container.stable_vector.const_iterator"></a>const_iterator;
- typedef impl_type::size_type <a name="boost.container.stable_vector.size_type"></a>size_type;
- typedef iterator::difference_type <a name="boost.container.stable_vector.difference_type"></a>difference_type;
- typedef T <a name="boost.container.stable_vector.value_type"></a>value_type;
- typedef Allocator <a name="boost.container.stable_vector.allocator_type"></a>allocator_type;
- typedef std::reverse_iterator< iterator > <a name="boost.container.stable_vector.reverse_iterator"></a>reverse_iterator;
- typedef std::reverse_iterator< const_iterator > <a name="boost.container.stable_vector.const_reverse_iterator"></a>const_reverse_iterator;
+template<typename T, typename Allocator>
+class stable_vector {
+public:
+ // types
+ typedef Allocator::reference <a name="boost.container.stable_vector.reference"></a>reference;
+ typedef Allocator::const_reference <a name="boost.container.stable_vector.const_reference"></a>const_reference;
+ typedef Allocator::pointer <a name="boost.container.stable_vector.pointer"></a>pointer;
+ typedef Allocator::const_pointer <a name="boost.container.stable_vector.const_pointer"></a>const_pointer;
+ typedef unspecified <a name="boost.container.stable_vector.iterator"></a>iterator;
+ typedef unspecified <a name="boost.container.stable_vector.const_iterator"></a>const_iterator;
+ typedef impl_type::size_type <a name="boost.container.stable_vector.size_type"></a>size_type;
+ typedef iterator::difference_type <a name="boost.container.stable_vector.difference_type"></a>difference_type;
+ typedef T <a name="boost.container.stable_vector.value_type"></a>value_type;
+ typedef Allocator <a name="boost.container.stable_vector.allocator_type"></a>allocator_type;
+ typedef std::reverse_iterator< iterator > <a name="boost.container.stable_vector.reverse_iterator"></a>reverse_iterator;
+ typedef std::reverse_iterator< const_iterator > <a name="boost.container.stable_vector.const_reverse_iterator"></a>const_reverse_iterator;

- // construct/copy/destruct
- stable_vector(const Allocator & = Allocator());
- stable_vector(size_type);
- stable_vector(size_type, const T &, const Allocator & = Allocator());
- template<typename InputIterator>
- stable_vector(InputIterator, InputIterator,
- const Allocator & = Allocator());
- stable_vector(const stable_vector &);
- stable_vector(stable_vector &&);
- stable_vector& operator=(const stable_vector &);
- stable_vector& operator=(stable_vector &&);
- ~stable_vector();
+ // construct/copy/destruct
+ stable_vector(const Allocator & = Allocator());
+ stable_vector(size_type);
+ stable_vector(size_type, const T &, const Allocator & = Allocator());
+ template<typename InputIterator>
+ stable_vector(InputIterator, InputIterator,
+ const Allocator & = Allocator());
+ stable_vector(const stable_vector &);
+ stable_vector(stable_vector &&);
+ stable_vector& operator=(const stable_vector &);
+ stable_vector& operator=(stable_vector &&);
+ ~stable_vector();

- // public member functions
- template<typename InputIterator> void assign(InputIterator, InputIterator) ;
- void assign(size_type, const T &) ;
- allocator_type get_allocator() const;
- iterator begin() ;
- const_iterator begin() const;
- iterator end() ;
- const_iterator end() const;
- reverse_iterator rbegin() ;
- const_reverse_iterator rbegin() const;
- reverse_iterator rend() ;
- const_reverse_iterator rend() const;
- const_iterator cbegin() const;
- const_iterator cend() const;
- const_reverse_iterator crbegin() const;
- const_reverse_iterator crend() const;
- size_type size() const;
- size_type max_size() const;
- size_type capacity() const;
- bool empty() const;
- void resize(size_type, const T &) ;
- void resize(size_type) ;
- void reserve(size_type) ;
- reference operator[](size_type) ;
- const_reference operator[](size_type) const;
- const_reference at(size_type) const;
- reference at(size_type) ;
- reference front() ;
- const_reference front() const;
- reference back() ;
- const_reference back() const;
- void push_back(const T &) ;
- void push_back(T &&) ;
- void pop_back() ;
- iterator insert(const_iterator, const T &) ;
- iterator insert(const_iterator, T &&) ;
- void insert(const_iterator, size_type, const T &) ;
- template<typename InputIterator>
- void insert(const_iterator, InputIterator, InputIterator) ;
- template<class... Args> void emplace_back(Args &&...) ;
- template<class... Args> iterator emplace(const_iterator, Args &&...) ;
- iterator erase(const_iterator) ;
- iterator erase(const_iterator, const_iterator) ;
- void swap(stable_vector &) ;
- void clear() ;
-};</pre></div>
+ // public member functions
+ template<typename InputIterator> void assign(InputIterator, InputIterator);
+ void assign(size_type, const T &);
+ allocator_type get_allocator() const;
+ iterator begin();
+ const_iterator begin() const;
+ iterator end();
+ const_iterator end() const;
+ reverse_iterator rbegin();
+ const_reverse_iterator rbegin() const;
+ reverse_iterator rend();
+ const_reverse_iterator rend() const;
+ const_iterator cbegin() const;
+ const_iterator cend() const;
+ const_reverse_iterator crbegin() const;
+ const_reverse_iterator crend() const;
+ size_type size() const;
+ size_type max_size() const;
+ size_type capacity() const;
+ bool empty() const;
+ void resize(size_type, const T &);
+ void resize(size_type);
+ void reserve(size_type);
+ reference operator[](size_type);
+ const_reference operator[](size_type) const;
+ reference at(size_type);
+ const_reference at(size_type) const;
+ reference front();
+ const_reference front() const;
+ reference back();
+ const_reference back() const;
+ void push_back(const T &);
+ void push_back(T &&);
+ void pop_back();
+ iterator insert(const_iterator, const T &);
+ iterator insert(const_iterator, T &&);
+ void insert(const_iterator, size_type, const T &);
+ template<typename InputIterator>
+ void insert(const_iterator, InputIterator, InputIterator);
+ template<class... Args> void emplace_back(Args &&...);
+ template<class... Args> iterator emplace(const_iterator, Args &&...);
+ iterator erase(const_iterator);
+ iterator erase(const_iterator, const_iterator);
+ void swap(stable_vector &);
+ void clear();
+};</pre></div>
<div class="refsect1" lang="en">
-<a name="id525071"></a><h2>Description</h2>
-Help taken from (Introducing stable_vector)
+<a name="id848892"></a><h2>Description</h2>
+Originally developed by Joaquin M. Lopez Munoz, stable_vector is std::vector drop-in replacement implemented as a node container, offering iterator and reference stability.
+More details taken the author's blog: (Introducing stable_vector)
We present stable_vector, a fully STL-compliant stable container that provides most of the features of std::vector except element contiguity.
General properties: stable_vector satisfies all the requirements of a container, a reversible container and a sequence and provides all the optional operations present in std::vector. Like std::vector, iterators are random access. stable_vector does not provide element contiguity; in exchange for this absence, the container is stable, i.e. references and iterators to an element of a stable_vector remain valid as long as the element is not erased, and an iterator that has been assigned the return value of end() always remain valid until the destruction of the associated stable_vector.
Operation complexity: The big-O complexities of stable_vector operations match exactly those of std::vector. In general, insertion/deletion is constant time at the end of the sequence and linear elsewhere. Unlike std::vector, stable_vector does not internally perform any value_type destruction, copy or assignment operations other than those exactly corresponding to the insertion of new elements or deletion of stored elements, which can sometimes compensate in terms of performance for the extra burden of doing more pointer manipulation and an additional allocation per element.
Exception safety: As stable_vector does not internally copy elements around, some operations provide stronger exception safety guarantees than in std::vector: 
<div class="refsect2" lang="en">
-<a name="id525087"></a><h3>
+<a name="id848915"></a><h3>
<a name="boost.container.stable_vectorconstruct-copy-destruct"></a><code class="computeroutput">stable_vector</code>
 public
 construct/copy/destruct</h3>
<div class="orderedlist"><ol type="1">
-<li><pre class="literallayout"><a name="id321257-bb"></a>stable_vector(const Allocator & al = Allocator());</pre></li>
-<li><pre class="literallayout"><a name="id321266-bb"></a>stable_vector(size_type n);</pre></li>
-<li><pre class="literallayout"><a name="id321272-bb"></a>stable_vector(size_type n, const T & t, const Allocator & al = Allocator());</pre></li>
-<li><pre class="literallayout">template<typename InputIterator>
- <a name="id321290-bb"></a>stable_vector(InputIterator first, InputIterator last,
- const Allocator & al = Allocator());</pre></li>
-<li><pre class="literallayout"><a name="id321314-bb"></a>stable_vector(const stable_vector & x);</pre></li>
-<li><pre class="literallayout"><a name="id321323-bb"></a>stable_vector(stable_vector && x);</pre></li>
-<li><pre class="literallayout">stable_vector& <a name="id321333-bb"></a>operator=(const stable_vector & x);</pre></li>
-<li><pre class="literallayout">stable_vector& <a name="id321342-bb"></a>operator=(stable_vector && x);</pre></li>
-<li><pre class="literallayout"><a name="id321332-bb"></a>~stable_vector();</pre></li>
+<li>
+<pre class="literallayout"><a name="id402902-bb"></a>stable_vector(const Allocator & al = Allocator());</pre>
+Effects: Constructs a stable_vector taking the allocator as parameter.
+Throws: If allocator_type's copy constructor throws.
+Complexity: Constant. 
+</li>
+<li>
+<pre class="literallayout"><a name="id402931-bb"></a>stable_vector(size_type n);</pre>
+Effects: Constructs a stable_vector that will use a copy of allocator a and inserts n default contructed values.
+Throws: If allocator_type's default constructor or copy constructor throws or T's default or copy constructor throws.
+Complexity: Linear to n. 
+</li>
+<li>
+<pre class="literallayout"><a name="id402956-bb"></a>stable_vector(size_type n, const T & t, const Allocator & al = Allocator());</pre>
+Effects: Constructs a stable_vector that will use a copy of allocator a and inserts n copies of value.
+Throws: If allocator_type's default constructor or copy constructor throws or T's default or copy constructor throws.
+Complexity: Linear to n. 
+</li>
+<li>
+<pre class="literallayout">template<typename InputIterator>
+ <a name="id402993-bb"></a>stable_vector(InputIterator first, InputIterator last,
+ const Allocator & al = Allocator());</pre>
+Effects: Constructs a stable_vector that will use a copy of allocator a and inserts a copy of the range [first, last) in the stable_vector.
+Throws: If allocator_type's default constructor or copy constructor throws or T's constructor taking an dereferenced InIt throws.
+Complexity: Linear to the range [first, last). 
+</li>
+<li>
+<pre class="literallayout"><a name="id403037-bb"></a>stable_vector(const stable_vector & x);</pre>
+Effects: Copy constructs a stable_vector.
+Postcondition: x == *this.
+Complexity: Linear to the elements x contains. 
+</li>
+<li>
+<pre class="literallayout"><a name="id403065-bb"></a>stable_vector(stable_vector && x);</pre>
+Effects: Move constructor. Moves mx's resources to *this.
+Throws: If allocator_type's copy constructor throws.
+Complexity: Constant. 
+</li>
+<li>
+<pre class="literallayout">stable_vector& <a name="id403113-bb"></a>operator=(const stable_vector & x);</pre>
+Effects: Makes *this contain the same elements as x.
+Postcondition: this->size() == x.size(). *this contains a copy of each of x's elements.
+Throws: If memory allocation throws or T's copy constructor throws.
+Complexity: Linear to the number of elements in x. 
+</li>
+<li>
+<pre class="literallayout">stable_vector& <a name="id403149-bb"></a>operator=(stable_vector && x);</pre>
+Effects: Move assignment. All mx's values are transferred to *this.
+Postcondition: x.empty(). *this contains a the elements x had before the function.
+Throws: If allocator_type's copy constructor throws.
+Complexity: Linear. 
+</li>
+<li>
+<pre class="literallayout"><a name="id403093-bb"></a>~stable_vector();</pre>
+Effects: Destroys the stable_vector. All stored values are destroyed and used memory is deallocated.
+Throws: Nothing.
+Complexity: Linear to the number of elements. 
+</li>
</ol></div>
</div>
<div class="refsect2" lang="en">
-<a name="id525254"></a><h3>
-<a name="id320259-bb"></a><code class="computeroutput">stable_vector</code> public member functions</h3>
+<a name="id849532"></a><h3>
+<a name="id400419-bb"></a><code class="computeroutput">stable_vector</code> public member functions</h3>
<div class="orderedlist"><ol type="1">
-<li><pre class="literallayout">template<typename InputIterator>
- void <a name="id320261-bb"></a>assign(InputIterator first, InputIterator last) ;</pre></li>
-<li><pre class="literallayout">void <a name="id320283-bb"></a>assign(size_type n, const T & t) ;</pre></li>
-<li><pre class="literallayout">allocator_type <a name="id320298-bb"></a>get_allocator() const;</pre></li>
-<li><pre class="literallayout">iterator <a name="id320304-bb"></a>begin() ;</pre></li>
-<li><pre class="literallayout">const_iterator <a name="id320310-bb"></a>begin() const;</pre></li>
-<li><pre class="literallayout">iterator <a name="id320316-bb"></a>end() ;</pre></li>
-<li><pre class="literallayout">const_iterator <a name="id320322-bb"></a>end() const;</pre></li>
-<li><pre class="literallayout">reverse_iterator <a name="id320328-bb"></a>rbegin() ;</pre></li>
-<li><pre class="literallayout">const_reverse_iterator <a name="id320334-bb"></a>rbegin() const;</pre></li>
-<li><pre class="literallayout">reverse_iterator <a name="id320340-bb"></a>rend() ;</pre></li>
-<li><pre class="literallayout">const_reverse_iterator <a name="id320346-bb"></a>rend() const;</pre></li>
-<li><pre class="literallayout">const_iterator <a name="id320352-bb"></a>cbegin() const;</pre></li>
-<li><pre class="literallayout">const_iterator <a name="id320358-bb"></a>cend() const;</pre></li>
-<li><pre class="literallayout">const_reverse_iterator <a name="id320364-bb"></a>crbegin() const;</pre></li>
-<li><pre class="literallayout">const_reverse_iterator <a name="id320370-bb"></a>crend() const;</pre></li>
-<li><pre class="literallayout">size_type <a name="id320376-bb"></a>size() const;</pre></li>
-<li><pre class="literallayout">size_type <a name="id320382-bb"></a>max_size() const;</pre></li>
-<li><pre class="literallayout">size_type <a name="id320388-bb"></a>capacity() const;</pre></li>
-<li><pre class="literallayout">bool <a name="id320394-bb"></a>empty() const;</pre></li>
-<li><pre class="literallayout">void <a name="id320400-bb"></a>resize(size_type n, const T & t) ;</pre></li>
-<li><pre class="literallayout">void <a name="id320416-bb"></a>resize(size_type n) ;</pre></li>
-<li><pre class="literallayout">void <a name="id320427-bb"></a>reserve(size_type n) ;</pre></li>
-<li><pre class="literallayout">reference <a name="id320438-bb"></a>operator[](size_type n) ;</pre></li>
-<li><pre class="literallayout">const_reference <a name="id320448-bb"></a>operator[](size_type n) const;</pre></li>
-<li><pre class="literallayout">const_reference <a name="id320459-bb"></a>at(size_type n) const;</pre></li>
-<li><pre class="literallayout">reference <a name="id320470-bb"></a>at(size_type n) ;</pre></li>
-<li><pre class="literallayout">reference <a name="id320481-bb"></a>front() ;</pre></li>
-<li><pre class="literallayout">const_reference <a name="id320487-bb"></a>front() const;</pre></li>
-<li><pre class="literallayout">reference <a name="id320493-bb"></a>back() ;</pre></li>
-<li><pre class="literallayout">const_reference <a name="id320499-bb"></a>back() const;</pre></li>
-<li><pre class="literallayout">void <a name="id320505-bb"></a>push_back(const T & x) ;</pre></li>
-<li><pre class="literallayout">void <a name="id320516-bb"></a>push_back(T && t) ;</pre></li>
-<li><pre class="literallayout">void <a name="id320526-bb"></a>pop_back() ;</pre></li>
-<li><pre class="literallayout">iterator <a name="id320532-bb"></a>insert(const_iterator position, const T & x) ;</pre></li>
-<li><pre class="literallayout">iterator <a name="id320548-bb"></a>insert(const_iterator position, T && x) ;</pre></li>
-<li><pre class="literallayout">void <a name="id320564-bb"></a>insert(const_iterator position, size_type n, const T & t) ;</pre></li>
-<li><pre class="literallayout">template<typename InputIterator>
- void <a name="id320584-bb"></a>insert(const_iterator position, InputIterator first,
- InputIterator last) ;</pre></li>
<li>
-<pre class="literallayout">template<class... Args> void <a name="id320610-bb"></a>emplace_back(Args &&... args) ;</pre>
-Effects: Inserts an object of type T constructed with std::forward<Args>(args)... in the end of the vector.
+<pre class="literallayout">template<typename InputIterator>
+ void <a name="id400421-bb"></a>assign(InputIterator first, InputIterator last);</pre>
+Effects: Assigns the the range [first, last) to *this.
+Throws: If memory allocation throws or T's constructor from dereferencing InpIt throws.
+Complexity: Linear to n. 
+</li>
+<li>
+<pre class="literallayout">void <a name="id400462-bb"></a>assign(size_type n, const T & t);</pre>
+Effects: Assigns the n copies of val to *this.
+Throws: If memory allocation throws or T's copy constructor throws.
+Complexity: Linear to n. 
+</li>
+<li>
+<pre class="literallayout">allocator_type <a name="id400498-bb"></a>get_allocator() const;</pre>
+Effects: Returns a copy of the internal allocator.
+Throws: If allocator's copy constructor throws.
+Complexity: Constant. 
+</li>
+<li>
+<pre class="literallayout">iterator <a name="id400523-bb"></a>begin();</pre>
+Effects: Returns an iterator to the first element contained in the stable_vector.
+Throws: Nothing.
+Complexity: Constant. 
+</li>
+<li>
+<pre class="literallayout">const_iterator <a name="id400549-bb"></a>begin() const;</pre>
+Effects: Returns a const_iterator to the first element contained in the stable_vector.
+Throws: Nothing.
+Complexity: Constant. 
+</li>
+<li>
+<pre class="literallayout">iterator <a name="id400574-bb"></a>end();</pre>
+Effects: Returns an iterator to the end of the stable_vector.
+Throws: Nothing.
+Complexity: Constant. 
+</li>
+<li>
+<pre class="literallayout">const_iterator <a name="id400599-bb"></a>end() const;</pre>
+Effects: Returns a const_iterator to the end of the stable_vector.
+Throws: Nothing.
+Complexity: Constant. 
+</li>
+<li>
+<pre class="literallayout">reverse_iterator <a name="id400625-bb"></a>rbegin();</pre>
+Effects: Returns a reverse_iterator pointing to the beginning of the reversed stable_vector.
+Throws: Nothing.
+Complexity: Constant. 
+</li>
+<li>
+<pre class="literallayout">const_reverse_iterator <a name="id400651-bb"></a>rbegin() const;</pre>
+Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed stable_vector.
+Throws: Nothing.
+Complexity: Constant. 
+</li>
+<li>
+<pre class="literallayout">reverse_iterator <a name="id400676-bb"></a>rend();</pre>
+Effects: Returns a reverse_iterator pointing to the end of the reversed stable_vector.
+Throws: Nothing.
+Complexity: Constant. 
+</li>
+<li>
+<pre class="literallayout">const_reverse_iterator <a name="id400701-bb"></a>rend() const;</pre>
+Effects: Returns a const_reverse_iterator pointing to the end of the reversed stable_vector.
+Throws: Nothing.
+Complexity: Constant. 
+</li>
+<li>
+<pre class="literallayout">const_iterator <a name="id400726-bb"></a>cbegin() const;</pre>
+Effects: Returns a const_iterator to the first element contained in the stable_vector.
+Throws: Nothing.
+Complexity: Constant. 
+</li>
+<li>
+<pre class="literallayout">const_iterator <a name="id400751-bb"></a>cend() const;</pre>
+Effects: Returns a const_iterator to the end of the stable_vector.
+Throws: Nothing.
+Complexity: Constant. 
+</li>
+<li>
+<pre class="literallayout">const_reverse_iterator <a name="id400778-bb"></a>crbegin() const;</pre>
+Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed stable_vector.
+Throws: Nothing.
+Complexity: Constant. 
+</li>
+<li>
+<pre class="literallayout">const_reverse_iterator <a name="id400803-bb"></a>crend() const;</pre>
+Effects: Returns a const_reverse_iterator pointing to the end of the reversed stable_vector.
+Throws: Nothing.
+Complexity: Constant. 
+</li>
+<li>
+<pre class="literallayout">size_type <a name="id400828-bb"></a>size() const;</pre>
+Effects: Returns the number of the elements contained in the stable_vector.
+Throws: Nothing.
+Complexity: Constant. 
+</li>
+<li>
+<pre class="literallayout">size_type <a name="id400853-bb"></a>max_size() const;</pre>
+Effects: Returns the largest possible size of the stable_vector.
+Throws: Nothing.
+Complexity: Constant. 
+</li>
+<li>
+<pre class="literallayout">size_type <a name="id400880-bb"></a>capacity() const;</pre>
+Effects: Number of elements for which memory has been allocated. capacity() is always greater than or equal to size().
+Throws: Nothing.
+Complexity: Constant. 
+</li>
+<li>
+<pre class="literallayout">bool <a name="id400905-bb"></a>empty() const;</pre>
+Effects: Returns true if the stable_vector contains no elements.
+Throws: Nothing.
+Complexity: Constant. 
+</li>
+<li>
+<pre class="literallayout">void <a name="id400931-bb"></a>resize(size_type n, const T & t);</pre>
+Effects: Inserts or erases elements at the end such that the size becomes n. New elements are copy constructed from x.
+Throws: If memory allocation throws, or T's copy constructor throws.
+Complexity: Linear to the difference between size() and new_size. 
+</li>
+<li>
+<pre class="literallayout">void <a name="id400969-bb"></a>resize(size_type n);</pre>
+Effects: Inserts or erases elements at the end such that the size becomes n. New elements are default constructed.
+Throws: If memory allocation throws, or T's copy constructor throws.
+Complexity: Linear to the difference between size() and new_size. 
+</li>
+<li>
+<pre class="literallayout">void <a name="id401001-bb"></a>reserve(size_type n);</pre>
+Effects: If n is less than or equal to capacity(), this call has no effect. Otherwise, it is a request for allocation of additional memory. If the request is successful, then capacity() is greater than or equal to n; otherwise, capacity() is unchanged. In either case, size() is unchanged.
+Throws: If memory allocation allocation throws. 
+</li>
+<li>
+<pre class="literallayout">reference <a name="id401025-bb"></a>operator[](size_type n);</pre>
+Requires: size() < n.
+Effects: Returns a reference to the nth element from the beginning of the container.
+Throws: Nothing.
+Complexity: Constant. 
+</li>
+<li>
+<pre class="literallayout">const_reference <a name="id401061-bb"></a>operator[](size_type n) const;</pre>
+Requires: size() < n.
+Effects: Returns a const reference to the nth element from the beginning of the container.
+Throws: Nothing.
+Complexity: Constant. 
+</li>
+<li>
+<pre class="literallayout">reference <a name="id401097-bb"></a>at(size_type n);</pre>
+Requires: size() < n.
+Effects: Returns a reference to the nth element from the beginning of the container.
+Throws: std::range_error if n >= size()
+Complexity: Constant. 
+</li>
+<li>
+<pre class="literallayout">const_reference <a name="id401133-bb"></a>at(size_type n) const;</pre>
+Requires: size() < n.
+Effects: Returns a const reference to the nth element from the beginning of the container.
+Throws: Nothing.
+Complexity: Constant. 
+</li>
+<li>
+<pre class="literallayout">reference <a name="id401169-bb"></a>front();</pre>
+Requires: !empty()
+Effects: Returns a reference to the first element of the container.
+Throws: Nothing.
+Complexity: Constant. 
+</li>
+<li>
+<pre class="literallayout">const_reference <a name="id401201-bb"></a>front() const;</pre>
+Requires: !empty()
+Effects: Returns a const reference to the first element of the container.
+Throws: Nothing.
+Complexity: Constant. 
+</li>
+<li>
+<pre class="literallayout">reference <a name="id401233-bb"></a>back();</pre>
+Requires: !empty()
+Effects: Returns a reference to the last element of the container.
+Throws: Nothing.
+Complexity: Constant. 
+</li>
+<li>
+<pre class="literallayout">const_reference <a name="id401265-bb"></a>back() const;</pre>
+Requires: !empty()
+Effects: Returns a const reference to the last element of the container.
+Throws: Nothing.
+Complexity: Constant. 
+</li>
+<li>
+<pre class="literallayout">void <a name="id401296-bb"></a>push_back(const T & x);</pre>
+Effects: Inserts a copy of x at the end of the stable_vector.
+Throws: If memory allocation throws or T's copy constructor throws.
+Complexity: Amortized constant time. 
+</li>
+<li>
+<pre class="literallayout">void <a name="id401327-bb"></a>push_back(T && t);</pre>
+Effects: Constructs a new element in the end of the stable_vector and moves the resources of mx to this new element.
+Throws: If memory allocation throws.
+Complexity: Amortized constant time. 
+</li>
+<li>
+<pre class="literallayout">void <a name="id401357-bb"></a>pop_back();</pre>
+Effects: Removes the last element from the stable_vector.
+Throws: Nothing.
+Complexity: Constant time. 
+</li>
+<li>
+<pre class="literallayout">iterator <a name="id401383-bb"></a>insert(const_iterator position, const T & x);</pre>
+Requires: position must be a valid iterator of *this.
+Effects: Insert a copy of x before position.
+Throws: If memory allocation throws or x's copy constructor throws.
+Complexity: If position is end(), amortized constant time Linear time otherwise. 
+</li>
+<li>
+<pre class="literallayout">iterator <a name="id401425-bb"></a>insert(const_iterator position, T && x);</pre>
+Requires: position must be a valid iterator of *this.
+Effects: Insert a new element before position with mx's resources.
+Throws: If memory allocation throws.
+Complexity: If position is end(), amortized constant time Linear time otherwise. 
+</li>
+<li>
+<pre class="literallayout">void <a name="id401467-bb"></a>insert(const_iterator position, size_type n, const T & t);</pre>
+Requires: pos must be a valid iterator of *this.
+Effects: Insert n copies of x before pos.
+Throws: If memory allocation throws or T's copy constructor throws.
+Complexity: Linear to n. 
+</li>
+<li>
+<pre class="literallayout">template<typename InputIterator>
+ void <a name="id401513-bb"></a>insert(const_iterator position, InputIterator first,
+ InputIterator last);</pre>
+Requires: pos must be a valid iterator of *this.
+Effects: Insert a copy of the [first, last) range before pos.
+Throws: If memory allocation throws, T's constructor from a dereferenced InpIt throws or T's copy constructor throws.
+Complexity: Linear to std::distance [first, last). 
+</li>
+<li>
+<pre class="literallayout">template<class... Args> void <a name="id401565-bb"></a>emplace_back(Args &&... args);</pre>
+Effects: Inserts an object of type T constructed with std::forward<Args>(args)... in the end of the stable_vector.
Throws: If memory allocation throws or the in-place constructor throws.
Complexity: Amortized constant time. 
</li>
<li>
-<pre class="literallayout">template<class... Args>
- iterator <a name="id321162-bb"></a>emplace(const_iterator position, Args &&... args) ;</pre>
+<pre class="literallayout">template<class... Args>
+ iterator <a name="id401603-bb"></a>emplace(const_iterator position, Args &&... args);</pre>
Requires: position must be a valid iterator of *this.
Effects: Inserts an object of type T constructed with std::forward<Args>(args)... before position
Throws: If memory allocation throws or the in-place constructor throws.
Complexity: If position is end(), amortized constant time Linear time otherwise. 
</li>
-<li><pre class="literallayout">iterator <a name="id321212-bb"></a>erase(const_iterator position) ;</pre></li>
-<li><pre class="literallayout">iterator <a name="id321222-bb"></a>erase(const_iterator first, const_iterator last) ;</pre></li>
-<li><pre class="literallayout">void <a name="id321238-bb"></a>swap(stable_vector & x) ;</pre></li>
-<li><pre class="literallayout">void <a name="id321251-bb"></a>clear() ;</pre></li>
+<li>
+<pre class="literallayout">iterator <a name="id401653-bb"></a>erase(const_iterator position);</pre>
+Effects: Erases the element at position pos.
+Throws: Nothing.
+Complexity: Linear to the elements between pos and the last element. Constant if pos is the last element. 
+</li>
+<li>
+<pre class="literallayout">iterator <a name="id401683-bb"></a>erase(const_iterator first, const_iterator last);</pre>
+Effects: Erases the elements pointed by [first, last).
+Throws: Nothing.
+Complexity: Linear to the distance between first and last plus linear to the elements between pos and the last element. 
+</li>
+<li>
+<pre class="literallayout">void <a name="id402843-bb"></a>swap(stable_vector & x);</pre>
+Effects: Swaps the contents of *this and x. If this->allocator_type() != x.allocator_type() allocators are also swapped.
+Throws: Nothing.
+Complexity: Constant. 
+</li>
+<li>
+<pre class="literallayout">void <a name="id402876-bb"></a>clear();</pre>
+Effects: Erases all the elements of the stable_vector.
+Throws: Nothing.
+Complexity: Linear to the number of elements in the stable_vector. 
+</li>
</ol></div>
</div>
</div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2009 -2010 Ion Gaztanaga
+<td align="right"><div class="copyright-footer">Copyright © 2009 -2011 Ion Gaztanaga
 Distributed under the Boost Software License, Version 1.0. (See accompanying
 file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
@@ -209,7 +473,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="slist.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.stable_vector_hpp"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="basic_string.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="slist.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.stable_vector_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="basic_string.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>

Modified: sandbox/move/libs/container/doc/html/boost/container/string.html
==============================================================================
--- sandbox/move/libs/container/doc/html/boost/container/string.html (original)
+++ sandbox/move/libs/container/doc/html/boost/container/string.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
@@ -1,10 +1,10 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Type definition string</title>
-<link rel="stylesheet" href="../../boostbook.css" type="text/css">
+<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
-<link rel="start" href="../../index.html" title="Chapter 1. Boost.Container">
+<link rel="start" href="../../index.html" title="Chapter 1. Boost.Container">
<link rel="up" href="../../boost_container_reference.html#header.boost.container.string_hpp" title="Header <boost/container/string.hpp>">
<link rel="prev" href="basic_string.html" title="Class template basic_string">
<link rel="next" href="wstring.html" title="Type definition wstring">
@@ -20,7 +20,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="basic_string.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.string_hpp"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="wstring.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="basic_string.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.string_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="wstring.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="refentry" lang="en">
<a name="boost.container.string"></a><div class="titlepage"></div>
@@ -29,18 +29,18 @@
string — 
</div>
<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2>
-<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/container/string.hpp>
+<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/container/string.hpp>

-
-typedef basic_string< char,std::char_traits< char >,std::allocator< char > > string;</pre></div>
+
+typedef basic_string< char,std::char_traits< char >,std::allocator< char > > string;</pre></div>
<div class="refsect1" lang="en">
-<a name="id538658"></a><h2>Description</h2>
+<a name="id882746"></a><h2>Description</h2>
Typedef for a basic_string of narrow characters 
</div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2009 -2010 Ion Gaztanaga
+<td align="right"><div class="copyright-footer">Copyright © 2009 -2011 Ion Gaztanaga
 Distributed under the Boost Software License, Version 1.0. (See accompanying
 file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
@@ -48,7 +48,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="basic_string.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.string_hpp"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="wstring.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="basic_string.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.string_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="wstring.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>

Modified: sandbox/move/libs/container/doc/html/boost/container/vector.html
==============================================================================
--- sandbox/move/libs/container/doc/html/boost/container/vector.html (original)
+++ sandbox/move/libs/container/doc/html/boost/container/vector.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
@@ -1,10 +1,10 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Class template vector</title>
-<link rel="stylesheet" href="../../boostbook.css" type="text/css">
+<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
-<link rel="start" href="../../index.html" title="Chapter 1. Boost.Container">
+<link rel="start" href="../../index.html" title="Chapter 1. Boost.Container">
<link rel="up" href="../../boost_container_reference.html#header.boost.container.vector_hpp" title="Header <boost/container/vector.hpp>">
<link rel="prev" href="wstring.html" title="Type definition wstring">
</head>
@@ -19,7 +19,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="wstring.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.vector_hpp"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a>
+<a accesskey="p" href="wstring.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.vector_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a>
</div>
<div class="refentry" lang="en">
<a name="boost.container.vector"></a><div class="titlepage"></div>
@@ -28,162 +28,158 @@
boost::container::vector — 
</div>
<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2>
-<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/container/vector.hpp>
+<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/container/vector.hpp>

-template<typename T, typename A>
-class vector {
-public:
- // types
- typedef T value_type;
- typedef A::pointer <a name="boost.container.vector.pointer"></a>pointer; // Pointer to T. 
- typedef A::const_pointer <a name="boost.container.vector.const_pointer"></a>const_pointer; // Const pointer to T. 
- typedef A::reference <a name="boost.container.vector.reference"></a>reference; // Reference to T. 
- typedef A::const_reference <a name="boost.container.vector.const_reference"></a>const_reference; // Const reference to T. 
- typedef A::size_type <a name="boost.container.vector.size_type"></a>size_type; // An unsigned integral type. 
- typedef A::difference_type <a name="boost.container.vector.difference_type"></a>difference_type; // A signed integral type. 
- typedef A <a name="boost.container.vector.allocator_type"></a>allocator_type; // The allocator type. 
- typedef unspecified <a name="boost.container.vector.iterator"></a>iterator; // The random access iterator. 
- typedef unspecified <a name="boost.container.vector.const_iterator"></a>const_iterator; // The random access const_iterator. 
- typedef std::reverse_iterator< iterator > <a name="boost.container.vector.reverse_iterator"></a>reverse_iterator; // Iterator used to iterate backwards through a vector. 
- typedef std::reverse_iterator< const_iterator > <a name="boost.container.vector.const_reverse_iterator"></a>const_reverse_iterator; // Const iterator used to iterate backwards through a vector. 
- typedef allocator_type <a name="boost.container.vector.stored_allocator_type"></a>stored_allocator_type; // The stored allocator type. 
+template<typename T, typename A>
+class vector {
+public:
+ // types
+ typedef T value_type;
+ typedef A::pointer <a name="boost.container.vector.pointer"></a>pointer; // Pointer to T. 
+ typedef A::const_pointer <a name="boost.container.vector.const_pointer"></a>const_pointer; // Const pointer to T. 
+ typedef A::reference <a name="boost.container.vector.reference"></a>reference; // Reference to T. 
+ typedef A::const_reference <a name="boost.container.vector.const_reference"></a>const_reference; // Const reference to T. 
+ typedef A::size_type <a name="boost.container.vector.size_type"></a>size_type; // An unsigned integral type. 
+ typedef A::difference_type <a name="boost.container.vector.difference_type"></a>difference_type; // A signed integral type. 
+ typedef A <a name="boost.container.vector.allocator_type"></a>allocator_type; // The allocator type. 
+ typedef unspecified <a name="boost.container.vector.iterator"></a>iterator; // The random access iterator. 
+ typedef unspecified <a name="boost.container.vector.const_iterator"></a>const_iterator; // The random access const_iterator. 
+ typedef std::reverse_iterator< iterator > <a name="boost.container.vector.reverse_iterator"></a>reverse_iterator; // Iterator used to iterate backwards through a vector. 
+ typedef std::reverse_iterator< const_iterator > <a name="boost.container.vector.const_reverse_iterator"></a>const_reverse_iterator; // Const iterator used to iterate backwards through a vector. 
+ typedef allocator_type <a name="boost.container.vector.stored_allocator_type"></a>stored_allocator_type; // The stored allocator type. 

- // construct/copy/destruct
- vector(const A & = A());
- vector(size_type);
- vector(size_type, const T &, const allocator_type & = allocator_type());
- vector(const vector< T, A > &);
- vector(vector &&);
- template<typename InIt>
- vector(InIt, InIt, const allocator_type & = allocator_type());
- vector& operator=(const vector &);
- vector& operator=(vector &&);
- ~vector();
+ // construct/copy/destruct
+ vector(const A & = A());
+ vector(size_type);
+ vector(size_type, const T &, const allocator_type & = allocator_type());
+ vector(const vector< T, A > &);
+ vector(vector &&);
+ template<typename InIt>
+ vector(InIt, InIt, const allocator_type & = allocator_type());
+ vector& operator=(const vector &);
+ vector& operator=(vector &&);
+ ~vector();

- // public member functions
- iterator begin() ;
- const_iterator begin() const;
- iterator end() ;
- const_iterator end() const;
- reverse_iterator rbegin() ;
- const_reverse_iterator rbegin() const;
- reverse_iterator rend() ;
- const_reverse_iterator rend() const;
- const_iterator cbegin() const;
- const_iterator cend() const;
- const_reverse_iterator crbegin() const;
- const_reverse_iterator crend() const;
- reference front() ;
- const_reference front() const;
- reference back() ;
- const_reference back() const;
- pointer data() ;
- const_pointer data() const;
- size_type size() const;
- size_type max_size() const;
- size_type capacity() const;
- bool empty() const;
- reference operator[](size_type) ;
- const_reference operator[](size_type) const;
- reference at(size_type) ;
- const_reference at(size_type) const;
- allocator_type get_allocator() const;
- const stored_allocator_type & get_stored_allocator() const;
- stored_allocator_type & get_stored_allocator() ;
- void reserve(size_type) ;
- void assign(size_type, const value_type &) ;
- template<typename InIt> void assign(InIt, InIt) ;
- void push_back(const T &) ;
- void push_back(T &&) ;
- template<class... Args> void emplace_back(Args &&...) ;
- template<class... Args> iterator emplace(const_iterator, Args &&...) ;
- void swap(vector &) ;
- iterator insert(const_iterator, const T &) ;
- iterator insert(const_iterator, T &&) ;
- template<typename InIt> void insert(const_iterator, InIt, InIt) ;
- void insert(const_iterator, size_type, const T &) ;
- void pop_back() ;
- iterator erase(const_iterator) ;
- iterator erase(const_iterator, const_iterator) ;
- void resize(size_type, const T &) ;
- void resize(size_type) ;
- void clear() ;
- void shrink_to_fit() ;
-};</pre></div>
+ // public member functions
+ iterator begin();
+ const_iterator begin() const;
+ iterator end();
+ const_iterator end() const;
+ reverse_iterator rbegin();
+ const_reverse_iterator rbegin() const;
+ reverse_iterator rend();
+ const_reverse_iterator rend() const;
+ const_iterator cbegin() const;
+ const_iterator cend() const;
+ const_reverse_iterator crbegin() const;
+ const_reverse_iterator crend() const;
+ reference front();
+ const_reference front() const;
+ reference back();
+ const_reference back() const;
+ pointer data();
+ const_pointer data() const;
+ size_type size() const;
+ size_type max_size() const;
+ size_type capacity() const;
+ bool empty() const;
+ reference operator[](size_type);
+ const_reference operator[](size_type) const;
+ reference at(size_type);
+ const_reference at(size_type) const;
+ allocator_type get_allocator() const;
+ const stored_allocator_type & get_stored_allocator() const;
+ stored_allocator_type & get_stored_allocator();
+ void reserve(size_type);
+ void assign(size_type, const value_type &);
+ template<typename InIt> void assign(InIt, InIt);
+ template<class... Args> void emplace_back(Args &&...);
+ template<class... Args> iterator emplace(const_iterator, Args &&...);
+ void swap(vector &);
+ template<typename InIt> void insert(const_iterator, InIt, InIt);
+ void insert(const_iterator, size_type, const T &);
+ void pop_back();
+ iterator erase(const_iterator);
+ iterator erase(const_iterator, const_iterator);
+ void resize(size_type, const T &);
+ void resize(size_type);
+ void clear();
+ void shrink_to_fit();
+};</pre></div>
<div class="refsect1" lang="en">
-<a name="id539892"></a><h2>Description</h2>
+<a name="id885823"></a><h2>Description</h2>
A vector is a sequence that supports random access to elements, constant time insertion and removal of elements at the end, and linear time insertion and removal of elements at the beginning or in the middle. The number of elements in a vector may vary dynamically; memory management is automatic. boost::container::vector is similar to std::vector but it's compatible with shared memory and memory mapped files. 
<div class="refsect2" lang="en">
-<a name="id539898"></a><h3>
+<a name="id885829"></a><h3>
<a name="boost.container.vectortypes"></a><code class="computeroutput">vector</code>
 public
 types</h3>
<div class="orderedlist"><ol type="1"><li>

-typedef T <a name="boost.container.vector.value_type"></a>value_type;
+typedef T <a name="boost.container.vector.value_type"></a>value_type;
The type of object, T, stored in the vector 
</li></ol></div>
</div>
<div class="refsect2" lang="en">
-<a name="id539926"></a><h3>
+<a name="id885867"></a><h3>
<a name="boost.container.vectorconstruct-copy-destruct"></a><code class="computeroutput">vector</code>
 public
 construct/copy/destruct</h3>
<div class="orderedlist"><ol type="1">
<li>
-<pre class="literallayout"><a name="id329411-bb"></a>vector(const A & a = A());</pre>
+<pre class="literallayout"><a name="id409536-bb"></a>vector(const A & a = A());</pre>
Effects: Constructs a vector taking the allocator as parameter.
Throws: If allocator_type's copy constructor throws.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout"><a name="id329440-bb"></a>vector(size_type n);</pre>
+<pre class="literallayout"><a name="id409565-bb"></a>vector(size_type n);</pre>
Effects: Constructs a vector that will use a copy of allocator a and inserts n default contructed values.
Throws: If allocator_type's default constructor or copy constructor throws or T's default or copy constructor throws.
Complexity: Linear to n. 
</li>
<li>
-<pre class="literallayout"><a name="id329465-bb"></a>vector(size_type n, const T & value,
- const allocator_type & a = allocator_type());</pre>
+<pre class="literallayout"><a name="id409590-bb"></a>vector(size_type n, const T & value,
+ const allocator_type & a = allocator_type());</pre>
Effects: Constructs a vector that will use a copy of allocator a and inserts n copies of value.
Throws: If allocator_type's default constructor or copy constructor throws or T's default or copy constructor throws.
Complexity: Linear to n. 
</li>
<li>
-<pre class="literallayout"><a name="id329502-bb"></a>vector(const vector< T, A > & x);</pre>
+<pre class="literallayout"><a name="id409627-bb"></a>vector(const vector< T, A > & x);</pre>
Effects: Copy constructs a vector.
Postcondition: x == *this.
Complexity: Linear to the elements x contains. 
</li>
<li>
-<pre class="literallayout"><a name="id329531-bb"></a>vector(vector && mx);</pre>
+<pre class="literallayout"><a name="id409656-bb"></a>vector(vector && mx);</pre>
Effects: Move constructor. Moves mx's resources to *this.
Throws: If allocator_type's copy constructor throws.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">template<typename InIt>
- <a name="id329558-bb"></a>vector(InIt first, InIt last, const allocator_type & a = allocator_type());</pre>
+<pre class="literallayout">template<typename InIt>
+ <a name="id409684-bb"></a>vector(InIt first, InIt last, const allocator_type & a = allocator_type());</pre>
Effects: Constructs a vector that will use a copy of allocator a and inserts a copy of the range [first, last) in the vector.
Throws: If allocator_type's default constructor or copy constructor throws or T's constructor taking an dereferenced InIt throws.
Complexity: Linear to the range [first, last). 
</li>
<li>
-<pre class="literallayout">vector& <a name="id329622-bb"></a>operator=(const vector & x);</pre>
+<pre class="literallayout">vector& <a name="id409747-bb"></a>operator=(const vector & x);</pre>
Effects: Makes *this contain the same elements as x.
Postcondition: this->size() == x.size(). *this contains a copy of each of x's elements.
Throws: If memory allocation throws or T's copy constructor throws.
Complexity: Linear to the number of elements in x. 
</li>
<li>
-<pre class="literallayout">vector& <a name="id329658-bb"></a>operator=(vector && x);</pre>
+<pre class="literallayout">vector& <a name="id409783-bb"></a>operator=(vector && x);</pre>
Effects: Move assignment. All mx's values are transferred to *this.
Postcondition: x.empty(). *this contains a the elements x had before the function.
Throws: If allocator_type's copy constructor throws.
Complexity: Linear. 
</li>
<li>
-<pre class="literallayout"><a name="id329602-bb"></a>~vector();</pre>
+<pre class="literallayout"><a name="id409727-bb"></a>~vector();</pre>
Effects: Destroys the vector. All stored values are destroyed and used memory is deallocated.
Throws: Nothing.
Complexity: Linear to the number of elements. 
@@ -191,296 +187,272 @@
</ol></div>
</div>
<div class="refsect2" lang="en">
-<a name="id541780"></a><h3>
-<a name="id327978-bb"></a><code class="computeroutput">vector</code> public member functions</h3>
+<a name="id886506"></a><h3>
+<a name="id408223-bb"></a><code class="computeroutput">vector</code> public member functions</h3>
<div class="orderedlist"><ol type="1">
<li>
-<pre class="literallayout">iterator <a name="id327980-bb"></a>begin() ;</pre>
+<pre class="literallayout">iterator <a name="id408226-bb"></a>begin();</pre>
Effects: Returns an iterator to the first element contained in the vector.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_iterator <a name="id328006-bb"></a>begin() const;</pre>
+<pre class="literallayout">const_iterator <a name="id408251-bb"></a>begin() const;</pre>
Effects: Returns a const_iterator to the first element contained in the vector.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id328031-bb"></a>end() ;</pre>
+<pre class="literallayout">iterator <a name="id408276-bb"></a>end();</pre>
Effects: Returns an iterator to the end of the vector.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_iterator <a name="id328056-bb"></a>end() const;</pre>
+<pre class="literallayout">const_iterator <a name="id408301-bb"></a>end() const;</pre>
Effects: Returns a const_iterator to the end of the vector.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">reverse_iterator <a name="id328081-bb"></a>rbegin() ;</pre>
+<pre class="literallayout">reverse_iterator <a name="id408326-bb"></a>rbegin();</pre>
Effects: Returns a reverse_iterator pointing to the beginning of the reversed vector.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_reverse_iterator <a name="id328106-bb"></a>rbegin() const;</pre>
+<pre class="literallayout">const_reverse_iterator <a name="id408352-bb"></a>rbegin() const;</pre>
Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed vector.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">reverse_iterator <a name="id328132-bb"></a>rend() ;</pre>
+<pre class="literallayout">reverse_iterator <a name="id408377-bb"></a>rend();</pre>
Effects: Returns a reverse_iterator pointing to the end of the reversed vector.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_reverse_iterator <a name="id328157-bb"></a>rend() const;</pre>
+<pre class="literallayout">const_reverse_iterator <a name="id408402-bb"></a>rend() const;</pre>
Effects: Returns a const_reverse_iterator pointing to the end of the reversed vector.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_iterator <a name="id328182-bb"></a>cbegin() const;</pre>
+<pre class="literallayout">const_iterator <a name="id408427-bb"></a>cbegin() const;</pre>
Effects: Returns a const_iterator to the first element contained in the vector.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_iterator <a name="id328207-bb"></a>cend() const;</pre>
+<pre class="literallayout">const_iterator <a name="id408452-bb"></a>cend() const;</pre>
Effects: Returns a const_iterator to the end of the vector.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_reverse_iterator <a name="id328232-bb"></a>crbegin() const;</pre>
+<pre class="literallayout">const_reverse_iterator <a name="id408478-bb"></a>crbegin() const;</pre>
Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed vector.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_reverse_iterator <a name="id328258-bb"></a>crend() const;</pre>
+<pre class="literallayout">const_reverse_iterator <a name="id408503-bb"></a>crend() const;</pre>
Effects: Returns a const_reverse_iterator pointing to the end of the reversed vector.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">reference <a name="id328283-bb"></a>front() ;</pre>
+<pre class="literallayout">reference <a name="id408528-bb"></a>front();</pre>
Requires: !empty()
-Effects: Returns a reference to the first element from the beginning of the container.
+Effects: Returns a reference to the first element of the container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_reference <a name="id328314-bb"></a>front() const;</pre>
+<pre class="literallayout">const_reference <a name="id408560-bb"></a>front() const;</pre>
Requires: !empty()
-Effects: Returns a const reference to the first element from the beginning of the container.
+Effects: Returns a const reference to the first element of the container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">reference <a name="id328345-bb"></a>back() ;</pre>
+<pre class="literallayout">reference <a name="id408592-bb"></a>back();</pre>
Requires: !empty()
-Effects: Returns a reference to the first element from the beginning of the container.
+Effects: Returns a reference to the last element of the container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_reference <a name="id328376-bb"></a>back() const;</pre>
-Effects: Returns a const reference to the first element from the beginning of the container.
+<pre class="literallayout">const_reference <a name="id408624-bb"></a>back() const;</pre>
+Requires: !empty()
+Effects: Returns a const reference to the last element of the container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">pointer <a name="id328402-bb"></a>data() ;</pre>
+<pre class="literallayout">pointer <a name="id408655-bb"></a>data();</pre>
Returns: A pointer such that [data(),data() + size()) is a valid range. For a non-empty vector, data() == &front().
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_pointer <a name="id328427-bb"></a>data() const;</pre>
+<pre class="literallayout">const_pointer <a name="id408680-bb"></a>data() const;</pre>
Returns: A pointer such that [data(),data() + size()) is a valid range. For a non-empty vector, data() == &front().
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">size_type <a name="id328452-bb"></a>size() const;</pre>
+<pre class="literallayout">size_type <a name="id408706-bb"></a>size() const;</pre>
Effects: Returns the number of the elements contained in the vector.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">size_type <a name="id328478-bb"></a>max_size() const;</pre>
+<pre class="literallayout">size_type <a name="id408732-bb"></a>max_size() const;</pre>
Effects: Returns the largest possible size of the vector.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">size_type <a name="id328504-bb"></a>capacity() const;</pre>
+<pre class="literallayout">size_type <a name="id408757-bb"></a>capacity() const;</pre>
Effects: Number of elements for which memory has been allocated. capacity() is always greater than or equal to size().
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">bool <a name="id328529-bb"></a>empty() const;</pre>
+<pre class="literallayout">bool <a name="id408782-bb"></a>empty() const;</pre>
Effects: Returns true if the vector contains no elements.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">reference <a name="id328554-bb"></a>operator[](size_type n) ;</pre>
+<pre class="literallayout">reference <a name="id408808-bb"></a>operator[](size_type n);</pre>
Requires: size() < n.
Effects: Returns a reference to the nth element from the beginning of the container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_reference <a name="id328590-bb"></a>operator[](size_type n) const;</pre>
+<pre class="literallayout">const_reference <a name="id408844-bb"></a>operator[](size_type n) const;</pre>
Requires: size() < n.
Effects: Returns a const reference to the nth element from the beginning of the container.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">reference <a name="id328626-bb"></a>at(size_type n) ;</pre>
+<pre class="literallayout">reference <a name="id408880-bb"></a>at(size_type n);</pre>
Requires: size() < n.
Effects: Returns a reference to the nth element from the beginning of the container.
Throws: std::range_error if n >= size()
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">const_reference <a name="id328662-bb"></a>at(size_type n) const;</pre>
+<pre class="literallayout">const_reference <a name="id408916-bb"></a>at(size_type n) const;</pre>
Requires: size() < n.
Effects: Returns a const reference to the nth element from the beginning of the container.
Throws: std::range_error if n >= size()
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">allocator_type <a name="id328698-bb"></a>get_allocator() const;</pre>
+<pre class="literallayout">allocator_type <a name="id408952-bb"></a>get_allocator() const;</pre>
Effects: Returns a copy of the internal allocator.
Throws: If allocator's copy constructor throws.
Complexity: Constant. 
</li>
-<li><pre class="literallayout">const stored_allocator_type & <a name="id328723-bb"></a>get_stored_allocator() const;</pre></li>
-<li><pre class="literallayout">stored_allocator_type & <a name="id328729-bb"></a>get_stored_allocator() ;</pre></li>
+<li><pre class="literallayout">const stored_allocator_type & <a name="id408977-bb"></a>get_stored_allocator() const;</pre></li>
+<li><pre class="literallayout">stored_allocator_type & <a name="id408983-bb"></a>get_stored_allocator();</pre></li>
<li>
-<pre class="literallayout">void <a name="id328735-bb"></a>reserve(size_type new_cap) ;</pre>
+<pre class="literallayout">void <a name="id408989-bb"></a>reserve(size_type new_cap);</pre>
Effects: If n is less than or equal to capacity(), this call has no effect. Otherwise, it is a request for allocation of additional memory. If the request is successful, then capacity() is greater than or equal to n; otherwise, capacity() is unchanged. In either case, size() is unchanged.
-Throws: If memory allocation allocation throws or T's copy constructor throws. 
+Throws: If memory allocation allocation throws or T's copy/move constructor throws. 
</li>
<li>
-<pre class="literallayout">void <a name="id328759-bb"></a>assign(size_type n, const value_type & val) ;</pre>
+<pre class="literallayout">void <a name="id409013-bb"></a>assign(size_type n, const value_type & val);</pre>
Effects: Assigns the n copies of val to *this.
Throws: If memory allocation throws or T's copy constructor throws.
Complexity: Linear to n. 
</li>
<li>
-<pre class="literallayout">template<typename InIt> void <a name="id328795-bb"></a>assign(InIt first, InIt last) ;</pre>
+<pre class="literallayout">template<typename InIt> void <a name="id409049-bb"></a>assign(InIt first, InIt last);</pre>
Effects: Assigns the the range [first, last) to *this.
Throws: If memory allocation throws or T's constructor from dereferencing InpIt throws.
Complexity: Linear to n. 
</li>
<li>
-<pre class="literallayout">void <a name="id328836-bb"></a>push_back(const T & x) ;</pre>
-Effects: Inserts a copy of x at the end of the vector.
-Throws: If memory allocation throws or T's copy constructor throws.
-Complexity: Amortized constant time. 
-</li>
-<li>
-<pre class="literallayout">void <a name="id328867-bb"></a>push_back(T && x) ;</pre>
+<pre class="literallayout">template<class... Args> void <a name="id409090-bb"></a>emplace_back(Args &&... args);</pre>
Effects: Constructs a new element in the end of the vector and moves the resources of mx to this new element.
Throws: If memory allocation throws.
-Complexity: Amortized constant time. 
-</li>
-<li>
-<pre class="literallayout">template<class... Args> void <a name="id328897-bb"></a>emplace_back(Args &&... args) ;</pre>
-Effects: Inserts an object of type T constructed with std::forward<Args>(args)... in the end of the vector.
+Complexity: Amortized constant time. Effects: Inserts an object of type T constructed with std::forward<Args>(args)... in the end of the vector.
Throws: If memory allocation throws or the in-place constructor throws.
Complexity: Amortized constant time. 
</li>
<li>
-<pre class="literallayout">template<class... Args>
- iterator <a name="id328936-bb"></a>emplace(const_iterator position, Args &&... args) ;</pre>
+<pre class="literallayout">template<class... Args>
+ iterator <a name="id409145-bb"></a>emplace(const_iterator position, Args &&... args);</pre>
Requires: position must be a valid iterator of *this.
Effects: Inserts an object of type T constructed with std::forward<Args>(args)... before position
Throws: If memory allocation throws or the in-place constructor throws.
Complexity: If position is end(), amortized constant time Linear time otherwise. 
</li>
<li>
-<pre class="literallayout">void <a name="id328985-bb"></a>swap(vector & x) ;</pre>
+<pre class="literallayout">void <a name="id409194-bb"></a>swap(vector & x);</pre>
Effects: Swaps the contents of *this and x. If this->allocator_type() != x.allocator_type() allocators are also swapped.
Throws: Nothing.
Complexity: Constant. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id329017-bb"></a>insert(const_iterator position, const T & x) ;</pre>
-Requires: position must be a valid iterator of *this.
-Effects: Insert a copy of x before position.
-Throws: If memory allocation throws or x's copy constructor throws.
-Complexity: If position is end(), amortized constant time Linear time otherwise. 
-</li>
-<li>
-<pre class="literallayout">iterator <a name="id329059-bb"></a>insert(const_iterator position, T && x) ;</pre>
-Requires: position must be a valid iterator of *this.
-Effects: Insert a new element before position with mx's resources.
-Throws: If memory allocation throws.
-Complexity: If position is end(), amortized constant time Linear time otherwise. 
-</li>
-<li>
-<pre class="literallayout">template<typename InIt>
- void <a name="id329101-bb"></a>insert(const_iterator pos, InIt first, InIt last) ;</pre>
+<pre class="literallayout">template<typename InIt> void <a name="id409226-bb"></a>insert(const_iterator pos, InIt first, InIt last);</pre>
Requires: pos must be a valid iterator of *this.
Effects: Insert a copy of the [first, last) range before pos.
Throws: If memory allocation throws, T's constructor from a dereferenced InpIt throws or T's copy constructor throws.
Complexity: Linear to std::distance [first, last). 
</li>
<li>
-<pre class="literallayout">void <a name="id329153-bb"></a>insert(const_iterator p, size_type n, const T & x) ;</pre>
+<pre class="literallayout">void <a name="id409278-bb"></a>insert(const_iterator p, size_type n, const T & x);</pre>
Requires: pos must be a valid iterator of *this.
Effects: Insert n copies of x before pos.
Throws: If memory allocation throws or T's copy constructor throws.
Complexity: Linear to n. 
</li>
<li>
-<pre class="literallayout">void <a name="id329200-bb"></a>pop_back() ;</pre>
+<pre class="literallayout">void <a name="id409325-bb"></a>pop_back();</pre>
Effects: Removes the last element from the vector.
Throws: Nothing.
Complexity: Constant time. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id329225-bb"></a>erase(const_iterator position) ;</pre>
+<pre class="literallayout">iterator <a name="id409350-bb"></a>erase(const_iterator position);</pre>
Effects: Erases the element at position pos.
Throws: Nothing.
-Complexity: Linear to the elements between pos and the last element. Constant if pos is the first or the last element. 
+Complexity: Linear to the elements between pos and the last element. Constant if pos is the last element. 
</li>
<li>
-<pre class="literallayout">iterator <a name="id329255-bb"></a>erase(const_iterator first, const_iterator last) ;</pre>
+<pre class="literallayout">iterator <a name="id409380-bb"></a>erase(const_iterator first, const_iterator last);</pre>
Effects: Erases the elements pointed by [first, last).
Throws: Nothing.
-Complexity: Linear to the distance between first and last. 
+Complexity: Linear to the distance between first and last plus linear to the elements between pos and the last element. 
</li>
<li>
-<pre class="literallayout">void <a name="id329290-bb"></a>resize(size_type new_size, const T & x) ;</pre>
+<pre class="literallayout">void <a name="id409415-bb"></a>resize(size_type new_size, const T & x);</pre>
Effects: Inserts or erases elements at the end such that the size becomes n. New elements are copy constructed from x.
Throws: If memory allocation throws, or T's copy constructor throws.
Complexity: Linear to the difference between size() and new_size. 
</li>
<li>
-<pre class="literallayout">void <a name="id329327-bb"></a>resize(size_type new_size) ;</pre>
+<pre class="literallayout">void <a name="id409452-bb"></a>resize(size_type new_size);</pre>
Effects: Inserts or erases elements at the end such that the size becomes n. New elements are default constructed.
Throws: If memory allocation throws, or T's copy constructor throws.
Complexity: Linear to the difference between size() and new_size. 
</li>
<li>
-<pre class="literallayout">void <a name="id329359-bb"></a>clear() ;</pre>
+<pre class="literallayout">void <a name="id409484-bb"></a>clear();</pre>
Effects: Erases all the elements of the vector.
Throws: Nothing.
Complexity: Linear to the number of elements in the vector. 
</li>
<li>
-<pre class="literallayout">void <a name="id329384-bb"></a>shrink_to_fit() ;</pre>
+<pre class="literallayout">void <a name="id409510-bb"></a>shrink_to_fit();</pre>
Effects: Tries to deallocate the excess of memory created with previous allocations. The size of the vector is unchanged
Throws: If memory allocation throws, or T's copy constructor throws.
Complexity: Linear to size(). 
@@ -491,7 +463,7 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2009 -2010 Ion Gaztanaga
+<td align="right"><div class="copyright-footer">Copyright © 2009 -2011 Ion Gaztanaga
 Distributed under the Boost Software License, Version 1.0. (See accompanying
 file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
@@ -499,7 +471,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="wstring.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.vector_hpp"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a>
+<a accesskey="p" href="wstring.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.vector_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a>
</div>
</body>
</html>

Modified: sandbox/move/libs/container/doc/html/boost/container/wstring.html
==============================================================================
--- sandbox/move/libs/container/doc/html/boost/container/wstring.html (original)
+++ sandbox/move/libs/container/doc/html/boost/container/wstring.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
@@ -1,10 +1,10 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Type definition wstring</title>
-<link rel="stylesheet" href="../../boostbook.css" type="text/css">
+<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
-<link rel="start" href="../../index.html" title="Chapter 1. Boost.Container">
+<link rel="start" href="../../index.html" title="Chapter 1. Boost.Container">
<link rel="up" href="../../boost_container_reference.html#header.boost.container.string_hpp" title="Header <boost/container/string.hpp>">
<link rel="prev" href="string.html" title="Type definition string">
<link rel="next" href="vector.html" title="Class template vector">
@@ -20,7 +20,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="string.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.string_hpp"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="vector.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="string.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.string_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="vector.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="refentry" lang="en">
<a name="boost.container.wstring"></a><div class="titlepage"></div>
@@ -29,18 +29,18 @@
wstring — 
</div>
<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2>
-<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/container/string.hpp>
+<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/container/string.hpp>

-
-typedef basic_string< wchar_t,std::char_traits< wchar_t >,std::allocator< wchar_t > > wstring;</pre></div>
+
+typedef basic_string< wchar_t,std::char_traits< wchar_t >,std::allocator< wchar_t > > wstring;</pre></div>
<div class="refsect1" lang="en">
-<a name="id538713"></a><h2>Description</h2>
+<a name="id882863"></a><h2>Description</h2>
Typedef for a basic_string of narrow characters 
</div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2009 -2010 Ion Gaztanaga
+<td align="right"><div class="copyright-footer">Copyright © 2009 -2011 Ion Gaztanaga
 Distributed under the Boost Software License, Version 1.0. (See accompanying
 file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
@@ -48,7 +48,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="string.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.string_hpp"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="vector.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="string.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_container_reference.html#header.boost.container.string_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="vector.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>

Modified: sandbox/move/libs/container/doc/html/boost_container_reference.html
==============================================================================
--- sandbox/move/libs/container/doc/html/boost_container_reference.html (original)
+++ sandbox/move/libs/container/doc/html/boost_container_reference.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
@@ -1,12 +1,12 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Boost.Container Reference</title>
-<link rel="stylesheet" href="boostbook.css" type="text/css">
+<link rel="stylesheet" href="../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
-<link rel="start" href="index.html" title="Chapter 1. Boost.Container">
-<link rel="up" href="index.html" title="Chapter 1. Boost.Container">
-<link rel="prev" href="container/release_notes.html" title=" Release Notes">
+<link rel="start" href="index.html" title="Chapter 1. Boost.Container">
+<link rel="up" href="index.html" title="Chapter 1. Boost.Container">
+<link rel="prev" href="container/release_notes.html" title="Release Notes">
<link rel="next" href="boost/container/ordered_range_impl_t.html" title="Struct ordered_range_impl_t">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
@@ -20,7 +20,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="container/release_notes.html"><img src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="index.html"><img src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="index.html"><img src="../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="boost/container/ordered_range_impl_t.html"><img src="../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="container/release_notes.html"><img src="../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="index.html"><img src="../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="index.html"><img src="../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="boost/container/ordered_range_impl_t.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
@@ -41,476 +41,476 @@
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
<a name="header.boost.container.container_fwd_hpp"></a>Header <boost/container/container_fwd.hpp></h3></div></div></div>
-<pre class="synopsis">namespace boost {
- namespace container {
- struct ordered_range_impl_t;
- struct ordered_unique_range_impl_t;
+<pre class="synopsis">namespace boost {
+ namespace container {
+ struct ordered_range_impl_t;
+ struct ordered_unique_range_impl_t;

- static const ordered_range_t ordered_range;
- static const ordered_unique_range_t ordered_unique_range;
- }
-}</pre>
+ static const ordered_range_t ordered_range;
+ static const ordered_unique_range_t ordered_unique_range;
+ }
+}</pre>
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
<a name="header.boost.container.deque_hpp"></a>Header <boost/container/deque.hpp></h3></div></div></div>
-<pre class="synopsis">namespace boost {
- namespace container {
- template<typename T, typename Alloc> class deque;
- template<typename T, typename Alloc>
- bool <a name="boost.container.operator==_id294263"></a>operator==(const deque< T, Alloc > & x,
- const deque< T, Alloc > & y);
- template<typename T, typename Alloc>
- bool <a name="boost.container.operator_id294294"></a>operator<(const deque< T, Alloc > & x, const deque< T, Alloc > & y);
- template<typename T, typename Alloc>
- bool <a name="boost.container.operator!=_id294325"></a>operator!=(const deque< T, Alloc > & x,
- const deque< T, Alloc > & y);
- template<typename T, typename Alloc>
- bool <a name="boost.container.operator_id294356"></a>operator>(const deque< T, Alloc > & x, const deque< T, Alloc > & y);
- template<typename T, typename Alloc>
- bool <a name="boost.container.operator_=_id294388"></a>operator<=(const deque< T, Alloc > & x,
- const deque< T, Alloc > & y);
- template<typename T, typename Alloc>
- bool <a name="boost.container.operator_=_id294419"></a>operator>=(const deque< T, Alloc > & x,
- const deque< T, Alloc > & y);
- template<typename T, typename A>
- void <a name="boost.container.swap_id294450"></a>swap(deque< T, A > & x, deque< T, A > & y);
- }
-}</pre>
+<pre class="synopsis">namespace boost {
+ namespace container {
+ template<typename T, typename Alloc> class deque;
+ template<typename T, typename Alloc>
+ bool <a name="boost.container.operator==_id373086"></a>operator==(const deque< T, Alloc > & x,
+ const deque< T, Alloc > & y);
+ template<typename T, typename Alloc>
+ bool <a name="boost.container.operator_id373118"></a>operator<(const deque< T, Alloc > & x, const deque< T, Alloc > & y);
+ template<typename T, typename Alloc>
+ bool <a name="boost.container.operator!=_id373149"></a>operator!=(const deque< T, Alloc > & x,
+ const deque< T, Alloc > & y);
+ template<typename T, typename Alloc>
+ bool <a name="boost.container.operator_id373180"></a>operator>(const deque< T, Alloc > & x, const deque< T, Alloc > & y);
+ template<typename T, typename Alloc>
+ bool <a name="boost.container.operator_=_id373211"></a>operator<=(const deque< T, Alloc > & x,
+ const deque< T, Alloc > & y);
+ template<typename T, typename Alloc>
+ bool <a name="boost.container.operator_=_id373242"></a>operator>=(const deque< T, Alloc > & x,
+ const deque< T, Alloc > & y);
+ template<typename T, typename A>
+ void <a name="boost.container.swap_id373274"></a>swap(deque< T, A > & x, deque< T, A > & y);
+ }
+}</pre>
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
<a name="header.boost.container.flat_map_hpp"></a>Header <boost/container/flat_map.hpp></h3></div></div></div>
-<pre class="synopsis">namespace boost {
- namespace container {
- template<typename Key, typename T, typename Pred, typename Alloc>
- class flat_map;
- template<typename Key, typename T, typename Pred, typename Alloc>
- class flat_multimap;
- template<typename Key, typename T, typename Pred, typename Alloc>
- bool <a name="boost.container.operator==_id298011"></a>operator==(const flat_map< Key, T, Pred, Alloc > & x,
- const flat_map< Key, T, Pred, Alloc > & y);
- template<typename Key, typename T, typename Pred, typename Alloc>
- bool <a name="boost.container.operator_id298050"></a>operator<(const flat_map< Key, T, Pred, Alloc > & x,
- const flat_map< Key, T, Pred, Alloc > & y);
- template<typename Key, typename T, typename Pred, typename Alloc>
- bool <a name="boost.container.operator!=_id298088"></a>operator!=(const flat_map< Key, T, Pred, Alloc > & x,
- const flat_map< Key, T, Pred, Alloc > & y);
- template<typename Key, typename T, typename Pred, typename Alloc>
- bool <a name="boost.container.operator_id298126"></a>operator>(const flat_map< Key, T, Pred, Alloc > & x,
- const flat_map< Key, T, Pred, Alloc > & y);
- template<typename Key, typename T, typename Pred, typename Alloc>
- bool <a name="boost.container.operator_=_id298165"></a>operator<=(const flat_map< Key, T, Pred, Alloc > & x,
- const flat_map< Key, T, Pred, Alloc > & y);
- template<typename Key, typename T, typename Pred, typename Alloc>
- bool <a name="boost.container.operator_=_id298203"></a>operator>=(const flat_map< Key, T, Pred, Alloc > & x,
- const flat_map< Key, T, Pred, Alloc > & y);
- template<typename Key, typename T, typename Pred, typename Alloc>
- void <a name="boost.container.swap_id298242"></a>swap(flat_map< Key, T, Pred, Alloc > & x,
- flat_map< Key, T, Pred, Alloc > & y);
- template<typename Key, typename T, typename Pred, typename Alloc>
- bool <a name="boost.container.operator==_id298278"></a>operator==(const flat_multimap< Key, T, Pred, Alloc > & x,
- const flat_multimap< Key, T, Pred, Alloc > & y);
- template<typename Key, typename T, typename Pred, typename Alloc>
- bool <a name="boost.container.operator_id298316"></a>operator<(const flat_multimap< Key, T, Pred, Alloc > & x,
- const flat_multimap< Key, T, Pred, Alloc > & y);
- template<typename Key, typename T, typename Pred, typename Alloc>
- bool <a name="boost.container.operator!=_id298354"></a>operator!=(const flat_multimap< Key, T, Pred, Alloc > & x,
- const flat_multimap< Key, T, Pred, Alloc > & y);
- template<typename Key, typename T, typename Pred, typename Alloc>
- bool <a name="boost.container.operator_id298393"></a>operator>(const flat_multimap< Key, T, Pred, Alloc > & x,
- const flat_multimap< Key, T, Pred, Alloc > & y);
- template<typename Key, typename T, typename Pred, typename Alloc>
- bool <a name="boost.container.operator_=_id298431"></a>operator<=(const flat_multimap< Key, T, Pred, Alloc > & x,
- const flat_multimap< Key, T, Pred, Alloc > & y);
- template<typename Key, typename T, typename Pred, typename Alloc>
- bool <a name="boost.container.operator_=_id298470"></a>operator>=(const flat_multimap< Key, T, Pred, Alloc > & x,
- const flat_multimap< Key, T, Pred, Alloc > & y);
- template<typename Key, typename T, typename Pred, typename Alloc>
- void <a name="boost.container.swap_id298508"></a>swap(flat_multimap< Key, T, Pred, Alloc > & x,
- flat_multimap< Key, T, Pred, Alloc > & y);
- }
-}</pre>
+<pre class="synopsis">namespace boost {
+ namespace container {
+ template<typename Key, typename T, typename Pred, typename Alloc>
+ class flat_map;
+ template<typename Key, typename T, typename Pred, typename Alloc>
+ class flat_multimap;
+ template<typename Key, typename T, typename Pred, typename Alloc>
+ bool <a name="boost.container.operator==_id379596"></a>operator==(const flat_map< Key, T, Pred, Alloc > & x,
+ const flat_map< Key, T, Pred, Alloc > & y);
+ template<typename Key, typename T, typename Pred, typename Alloc>
+ bool <a name="boost.container.operator_id379634"></a>operator<(const flat_map< Key, T, Pred, Alloc > & x,
+ const flat_map< Key, T, Pred, Alloc > & y);
+ template<typename Key, typename T, typename Pred, typename Alloc>
+ bool <a name="boost.container.operator!=_id379672"></a>operator!=(const flat_map< Key, T, Pred, Alloc > & x,
+ const flat_map< Key, T, Pred, Alloc > & y);
+ template<typename Key, typename T, typename Pred, typename Alloc>
+ bool <a name="boost.container.operator_id379711"></a>operator>(const flat_map< Key, T, Pred, Alloc > & x,
+ const flat_map< Key, T, Pred, Alloc > & y);
+ template<typename Key, typename T, typename Pred, typename Alloc>
+ bool <a name="boost.container.operator_=_id379749"></a>operator<=(const flat_map< Key, T, Pred, Alloc > & x,
+ const flat_map< Key, T, Pred, Alloc > & y);
+ template<typename Key, typename T, typename Pred, typename Alloc>
+ bool <a name="boost.container.operator_=_id379788"></a>operator>=(const flat_map< Key, T, Pred, Alloc > & x,
+ const flat_map< Key, T, Pred, Alloc > & y);
+ template<typename Key, typename T, typename Pred, typename Alloc>
+ void <a name="boost.container.swap_id379826"></a>swap(flat_map< Key, T, Pred, Alloc > & x,
+ flat_map< Key, T, Pred, Alloc > & y);
+ template<typename Key, typename T, typename Pred, typename Alloc>
+ bool <a name="boost.container.operator==_id379862"></a>operator==(const flat_multimap< Key, T, Pred, Alloc > & x,
+ const flat_multimap< Key, T, Pred, Alloc > & y);
+ template<typename Key, typename T, typename Pred, typename Alloc>
+ bool <a name="boost.container.operator_id379900"></a>operator<(const flat_multimap< Key, T, Pred, Alloc > & x,
+ const flat_multimap< Key, T, Pred, Alloc > & y);
+ template<typename Key, typename T, typename Pred, typename Alloc>
+ bool <a name="boost.container.operator!=_id379939"></a>operator!=(const flat_multimap< Key, T, Pred, Alloc > & x,
+ const flat_multimap< Key, T, Pred, Alloc > & y);
+ template<typename Key, typename T, typename Pred, typename Alloc>
+ bool <a name="boost.container.operator_id379977"></a>operator>(const flat_multimap< Key, T, Pred, Alloc > & x,
+ const flat_multimap< Key, T, Pred, Alloc > & y);
+ template<typename Key, typename T, typename Pred, typename Alloc>
+ bool <a name="boost.container.operator_=_id380016"></a>operator<=(const flat_multimap< Key, T, Pred, Alloc > & x,
+ const flat_multimap< Key, T, Pred, Alloc > & y);
+ template<typename Key, typename T, typename Pred, typename Alloc>
+ bool <a name="boost.container.operator_=_id380054"></a>operator>=(const flat_multimap< Key, T, Pred, Alloc > & x,
+ const flat_multimap< Key, T, Pred, Alloc > & y);
+ template<typename Key, typename T, typename Pred, typename Alloc>
+ void <a name="boost.container.swap_id380092"></a>swap(flat_multimap< Key, T, Pred, Alloc > & x,
+ flat_multimap< Key, T, Pred, Alloc > & y);
+ }
+}</pre>
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
<a name="header.boost.container.flat_set_hpp"></a>Header <boost/container/flat_set.hpp></h3></div></div></div>
-<pre class="synopsis">namespace boost {
- namespace container {
- template<typename T, typename Pred, typename Alloc> class flat_set;
- template<typename T, typename Pred, typename Alloc> class flat_multiset;
- template<typename T, typename Pred, typename Alloc>
- bool <a name="boost.container.operator==_id303659"></a>operator==(const flat_set< T, Pred, Alloc > & x,
- const flat_set< T, Pred, Alloc > & y);
- template<typename T, typename Pred, typename Alloc>
- bool <a name="boost.container.operator_id303694"></a>operator<(const flat_set< T, Pred, Alloc > & x,
- const flat_set< T, Pred, Alloc > & y);
- template<typename T, typename Pred, typename Alloc>
- bool <a name="boost.container.operator!=_id303729"></a>operator!=(const flat_set< T, Pred, Alloc > & x,
- const flat_set< T, Pred, Alloc > & y);
- template<typename T, typename Pred, typename Alloc>
- bool <a name="boost.container.operator_id303764"></a>operator>(const flat_set< T, Pred, Alloc > & x,
- const flat_set< T, Pred, Alloc > & y);
- template<typename T, typename Pred, typename Alloc>
- bool <a name="boost.container.operator_=_id303798"></a>operator<=(const flat_set< T, Pred, Alloc > & x,
- const flat_set< T, Pred, Alloc > & y);
- template<typename T, typename Pred, typename Alloc>
- bool <a name="boost.container.operator_=_id303833"></a>operator>=(const flat_set< T, Pred, Alloc > & x,
- const flat_set< T, Pred, Alloc > & y);
- template<typename T, typename Pred, typename Alloc>
- void <a name="boost.container.swap_id303868"></a>swap(flat_set< T, Pred, Alloc > & x,
- flat_set< T, Pred, Alloc > & y);
- template<typename T, typename Pred, typename Alloc>
- bool <a name="boost.container.operator==_id303900"></a>operator==(const flat_multiset< T, Pred, Alloc > & x,
- const flat_multiset< T, Pred, Alloc > & y);
- template<typename T, typename Pred, typename Alloc>
- bool <a name="boost.container.operator_id303935"></a>operator<(const flat_multiset< T, Pred, Alloc > & x,
- const flat_multiset< T, Pred, Alloc > & y);
- template<typename T, typename Pred, typename Alloc>
- bool <a name="boost.container.operator!=_id303970"></a>operator!=(const flat_multiset< T, Pred, Alloc > & x,
- const flat_multiset< T, Pred, Alloc > & y);
- template<typename T, typename Pred, typename Alloc>
- bool <a name="boost.container.operator_id304005"></a>operator>(const flat_multiset< T, Pred, Alloc > & x,
- const flat_multiset< T, Pred, Alloc > & y);
- template<typename T, typename Pred, typename Alloc>
- bool <a name="boost.container.operator_=_id304040"></a>operator<=(const flat_multiset< T, Pred, Alloc > & x,
- const flat_multiset< T, Pred, Alloc > & y);
- template<typename T, typename Pred, typename Alloc>
- bool <a name="boost.container.operator_=_id304074"></a>operator>=(const flat_multiset< T, Pred, Alloc > & x,
- const flat_multiset< T, Pred, Alloc > & y);
- template<typename T, typename Pred, typename Alloc>
- void <a name="boost.container.swap_id304109"></a>swap(flat_multiset< T, Pred, Alloc > & x,
- flat_multiset< T, Pred, Alloc > & y);
- }
-}</pre>
+<pre class="synopsis">namespace boost {
+ namespace container {
+ template<typename T, typename Pred, typename Alloc> class flat_set;
+ template<typename T, typename Pred, typename Alloc> class flat_multiset;
+ template<typename T, typename Pred, typename Alloc>
+ bool <a name="boost.container.operator==_id383132"></a>operator==(const flat_set< T, Pred, Alloc > & x,
+ const flat_set< T, Pred, Alloc > & y);
+ template<typename T, typename Pred, typename Alloc>
+ bool <a name="boost.container.operator_id383166"></a>operator<(const flat_set< T, Pred, Alloc > & x,
+ const flat_set< T, Pred, Alloc > & y);
+ template<typename T, typename Pred, typename Alloc>
+ bool <a name="boost.container.operator!=_id383201"></a>operator!=(const flat_set< T, Pred, Alloc > & x,
+ const flat_set< T, Pred, Alloc > & y);
+ template<typename T, typename Pred, typename Alloc>
+ bool <a name="boost.container.operator_id383236"></a>operator>(const flat_set< T, Pred, Alloc > & x,
+ const flat_set< T, Pred, Alloc > & y);
+ template<typename T, typename Pred, typename Alloc>
+ bool <a name="boost.container.operator_=_id383271"></a>operator<=(const flat_set< T, Pred, Alloc > & x,
+ const flat_set< T, Pred, Alloc > & y);
+ template<typename T, typename Pred, typename Alloc>
+ bool <a name="boost.container.operator_=_id383306"></a>operator>=(const flat_set< T, Pred, Alloc > & x,
+ const flat_set< T, Pred, Alloc > & y);
+ template<typename T, typename Pred, typename Alloc>
+ void <a name="boost.container.swap_id383340"></a>swap(flat_set< T, Pred, Alloc > & x,
+ flat_set< T, Pred, Alloc > & y);
+ template<typename T, typename Pred, typename Alloc>
+ bool <a name="boost.container.operator==_id383373"></a>operator==(const flat_multiset< T, Pred, Alloc > & x,
+ const flat_multiset< T, Pred, Alloc > & y);
+ template<typename T, typename Pred, typename Alloc>
+ bool <a name="boost.container.operator_id383408"></a>operator<(const flat_multiset< T, Pred, Alloc > & x,
+ const flat_multiset< T, Pred, Alloc > & y);
+ template<typename T, typename Pred, typename Alloc>
+ bool <a name="boost.container.operator!=_id383442"></a>operator!=(const flat_multiset< T, Pred, Alloc > & x,
+ const flat_multiset< T, Pred, Alloc > & y);
+ template<typename T, typename Pred, typename Alloc>
+ bool <a name="boost.container.operator_id383477"></a>operator>(const flat_multiset< T, Pred, Alloc > & x,
+ const flat_multiset< T, Pred, Alloc > & y);
+ template<typename T, typename Pred, typename Alloc>
+ bool <a name="boost.container.operator_=_id383512"></a>operator<=(const flat_multiset< T, Pred, Alloc > & x,
+ const flat_multiset< T, Pred, Alloc > & y);
+ template<typename T, typename Pred, typename Alloc>
+ bool <a name="boost.container.operator_=_id383547"></a>operator>=(const flat_multiset< T, Pred, Alloc > & x,
+ const flat_multiset< T, Pred, Alloc > & y);
+ template<typename T, typename Pred, typename Alloc>
+ void <a name="boost.container.swap_id383582"></a>swap(flat_multiset< T, Pred, Alloc > & x,
+ flat_multiset< T, Pred, Alloc > & y);
+ }
+}</pre>
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
<a name="header.boost.container.list_hpp"></a>Header <boost/container/list.hpp></h3></div></div></div>
-<pre class="synopsis">namespace boost {
- namespace container {
- template<typename T, typename A> class list;
- template<typename T, typename A>
- bool <a name="boost.container.operator==_id307987"></a>operator==(const list< T, A > & x, const list< T, A > & y);
- template<typename T, typename A>
- bool <a name="boost.container.operator_id308018"></a>operator<(const list< T, A > & x, const list< T, A > & y);
- template<typename T, typename A>
- bool <a name="boost.container.operator!=_id308049"></a>operator!=(const list< T, A > & x, const list< T, A > & y);
- template<typename T, typename A>
- bool <a name="boost.container.operator_id308080"></a>operator>(const list< T, A > & x, const list< T, A > & y);
- template<typename T, typename A>
- bool <a name="boost.container.operator_=_id308112"></a>operator<=(const list< T, A > & x, const list< T, A > & y);
- template<typename T, typename A>
- bool <a name="boost.container.operator_=_id308143"></a>operator>=(const list< T, A > & x, const list< T, A > & y);
- template<typename T, typename A>
- void <a name="boost.container.swap_id308174"></a>swap(list< T, A > & x, list< T, A > & y);
- }
-}</pre>
+<pre class="synopsis">namespace boost {
+ namespace container {
+ template<typename T, typename A> class list;
+ template<typename T, typename A>
+ bool <a name="boost.container.operator==_id387099"></a>operator==(const list< T, A > & x, const list< T, A > & y);
+ template<typename T, typename A>
+ bool <a name="boost.container.operator_id387130"></a>operator<(const list< T, A > & x, const list< T, A > & y);
+ template<typename T, typename A>
+ bool <a name="boost.container.operator!=_id387161"></a>operator!=(const list< T, A > & x, const list< T, A > & y);
+ template<typename T, typename A>
+ bool <a name="boost.container.operator_id387192"></a>operator>(const list< T, A > & x, const list< T, A > & y);
+ template<typename T, typename A>
+ bool <a name="boost.container.operator_=_id387224"></a>operator<=(const list< T, A > & x, const list< T, A > & y);
+ template<typename T, typename A>
+ bool <a name="boost.container.operator_=_id387255"></a>operator>=(const list< T, A > & x, const list< T, A > & y);
+ template<typename T, typename A>
+ void <a name="boost.container.swap_id387286"></a>swap(list< T, A > & x, list< T, A > & y);
+ }
+}</pre>
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
<a name="header.boost.container.map_hpp"></a>Header <boost/container/map.hpp></h3></div></div></div>
-<pre class="synopsis">namespace boost {
- namespace container {
- template<typename Key, typename T, typename Pred, typename Alloc> class map;
- template<typename Key, typename T, typename Pred, typename Alloc>
- class multimap;
- template<typename Key, typename T, typename Pred, typename Alloc>
- bool <a name="boost.container.operator==_id311436"></a>operator==(const map< Key, T, Pred, Alloc > & x,
- const map< Key, T, Pred, Alloc > & y);
- template<typename Key, typename T, typename Pred, typename Alloc>
- bool <a name="boost.container.operator_id311474"></a>operator<(const map< Key, T, Pred, Alloc > & x,
- const map< Key, T, Pred, Alloc > & y);
- template<typename Key, typename T, typename Pred, typename Alloc>
- bool <a name="boost.container.operator!=_id311513"></a>operator!=(const map< Key, T, Pred, Alloc > & x,
- const map< Key, T, Pred, Alloc > & y);
- template<typename Key, typename T, typename Pred, typename Alloc>
- bool <a name="boost.container.operator_id311551"></a>operator>(const map< Key, T, Pred, Alloc > & x,
- const map< Key, T, Pred, Alloc > & y);
- template<typename Key, typename T, typename Pred, typename Alloc>
- bool <a name="boost.container.operator_=_id311589"></a>operator<=(const map< Key, T, Pred, Alloc > & x,
- const map< Key, T, Pred, Alloc > & y);
- template<typename Key, typename T, typename Pred, typename Alloc>
- bool <a name="boost.container.operator_=_id311628"></a>operator>=(const map< Key, T, Pred, Alloc > & x,
- const map< Key, T, Pred, Alloc > & y);
- template<typename Key, typename T, typename Pred, typename Alloc>
- void <a name="boost.container.swap_id311666"></a>swap(map< Key, T, Pred, Alloc > & x,
- map< Key, T, Pred, Alloc > & y);
- template<typename Key, typename T, typename Pred, typename Alloc>
- bool <a name="boost.container.operator==_id311702"></a>operator==(const multimap< Key, T, Pred, Alloc > & x,
- const multimap< Key, T, Pred, Alloc > & y);
- template<typename Key, typename T, typename Pred, typename Alloc>
- bool <a name="boost.container.operator_id311741"></a>operator<(const multimap< Key, T, Pred, Alloc > & x,
- const multimap< Key, T, Pred, Alloc > & y);
- template<typename Key, typename T, typename Pred, typename Alloc>
- bool <a name="boost.container.operator!=_id311779"></a>operator!=(const multimap< Key, T, Pred, Alloc > & x,
- const multimap< Key, T, Pred, Alloc > & y);
- template<typename Key, typename T, typename Pred, typename Alloc>
- bool <a name="boost.container.operator_id311817"></a>operator>(const multimap< Key, T, Pred, Alloc > & x,
- const multimap< Key, T, Pred, Alloc > & y);
- template<typename Key, typename T, typename Pred, typename Alloc>
- bool <a name="boost.container.operator_=_id311856"></a>operator<=(const multimap< Key, T, Pred, Alloc > & x,
- const multimap< Key, T, Pred, Alloc > & y);
- template<typename Key, typename T, typename Pred, typename Alloc>
- bool <a name="boost.container.operator_=_id311894"></a>operator>=(const multimap< Key, T, Pred, Alloc > & x,
- const multimap< Key, T, Pred, Alloc > & y);
- template<typename Key, typename T, typename Pred, typename Alloc>
- void <a name="boost.container.swap_id312484"></a>swap(multimap< Key, T, Pred, Alloc > & x,
- multimap< Key, T, Pred, Alloc > & y);
- }
-}</pre>
+<pre class="synopsis">namespace boost {
+ namespace container {
+ template<typename Key, typename T, typename Pred, typename Alloc> class map;
+ template<typename Key, typename T, typename Pred, typename Alloc>
+ class multimap;
+ template<typename Key, typename T, typename Pred, typename Alloc>
+ bool <a name="boost.container.operator==_id391668"></a>operator==(const map< Key, T, Pred, Alloc > & x,
+ const map< Key, T, Pred, Alloc > & y);
+ template<typename Key, typename T, typename Pred, typename Alloc>
+ bool <a name="boost.container.operator_id391706"></a>operator<(const map< Key, T, Pred, Alloc > & x,
+ const map< Key, T, Pred, Alloc > & y);
+ template<typename Key, typename T, typename Pred, typename Alloc>
+ bool <a name="boost.container.operator!=_id391745"></a>operator!=(const map< Key, T, Pred, Alloc > & x,
+ const map< Key, T, Pred, Alloc > & y);
+ template<typename Key, typename T, typename Pred, typename Alloc>
+ bool <a name="boost.container.operator_id391783"></a>operator>(const map< Key, T, Pred, Alloc > & x,
+ const map< Key, T, Pred, Alloc > & y);
+ template<typename Key, typename T, typename Pred, typename Alloc>
+ bool <a name="boost.container.operator_=_id391822"></a>operator<=(const map< Key, T, Pred, Alloc > & x,
+ const map< Key, T, Pred, Alloc > & y);
+ template<typename Key, typename T, typename Pred, typename Alloc>
+ bool <a name="boost.container.operator_=_id391860"></a>operator>=(const map< Key, T, Pred, Alloc > & x,
+ const map< Key, T, Pred, Alloc > & y);
+ template<typename Key, typename T, typename Pred, typename Alloc>
+ void <a name="boost.container.swap_id391898"></a>swap(map< Key, T, Pred, Alloc > & x,
+ map< Key, T, Pred, Alloc > & y);
+ template<typename Key, typename T, typename Pred, typename Alloc>
+ bool <a name="boost.container.operator==_id391934"></a>operator==(const multimap< Key, T, Pred, Alloc > & x,
+ const multimap< Key, T, Pred, Alloc > & y);
+ template<typename Key, typename T, typename Pred, typename Alloc>
+ bool <a name="boost.container.operator_id391973"></a>operator<(const multimap< Key, T, Pred, Alloc > & x,
+ const multimap< Key, T, Pred, Alloc > & y);
+ template<typename Key, typename T, typename Pred, typename Alloc>
+ bool <a name="boost.container.operator!=_id392011"></a>operator!=(const multimap< Key, T, Pred, Alloc > & x,
+ const multimap< Key, T, Pred, Alloc > & y);
+ template<typename Key, typename T, typename Pred, typename Alloc>
+ bool <a name="boost.container.operator_id392050"></a>operator>(const multimap< Key, T, Pred, Alloc > & x,
+ const multimap< Key, T, Pred, Alloc > & y);
+ template<typename Key, typename T, typename Pred, typename Alloc>
+ bool <a name="boost.container.operator_=_id392088"></a>operator<=(const multimap< Key, T, Pred, Alloc > & x,
+ const multimap< Key, T, Pred, Alloc > & y);
+ template<typename Key, typename T, typename Pred, typename Alloc>
+ bool <a name="boost.container.operator_=_id392126"></a>operator>=(const multimap< Key, T, Pred, Alloc > & x,
+ const multimap< Key, T, Pred, Alloc > & y);
+ template<typename Key, typename T, typename Pred, typename Alloc>
+ void <a name="boost.container.swap_id392165"></a>swap(multimap< Key, T, Pred, Alloc > & x,
+ multimap< Key, T, Pred, Alloc > & y);
+ }
+}</pre>
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
<a name="header.boost.container.set_hpp"></a>Header <boost/container/set.hpp></h3></div></div></div>
-<pre class="synopsis">namespace boost {
- namespace container {
- template<typename T, typename Pred, typename Alloc> class set;
- template<typename T, typename Pred, typename Alloc> class multiset;
- template<typename T, typename Pred, typename Alloc>
- bool <a name="boost.container.operator==_id316877"></a>operator==(const set< T, Pred, Alloc > & x,
- const set< T, Pred, Alloc > & y);
- template<typename T, typename Pred, typename Alloc>
- bool <a name="boost.container.operator_id316912"></a>operator<(const set< T, Pred, Alloc > & x,
- const set< T, Pred, Alloc > & y);
- template<typename T, typename Pred, typename Alloc>
- bool <a name="boost.container.operator!=_id316947"></a>operator!=(const set< T, Pred, Alloc > & x,
- const set< T, Pred, Alloc > & y);
- template<typename T, typename Pred, typename Alloc>
- bool <a name="boost.container.operator_id316981"></a>operator>(const set< T, Pred, Alloc > & x,
- const set< T, Pred, Alloc > & y);
- template<typename T, typename Pred, typename Alloc>
- bool <a name="boost.container.operator_=_id317016"></a>operator<=(const set< T, Pred, Alloc > & x,
- const set< T, Pred, Alloc > & y);
- template<typename T, typename Pred, typename Alloc>
- bool <a name="boost.container.operator_=_id317051"></a>operator>=(const set< T, Pred, Alloc > & x,
- const set< T, Pred, Alloc > & y);
- template<typename T, typename Pred, typename Alloc>
- void <a name="boost.container.swap_id317086"></a>swap(set< T, Pred, Alloc > & x, set< T, Pred, Alloc > & y);
- template<typename T, typename Pred, typename Alloc>
- bool <a name="boost.container.operator==_id317118"></a>operator==(const multiset< T, Pred, Alloc > & x,
- const multiset< T, Pred, Alloc > & y);
- template<typename T, typename Pred, typename Alloc>
- bool <a name="boost.container.operator_id317153"></a>operator<(const multiset< T, Pred, Alloc > & x,
- const multiset< T, Pred, Alloc > & y);
- template<typename T, typename Pred, typename Alloc>
- bool <a name="boost.container.operator!=_id317188"></a>operator!=(const multiset< T, Pred, Alloc > & x,
- const multiset< T, Pred, Alloc > & y);
- template<typename T, typename Pred, typename Alloc>
- bool <a name="boost.container.operator_id317223"></a>operator>(const multiset< T, Pred, Alloc > & x,
- const multiset< T, Pred, Alloc > & y);
- template<typename T, typename Pred, typename Alloc>
- bool <a name="boost.container.operator_=_id317257"></a>operator<=(const multiset< T, Pred, Alloc > & x,
- const multiset< T, Pred, Alloc > & y);
- template<typename T, typename Pred, typename Alloc>
- bool <a name="boost.container.operator_=_id317292"></a>operator>=(const multiset< T, Pred, Alloc > & x,
- const multiset< T, Pred, Alloc > & y);
- template<typename T, typename Pred, typename Alloc>
- void <a name="boost.container.swap_id317327"></a>swap(multiset< T, Pred, Alloc > & x,
- multiset< T, Pred, Alloc > & y);
- }
-}</pre>
+<pre class="synopsis">namespace boost {
+ namespace container {
+ template<typename T, typename Pred, typename Alloc> class set;
+ template<typename T, typename Pred, typename Alloc> class multiset;
+ template<typename T, typename Pred, typename Alloc>
+ bool <a name="boost.container.operator==_id396148"></a>operator==(const set< T, Pred, Alloc > & x,
+ const set< T, Pred, Alloc > & y);
+ template<typename T, typename Pred, typename Alloc>
+ bool <a name="boost.container.operator_id396183"></a>operator<(const set< T, Pred, Alloc > & x,
+ const set< T, Pred, Alloc > & y);
+ template<typename T, typename Pred, typename Alloc>
+ bool <a name="boost.container.operator!=_id396218"></a>operator!=(const set< T, Pred, Alloc > & x,
+ const set< T, Pred, Alloc > & y);
+ template<typename T, typename Pred, typename Alloc>
+ bool <a name="boost.container.operator_id396253"></a>operator>(const set< T, Pred, Alloc > & x,
+ const set< T, Pred, Alloc > & y);
+ template<typename T, typename Pred, typename Alloc>
+ bool <a name="boost.container.operator_=_id396288"></a>operator<=(const set< T, Pred, Alloc > & x,
+ const set< T, Pred, Alloc > & y);
+ template<typename T, typename Pred, typename Alloc>
+ bool <a name="boost.container.operator_=_id396322"></a>operator>=(const set< T, Pred, Alloc > & x,
+ const set< T, Pred, Alloc > & y);
+ template<typename T, typename Pred, typename Alloc>
+ void <a name="boost.container.swap_id396357"></a>swap(set< T, Pred, Alloc > & x, set< T, Pred, Alloc > & y);
+ template<typename T, typename Pred, typename Alloc>
+ bool <a name="boost.container.operator==_id396390"></a>operator==(const multiset< T, Pred, Alloc > & x,
+ const multiset< T, Pred, Alloc > & y);
+ template<typename T, typename Pred, typename Alloc>
+ bool <a name="boost.container.operator_id396425"></a>operator<(const multiset< T, Pred, Alloc > & x,
+ const multiset< T, Pred, Alloc > & y);
+ template<typename T, typename Pred, typename Alloc>
+ bool <a name="boost.container.operator!=_id396460"></a>operator!=(const multiset< T, Pred, Alloc > & x,
+ const multiset< T, Pred, Alloc > & y);
+ template<typename T, typename Pred, typename Alloc>
+ bool <a name="boost.container.operator_id396494"></a>operator>(const multiset< T, Pred, Alloc > & x,
+ const multiset< T, Pred, Alloc > & y);
+ template<typename T, typename Pred, typename Alloc>
+ bool <a name="boost.container.operator_=_id396529"></a>operator<=(const multiset< T, Pred, Alloc > & x,
+ const multiset< T, Pred, Alloc > & y);
+ template<typename T, typename Pred, typename Alloc>
+ bool <a name="boost.container.operator_=_id396564"></a>operator>=(const multiset< T, Pred, Alloc > & x,
+ const multiset< T, Pred, Alloc > & y);
+ template<typename T, typename Pred, typename Alloc>
+ void <a name="boost.container.swap_id396599"></a>swap(multiset< T, Pred, Alloc > & x,
+ multiset< T, Pred, Alloc > & y);
+ }
+}</pre>
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
<a name="header.boost.container.slist_hpp"></a>Header <boost/container/slist.hpp></h3></div></div></div>
-<pre class="synopsis">namespace boost {
- namespace container {
- template<typename T, typename A> class slist;
- template<typename T, typename A>
- bool <a name="boost.container.operator==_id319950"></a>operator==(const slist< T, A > & x, const slist< T, A > & y);
- template<typename T, typename A>
- bool <a name="boost.container.operator_id319982"></a>operator<(const slist< T, A > & sL1, const slist< T, A > & sL2);
- template<typename T, typename A>
- bool <a name="boost.container.operator!=_id320013"></a>operator!=(const slist< T, A > & sL1, const slist< T, A > & sL2);
- template<typename T, typename A>
- bool <a name="boost.container.operator_id320044"></a>operator>(const slist< T, A > & sL1, const slist< T, A > & sL2);
- template<typename T, typename A>
- bool <a name="boost.container.operator_=_id320075"></a>operator<=(const slist< T, A > & sL1, const slist< T, A > & sL2);
- template<typename T, typename A>
- bool <a name="boost.container.operator_=_id320106"></a>operator>=(const slist< T, A > & sL1, const slist< T, A > & sL2);
- template<typename T, typename A>
- void <a name="boost.container.swap_id320138"></a>swap(slist< T, A > & x, slist< T, A > & y);
- }
-}</pre>
+<pre class="synopsis">namespace boost {
+ namespace container {
+ template<typename T, typename A> class slist;
+ template<typename T, typename A>
+ bool <a name="boost.container.operator==_id400103"></a>operator==(const slist< T, A > & x, const slist< T, A > & y);
+ template<typename T, typename A>
+ bool <a name="boost.container.operator_id400135"></a>operator<(const slist< T, A > & sL1, const slist< T, A > & sL2);
+ template<typename T, typename A>
+ bool <a name="boost.container.operator!=_id400166"></a>operator!=(const slist< T, A > & sL1, const slist< T, A > & sL2);
+ template<typename T, typename A>
+ bool <a name="boost.container.operator_id400197"></a>operator>(const slist< T, A > & sL1, const slist< T, A > & sL2);
+ template<typename T, typename A>
+ bool <a name="boost.container.operator_=_id400228"></a>operator<=(const slist< T, A > & sL1, const slist< T, A > & sL2);
+ template<typename T, typename A>
+ bool <a name="boost.container.operator_=_id400259"></a>operator>=(const slist< T, A > & sL1, const slist< T, A > & sL2);
+ template<typename T, typename A>
+ void <a name="boost.container.swap_id400291"></a>swap(slist< T, A > & x, slist< T, A > & y);
+ }
+}</pre>
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
<a name="header.boost.container.stable_vector_hpp"></a>Header <boost/container/stable_vector.hpp></h3></div></div></div>
-<pre class="synopsis">namespace boost {
- namespace container {
- template<typename T, typename Allocator> class stable_vector;
- template<typename T, typename Allocator>
- bool <a name="boost.container.operator==_id321351"></a>operator==(const stable_vector< T, Allocator > & x,
- const stable_vector< T, Allocator > & y);
- template<typename T, typename Allocator>
- bool <a name="boost.container.operator_id321382"></a>operator<(const stable_vector< T, Allocator > & x,
- const stable_vector< T, Allocator > & y);
- template<typename T, typename Allocator>
- bool <a name="boost.container.operator!=_id321413"></a>operator!=(const stable_vector< T, Allocator > & x,
- const stable_vector< T, Allocator > & y);
- template<typename T, typename Allocator>
- bool <a name="boost.container.operator_id321444"></a>operator>(const stable_vector< T, Allocator > & x,
- const stable_vector< T, Allocator > & y);
- template<typename T, typename Allocator>
- bool <a name="boost.container.operator_=_id321476"></a>operator>=(const stable_vector< T, Allocator > & x,
- const stable_vector< T, Allocator > & y);
- template<typename T, typename Allocator>
- bool <a name="boost.container.operator_=_id321507"></a>operator<=(const stable_vector< T, Allocator > & x,
- const stable_vector< T, Allocator > & y);
- template<typename T, typename Allocator>
- void <a name="boost.container.swap_id321538"></a>swap(stable_vector< T, Allocator > & x,
- stable_vector< T, Allocator > & y);
- }
-}</pre>
+<pre class="synopsis">namespace boost {
+ namespace container {
+ template<typename T, typename Allocator> class stable_vector;
+ template<typename T, typename Allocator>
+ bool <a name="boost.container.operator==_id403184"></a>operator==(const stable_vector< T, Allocator > & x,
+ const stable_vector< T, Allocator > & y);
+ template<typename T, typename Allocator>
+ bool <a name="boost.container.operator_id403215"></a>operator<(const stable_vector< T, Allocator > & x,
+ const stable_vector< T, Allocator > & y);
+ template<typename T, typename Allocator>
+ bool <a name="boost.container.operator!=_id403247"></a>operator!=(const stable_vector< T, Allocator > & x,
+ const stable_vector< T, Allocator > & y);
+ template<typename T, typename Allocator>
+ bool <a name="boost.container.operator_id403278"></a>operator>(const stable_vector< T, Allocator > & x,
+ const stable_vector< T, Allocator > & y);
+ template<typename T, typename Allocator>
+ bool <a name="boost.container.operator_=_id403309"></a>operator>=(const stable_vector< T, Allocator > & x,
+ const stable_vector< T, Allocator > & y);
+ template<typename T, typename Allocator>
+ bool <a name="boost.container.operator_=_id403340"></a>operator<=(const stable_vector< T, Allocator > & x,
+ const stable_vector< T, Allocator > & y);
+ template<typename T, typename Allocator>
+ void <a name="boost.container.swap_id403371"></a>swap(stable_vector< T, Allocator > & x,
+ stable_vector< T, Allocator > & y);
+ }
+}</pre>
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
<a name="header.boost.container.string_hpp"></a>Header <boost/container/string.hpp></h3></div></div></div>
-<pre class="synopsis">namespace boost {
- namespace container {
- template<typename CharT, typename Traits, typename A> class basic_string;
- typedef basic_string< char,std::char_traits< char >,std::allocator< char > > string;
- typedef basic_string< wchar_t,std::char_traits< wchar_t >,std::allocator< wchar_t > > wstring;
- template<typename CharT, typename Traits, typename A>
- basic_string< CharT, Traits, A >
- <a name="boost.container.operator+_id326390"></a>operator+(const basic_string< CharT, Traits, A > & x,
- const basic_string< CharT, Traits, A > & y);
- template<typename CharT, typename Traits, typename A>
- basic_string< CharT, Traits, A > basic_string< CharT, Traits, A > &&
- <a name="boost.container.operator+_id326428"></a>operator+(basic_string< CharT, Traits, A > basic_string< CharT, Traits, A > && mx,
- const basic_string< CharT, Traits, A > & y);
- template<typename CharT, typename Traits, typename A>
- basic_string< CharT, Traits, A > basic_string< CharT, Traits, A > &&
- <a name="boost.container.operator+_id326471"></a>operator+(const basic_string< CharT, Traits, A > & x,
- basic_string< CharT, Traits, A > basic_string< CharT, Traits, A > && my);
- template<typename CharT, typename Traits, typename A>
- basic_string< CharT, Traits, A >
- <a name="boost.container.operator+_id326514"></a>operator+(const CharT * s, const basic_string< CharT, Traits, A > & y);
- template<typename CharT, typename Traits, typename A>
- basic_string< CharT, Traits, A > basic_string< CharT, Traits, A > &&
- <a name="boost.container.operator+_id326548"></a>operator+(const CharT * s,
- basic_string< CharT, Traits, A > basic_string< CharT, Traits, A > && my);
- template<typename CharT, typename Traits, typename A>
- basic_string< CharT, Traits, A >
- <a name="boost.container.operator+_id326587"></a>operator+(CharT c, const basic_string< CharT, Traits, A > & y);
- template<typename CharT, typename Traits, typename A>
- basic_string< CharT, Traits, A > basic_string< CharT, Traits, A > &&
- <a name="boost.container.operator+_id326621"></a>operator+(CharT c,
- basic_string< CharT, Traits, A > basic_string< CharT, Traits, A > && my);
- template<typename CharT, typename Traits, typename A>
- basic_string< CharT, Traits, A >
- <a name="boost.container.operator+_id326660"></a>operator+(const basic_string< CharT, Traits, A > & x, const CharT * s);
- template<typename CharT, typename Traits, typename A>
- basic_string< CharT, Traits, A > basic_string< CharT, Traits, A > &&
- <a name="boost.container.operator+_id326694"></a>operator+(basic_string< CharT, Traits, A > basic_string< CharT, Traits, A > && mx,
- const CharT * s);
- template<typename CharT, typename Traits, typename A>
- basic_string< CharT, Traits, A >
- <a name="boost.container.operator+_id326734"></a>operator+(const basic_string< CharT, Traits, A > & x, const CharT c);
- template<typename CharT, typename Traits, typename A>
- basic_string< CharT, Traits, A > basic_string< CharT, Traits, A > &&
- <a name="boost.container.operator+_id326767"></a>operator+(basic_string< CharT, Traits, A > basic_string< CharT, Traits, A > && mx,
- const CharT c);
- template<typename CharT, typename Traits, typename A>
- bool <a name="boost.container.operator==_id326807"></a>operator==(const basic_string< CharT, Traits, A > & x,
- const basic_string< CharT, Traits, A > & y);
- template<typename CharT, typename Traits, typename A>
- bool <a name="boost.container.operator==_id326842"></a>operator==(const CharT * s,
- const basic_string< CharT, Traits, A > & y);
- template<typename CharT, typename Traits, typename A>
- bool <a name="boost.container.operator==_id326873"></a>operator==(const basic_string< CharT, Traits, A > & x,
- const CharT * s);
- template<typename CharT, typename Traits, typename A>
- bool <a name="boost.container.operator!=_id326904"></a>operator!=(const basic_string< CharT, Traits, A > & x,
- const basic_string< CharT, Traits, A > & y);
- template<typename CharT, typename Traits, typename A>
- bool <a name="boost.container.operator!=_id326939"></a>operator!=(const CharT * s,
- const basic_string< CharT, Traits, A > & y);
- template<typename CharT, typename Traits, typename A>
- bool <a name="boost.container.operator!=_id326970"></a>operator!=(const basic_string< CharT, Traits, A > & x,
- const CharT * s);
- template<typename CharT, typename Traits, typename A>
- bool <a name="boost.container.operator_id327001"></a>operator<(const basic_string< CharT, Traits, A > & x,
- const basic_string< CharT, Traits, A > & y);
- template<typename CharT, typename Traits, typename A>
- bool <a name="boost.container.operator_id327036"></a>operator<(const CharT * s,
- const basic_string< CharT, Traits, A > & y);
- template<typename CharT, typename Traits, typename A>
- bool <a name="boost.container.operator_id327067"></a>operator<(const basic_string< CharT, Traits, A > & x,
- const CharT * s);
- template<typename CharT, typename Traits, typename A>
- bool <a name="boost.container.operator_id327098"></a>operator>(const basic_string< CharT, Traits, A > & x,
- const basic_string< CharT, Traits, A > & y);
- template<typename CharT, typename Traits, typename A>
- bool <a name="boost.container.operator_id327133"></a>operator>(const CharT * s,
- const basic_string< CharT, Traits, A > & y);
- template<typename CharT, typename Traits, typename A>
- bool <a name="boost.container.operator_id327164"></a>operator>(const basic_string< CharT, Traits, A > & x,
- const CharT * s);
- template<typename CharT, typename Traits, typename A>
- bool <a name="boost.container.operator_=_id327196"></a>operator<=(const basic_string< CharT, Traits, A > & x,
- const basic_string< CharT, Traits, A > & y);
- template<typename CharT, typename Traits, typename A>
- bool <a name="boost.container.operator_=_id327230"></a>operator<=(const CharT * s,
- const basic_string< CharT, Traits, A > & y);
- template<typename CharT, typename Traits, typename A>
- bool <a name="boost.container.operator_=_id327548"></a>operator<=(const basic_string< CharT, Traits, A > & x,
- const CharT * s);
- template<typename CharT, typename Traits, typename A>
- bool <a name="boost.container.operator_=_id327580"></a>operator>=(const basic_string< CharT, Traits, A > & x,
- const basic_string< CharT, Traits, A > & y);
- template<typename CharT, typename Traits, typename A>
- bool <a name="boost.container.operator_=_id327614"></a>operator>=(const CharT * s,
- const basic_string< CharT, Traits, A > & y);
- template<typename CharT, typename Traits, typename A>
- bool <a name="boost.container.operator_=_id327646"></a>operator>=(const basic_string< CharT, Traits, A > & x,
- const CharT * s);
- template<typename CharT, typename Traits, typename A>
- void <a name="boost.container.swap_id327677"></a>swap(basic_string< CharT, Traits, A > & x,
- basic_string< CharT, Traits, A > & y);
- template<typename CharT, typename Traits, typename A>
- std::basic_ostream< CharT, Traits > &
- <a name="boost.container.operator_id327709"></a>operator<<(std::basic_ostream< CharT, Traits > & os,
- const basic_string< CharT, Traits, A > & s);
- template<typename CharT, typename Traits, typename A>
- std::basic_istream< CharT, Traits > &
- <a name="boost.container.operator_id327740"></a>operator>>(std::basic_istream< CharT, Traits > & is,
- basic_string< CharT, Traits, A > & s);
- template<typename CharT, typename Traits, typename A>
- std::basic_istream< CharT, Traits > &
- <a name="boost.container.getline_id327770"></a>getline(std::istream & is, basic_string< CharT, Traits, A > & s,
- CharT delim);
- template<typename CharT, typename Traits, typename A>
- std::basic_istream< CharT, Traits > &
- <a name="boost.container.getline_id327805"></a>getline(std::basic_istream< CharT, Traits > & is,
- basic_string< CharT, Traits, A > & s);
- template<typename Ch, typename A>
- std::size_t <a name="boost.container.hash_value"></a>hash_value(basic_string< Ch, std::char_traits< Ch >, A > const & v);
- }
-}</pre>
+<pre class="synopsis">namespace boost {
+ namespace container {
+ template<typename CharT, typename Traits, typename A> class basic_string;
+ typedef basic_string< char,std::char_traits< char >,std::allocator< char > > string;
+ typedef basic_string< wchar_t,std::char_traits< wchar_t >,std::allocator< wchar_t > > wstring;
+ template<typename CharT, typename Traits, typename A>
+ basic_string< CharT, Traits, A >
+ <a name="boost.container.operator+_id406840"></a>operator+(const basic_string< CharT, Traits, A > & x,
+ const basic_string< CharT, Traits, A > & y);
+ template<typename CharT, typename Traits, typename A>
+ basic_string< CharT, Traits, A > basic_string< CharT, Traits, A > &&
+ <a name="boost.container.operator+_id406878"></a>operator+(basic_string< CharT, Traits, A > basic_string< CharT, Traits, A > && mx,
+ const basic_string< CharT, Traits, A > & y);
+ template<typename CharT, typename Traits, typename A>
+ basic_string< CharT, Traits, A > basic_string< CharT, Traits, A > &&
+ <a name="boost.container.operator+_id406921"></a>operator+(const basic_string< CharT, Traits, A > & x,
+ basic_string< CharT, Traits, A > basic_string< CharT, Traits, A > && my);
+ template<typename CharT, typename Traits, typename A>
+ basic_string< CharT, Traits, A >
+ <a name="boost.container.operator+_id406964"></a>operator+(const CharT * s, const basic_string< CharT, Traits, A > & y);
+ template<typename CharT, typename Traits, typename A>
+ basic_string< CharT, Traits, A > basic_string< CharT, Traits, A > &&
+ <a name="boost.container.operator+_id406998"></a>operator+(const CharT * s,
+ basic_string< CharT, Traits, A > basic_string< CharT, Traits, A > && my);
+ template<typename CharT, typename Traits, typename A>
+ basic_string< CharT, Traits, A >
+ <a name="boost.container.operator+_id407037"></a>operator+(CharT c, const basic_string< CharT, Traits, A > & y);
+ template<typename CharT, typename Traits, typename A>
+ basic_string< CharT, Traits, A > basic_string< CharT, Traits, A > &&
+ <a name="boost.container.operator+_id407071"></a>operator+(CharT c,
+ basic_string< CharT, Traits, A > basic_string< CharT, Traits, A > && my);
+ template<typename CharT, typename Traits, typename A>
+ basic_string< CharT, Traits, A >
+ <a name="boost.container.operator+_id407110"></a>operator+(const basic_string< CharT, Traits, A > & x, const CharT * s);
+ template<typename CharT, typename Traits, typename A>
+ basic_string< CharT, Traits, A > basic_string< CharT, Traits, A > &&
+ <a name="boost.container.operator+_id407144"></a>operator+(basic_string< CharT, Traits, A > basic_string< CharT, Traits, A > && mx,
+ const CharT * s);
+ template<typename CharT, typename Traits, typename A>
+ basic_string< CharT, Traits, A >
+ <a name="boost.container.operator+_id407184"></a>operator+(const basic_string< CharT, Traits, A > & x, const CharT c);
+ template<typename CharT, typename Traits, typename A>
+ basic_string< CharT, Traits, A > basic_string< CharT, Traits, A > &&
+ <a name="boost.container.operator+_id407217"></a>operator+(basic_string< CharT, Traits, A > basic_string< CharT, Traits, A > && mx,
+ const CharT c);
+ template<typename CharT, typename Traits, typename A>
+ bool <a name="boost.container.operator==_id407257"></a>operator==(const basic_string< CharT, Traits, A > & x,
+ const basic_string< CharT, Traits, A > & y);
+ template<typename CharT, typename Traits, typename A>
+ bool <a name="boost.container.operator==_id407292"></a>operator==(const CharT * s,
+ const basic_string< CharT, Traits, A > & y);
+ template<typename CharT, typename Traits, typename A>
+ bool <a name="boost.container.operator==_id407323"></a>operator==(const basic_string< CharT, Traits, A > & x,
+ const CharT * s);
+ template<typename CharT, typename Traits, typename A>
+ bool <a name="boost.container.operator!=_id407354"></a>operator!=(const basic_string< CharT, Traits, A > & x,
+ const basic_string< CharT, Traits, A > & y);
+ template<typename CharT, typename Traits, typename A>
+ bool <a name="boost.container.operator!=_id407389"></a>operator!=(const CharT * s,
+ const basic_string< CharT, Traits, A > & y);
+ template<typename CharT, typename Traits, typename A>
+ bool <a name="boost.container.operator!=_id407420"></a>operator!=(const basic_string< CharT, Traits, A > & x,
+ const CharT * s);
+ template<typename CharT, typename Traits, typename A>
+ bool <a name="boost.container.operator_id407451"></a>operator<(const basic_string< CharT, Traits, A > & x,
+ const basic_string< CharT, Traits, A > & y);
+ template<typename CharT, typename Traits, typename A>
+ bool <a name="boost.container.operator_id407486"></a>operator<(const CharT * s,
+ const basic_string< CharT, Traits, A > & y);
+ template<typename CharT, typename Traits, typename A>
+ bool <a name="boost.container.operator_id407517"></a>operator<(const basic_string< CharT, Traits, A > & x,
+ const CharT * s);
+ template<typename CharT, typename Traits, typename A>
+ bool <a name="boost.container.operator_id407548"></a>operator>(const basic_string< CharT, Traits, A > & x,
+ const basic_string< CharT, Traits, A > & y);
+ template<typename CharT, typename Traits, typename A>
+ bool <a name="boost.container.operator_id407665"></a>operator>(const CharT * s,
+ const basic_string< CharT, Traits, A > & y);
+ template<typename CharT, typename Traits, typename A>
+ bool <a name="boost.container.operator_id407696"></a>operator>(const basic_string< CharT, Traits, A > & x,
+ const CharT * s);
+ template<typename CharT, typename Traits, typename A>
+ bool <a name="boost.container.operator_=_id407728"></a>operator<=(const basic_string< CharT, Traits, A > & x,
+ const basic_string< CharT, Traits, A > & y);
+ template<typename CharT, typename Traits, typename A>
+ bool <a name="boost.container.operator_=_id407762"></a>operator<=(const CharT * s,
+ const basic_string< CharT, Traits, A > & y);
+ template<typename CharT, typename Traits, typename A>
+ bool <a name="boost.container.operator_=_id407794"></a>operator<=(const basic_string< CharT, Traits, A > & x,
+ const CharT * s);
+ template<typename CharT, typename Traits, typename A>
+ bool <a name="boost.container.operator_=_id407825"></a>operator>=(const basic_string< CharT, Traits, A > & x,
+ const basic_string< CharT, Traits, A > & y);
+ template<typename CharT, typename Traits, typename A>
+ bool <a name="boost.container.operator_=_id407860"></a>operator>=(const CharT * s,
+ const basic_string< CharT, Traits, A > & y);
+ template<typename CharT, typename Traits, typename A>
+ bool <a name="boost.container.operator_=_id407891"></a>operator>=(const basic_string< CharT, Traits, A > & x,
+ const CharT * s);
+ template<typename CharT, typename Traits, typename A>
+ void <a name="boost.container.swap_id407922"></a>swap(basic_string< CharT, Traits, A > & x,
+ basic_string< CharT, Traits, A > & y);
+ template<typename CharT, typename Traits, typename A>
+ std::basic_ostream< CharT, Traits > &
+ <a name="boost.container.operator_id407954"></a>operator<<(std::basic_ostream< CharT, Traits > & os,
+ const basic_string< CharT, Traits, A > & s);
+ template<typename CharT, typename Traits, typename A>
+ std::basic_istream< CharT, Traits > &
+ <a name="boost.container.operator_id407986"></a>operator>>(std::basic_istream< CharT, Traits > & is,
+ basic_string< CharT, Traits, A > & s);
+ template<typename CharT, typename Traits, typename A>
+ std::basic_istream< CharT, Traits > &
+ <a name="boost.container.getline_id408016"></a>getline(std::istream & is, basic_string< CharT, Traits, A > & s,
+ CharT delim);
+ template<typename CharT, typename Traits, typename A>
+ std::basic_istream< CharT, Traits > &
+ <a name="boost.container.getline_id408050"></a>getline(std::basic_istream< CharT, Traits > & is,
+ basic_string< CharT, Traits, A > & s);
+ template<typename Ch, typename A>
+ std::size_t <a name="boost.container.hash_value"></a>hash_value(basic_string< Ch, std::char_traits< Ch >, A > const & v);
+ }
+}</pre>
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
<a name="header.boost.container.vector_hpp"></a>Header <boost/container/vector.hpp></h3></div></div></div>
-<pre class="synopsis">namespace boost {
- namespace container {
- template<typename T, typename A> class vector;
- template<typename T, typename A>
- bool <a name="boost.container.operator==_id329693"></a>operator==(const vector< T, A > & x, const vector< T, A > & y);
- template<typename T, typename A>
- bool <a name="boost.container.operator!=_id329805"></a>operator!=(const vector< T, A > & x, const vector< T, A > & y);
- template<typename T, typename A>
- bool <a name="boost.container.operator_id329836"></a>operator<(const vector< T, A > & x, const vector< T, A > & y);
- template<typename T, typename A>
- void <a name="boost.container.swap_id329867"></a>swap(vector< T, A > & x, vector< T, A > & y);
- }
-}</pre>
+<pre class="synopsis">namespace boost {
+ namespace container {
+ template<typename T, typename A> class vector;
+ template<typename T, typename A>
+ bool <a name="boost.container.operator==_id409818"></a>operator==(const vector< T, A > & x, const vector< T, A > & y);
+ template<typename T, typename A>
+ bool <a name="boost.container.operator!=_id411995"></a>operator!=(const vector< T, A > & x, const vector< T, A > & y);
+ template<typename T, typename A>
+ bool <a name="boost.container.operator_id412026"></a>operator<(const vector< T, A > & x, const vector< T, A > & y);
+ template<typename T, typename A>
+ void <a name="boost.container.swap_id412058"></a>swap(vector< T, A > & x, vector< T, A > & y);
+ }
+}</pre>
</div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2009 -2010 Ion Gaztanaga
+<td align="right"><div class="copyright-footer">Copyright © 2009 -2011 Ion Gaztanaga
 Distributed under the Boost Software License, Version 1.0. (See accompanying
 file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
@@ -518,7 +518,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="container/release_notes.html"><img src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="index.html"><img src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="index.html"><img src="../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="boost/container/ordered_range_impl_t.html"><img src="../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="container/release_notes.html"><img src="../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="index.html"><img src="../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="index.html"><img src="../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="boost/container/ordered_range_impl_t.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>

Modified: sandbox/move/libs/container/doc/html/container/acknowledgements_notes.html
==============================================================================
--- sandbox/move/libs/container/doc/html/container/acknowledgements_notes.html (original)
+++ sandbox/move/libs/container/doc/html/container/acknowledgements_notes.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
@@ -1,14 +1,14 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title> Acknowledgements, notes
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Acknowledgements, notes
 and links</title>
-<link rel="stylesheet" href="../boostbook.css" type="text/css">
+<link rel="stylesheet" href="../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
-<link rel="start" href="../index.html" title="Chapter 1. Boost.Container">
-<link rel="up" href="../index.html" title="Chapter 1. Boost.Container">
-<link rel="prev" href="other_features.html" title=" Other features">
-<link rel="next" href="release_notes.html" title=" Release Notes">
+<link rel="start" href="../index.html" title="Chapter 1. Boost.Container">
+<link rel="up" href="../index.html" title="Chapter 1. Boost.Container">
+<link rel="prev" href="other_features.html" title="Other features">
+<link rel="next" href="release_notes.html" title="Release Notes">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
@@ -21,22 +21,22 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="other_features.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="release_notes.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="other_features.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="release_notes.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="container.acknowledgements_notes"></a><a href="acknowledgements_notes.html" title=" Acknowledgements, notes
- and links"> Acknowledgements, notes
+<a name="container.acknowledgements_notes"></a><a href="acknowledgements_notes.html" title="Acknowledgements, notes
+ and links">Acknowledgements, notes
 and links</a>
</h2></div></div></div>
-<div class="toc"><dl><dt> Thanks to...</dt></dl></div>
+<div class="toc"><dl><dt>Thanks to...</dt></dl></div>
<div class="section" lang="en"><div class="titlepage"><div><div><h3 class="title">
-<a name="container.acknowledgements_notes.thanks_to"></a> Thanks to...
+<a name="container.acknowledgements_notes.thanks_to"></a>Thanks to...
</h3></div></div></div></div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2009 -2010 Ion Gaztanaga
+<td align="right"><div class="copyright-footer">Copyright © 2009 -2011 Ion Gaztanaga
 Distributed under the Boost Software License, Version 1.0. (See accompanying
 file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
@@ -44,7 +44,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="other_features.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="release_notes.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="other_features.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="release_notes.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>

Modified: sandbox/move/libs/container/doc/html/container/emplace.html
==============================================================================
--- sandbox/move/libs/container/doc/html/container/emplace.html (original)
+++ sandbox/move/libs/container/doc/html/container/emplace.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
@@ -1,13 +1,13 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title> Emplace: Placement insertion</title>
-<link rel="stylesheet" href="../boostbook.css" type="text/css">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Emplace: Placement insertion</title>
+<link rel="stylesheet" href="../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
-<link rel="start" href="../index.html" title="Chapter 1. Boost.Container">
-<link rel="up" href="../index.html" title="Chapter 1. Boost.Container">
-<link rel="prev" href="move_containers.html" title=" Move-aware containers">
-<link rel="next" href="recursive_containers.html" title=" Recursive containers">
+<link rel="start" href="../index.html" title="Chapter 1. Boost.Container">
+<link rel="up" href="../index.html" title="Chapter 1. Boost.Container">
+<link rel="prev" href="move_containers.html" title="Move-aware containers">
+<link rel="next" href="recursive_containers.html" title="Recursive containers">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
@@ -20,11 +20,11 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="move_containers.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="recursive_containers.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="move_containers.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="recursive_containers.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="container.emplace"></a> Emplace: Placement insertion
+<a name="container.emplace"></a>Emplace: Placement insertion
</h2></div></div></div>

 All containers offered by Boost.Container
@@ -35,9 +35,7 @@
 and non-copyable types in containers! Let's see an example:
 

- 
-
-
+

<pre class="programlisting">#include <boost/container/list.hpp>
#include <cassert>
@@ -71,13 +69,11 @@
}
</pre>

- 
-
 
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2009 -2010 Ion Gaztanaga
+<td align="right"><div class="copyright-footer">Copyright © 2009 -2011 Ion Gaztanaga
 Distributed under the Boost Software License, Version 1.0. (See accompanying
 file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
@@ -85,7 +81,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="move_containers.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="recursive_containers.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="move_containers.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="recursive_containers.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>

Modified: sandbox/move/libs/container/doc/html/container/intro.html
==============================================================================
--- sandbox/move/libs/container/doc/html/container/intro.html (original)
+++ sandbox/move/libs/container/doc/html/container/intro.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
@@ -1,13 +1,13 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title> Introduction</title>
-<link rel="stylesheet" href="../boostbook.css" type="text/css">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Introduction</title>
+<link rel="stylesheet" href="../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
-<link rel="start" href="../index.html" title="Chapter 1. Boost.Container">
-<link rel="up" href="../index.html" title="Chapter 1. Boost.Container">
-<link rel="prev" href="../index.html" title="Chapter 1. Boost.Container">
-<link rel="next" href="move_containers.html" title=" Move-aware containers">
+<link rel="start" href="../index.html" title="Chapter 1. Boost.Container">
+<link rel="up" href="../index.html" title="Chapter 1. Boost.Container">
+<link rel="prev" href="../index.html" title="Chapter 1. Boost.Container">
+<link rel="next" href="move_containers.html" title="Move-aware containers">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
@@ -20,16 +20,16 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="../index.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="move_containers.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="../index.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="move_containers.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="container.intro"></a> Introduction
+<a name="container.intro"></a>Introduction
</h2></div></div></div>
<div class="toc"><dl>
-<dt><a href="intro.html#container.intro.introduction_building_container"> Building
+<dt><a href="intro.html#container.intro.introduction_building_container">Building
 Boost.Container</a></dt>
-<dt> Tested compilers</dt>
+<dt>Tested compilers</dt>
</dl></div>

 Boost.Container library implements several
@@ -42,41 +42,46 @@
 
<div class="itemizedlist"><ul type="disc">
<li>
- Move semantics are implemented, including move emulation for pre-C++0x compilers.
- </li>
+ Move semantics are implemented, including move emulation for pre-C++0x
+ compilers.
+ </li>
<li>
- New advanced features (e.g. placement insertion, recursive containers) are
- present.
- </li>
-<li>
- Containers support stateful allocators and are compatible with Boost.Interprocess (they can be safely placed in shared
- memory).
- </li>
-<li>
- The library offers new useful containers:
- <div class="itemizedlist"><ul type="circle">
-<li>
-<code class="computeroutput">flat_map</code>, <code class="computeroutput">flat_set</code>, <code class="computeroutput">flat_multiset</code>
- and <code class="computeroutput">flat_multiset</code>:
- drop-in replacements for standard associative containers but more memory
- friendly and with faster searches.
- </li>
+ New advanced features (e.g. placement insertion, recursive containers)
+ are present.
+ </li>
<li>
-<code class="computeroutput">stable_vector</code>:
- a std::list and std::vector hybrid with random-access iterators that
- offers iterator stability in insertions and erasures.
- </li>
+ Containers support stateful allocators and are compatible with Boost.Interprocess (they can be safely placed in
+ shared memory).
+ </li>
<li>
-<code class="computeroutput">slist</code>: the classic
- pre-standard singly linked list container.
- </li>
+
+ The library offers new useful containers:
+ 
+<div class="itemizedlist"><ul type="circle">
+<li>
+ <code class="computeroutput">flat_map</code>,
+ <code class="computeroutput">flat_set</code>,
+ <code class="computeroutput">flat_multiset</code>
+ and <code class="computeroutput">flat_multiset</code>:
+ drop-in replacements for standard associative containers but more memory
+ friendly and with faster searches.
+ </li>
+<li>
+ <code class="computeroutput">stable_vector</code>:
+ a std::list and std::vector hybrid with random-access iterators that
+ offers iterator stability in insertions and erasures.
+ </li>
+<li>
+ <code class="computeroutput">slist</code>: the classic
+ pre-standard singly linked list container.
+ </li>
</ul></div>
</li>
</ul></div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="container.intro.introduction_building_container"></a><a href="intro.html#container.intro.introduction_building_container" title=" Building
- Boost.Container"> Building
+<a name="container.intro.introduction_building_container"></a><a href="intro.html#container.intro.introduction_building_container" title="Building
+ Boost.Container">Building
 Boost.Container</a>
</h3></div></div></div>

@@ -87,7 +92,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="container.intro.tested_compilers"></a> Tested compilers
+<a name="container.intro.tested_compilers"></a>Tested compilers
</h3></div></div></div>

 Boost.Container requires a decent C++98
@@ -95,20 +100,20 @@
 
<div class="itemizedlist"><ul type="disc">
<li>
- Visual C++ >= 7.1.
- </li>
+ Visual C++ >= 7.1.
+ </li>
<li>
- GCC >= 3.4.
- </li>
+ GCC >= 3.4.
+ </li>
<li>
- Intel C++ >= 9.0
- </li>
+ Intel C++ >= 9.0
+ </li>
</ul></div>
</div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2009 -2010 Ion Gaztanaga
+<td align="right"><div class="copyright-footer">Copyright © 2009 -2011 Ion Gaztanaga
 Distributed under the Boost Software License, Version 1.0. (See accompanying
 file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
@@ -116,7 +121,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="../index.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="move_containers.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="../index.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="move_containers.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>

Modified: sandbox/move/libs/container/doc/html/container/move_containers.html
==============================================================================
--- sandbox/move/libs/container/doc/html/container/move_containers.html (original)
+++ sandbox/move/libs/container/doc/html/container/move_containers.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
@@ -1,13 +1,13 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title> Move-aware containers</title>
-<link rel="stylesheet" href="../boostbook.css" type="text/css">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Move-aware containers</title>
+<link rel="stylesheet" href="../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
-<link rel="start" href="../index.html" title="Chapter 1. Boost.Container">
-<link rel="up" href="../index.html" title="Chapter 1. Boost.Container">
-<link rel="prev" href="intro.html" title=" Introduction">
-<link rel="next" href="emplace.html" title=" Emplace: Placement insertion">
+<link rel="start" href="../index.html" title="Chapter 1. Boost.Container">
+<link rel="up" href="../index.html" title="Chapter 1. Boost.Container">
+<link rel="prev" href="intro.html" title="Introduction">
+<link rel="next" href="emplace.html" title="Emplace: Placement insertion">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
@@ -20,11 +20,11 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="intro.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="emplace.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="intro.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="emplace.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="container.move_containers"></a> Move-aware containers
+<a name="container.move_containers"></a>Move-aware containers
</h2></div></div></div>

 All containers offered by Boost.Container
@@ -39,9 +39,7 @@
 operations when transfering data between vectors. Let's see an example:
 

- 
-
-
+

<pre class="programlisting">#include <boost/container/vector.hpp>
#include <boost/move/move.hpp>
@@ -85,13 +83,11 @@
}
</pre>

- 
-
 
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2009 -2010 Ion Gaztanaga
+<td align="right"><div class="copyright-footer">Copyright © 2009 -2011 Ion Gaztanaga
 Distributed under the Boost Software License, Version 1.0. (See accompanying
 file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
@@ -99,7 +95,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="intro.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="emplace.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="intro.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="emplace.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>

Modified: sandbox/move/libs/container/doc/html/container/other_features.html
==============================================================================
--- sandbox/move/libs/container/doc/html/container/other_features.html (original)
+++ sandbox/move/libs/container/doc/html/container/other_features.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
@@ -1,13 +1,13 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title> Other features</title>
-<link rel="stylesheet" href="../boostbook.css" type="text/css">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Other features</title>
+<link rel="stylesheet" href="../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
-<link rel="start" href="../index.html" title="Chapter 1. Boost.Container">
-<link rel="up" href="../index.html" title="Chapter 1. Boost.Container">
-<link rel="prev" href="recursive_containers.html" title=" Recursive containers">
-<link rel="next" href="acknowledgements_notes.html" title=" Acknowledgements, notes
+<link rel="start" href="../index.html" title="Chapter 1. Boost.Container">
+<link rel="up" href="../index.html" title="Chapter 1. Boost.Container">
+<link rel="prev" href="recursive_containers.html" title="Recursive containers">
+<link rel="next" href="acknowledgements_notes.html" title="Acknowledgements, notes
 and links">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
@@ -21,29 +21,29 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="recursive_containers.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="acknowledgements_notes.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="recursive_containers.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="acknowledgements_notes.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="container.other_features"></a> Other features
+<a name="container.other_features"></a>Other features
</h2></div></div></div>
<div class="itemizedlist"><ul type="disc">
<li>
- Default constructors don't allocate memory which improves performance and
- usually implies a no-throw guarantee (if predicate's or allocator's default
- constructor doesn't throw).
- </li>
+ Default constructors don't allocate memory which improves performance and
+ usually implies a no-throw guarantee (if predicate's or allocator's default
+ constructor doesn't throw).
+ </li>
<li>
- Small string optimization for <code class="computeroutput">basic_string</code>,
- with an internal buffer of 11/23 bytes (32/64 bit systems) without
- increasing the usual <code class="computeroutput">sizeof</code>
- of the string (3 words).
- </li>
+ Small string optimization for <code class="computeroutput">basic_string</code>,
+ with an internal buffer of 11/23 bytes (32/64 bit systems) without
+ increasing the usual <code class="computeroutput">sizeof</code>
+ of the string (3 words).
+ </li>
</ul></div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2009 -2010 Ion Gaztanaga
+<td align="right"><div class="copyright-footer">Copyright © 2009 -2011 Ion Gaztanaga
 Distributed under the Boost Software License, Version 1.0. (See accompanying
 file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
@@ -51,7 +51,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="recursive_containers.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="acknowledgements_notes.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="recursive_containers.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="acknowledgements_notes.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>

Modified: sandbox/move/libs/container/doc/html/container/recursive_containers.html
==============================================================================
--- sandbox/move/libs/container/doc/html/container/recursive_containers.html (original)
+++ sandbox/move/libs/container/doc/html/container/recursive_containers.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
@@ -1,13 +1,13 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title> Recursive containers</title>
-<link rel="stylesheet" href="../boostbook.css" type="text/css">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Recursive containers</title>
+<link rel="stylesheet" href="../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
-<link rel="start" href="../index.html" title="Chapter 1. Boost.Container">
-<link rel="up" href="../index.html" title="Chapter 1. Boost.Container">
-<link rel="prev" href="emplace.html" title=" Emplace: Placement insertion">
-<link rel="next" href="other_features.html" title=" Other features">
+<link rel="start" href="../index.html" title="Chapter 1. Boost.Container">
+<link rel="up" href="../index.html" title="Chapter 1. Boost.Container">
+<link rel="prev" href="emplace.html" title="Emplace: Placement insertion">
+<link rel="next" href="other_features.html" title="Other features">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
@@ -20,21 +20,19 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="emplace.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="other_features.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="emplace.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="other_features.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="container.recursive_containers"></a> Recursive containers
+<a name="container.recursive_containers"></a>Recursive containers
</h2></div></div></div>

 All containers offered by Boost.Container
 can be used in recursive data structures, something that is not guaranteed
- by the standard. Programmers can write the following data structures:
+ by the standard. Programmers can write the following data structure:
 

- 
-
-
+

<pre class="programlisting">#include <boost/container/vector.hpp>
#include <boost/container/list.hpp>
@@ -62,13 +60,11 @@
}
</pre>

- 
-
 
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2009 -2010 Ion Gaztanaga
+<td align="right"><div class="copyright-footer">Copyright © 2009 -2011 Ion Gaztanaga
 Distributed under the Boost Software License, Version 1.0. (See accompanying
 file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
@@ -76,7 +72,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="emplace.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="other_features.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="emplace.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="other_features.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>

Modified: sandbox/move/libs/container/doc/html/container/release_notes.html
==============================================================================
--- sandbox/move/libs/container/doc/html/container/release_notes.html (original)
+++ sandbox/move/libs/container/doc/html/container/release_notes.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
@@ -1,12 +1,12 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title> Release Notes</title>
-<link rel="stylesheet" href="../boostbook.css" type="text/css">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Release Notes</title>
+<link rel="stylesheet" href="../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
-<link rel="start" href="../index.html" title="Chapter 1. Boost.Container">
-<link rel="up" href="../index.html" title="Chapter 1. Boost.Container">
-<link rel="prev" href="acknowledgements_notes.html" title=" Acknowledgements, notes
+<link rel="start" href="../index.html" title="Chapter 1. Boost.Container">
+<link rel="up" href="../index.html" title="Chapter 1. Boost.Container">
+<link rel="prev" href="acknowledgements_notes.html" title="Acknowledgements, notes
 and links">
<link rel="next" href="../boost_container_reference.html" title="Boost.Container Reference">
</head>
@@ -21,14 +21,14 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="acknowledgements_notes.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../boost_container_reference.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="acknowledgements_notes.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../boost_container_reference.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="section" lang="en"><div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="container.release_notes"></a> Release Notes
+<a name="container.release_notes"></a>Release Notes
</h2></div></div></div></div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2009 -2010 Ion Gaztanaga
+<td align="right"><div class="copyright-footer">Copyright © 2009 -2011 Ion Gaztanaga
 Distributed under the Boost Software License, Version 1.0. (See accompanying
 file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
@@ -36,7 +36,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="acknowledgements_notes.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../boost_container_reference.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="acknowledgements_notes.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../boost_container_reference.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>

Modified: sandbox/move/libs/container/doc/html/index.html
==============================================================================
--- sandbox/move/libs/container/doc/html/index.html (original)
+++ sandbox/move/libs/container/doc/html/index.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
@@ -1,11 +1,11 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title>Chapter 1. Boost.Container</title>
-<link rel="stylesheet" href="boostbook.css" type="text/css">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Chapter 1. Boost.Container</title>
+<link rel="stylesheet" href="../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
-<link rel="start" href="index.html" title="Chapter 1. Boost.Container">
-<link rel="next" href="container/intro.html" title=" Introduction">
+<link rel="start" href="index.html" title="Chapter 1. Boost.Container">
+<link rel="next" href="container/intro.html" title="Introduction">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
@@ -17,17 +17,17 @@
<td align="center">More</td>
</tr></table>
<hr>
-<div class="spirit-nav"><a accesskey="n" href="container/intro.html"><img src="../../../../doc/html/images/next.png" alt="Next"></a></div>
+<div class="spirit-nav"><a accesskey="n" href="container/intro.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a></div>
<div class="chapter" lang="en">
<div class="titlepage"><div>
<div><h2 class="title">
-<a name="container"></a>Chapter 1. Boost.Container</h2></div>
+<a name="container"></a>Chapter 1. Boost.Container</h2></div>
<div><div class="author"><h3 class="author">
Ion Gaztanaga
</h3></div></div>
-<div>Copyright © 2009 -2010 Ion Gaztanaga</div>
+<div>Copyright © 2009 -2011 Ion Gaztanaga</div>
<div><div class="legalnotice">
-<a name="id459684"></a>
+<a name="id731850"></a>
 Distributed under the Boost Software License, Version 1.0. (See accompanying
 file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
@@ -36,20 +36,20 @@
<div class="toc">
Table of Contents
<dl>
-<dt> Introduction</dt>
+<dt>Introduction</dt>
<dd><dl>
-<dt><a href="container/intro.html#container.intro.introduction_building_container"> Building
+<dt><a href="container/intro.html#container.intro.introduction_building_container">Building
 Boost.Container</a></dt>
-<dt> Tested compilers</dt>
+<dt>Tested compilers</dt>
</dl></dd>
-<dt> Move-aware containers</dt>
-<dt> Emplace: Placement insertion</dt>
-<dt> Recursive containers</dt>
-<dt> Other features</dt>
-<dt><a href="container/acknowledgements_notes.html"> Acknowledgements, notes
+<dt>Move-aware containers</dt>
+<dt>Emplace: Placement insertion</dt>
+<dt>Recursive containers</dt>
+<dt>Other features</dt>
+<dt><a href="container/acknowledgements_notes.html">Acknowledgements, notes
 and links</a></dt>
-<dd><dl><dt> Thanks to...</dt></dl></dd>
-<dt> Release Notes</dt>
+<dd><dl><dt>Thanks to...</dt></dl></dd>
+<dt>Release Notes</dt>
<dt>Boost.Container Reference</dt>
<dd><dl>
<dt>Header <boost/container/container_fwd.hpp></dt>
@@ -68,7 +68,7 @@
</div>
<div class="warning"><table border="0" summary="Warning">
<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Warning]" src="../../../../doc/html/images/warning.png"></td>
+<td rowspan="2" align="center" valign="top" width="25"><img alt="[Warning]" src="../../../../doc/src/images/warning.png"></td>
<th align="left">Warning</th>
</tr>
<tr><td colspan="2" align="left" valign="top">
@@ -77,7 +77,7 @@
</table></div>
<div class="important"><table border="0" summary="Important">
<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Important]" src="../../../../doc/html/images/important.png"></td>
+<td rowspan="2" align="center" valign="top" width="25"><img alt="[Important]" src="../../../../doc/src/images/important.png"></td>
<th align="left">Important</th>
</tr>
<tr><td colspan="2" align="left" valign="top">
@@ -86,10 +86,10 @@
</table></div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left">Last revised: May 27, 2010 at 17:00:45 GMT</td>
+<td align="left">Last revised: July 03, 2011 at 19:18:54 GMT</td>
<td align="right"><div class="copyright-footer"></div></td>
</tr></table>
<hr>
-<div class="spirit-nav"><a accesskey="n" href="container/intro.html"><img src="../../../../doc/html/images/next.png" alt="Next"></a></div>
+<div class="spirit-nav"><a accesskey="n" href="container/intro.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a></div>
</body>
</html>

Deleted: sandbox/move/libs/container/test/boost_interprocess_check.hpp
==============================================================================
--- sandbox/move/libs/container/test/boost_interprocess_check.hpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,27 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2004-2007. Distributed under the Boost
-// Software License, Version 1.0. (See accompanying file
-// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/container for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_CONTAINER_TEST_HEADER
-#define BOOST_CONTAINER_TEST_HEADER
-
-#include <boost/container/detail/config_begin.hpp>
-#include <boost/container/exceptions.hpp>
-#include <iostream>
-
-namespace boost { namespace container { namespace test {
-
-#define BOOST_INTERPROCES_CHECK( P ) \
- if(!(P)) do{ std::cout << "Failed: " << #P << " file: " << __FILE__ << " line : " << __LINE__ << std::endl; throw boost::container::container_exception();}while(0)
-
-}}} //namespace boost { namespace container { namespace test {
-
-#include <boost/container/detail/config_end.hpp>
-
-#endif //BOOST_CONTAINER_TEST_HEADER

Modified: sandbox/move/libs/container/test/check_equal_containers.hpp
==============================================================================
--- sandbox/move/libs/container/test/check_equal_containers.hpp (original)
+++ sandbox/move/libs/container/test/check_equal_containers.hpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
@@ -21,48 +21,48 @@
namespace test{

//Function to check if both containers are equal
-template<class MyShmCont
+template<class MyBoostCont
 ,class MyStdCont>
-bool CheckEqualContainers(MyShmCont *shmcont, MyStdCont *stdcont)
+bool CheckEqualContainers(MyBoostCont *boostcont, MyStdCont *stdcont)
{
- if(shmcont->size() != stdcont->size())
+ if(boostcont->size() != stdcont->size())
 return false;

- typedef typename MyShmCont::value_type value_type;
+ typedef typename MyBoostCont::value_type value_type;

- typename MyShmCont::iterator itshm(shmcont->begin()), itshmend(shmcont->end());
+ typename MyBoostCont::iterator itboost(boostcont->begin()), itboostend(boostcont->end());
 typename MyStdCont::iterator itstd(stdcont->begin());
- typename MyStdCont::size_type dist = (typename MyStdCont::size_type)std::distance(itshm, itshmend);
- if(dist != shmcont->size()){
+ typename MyStdCont::size_type dist = (typename MyStdCont::size_type)std::distance(itboost, itboostend);
+ if(dist != boostcont->size()){
 return false;
 }
 std::size_t i = 0;
- for(; itshm != itshmend; ++itshm, ++itstd, ++i){
+ for(; itboost != itboostend; ++itboost, ++itstd, ++i){
 value_type val(*itstd);
- const value_type &v = *itshm;
+ const value_type &v = *itboost;
 if(v != val)
 return false;
 }
 return true;
}

-template<class MyShmCont
+template<class MyBoostCont
 ,class MyStdCont>
-bool CheckEqualPairContainers(MyShmCont *shmcont, MyStdCont *stdcont)
+bool CheckEqualPairContainers(MyBoostCont *boostcont, MyStdCont *stdcont)
{
- if(shmcont->size() != stdcont->size())
+ if(boostcont->size() != stdcont->size())
 return false;

- typedef typename MyShmCont::key_type key_type;
- typedef typename MyShmCont::mapped_type mapped_type;
+ typedef typename MyBoostCont::key_type key_type;
+ typedef typename MyBoostCont::mapped_type mapped_type;

- typename MyShmCont::iterator itshm(shmcont->begin()), itshmend(shmcont->end());
+ typename MyBoostCont::iterator itboost(boostcont->begin()), itboostend(boostcont->end());
 typename MyStdCont::iterator itstd(stdcont->begin());
- for(; itshm != itshmend; ++itshm, ++itstd){
- if(itshm->first != key_type(itstd->first))
+ for(; itboost != itboostend; ++itboost, ++itstd){
+ if(itboost->first != key_type(itstd->first))
 return false;

- if(itshm->second != mapped_type(itstd->second))
+ if(itboost->second != mapped_type(itstd->second))
 return false;
 }
 return true;

Modified: sandbox/move/libs/container/test/deque_test.cpp
==============================================================================
--- sandbox/move/libs/container/test/deque_test.cpp (original)
+++ sandbox/move/libs/container/test/deque_test.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
@@ -212,7 +212,7 @@
 }

 if(!deque_copyable_only(cntdeque, stddeque
- ,containers_detail::bool_<!boost::is_movable<IntType>::value>())){
+ ,containers_detail::bool_<boost::container::test::is_copyable<IntType>::value>())){
 return false;
 }

@@ -259,6 +259,7 @@
 return true;
}

+
int main ()
{
 if(!do_test<int>())

Modified: sandbox/move/libs/container/test/emplace_test.hpp
==============================================================================
--- sandbox/move/libs/container/test/emplace_test.hpp (original)
+++ sandbox/move/libs/container/test/emplace_test.hpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
@@ -70,6 +70,9 @@
 return os;
 }

+ ~EmplaceInt()
+ { a_ = b_ = c_ = d_ = e_ = 0; }
+
 //private:
 int sum() const
 { return this->a_ + this->b_ + this->c_ + this->d_ + this->e_; }
@@ -211,7 +214,7 @@
 c.emplace_front();
 if(!test_expected_container(c, &expected[0] + 5, 1))
 return false;
- c.emplace_front(1);
+ c.emplace_front(1);/*
 if(!test_expected_container(c, &expected[0] + 4, 2))
 return false;
 c.emplace_front(1, 2);
@@ -225,7 +228,7 @@
 return false;
 c.emplace_front(1, 2, 3, 4, 5);
 if(!test_expected_container(c, &expected[0] + 0, 6))
- return false;
+ return false;*/
 }
 return true;
}
@@ -594,10 +597,10 @@
template<class Container, EmplaceOptions O>
bool test_emplace()
{
- if(!test_emplace_back<Container>(emplace_active<O, EMPLACE_BACK>()))
- return false;
+// if(!test_emplace_back<Container>(emplace_active<O, EMPLACE_BACK>()))
+// return false;
 if(!test_emplace_front<Container>(emplace_active<O, EMPLACE_FRONT>()))
- return false;
+ return false;/*
 if(!test_emplace_before<Container>(emplace_active<O, EMPLACE_BEFORE>()))
 return false;
 if(!test_emplace_after<Container>(emplace_active<O, EMPLACE_AFTER>()))
@@ -609,7 +612,7 @@
 if(!test_emplace_assoc_pair<Container>(emplace_active<O, EMPLACE_ASSOC_PAIR>()))
 return false;
 if(!test_emplace_hint_pair<Container>(emplace_active<O, EMPLACE_HINT_PAIR>()))
- return false;
+ return false;*/
 return true;
}

Modified: sandbox/move/libs/container/test/flat_tree_test.cpp
==============================================================================
--- sandbox/move/libs/container/test/flat_tree_test.cpp (original)
+++ sandbox/move/libs/container/test/flat_tree_test.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
@@ -45,43 +45,43 @@
typedef std::map<int, int> MyStdMap;
typedef std::multimap<int, int> MyStdMultiMap;

-typedef flat_set<int, std::less<int>, allocator_t> MyShmSet;
-typedef flat_multiset<int, std::less<int>, allocator_t> MyShmMultiSet;
-typedef flat_map<int, int, std::less<int>, pair_allocator_t> MyShmMap;
-typedef flat_multimap<int, int, std::less<int>, pair_allocator_t> MyShmMultiMap;
+typedef flat_set<int, std::less<int>, allocator_t> MyBoostSet;
+typedef flat_multiset<int, std::less<int>, allocator_t> MyBoostMultiSet;
+typedef flat_map<int, int, std::less<int>, pair_allocator_t> MyBoostMap;
+typedef flat_multimap<int, int, std::less<int>, pair_allocator_t> MyBoostMultiMap;

typedef flat_set<test::movable_int, std::less<test::movable_int>
- ,movable_allocator_t> MyMovableShmSet;
+ ,movable_allocator_t> MyMovableBoostSet;
typedef flat_multiset<test::movable_int,std::less<test::movable_int>
- ,movable_allocator_t> MyMovableShmMultiSet;
+ ,movable_allocator_t> MyMovableBoostMultiSet;
typedef flat_map<test::movable_int, test::movable_int
 ,std::less<test::movable_int>
- ,movable_pair_allocator_t> MyMovableShmMap;
+ ,movable_pair_allocator_t> MyMovableBoostMap;
typedef flat_multimap<test::movable_int, test::movable_int
 ,std::less<test::movable_int>
- ,movable_pair_allocator_t> MyMovableShmMultiMap;
+ ,movable_pair_allocator_t> MyMovableBoostMultiMap;

typedef flat_set<test::movable_and_copyable_int, std::less<test::movable_and_copyable_int>
- ,move_copy_allocator_t> MyMoveCopyShmSet;
+ ,move_copy_allocator_t> MyMoveCopyBoostSet;
typedef flat_multiset<test::movable_and_copyable_int,std::less<test::movable_and_copyable_int>
- ,move_copy_allocator_t> MyMoveCopyShmMultiSet;
+ ,move_copy_allocator_t> MyMoveCopyBoostMultiSet;
typedef flat_map<test::movable_and_copyable_int, test::movable_and_copyable_int
 ,std::less<test::movable_and_copyable_int>
- ,move_copy_pair_allocator_t> MyMoveCopyShmMap;
+ ,move_copy_pair_allocator_t> MyMoveCopyBoostMap;
typedef flat_multimap<test::movable_and_copyable_int, test::movable_and_copyable_int
 ,std::less<test::movable_and_copyable_int>
- ,move_copy_pair_allocator_t> MyMoveCopyShmMultiMap;
+ ,move_copy_pair_allocator_t> MyMoveCopyBoostMultiMap;

typedef flat_set<test::copyable_int, std::less<test::copyable_int>
- ,copy_allocator_t> MyCopyShmSet;
+ ,copy_allocator_t> MyCopyBoostSet;
typedef flat_multiset<test::copyable_int,std::less<test::copyable_int>
- ,copy_allocator_t> MyCopyShmMultiSet;
+ ,copy_allocator_t> MyCopyBoostMultiSet;
typedef flat_map<test::copyable_int, test::copyable_int
 ,std::less<test::copyable_int>
- ,copy_pair_allocator_t> MyCopyShmMap;
+ ,copy_pair_allocator_t> MyCopyBoostMap;
typedef flat_multimap<test::copyable_int, test::copyable_int
 ,std::less<test::copyable_int>
- ,copy_pair_allocator_t> MyCopyShmMultiMap;
+ ,copy_pair_allocator_t> MyCopyBoostMultiMap;

@@ -192,127 +192,127 @@

 if (0 != set_test<
- MyShmSet
+ MyBoostSet
 ,MyStdSet
- ,MyShmMultiSet
+ ,MyBoostMultiSet
 ,MyStdMultiSet>()){
- std::cout << "Error in set_test<MyShmSet>" << std::endl;
+ std::cout << "Error in set_test<MyBoostSet>" << std::endl;
 return 1;
 }

 if (0 != set_test_copyable<
- MyShmSet
+ MyBoostSet
 ,MyStdSet
- ,MyShmMultiSet
+ ,MyBoostMultiSet
 ,MyStdMultiSet>()){
- std::cout << "Error in set_test<MyShmSet>" << std::endl;
+ std::cout << "Error in set_test<MyBoostSet>" << std::endl;
 return 1;
 }

 if (0 != set_test<
- MyMovableShmSet
+ MyMovableBoostSet
 ,MyStdSet
- ,MyMovableShmMultiSet
+ ,MyMovableBoostMultiSet
 ,MyStdMultiSet>()){
- std::cout << "Error in set_test<MyMovableShmSet>" << std::endl;
+ std::cout << "Error in set_test<MyMovableBoostSet>" << std::endl;
 return 1;
 }

 if (0 != set_test<
- MyMoveCopyShmSet
+ MyMoveCopyBoostSet
 ,MyStdSet
- ,MyMoveCopyShmMultiSet
+ ,MyMoveCopyBoostMultiSet
 ,MyStdMultiSet>()){
- std::cout << "Error in set_test<MyMoveCopyShmSet>" << std::endl;
+ std::cout << "Error in set_test<MyMoveCopyBoostSet>" << std::endl;
 return 1;
 }

 if (0 != set_test_copyable<
- MyMoveCopyShmSet
+ MyMoveCopyBoostSet
 ,MyStdSet
- ,MyMoveCopyShmMultiSet
+ ,MyMoveCopyBoostMultiSet
 ,MyStdMultiSet>()){
- std::cout << "Error in set_test<MyShmSet>" << std::endl;
+ std::cout << "Error in set_test<MyBoostSet>" << std::endl;
 return 1;
 }

 if (0 != set_test<
- MyCopyShmSet
+ MyCopyBoostSet
 ,MyStdSet
- ,MyCopyShmMultiSet
+ ,MyCopyBoostMultiSet
 ,MyStdMultiSet>()){
- std::cout << "Error in set_test<MyCopyShmSet>" << std::endl;
+ std::cout << "Error in set_test<MyCopyBoostSet>" << std::endl;
 return 1;
 }

 if (0 != set_test_copyable<
- MyCopyShmSet
+ MyCopyBoostSet
 ,MyStdSet
- ,MyCopyShmMultiSet
+ ,MyCopyBoostMultiSet
 ,MyStdMultiSet>()){
- std::cout << "Error in set_test<MyShmSet>" << std::endl;
+ std::cout << "Error in set_test<MyBoostSet>" << std::endl;
 return 1;
 }

 if (0 != map_test<
- MyShmMap
+ MyBoostMap
 ,MyStdMap
- ,MyShmMultiMap
+ ,MyBoostMultiMap
 ,MyStdMultiMap>()){
- std::cout << "Error in set_test<MyShmMap>" << std::endl;
+ std::cout << "Error in set_test<MyBoostMap>" << std::endl;
 return 1;
 }

 if (0 != map_test_copyable<
- MyShmMap
+ MyBoostMap
 ,MyStdMap
- ,MyShmMultiMap
+ ,MyBoostMultiMap
 ,MyStdMultiMap>()){
- std::cout << "Error in set_test<MyShmMap>" << std::endl;
+ std::cout << "Error in set_test<MyBoostMap>" << std::endl;
 return 1;
 }

// if (0 != map_test<
-// MyMovableShmMap
+// MyMovableBoostMap
// ,MyStdMap
-// ,MyMovableShmMultiMap
+// ,MyMovableBoostMultiMap
// ,MyStdMultiMap>()){
// return 1;
// }

 if (0 != map_test<
- MyMoveCopyShmMap
+ MyMoveCopyBoostMap
 ,MyStdMap
- ,MyMoveCopyShmMultiMap
+ ,MyMoveCopyBoostMultiMap
 ,MyStdMultiMap>()){
- std::cout << "Error in set_test<MyMoveCopyShmMap>" << std::endl;
+ std::cout << "Error in set_test<MyMoveCopyBoostMap>" << std::endl;
 return 1;
 }

 if (0 != map_test_copyable<
- MyMoveCopyShmMap
+ MyMoveCopyBoostMap
 ,MyStdMap
- ,MyMoveCopyShmMultiMap
+ ,MyMoveCopyBoostMultiMap
 ,MyStdMultiMap>()){
- std::cout << "Error in set_test<MyShmMap>" << std::endl;
+ std::cout << "Error in set_test<MyBoostMap>" << std::endl;
 return 1;
 }

 if (0 != map_test<
- MyCopyShmMap
+ MyCopyBoostMap
 ,MyStdMap
- ,MyCopyShmMultiMap
+ ,MyCopyBoostMultiMap
 ,MyStdMultiMap>()){
- std::cout << "Error in set_test<MyCopyShmMap>" << std::endl;
+ std::cout << "Error in set_test<MyCopyBoostMap>" << std::endl;
 return 1;
 }

 if (0 != map_test_copyable<
- MyCopyShmMap
+ MyCopyBoostMap
 ,MyStdMap
- ,MyCopyShmMultiMap
+ ,MyCopyBoostMultiMap
 ,MyStdMultiMap>()){
- std::cout << "Error in set_test<MyShmMap>" << std::endl;
+ std::cout << "Error in set_test<MyBoostMap>" << std::endl;
 return 1;
 }

Modified: sandbox/move/libs/container/test/list_test.cpp
==============================================================================
--- sandbox/move/libs/container/test/list_test.cpp (original)
+++ sandbox/move/libs/container/test/list_test.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
@@ -11,8 +11,8 @@
#include <boost/container/detail/config_begin.hpp>
#include <boost/container/list.hpp>
#include "dummy_test_allocator.hpp"
-#include "list_test.hpp"
#include "movable_int.hpp"
+#include "list_test.hpp"
#include "emplace_test.hpp"

using namespace boost::container;

Modified: sandbox/move/libs/container/test/list_test.hpp
==============================================================================
--- sandbox/move/libs/container/test/list_test.hpp (original)
+++ sandbox/move/libs/container/test/list_test.hpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
@@ -33,40 +33,40 @@

//Function to check if both sets are equal
template<class V1, class V2>
-bool list_copyable_only(V1 *shmlist, V2 *stdlist, boost::container::containers_detail::true_type)
+bool list_copyable_only(V1 *boostlist, V2 *stdlist, boost::container::containers_detail::true_type)
{
 typedef typename V1::value_type IntType;
- shmlist->insert(shmlist->end(), 50, IntType(1));
+ boostlist->insert(boostlist->end(), 50, IntType(1));
 stdlist->insert(stdlist->end(), 50, 1);
- if(!test::CheckEqualContainers(shmlist, stdlist)) return false;
+ if(!test::CheckEqualContainers(boostlist, stdlist)) return false;

 {
 IntType move_me(1);
- shmlist->insert(shmlist->begin(), 50, boost::move(move_me));
+ boostlist->insert(boostlist->begin(), 50, boost::move(move_me));
 stdlist->insert(stdlist->begin(), 50, 1);
- if(!test::CheckEqualContainers(shmlist, stdlist)) return false;
+ if(!test::CheckEqualContainers(boostlist, stdlist)) return false;
 }
 {
 IntType move_me(2);
- shmlist->assign(shmlist->size()/2, boost::move(move_me));
+ boostlist->assign(boostlist->size()/2, boost::move(move_me));
 stdlist->assign(stdlist->size()/2, 2);
- if(!test::CheckEqualContainers(shmlist, stdlist)) return false;
+ if(!test::CheckEqualContainers(boostlist, stdlist)) return false;
 }
 {
 IntType move_me(3);
- shmlist->assign(shmlist->size()*3-1, boost::move(move_me));
+ boostlist->assign(boostlist->size()*3-1, boost::move(move_me));
 stdlist->assign(stdlist->size()*3-1, 3);
- if(!test::CheckEqualContainers(shmlist, stdlist)) return false;
+ if(!test::CheckEqualContainers(boostlist, stdlist)) return false;
 }

 {
 IntType copy_me(3);
 const IntType ccopy_me(3);
- shmlist->push_front(copy_me);
+ boostlist->push_front(copy_me);
 stdlist->push_front(int(3));
- shmlist->push_front(ccopy_me);
+ boostlist->push_front(ccopy_me);
 stdlist->push_front(int(3));
- if(!test::CheckEqualContainers(shmlist, stdlist)) return false;
+ if(!test::CheckEqualContainers(boostlist, stdlist)) return false;
 }

 return true;
@@ -75,18 +75,18 @@
template<bool DoublyLinked>
struct list_push_data_function
{
- template<class MyShmList, class MyStdList>
- static int execute(int max, MyShmList *shmlist, MyStdList *stdlist)
+ template<class MyBoostList, class MyStdList>
+ static int execute(int max, MyBoostList *boostlist, MyStdList *stdlist)
 {
- typedef typename MyShmList::value_type IntType;
+ typedef typename MyBoostList::value_type IntType;
 for(int i = 0; i < max; ++i){
 IntType move_me(i);
- shmlist->push_back(boost::move(move_me));
+ boostlist->push_back(boost::move(move_me));
 stdlist->push_back(i);
- shmlist->push_front(IntType(i));
+ boostlist->push_front(IntType(i));
 stdlist->push_front(int(i));
 }
- if(!CheckEqualContainers(shmlist, stdlist))
+ if(!CheckEqualContainers(boostlist, stdlist))
 return 1;
 return 0;
 }
@@ -95,18 +95,18 @@
template<>
struct list_push_data_function<false>
{
- template<class MyShmList, class MyStdList>
- static int execute(int max, MyShmList *shmlist, MyStdList *stdlist)
+ template<class MyBoostList, class MyStdList>
+ static int execute(int max, MyBoostList *boostlist, MyStdList *stdlist)
 {
- typedef typename MyShmList::value_type IntType;
+ typedef typename MyBoostList::value_type IntType;
 for(int i = 0; i < max; ++i){
 IntType move_me(i);
- shmlist->push_front(boost::move(move_me));
+ boostlist->push_front(boost::move(move_me));
 stdlist->push_front(i);
- shmlist->push_front(IntType(i));
+ boostlist->push_front(IntType(i));
 stdlist->push_front(int(i));
 }
- if(!CheckEqualContainers(shmlist, stdlist))
+ if(!CheckEqualContainers(boostlist, stdlist))
 return 1;
 return 0;
 }
@@ -115,12 +115,12 @@
template<bool DoublyLinked>
struct list_pop_back_function
{
- template<class MyStdList, class MyShmList>
- static int execute(MyShmList *shmlist, MyStdList *stdlist)
+ template<class MyStdList, class MyBoostList>
+ static int execute(MyBoostList *boostlist, MyStdList *stdlist)
 {
- shmlist->pop_back();
+ boostlist->pop_back();
 stdlist->pop_back();
- if(!CheckEqualContainers(shmlist, stdlist))
+ if(!CheckEqualContainers(boostlist, stdlist))
 return 1;
 return 0;
 }
@@ -129,42 +129,42 @@
template<>
struct list_pop_back_function<false>
{
- template<class MyStdList, class MyShmList>
- static int execute(MyShmList *shmlist, MyStdList *stdlist)
+ template<class MyStdList, class MyBoostList>
+ static int execute(MyBoostList *boostlist, MyStdList *stdlist)
 {
- (void)shmlist; (void)stdlist;
+ (void)boostlist; (void)stdlist;
 return 0;
 }
};

-template<class MyShmList
+template<class MyBoostList
 ,bool DoublyLinked>
int list_test (bool copied_allocators_equal = true)
{
 typedef std::list<int> MyStdList;
- typedef typename MyShmList::value_type IntType;
+ typedef typename MyBoostList::value_type IntType;
 const int max = 100;
 typedef list_push_data_function<DoublyLinked> push_data_t;

 try{
- MyShmList *shmlist = new MyShmList;
+ MyBoostList *boostlist = new MyBoostList;
 MyStdList *stdlist = new MyStdList;

- if(push_data_t::execute(max, shmlist, stdlist)){
+ if(push_data_t::execute(max, boostlist, stdlist)){
 return 1;
 }

- shmlist->erase(shmlist->begin()++);
+ boostlist->erase(boostlist->begin()++);
 stdlist->erase(stdlist->begin()++);
- if(!CheckEqualContainers(shmlist, stdlist)) return 1;
+ if(!CheckEqualContainers(boostlist, stdlist)) return 1;

- if(list_pop_back_function<DoublyLinked>::execute(shmlist, stdlist)){
+ if(list_pop_back_function<DoublyLinked>::execute(boostlist, stdlist)){
 return 1;
 }

- shmlist->pop_front();
+ boostlist->pop_front();
 stdlist->pop_front();
- if(!CheckEqualContainers(shmlist, stdlist)) return 1;
+ if(!CheckEqualContainers(boostlist, stdlist)) return 1;

 {
 IntType aux_vect[50];
@@ -176,25 +176,25 @@
 for(int i = 0; i < 50; ++i){
 aux_vect2[i] = -1;
 }
- shmlist->assign(boost::make_move_iterator(&aux_vect[0])
+ boostlist->assign(boost::make_move_iterator(&aux_vect[0])
 ,boost::make_move_iterator(&aux_vect[50]));
 stdlist->assign(&aux_vect2[0], &aux_vect2[50]);
- if(!CheckEqualContainers(shmlist, stdlist)) return 1;
+ if(!CheckEqualContainers(boostlist, stdlist)) return 1;
 }

 if(copied_allocators_equal){
- shmlist->sort();
+ boostlist->sort();
 stdlist->sort();
- if(!CheckEqualContainers(shmlist, stdlist)) return 1;
+ if(!CheckEqualContainers(boostlist, stdlist)) return 1;
 }

- shmlist->reverse();
+ boostlist->reverse();
 stdlist->reverse();
- if(!CheckEqualContainers(shmlist, stdlist)) return 1;
+ if(!CheckEqualContainers(boostlist, stdlist)) return 1;

- shmlist->reverse();
+ boostlist->reverse();
 stdlist->reverse();
- if(!CheckEqualContainers(shmlist, stdlist)) return 1;
+ if(!CheckEqualContainers(boostlist, stdlist)) return 1;

 {
 IntType aux_vect[50];
@@ -206,95 +206,95 @@
 for(int i = 0; i < 50; ++i){
 aux_vect2[i] = -1;
 }
- shmlist->insert(shmlist->begin()
+ boostlist->insert(boostlist->begin()
 ,boost::make_move_iterator(&aux_vect[0])
 ,boost::make_move_iterator(&aux_vect[50]));
 stdlist->insert(stdlist->begin(), &aux_vect2[0], &aux_vect2[50]);
 }

- shmlist->unique();
+ boostlist->unique();
 stdlist->unique();
- if(!CheckEqualContainers(shmlist, stdlist))
+ if(!CheckEqualContainers(boostlist, stdlist))
 return 1;

 if(copied_allocators_equal){
- shmlist->sort(std::greater<IntType>());
+ boostlist->sort(std::greater<IntType>());
 stdlist->sort(std::greater<int>());
- if(!CheckEqualContainers(shmlist, stdlist))
+ if(!CheckEqualContainers(boostlist, stdlist))
 return 1;
 }

 for(int i = 0; i < max; ++i){
 IntType new_int(i);
- shmlist->insert(shmlist->end(), boost::move(new_int));
+ boostlist->insert(boostlist->end(), boost::move(new_int));
 stdlist->insert(stdlist->end(), i);
- if(!test::CheckEqualContainers(shmlist, stdlist)) return 1;
+ if(!test::CheckEqualContainers(boostlist, stdlist)) return 1;
 }
- if(!test::CheckEqualContainers(shmlist, stdlist)) return 1;
+ if(!test::CheckEqualContainers(boostlist, stdlist)) return 1;

- shmlist->resize(25);
+ boostlist->resize(25);
 stdlist->resize(25);
- shmlist->resize(50);
+ boostlist->resize(50);
 stdlist->resize(50);
- shmlist->resize(0);
+ boostlist->resize(0);
 stdlist->resize(0);
- if(!CheckEqualContainers(shmlist, stdlist))
+ if(!CheckEqualContainers(boostlist, stdlist))
 return 1;

- if(push_data_t::execute(max, shmlist, stdlist)){
+ if(push_data_t::execute(max, boostlist, stdlist)){
 return 1;
 }
 {
- MyShmList othershmlist(shmlist->get_allocator());
+ MyBoostList otherboostlist(boostlist->get_allocator());
 MyStdList otherstdlist;

- int listsize = (int)shmlist->size();
+ int listsize = (int)boostlist->size();

- if(push_data_t::execute(listsize, shmlist, stdlist)){
+ if(push_data_t::execute(listsize, boostlist, stdlist)){
 return 1;
 }

 if(copied_allocators_equal){
- shmlist->splice(shmlist->begin(), othershmlist);
+ boostlist->splice(boostlist->begin(), otherboostlist);
 stdlist->splice(stdlist->begin(), otherstdlist);
- if(!CheckEqualContainers(shmlist, stdlist))
+ if(!CheckEqualContainers(boostlist, stdlist))
 return 1;
 }

- listsize = (int)shmlist->size();
+ listsize = (int)boostlist->size();

- if(push_data_t::execute(listsize, shmlist, stdlist)){
+ if(push_data_t::execute(listsize, boostlist, stdlist)){
 return 1;
 }

- if(push_data_t::execute(listsize, &othershmlist, &otherstdlist)){
+ if(push_data_t::execute(listsize, &otherboostlist, &otherstdlist)){
 return 1;
 }

 if(copied_allocators_equal){
- shmlist->sort(std::greater<IntType>());
+ boostlist->sort(std::greater<IntType>());
 stdlist->sort(std::greater<int>());
- if(!CheckEqualContainers(shmlist, stdlist))
+ if(!CheckEqualContainers(boostlist, stdlist))
 return 1;

- othershmlist.sort(std::greater<IntType>());
+ otherboostlist.sort(std::greater<IntType>());
 otherstdlist.sort(std::greater<int>());
- if(!CheckEqualContainers(&othershmlist, &otherstdlist))
+ if(!CheckEqualContainers(&otherboostlist, &otherstdlist))
 return 1;

- shmlist->merge(othershmlist, std::greater<IntType>());
+ boostlist->merge(otherboostlist, std::greater<IntType>());
 stdlist->merge(otherstdlist, std::greater<int>());
- if(!CheckEqualContainers(shmlist, stdlist))
+ if(!CheckEqualContainers(boostlist, stdlist))
 return 1;
 }

- if(!list_copyable_only(shmlist, stdlist
- ,containers_detail::bool_<!is_movable<IntType>::value>())){
+ if(!list_copyable_only(boostlist, stdlist
+ ,containers_detail::bool_<boost::container::test::is_copyable<IntType>::value>())){
 return 1;
 }
 }

- delete shmlist;
+ delete boostlist;
 delete stdlist;
 }
 catch(...){

Modified: sandbox/move/libs/container/test/map_test.hpp
==============================================================================
--- sandbox/move/libs/container/test/map_test.hpp (original)
+++ sandbox/move/libs/container/test/map_test.hpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
@@ -31,21 +31,21 @@
namespace container {
namespace test{

-template<class MyShmMap
+template<class MyBoostMap
 ,class MyStdMap
- ,class MyShmMultiMap
+ ,class MyBoostMultiMap
 ,class MyStdMultiMap>
int map_test ()
{
- typedef typename MyShmMap::key_type IntType;
+ typedef typename MyBoostMap::key_type IntType;
 typedef containers_detail::pair<IntType, IntType> IntPairType;
 typedef typename MyStdMap::value_type StdPairType;
 const int max = 100;

 try{
- MyShmMap *shmmap = new MyShmMap;
+ MyBoostMap *boostmap = new MyBoostMap;
 MyStdMap *stdmap = new MyStdMap;
- MyShmMultiMap *shmmultimap = new MyShmMultiMap;
+ MyBoostMultiMap *boostmultimap = new MyBoostMultiMap;
 MyStdMultiMap *stdmultimap = new MyStdMultiMap;

 //Test construction from a range
@@ -73,16 +73,16 @@
 new(&aux_vect3[i])IntPairType(boost::move(i1), boost::move(i2));
 }

- MyShmMap *shmmap2 = new MyShmMap
+ MyBoostMap *boostmap2 = new MyBoostMap
 ( boost::make_move_iterator(&aux_vect[0])
 , boost::make_move_iterator(aux_vect + 50));
 MyStdMap *stdmap2 = new MyStdMap(aux_vect2, aux_vect2 + 50);
- MyShmMultiMap *shmmultimap2 = new MyShmMultiMap
+ MyBoostMultiMap *boostmultimap2 = new MyBoostMultiMap
 ( boost::make_move_iterator(&aux_vect3[0])
 , boost::make_move_iterator(aux_vect3 + 50));
 MyStdMultiMap *stdmultimap2 = new MyStdMultiMap(aux_vect2, aux_vect2 + 50);
- if(!CheckEqualContainers(shmmap2, stdmap2)) return 1;
- if(!CheckEqualContainers(shmmultimap2, stdmultimap2)) return 1;
+ if(!CheckEqualContainers(boostmap2, stdmap2)) return 1;
+ if(!CheckEqualContainers(boostmultimap2, stdmultimap2)) return 1;

 //ordered range insertion
 //This is really nasty, but we have no other simple choice
@@ -102,32 +102,32 @@
 new(&aux_vect3[i])IntPairType(boost::move(i1), boost::move(i2));
 }
/*
- MyShmMap *shmmap3 = new MyShmMap
+ MyBoostMap *boostmap3 = new MyBoostMap
 ( ordered_unique_range
 , boost::make_move_iterator(&aux_vect[0])
 , boost::make_move_iterator(aux_vect + 50));
 MyStdMap *stdmap3 = new MyStdMap(aux_vect2, aux_vect2 + 50);
- MyShmMultiMap *shmmultimap3 = new MyShmMultiMap
+ MyBoostMultiMap *boostmultimap3 = new MyBoostMultiMap
 ( ordered_range
 , boost::make_move_iterator(&aux_vect3[0])
 , boost::make_move_iterator(aux_vect3 + 50));
 MyStdMultiMap *stdmultimap3 = new MyStdMultiMap(aux_vect2, aux_vect2 + 50);

- if(!CheckEqualContainers(shmmap3, stdmap3)){
- std::cout << "Error in construct<MyShmMap>(MyShmMap3)" << std::endl;
+ if(!CheckEqualContainers(boostmap3, stdmap3)){
+ std::cout << "Error in construct<MyBoostMap>(MyBoostMap3)" << std::endl;
 return 1;
 }
- if(!CheckEqualContainers(shmmultimap3, stdmultimap3)){
- std::cout << "Error in construct<MyShmMultiMap>(MyShmMultiMap3)" << std::endl;
+ if(!CheckEqualContainers(boostmultimap3, stdmultimap3)){
+ std::cout << "Error in construct<MyBoostMultiMap>(MyBoostMultiMap3)" << std::endl;
 return 1;
 }
*/
- delete shmmap2;
- delete shmmultimap2;
+ delete boostmap2;
+ delete boostmultimap2;
 delete stdmap2;
 delete stdmultimap2;
- //delete shmmap3;
- //delete shmmultimap3;
+ //delete boostmap3;
+ //delete boostmultimap3;
 //delete stdmap3;
 //delete stdmultimap3;
 }
@@ -147,47 +147,47 @@
 }

 for(int i = 0; i < max; ++i){
- shmmap->insert(boost::move(aux_vect[i]));
+ boostmap->insert(boost::move(aux_vect[i]));
 stdmap->insert(StdPairType(i, i));
- shmmultimap->insert(boost::move(aux_vect3[i]));
+ boostmultimap->insert(boost::move(aux_vect3[i]));
 stdmultimap->insert(StdPairType(i, i));
 }

- if(!CheckEqualPairContainers(shmmap, stdmap)) return 1;
- if(!CheckEqualPairContainers(shmmultimap, stdmultimap)) return 1;
+ if(!CheckEqualPairContainers(boostmap, stdmap)) return 1;
+ if(!CheckEqualPairContainers(boostmultimap, stdmultimap)) return 1;

- typename MyShmMap::iterator it;
- typename MyShmMap::const_iterator cit = it;
+ typename MyBoostMap::iterator it;
+ typename MyBoostMap::const_iterator cit = it;

- shmmap->erase(shmmap->begin()++);
+ boostmap->erase(boostmap->begin()++);
 stdmap->erase(stdmap->begin()++);
- shmmultimap->erase(shmmultimap->begin()++);
+ boostmultimap->erase(boostmultimap->begin()++);
 stdmultimap->erase(stdmultimap->begin()++);
- if(!CheckEqualPairContainers(shmmap, stdmap)) return 1;
- if(!CheckEqualPairContainers(shmmultimap, stdmultimap)) return 1;
+ if(!CheckEqualPairContainers(boostmap, stdmap)) return 1;
+ if(!CheckEqualPairContainers(boostmultimap, stdmultimap)) return 1;

- shmmap->erase(shmmap->begin());
+ boostmap->erase(boostmap->begin());
 stdmap->erase(stdmap->begin());
- shmmultimap->erase(shmmultimap->begin());
+ boostmultimap->erase(boostmultimap->begin());
 stdmultimap->erase(stdmultimap->begin());
- if(!CheckEqualPairContainers(shmmap, stdmap)) return 1;
- if(!CheckEqualPairContainers(shmmultimap, stdmultimap)) return 1;
+ if(!CheckEqualPairContainers(boostmap, stdmap)) return 1;
+ if(!CheckEqualPairContainers(boostmultimap, stdmultimap)) return 1;

 //Swapping test
- MyShmMap tmpshmemap2;
+ MyBoostMap tmpboostemap2;
 MyStdMap tmpstdmap2;
- MyShmMultiMap tmpshmemultimap2;
+ MyBoostMultiMap tmpboostemultimap2;
 MyStdMultiMap tmpstdmultimap2;
- shmmap->swap(tmpshmemap2);
+ boostmap->swap(tmpboostemap2);
 stdmap->swap(tmpstdmap2);
- shmmultimap->swap(tmpshmemultimap2);
+ boostmultimap->swap(tmpboostemultimap2);
 stdmultimap->swap(tmpstdmultimap2);
- shmmap->swap(tmpshmemap2);
+ boostmap->swap(tmpboostemap2);
 stdmap->swap(tmpstdmap2);
- shmmultimap->swap(tmpshmemultimap2);
+ boostmultimap->swap(tmpboostemultimap2);
 stdmultimap->swap(tmpstdmultimap2);
- if(!CheckEqualPairContainers(shmmap, stdmap)) return 1;
- if(!CheckEqualPairContainers(shmmultimap, stdmultimap)) return 1;
+ if(!CheckEqualPairContainers(boostmap, stdmap)) return 1;
+ if(!CheckEqualPairContainers(boostmultimap, stdmultimap)) return 1;
 }
 //Insertion from other container
 //Initialize values
@@ -206,24 +206,24 @@
 new(&aux_vect3[i])IntPairType(boost::move(i1), boost::move(i2));
 }

- shmmap->insert(boost::make_move_iterator(&aux_vect[0]), boost::make_move_iterator(aux_vect + 50));
- shmmultimap->insert(boost::make_move_iterator(&aux_vect3[0]), boost::make_move_iterator(aux_vect3 + 50));
+ boostmap->insert(boost::make_move_iterator(&aux_vect[0]), boost::make_move_iterator(aux_vect + 50));
+ boostmultimap->insert(boost::make_move_iterator(&aux_vect3[0]), boost::make_move_iterator(aux_vect3 + 50));
 for(std::size_t i = 0; i != 50; ++i){
 StdPairType stdpairtype(-1, -1);
 stdmap->insert(stdpairtype);
 stdmultimap->insert(stdpairtype);
 }
- if(!CheckEqualPairContainers(shmmap, stdmap)) return 1;
- if(!CheckEqualPairContainers(shmmultimap, stdmultimap)) return 1;
+ if(!CheckEqualPairContainers(boostmap, stdmap)) return 1;
+ if(!CheckEqualPairContainers(boostmultimap, stdmultimap)) return 1;

- for(int i = 0, j = static_cast<int>(shmmap->size()); i < j; ++i){
- shmmap->erase(IntType(i));
+ for(int i = 0, j = static_cast<int>(boostmap->size()); i < j; ++i){
+ boostmap->erase(IntType(i));
 stdmap->erase(i);
- shmmultimap->erase(IntType(i));
+ boostmultimap->erase(IntType(i));
 stdmultimap->erase(i);
 }
- if(!CheckEqualPairContainers(shmmap, stdmap)) return 1;
- if(!CheckEqualPairContainers(shmmultimap, stdmultimap)) return 1;
+ if(!CheckEqualPairContainers(boostmap, stdmap)) return 1;
+ if(!CheckEqualPairContainers(boostmultimap, stdmultimap)) return 1;
 }
 {
 IntPairType aux_vect[50];
@@ -254,10 +254,10 @@
 new(&aux_vect5[i])IntPairType(boost::move(i1), boost::move(i2));
 }

- shmmap->insert(boost::make_move_iterator(&aux_vect[0]), boost::make_move_iterator(aux_vect + 50));
- shmmap->insert(boost::make_move_iterator(&aux_vect3[0]), boost::make_move_iterator(aux_vect3 + 50));
- shmmultimap->insert(boost::make_move_iterator(&aux_vect4[0]), boost::make_move_iterator(aux_vect4 + 50));
- shmmultimap->insert(boost::make_move_iterator(&aux_vect5[0]), boost::make_move_iterator(aux_vect5 + 50));
+ boostmap->insert(boost::make_move_iterator(&aux_vect[0]), boost::make_move_iterator(aux_vect + 50));
+ boostmap->insert(boost::make_move_iterator(&aux_vect3[0]), boost::make_move_iterator(aux_vect3 + 50));
+ boostmultimap->insert(boost::make_move_iterator(&aux_vect4[0]), boost::make_move_iterator(aux_vect4 + 50));
+ boostmultimap->insert(boost::make_move_iterator(&aux_vect5[0]), boost::make_move_iterator(aux_vect5 + 50));

 for(std::size_t i = 0; i != 50; ++i){
 StdPairType stdpairtype(-1, -1);
@@ -266,15 +266,15 @@
 stdmap->insert(stdpairtype);
 stdmultimap->insert(stdpairtype);
 }
- if(!CheckEqualPairContainers(shmmap, stdmap)) return 1;
- if(!CheckEqualPairContainers(shmmultimap, stdmultimap)) return 1;
+ if(!CheckEqualPairContainers(boostmap, stdmap)) return 1;
+ if(!CheckEqualPairContainers(boostmultimap, stdmultimap)) return 1;

- shmmap->erase(shmmap->begin()->first);
+ boostmap->erase(boostmap->begin()->first);
 stdmap->erase(stdmap->begin()->first);
- shmmultimap->erase(shmmultimap->begin()->first);
+ boostmultimap->erase(boostmultimap->begin()->first);
 stdmultimap->erase(stdmultimap->begin()->first);
- if(!CheckEqualPairContainers(shmmap, stdmap)) return 1;
- if(!CheckEqualPairContainers(shmmultimap, stdmultimap)) return 1;
+ if(!CheckEqualPairContainers(boostmap, stdmap)) return 1;
+ if(!CheckEqualPairContainers(boostmultimap, stdmultimap)) return 1;
 }

 {
@@ -293,14 +293,14 @@
 }

 for(int i = 0; i < max; ++i){
- shmmap->insert(boost::move(aux_vect[i]));
+ boostmap->insert(boost::move(aux_vect[i]));
 stdmap->insert(StdPairType(i, i));
- shmmultimap->insert(boost::move(aux_vect3[i]));
+ boostmultimap->insert(boost::move(aux_vect3[i]));
 stdmultimap->insert(StdPairType(i, i));
 }

- if(!CheckEqualPairContainers(shmmap, stdmap)) return 1;
- if(!CheckEqualPairContainers(shmmultimap, stdmultimap)) return 1;
+ if(!CheckEqualPairContainers(boostmap, stdmap)) return 1;
+ if(!CheckEqualPairContainers(boostmultimap, stdmultimap)) return 1;

 for(int i = 0; i < max; ++i){
 IntPairType intpair;
@@ -309,47 +309,47 @@
 IntType i2(i);
 new(&intpair)IntPairType(boost::move(i1), boost::move(i2));
 }
- shmmap->insert(shmmap->begin(), boost::move(intpair));
+ boostmap->insert(boostmap->begin(), boost::move(intpair));
 stdmap->insert(stdmap->begin(), StdPairType(i, i));
- //PrintContainers(shmmap, stdmap);
+ //PrintContainers(boostmap, stdmap);
 {
 IntType i1(i);
 IntType i2(i);
 new(&intpair)IntPairType(boost::move(i1), boost::move(i2));
 }
- shmmultimap->insert(shmmultimap->begin(), boost::move(intpair));
+ boostmultimap->insert(boostmultimap->begin(), boost::move(intpair));
 stdmultimap->insert(stdmultimap->begin(), StdPairType(i, i));
- //PrintContainers(shmmultimap, stdmultimap);
- if(!CheckEqualPairContainers(shmmap, stdmap))
+ //PrintContainers(boostmultimap, stdmultimap);
+ if(!CheckEqualPairContainers(boostmap, stdmap))
 return 1;
- if(!CheckEqualPairContainers(shmmultimap, stdmultimap))
+ if(!CheckEqualPairContainers(boostmultimap, stdmultimap))
 return 1;
 {
 IntType i1(i);
 IntType i2(i);
 new(&intpair)IntPairType(boost::move(i1), boost::move(i2));
 }
- shmmap->insert(shmmap->end(), boost::move(intpair));
+ boostmap->insert(boostmap->end(), boost::move(intpair));
 stdmap->insert(stdmap->end(), StdPairType(i, i));
 {
 IntType i1(i);
 IntType i2(i);
 new(&intpair)IntPairType(boost::move(i1), boost::move(i2));
 }
- shmmultimap->insert(shmmultimap->end(), boost::move(intpair));
+ boostmultimap->insert(boostmultimap->end(), boost::move(intpair));
 stdmultimap->insert(stdmultimap->end(), StdPairType(i, i));
- if(!CheckEqualPairContainers(shmmap, stdmap))
+ if(!CheckEqualPairContainers(boostmap, stdmap))
 return 1;
- if(!CheckEqualPairContainers(shmmultimap, stdmultimap))
+ if(!CheckEqualPairContainers(boostmultimap, stdmultimap))
 return 1;
 {
 IntType i1(i);
 IntType i2(i);
 new(&intpair)IntPairType(boost::move(i1), boost::move(i2));
 }
- shmmap->insert(shmmap->lower_bound(IntType(i)), boost::move(intpair));
+ boostmap->insert(boostmap->lower_bound(IntType(i)), boost::move(intpair));
 stdmap->insert(stdmap->lower_bound(i), StdPairType(i, i));
- //PrintContainers(shmmap, stdmap);
+ //PrintContainers(boostmap, stdmap);
 {
 IntType i1(i);
 IntType i2(i);
@@ -357,14 +357,14 @@
 }
 {
 IntType i1(i);
- shmmultimap->insert(shmmultimap->lower_bound(boost::move(i1)), boost::move(intpair));
+ boostmultimap->insert(boostmultimap->lower_bound(boost::move(i1)), boost::move(intpair));
 stdmultimap->insert(stdmultimap->lower_bound(i), StdPairType(i, i));
 }

- //PrintContainers(shmmultimap, stdmultimap);
- if(!CheckEqualPairContainers(shmmap, stdmap))
+ //PrintContainers(boostmultimap, stdmultimap);
+ if(!CheckEqualPairContainers(boostmap, stdmap))
 return 1;
- if(!CheckEqualPairContainers(shmmultimap, stdmultimap))
+ if(!CheckEqualPairContainers(boostmultimap, stdmultimap))
 return 1;
 {
 IntType i1(i);
@@ -373,10 +373,10 @@
 }
 {
 IntType i1(i);
- shmmap->insert(shmmap->upper_bound(boost::move(i1)), boost::move(intpair));
+ boostmap->insert(boostmap->upper_bound(boost::move(i1)), boost::move(intpair));
 stdmap->insert(stdmap->upper_bound(i), StdPairType(i, i));
 }
- //PrintContainers(shmmap, stdmap);
+ //PrintContainers(boostmap, stdmap);
 {
 IntType i1(i);
 IntType i2(i);
@@ -384,32 +384,32 @@
 }
 {
 IntType i1(i);
- shmmultimap->insert(shmmultimap->upper_bound(boost::move(i1)), boost::move(intpair));
+ boostmultimap->insert(boostmultimap->upper_bound(boost::move(i1)), boost::move(intpair));
 stdmultimap->insert(stdmultimap->upper_bound(i), StdPairType(i, i));
 }
- //PrintContainers(shmmultimap, stdmultimap);
- if(!CheckEqualPairContainers(shmmap, stdmap))
+ //PrintContainers(boostmultimap, stdmultimap);
+ if(!CheckEqualPairContainers(boostmap, stdmap))
 return 1;
- if(!CheckEqualPairContainers(shmmultimap, stdmultimap))
+ if(!CheckEqualPairContainers(boostmultimap, stdmultimap))
 return 1;
 }

 //Compare count with std containers
 for(int i = 0; i < max; ++i){
- if(shmmap->count(IntType(i)) != stdmap->count(i)){
+ if(boostmap->count(IntType(i)) != stdmap->count(i)){
 return -1;
 }

- if(shmmultimap->count(IntType(i)) != stdmultimap->count(i)){
+ if(boostmultimap->count(IntType(i)) != stdmultimap->count(i)){
 return -1;
 }
 }

 //Now do count exercise
- shmmap->erase(shmmap->begin(), shmmap->end());
- shmmultimap->erase(shmmultimap->begin(), shmmultimap->end());
- shmmap->clear();
- shmmultimap->clear();
+ boostmap->erase(boostmap->begin(), boostmap->end());
+ boostmultimap->erase(boostmultimap->begin(), boostmultimap->end());
+ boostmap->clear();
+ boostmultimap->clear();

 for(int j = 0; j < 3; ++j)
 for(int i = 0; i < 100; ++i){
@@ -418,22 +418,22 @@
 IntType i1(i), i2(i);
 new(&intpair)IntPairType(boost::move(i1), boost::move(i2));
 }
- shmmap->insert(boost::move(intpair));
+ boostmap->insert(boost::move(intpair));
 {
 IntType i1(i), i2(i);
 new(&intpair)IntPairType(boost::move(i1), boost::move(i2));
 }
- shmmultimap->insert(boost::move(intpair));
- if(shmmap->count(IntType(i)) != typename MyShmMultiMap::size_type(1))
+ boostmultimap->insert(boost::move(intpair));
+ if(boostmap->count(IntType(i)) != typename MyBoostMultiMap::size_type(1))
 return 1;
- if(shmmultimap->count(IntType(i)) != typename MyShmMultiMap::size_type(j+1))
+ if(boostmultimap->count(IntType(i)) != typename MyBoostMultiMap::size_type(j+1))
 return 1;
 }
 }

- delete shmmap;
+ delete boostmap;
 delete stdmap;
- delete shmmultimap;
+ delete boostmultimap;
 delete stdmultimap;
 }
 catch(...){
@@ -442,22 +442,22 @@
 return 0;
}

-template<class MyShmMap
+template<class MyBoostMap
 ,class MyStdMap
- ,class MyShmMultiMap
+ ,class MyBoostMultiMap
 ,class MyStdMultiMap>
int map_test_copyable ()
{
- typedef typename MyShmMap::key_type IntType;
+ typedef typename MyBoostMap::key_type IntType;
 typedef containers_detail::pair<IntType, IntType> IntPairType;
 typedef typename MyStdMap::value_type StdPairType;

 const int max = 100;

 try{
- MyShmMap *shmmap = new MyShmMap;
+ MyBoostMap *boostmap = new MyBoostMap;
 MyStdMap *stdmap = new MyStdMap;
- MyShmMultiMap *shmmultimap = new MyShmMultiMap;
+ MyBoostMultiMap *boostmultimap = new MyBoostMultiMap;
 MyStdMultiMap *stdmultimap = new MyStdMultiMap;

 int i;
@@ -465,43 +465,43 @@
 {
 IntType i1(i), i2(i);
 IntPairType intpair1(boost::move(i1), boost::move(i2));
- shmmap->insert(boost::move(intpair1));
+ boostmap->insert(boost::move(intpair1));
 stdmap->insert(StdPairType(i, i));
 }
 {
 IntType i1(i), i2(i);
 IntPairType intpair2(boost::move(i1), boost::move(i2));
- shmmultimap->insert(boost::move(intpair2));
+ boostmultimap->insert(boost::move(intpair2));
 stdmultimap->insert(StdPairType(i, i));
 }
 }
- if(!CheckEqualContainers(shmmap, stdmap)) return 1;
- if(!CheckEqualContainers(shmmultimap, stdmultimap)) return 1;
+ if(!CheckEqualContainers(boostmap, stdmap)) return 1;
+ if(!CheckEqualContainers(boostmultimap, stdmultimap)) return 1;

 {
 //Now, test copy constructor
- MyShmMap shmmapcopy(*shmmap);
+ MyBoostMap boostmapcopy(*boostmap);
 MyStdMap stdmapcopy(*stdmap);
- MyShmMultiMap shmmmapcopy(*shmmultimap);
+ MyBoostMultiMap boostmmapcopy(*boostmultimap);
 MyStdMultiMap stdmmapcopy(*stdmultimap);

- if(!CheckEqualContainers(&shmmapcopy, &stdmapcopy))
+ if(!CheckEqualContainers(&boostmapcopy, &stdmapcopy))
 return 1;
- if(!CheckEqualContainers(&shmmmapcopy, &stdmmapcopy))
+ if(!CheckEqualContainers(&boostmmapcopy, &stdmmapcopy))
 return 1;

 //And now assignment
- shmmapcopy = *shmmap;
+ boostmapcopy = *boostmap;
 stdmapcopy = *stdmap;
- shmmmapcopy = *shmmultimap;
+ boostmmapcopy = *boostmultimap;
 stdmmapcopy = *stdmultimap;

- if(!CheckEqualContainers(&shmmapcopy, &stdmapcopy))
+ if(!CheckEqualContainers(&boostmapcopy, &stdmapcopy))
 return 1;
- if(!CheckEqualContainers(&shmmmapcopy, &stdmmapcopy))
+ if(!CheckEqualContainers(&boostmmapcopy, &stdmmapcopy))
 return 1;
- delete shmmap;
- delete shmmultimap;
+ delete boostmap;
+ delete boostmultimap;
 delete stdmap;
 delete stdmultimap;
 }

Modified: sandbox/move/libs/container/test/movable_int.hpp
==============================================================================
--- sandbox/move/libs/container/test/movable_int.hpp (original)
+++ sandbox/move/libs/container/test/movable_int.hpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
@@ -19,6 +19,16 @@
namespace container {
namespace test {

+template<class T>
+struct is_copyable;
+
+template<>
+struct is_copyable<int>
+{
+ static const bool value = true;
+};
+
+
class movable_int
{
 BOOST_MOVABLE_BUT_NOT_COPYABLE(movable_int)
@@ -76,6 +86,13 @@
 return os;
}

+
+template<>
+struct is_copyable<movable_int>
+{
+ static const bool value = false;
+};
+
class movable_and_copyable_int
{
 BOOST_COPYABLE_AND_MOVABLE(movable_and_copyable_int)
@@ -140,6 +157,12 @@
 return os;
}

+template<>
+struct is_copyable<movable_and_copyable_int>
+{
+ static const bool value = true;
+};
+
class copyable_int
{
 public:
@@ -192,6 +215,12 @@
 return os;
}

+template<>
+struct is_copyable<copyable_int>
+{
+ static const bool value = true;
+};
+
} //namespace test {
} //namespace container {
} //namespace boost {

Modified: sandbox/move/libs/container/test/print_container.hpp
==============================================================================
--- sandbox/move/libs/container/test/print_container.hpp (original)
+++ sandbox/move/libs/container/test/print_container.hpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
@@ -37,16 +37,16 @@
}

//Function to dump data
-template<class MyShmCont
+template<class MyBoostCont
 ,class MyStdCont>
-void PrintContainers(MyShmCont *shmcont, MyStdCont *stdcont)
+void PrintContainers(MyBoostCont *boostcont, MyStdCont *stdcont)
{
- typename MyShmCont::iterator itshm = shmcont->begin(), itshmend = shmcont->end();
+ typename MyBoostCont::iterator itboost = boostcont->begin(), itboostend = boostcont->end();
 typename MyStdCont::iterator itstd = stdcont->begin(), itstdend = stdcont->end();

- std::cout << "MyShmCont" << std::endl;
- for(; itshm != itshmend; ++itshm){
- std::cout << *itshm << std::endl;
+ std::cout << "MyBoostCont" << std::endl;
+ for(; itboost != itboostend; ++itboost){
+ std::cout << *itboost << std::endl;
 }
 std::cout << "MyStdCont" << std::endl;

Modified: sandbox/move/libs/container/test/set_test.hpp
==============================================================================
--- sandbox/move/libs/container/test/set_test.hpp (original)
+++ sandbox/move/libs/container/test/set_test.hpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
@@ -24,20 +24,20 @@
namespace container {
namespace test{

-template<class MyShmSet
+template<class MyBoostSet
 ,class MyStdSet
- ,class MyShmMultiSet
+ ,class MyBoostMultiSet
 ,class MyStdMultiSet>
int set_test ()
{
- typedef typename MyShmSet::value_type IntType;
+ typedef typename MyBoostSet::value_type IntType;
 const int max = 100;

 //Shared memory allocator must be always be initialized
 //since it has no default constructor
- MyShmSet *shmset = new MyShmSet;
+ MyBoostSet *boostset = new MyBoostSet;
 MyStdSet *stdset = new MyStdSet;
- MyShmMultiSet *shmmultiset = new MyShmMultiSet;
+ MyBoostMultiSet *boostmultiset = new MyBoostMultiSet;
 MyStdMultiSet *stdmultiset = new MyStdMultiSet;

 //Test construction from a range
@@ -57,20 +57,20 @@
 aux_vect3[i] = boost::move(move_me);
 }

- MyShmSet *shmset2 = new MyShmSet
+ MyBoostSet *boostset2 = new MyBoostSet
 ( boost::make_move_iterator(&aux_vect[0])
 , boost::make_move_iterator(aux_vect + 50));
 MyStdSet *stdset2 = new MyStdSet(aux_vect2, aux_vect2 + 50);
- MyShmMultiSet *shmmultiset2 = new MyShmMultiSet
+ MyBoostMultiSet *boostmultiset2 = new MyBoostMultiSet
 ( boost::make_move_iterator(&aux_vect3[0])
 , boost::make_move_iterator(aux_vect3 + 50));
 MyStdMultiSet *stdmultiset2 = new MyStdMultiSet(aux_vect2, aux_vect2 + 50);
- if(!CheckEqualContainers(shmset2, stdset2)){
- std::cout << "Error in construct<MyShmSet>(MyShmSet2)" << std::endl;
+ if(!CheckEqualContainers(boostset2, stdset2)){
+ std::cout << "Error in construct<MyBoostSet>(MyBoostSet2)" << std::endl;
 return 1;
 }
- if(!CheckEqualContainers(shmmultiset2, stdmultiset2)){
- std::cout << "Error in construct<MyShmMultiSet>(MyShmMultiSet2)" << std::endl;
+ if(!CheckEqualContainers(boostmultiset2, stdmultiset2)){
+ std::cout << "Error in construct<MyBoostMultiSet>(MyBoostMultiSet2)" << std::endl;
 return 1;
 }

@@ -89,32 +89,32 @@
 aux_vect3[i] = boost::move(move_me);
 }
/*
- MyShmSet *shmset3 = MyShmSet
+ MyBoostSet *boostset3 = MyBoostSet
 ( ordered_unique_range
 , boost::make_move_iterator(&aux_vect[0])
 , boost::make_move_iterator(aux_vect + 50));
 MyStdSet *stdset3 = new MyStdSet(aux_vect2, aux_vect2 + 50);
- MyShmMultiSet *shmmultiset3 = MyShmMultiSet
+ MyBoostMultiSet *boostmultiset3 = MyBoostMultiSet
 ( ordered_range
 , boost::make_move_iterator(&aux_vect3[0])
 , boost::make_move_iterator(aux_vect3 + 50));
 MyStdMultiSet *stdmultiset3 = new MyStdMultiSet(aux_vect2, aux_vect2 + 50);

- if(!CheckEqualContainers(shmset3, stdset3)){
- std::cout << "Error in construct<MyShmSet>(MyShmSet3)" << std::endl;
+ if(!CheckEqualContainers(boostset3, stdset3)){
+ std::cout << "Error in construct<MyBoostSet>(MyBoostSet3)" << std::endl;
 return 1;
 }
- if(!CheckEqualContainers(shmmultiset3, stdmultiset3)){
- std::cout << "Error in construct<MyShmMultiSet>(MyShmMultiSet3)" << std::endl;
+ if(!CheckEqualContainers(boostmultiset3, stdmultiset3)){
+ std::cout << "Error in construct<MyBoostMultiSet>(MyBoostMultiSet3)" << std::endl;
 return 1;
 }
*/
- delete shmset2;
- delete shmmultiset2;
+ delete boostset2;
+ delete boostmultiset2;
 delete stdset2;
 delete stdmultiset2;
- //delete shmset3;
- //delete shmmultiset3;
+ //delete boostset3;
+ //delete boostmultiset3;
 //delete stdset3;
 //delete stdmultiset3;
 }
@@ -122,75 +122,75 @@
 int i, j;
 for(i = 0; i < max; ++i){
 IntType move_me(i);
- shmset->insert(boost::move(move_me));
+ boostset->insert(boost::move(move_me));
 stdset->insert(i);
- shmset->insert(IntType(i));
+ boostset->insert(IntType(i));
 stdset->insert(i);
 IntType move_me2(i);
- shmmultiset->insert(boost::move(move_me2));
+ boostmultiset->insert(boost::move(move_me2));
 stdmultiset->insert(i);
- shmmultiset->insert(IntType(i));
+ boostmultiset->insert(IntType(i));
 stdmultiset->insert(i);
 }

- if(!CheckEqualContainers(shmset, stdset)){
- std::cout << "Error in shmset->insert(boost::move(move_me)" << std::endl;
+ if(!CheckEqualContainers(boostset, stdset)){
+ std::cout << "Error in boostset->insert(boost::move(move_me)" << std::endl;
 return 1;
 }

- if(!CheckEqualContainers(shmmultiset, stdmultiset)){
- std::cout << "Error in shmmultiset->insert(boost::move(move_me)" << std::endl;
+ if(!CheckEqualContainers(boostmultiset, stdmultiset)){
+ std::cout << "Error in boostmultiset->insert(boost::move(move_me)" << std::endl;
 return 1;
 }

- typename MyShmSet::iterator it;
- typename MyShmSet::const_iterator cit = it;
+ typename MyBoostSet::iterator it;
+ typename MyBoostSet::const_iterator cit = it;

- shmset->erase(shmset->begin()++);
+ boostset->erase(boostset->begin()++);
 stdset->erase(stdset->begin()++);
- shmmultiset->erase(shmmultiset->begin()++);
+ boostmultiset->erase(boostmultiset->begin()++);
 stdmultiset->erase(stdmultiset->begin()++);
- if(!CheckEqualContainers(shmset, stdset)){
- std::cout << "Error in shmset->erase(shmset->begin()++)" << std::endl;
+ if(!CheckEqualContainers(boostset, stdset)){
+ std::cout << "Error in boostset->erase(boostset->begin()++)" << std::endl;
 return 1;
 }
- if(!CheckEqualContainers(shmmultiset, stdmultiset)){
- std::cout << "Error in shmmultiset->erase(shmmultiset->begin()++)" << std::endl;
+ if(!CheckEqualContainers(boostmultiset, stdmultiset)){
+ std::cout << "Error in boostmultiset->erase(boostmultiset->begin()++)" << std::endl;
 return 1;
 }

- shmset->erase(shmset->begin());
+ boostset->erase(boostset->begin());
 stdset->erase(stdset->begin());
- shmmultiset->erase(shmmultiset->begin());
+ boostmultiset->erase(boostmultiset->begin());
 stdmultiset->erase(stdmultiset->begin());
- if(!CheckEqualContainers(shmset, stdset)){
- std::cout << "Error in shmset->erase(shmset->begin())" << std::endl;
+ if(!CheckEqualContainers(boostset, stdset)){
+ std::cout << "Error in boostset->erase(boostset->begin())" << std::endl;
 return 1;
 }
- if(!CheckEqualContainers(shmmultiset, stdmultiset)){
- std::cout << "Error in shmmultiset->erase(shmmultiset->begin())" << std::endl;
+ if(!CheckEqualContainers(boostmultiset, stdmultiset)){
+ std::cout << "Error in boostmultiset->erase(boostmultiset->begin())" << std::endl;
 return 1;
 }

 //Swapping test
- MyShmSet tmpshmeset2;
+ MyBoostSet tmpboosteset2;
 MyStdSet tmpstdset2;
- MyShmMultiSet tmpshmemultiset2;
+ MyBoostMultiSet tmpboostemultiset2;
 MyStdMultiSet tmpstdmultiset2;
- shmset->swap(tmpshmeset2);
+ boostset->swap(tmpboosteset2);
 stdset->swap(tmpstdset2);
- shmmultiset->swap(tmpshmemultiset2);
+ boostmultiset->swap(tmpboostemultiset2);
 stdmultiset->swap(tmpstdmultiset2);
- shmset->swap(tmpshmeset2);
+ boostset->swap(tmpboosteset2);
 stdset->swap(tmpstdset2);
- shmmultiset->swap(tmpshmemultiset2);
+ boostmultiset->swap(tmpboostemultiset2);
 stdmultiset->swap(tmpstdmultiset2);
- if(!CheckEqualContainers(shmset, stdset)){
- std::cout << "Error in shmset->swap(tmpshmeset2)" << std::endl;
+ if(!CheckEqualContainers(boostset, stdset)){
+ std::cout << "Error in boostset->swap(tmpboosteset2)" << std::endl;
 return 1;
 }
- if(!CheckEqualContainers(shmmultiset, stdmultiset)){
- std::cout << "Error in shmmultiset->swap(tmpshmemultiset2)" << std::endl;
+ if(!CheckEqualContainers(boostmultiset, stdmultiset)){
+ std::cout << "Error in boostmultiset->swap(tmpboostemultiset2)" << std::endl;
 return 1;
 }

@@ -212,31 +212,31 @@
 aux_vect3[i] = boost::move(move_me);
 }

- shmset->insert(boost::make_move_iterator(&aux_vect[0]), boost::make_move_iterator(aux_vect + 50));
+ boostset->insert(boost::make_move_iterator(&aux_vect[0]), boost::make_move_iterator(aux_vect + 50));
 stdset->insert(aux_vect2, aux_vect2 + 50);
- shmmultiset->insert(boost::make_move_iterator(&aux_vect3[0]), boost::make_move_iterator(aux_vect3 + 50));
+ boostmultiset->insert(boost::make_move_iterator(&aux_vect3[0]), boost::make_move_iterator(aux_vect3 + 50));
 stdmultiset->insert(aux_vect2, aux_vect2 + 50);
- if(!CheckEqualContainers(shmset, stdset)){
- std::cout << "Error in shmset->insert(boost::make_move_iterator(&aux_vect[0])..." << std::endl;
+ if(!CheckEqualContainers(boostset, stdset)){
+ std::cout << "Error in boostset->insert(boost::make_move_iterator(&aux_vect[0])..." << std::endl;
 return 1;
 }
- if(!CheckEqualContainers(shmmultiset, stdmultiset)){
- std::cout << "Error in shmmultiset->insert(boost::make_move_iterator(&aux_vect3[0]), ..." << std::endl;
+ if(!CheckEqualContainers(boostmultiset, stdmultiset)){
+ std::cout << "Error in boostmultiset->insert(boost::make_move_iterator(&aux_vect3[0]), ..." << std::endl;
 return 1;
 }

- for(int i = 0, j = static_cast<int>(shmset->size()); i < j; ++i){
+ for(int i = 0, j = static_cast<int>(boostset->size()); i < j; ++i){
 IntType erase_me(i);
- shmset->erase(erase_me);
+ boostset->erase(erase_me);
 stdset->erase(i);
- shmmultiset->erase(erase_me);
+ boostmultiset->erase(erase_me);
 stdmultiset->erase(i);
- if(!CheckEqualContainers(shmset, stdset)){
- std::cout << "Error in shmset->erase(erase_me)" << shmset->size() << " " << stdset->size() << std::endl;
+ if(!CheckEqualContainers(boostset, stdset)){
+ std::cout << "Error in boostset->erase(erase_me)" << boostset->size() << " " << stdset->size() << std::endl;
 return 1;
 }
- if(!CheckEqualContainers(shmmultiset, stdmultiset)){
- std::cout << "Error in shmmultiset->erase(erase_me)" << std::endl;
+ if(!CheckEqualContainers(boostmultiset, stdmultiset)){
+ std::cout << "Error in boostmultiset->erase(erase_me)" << std::endl;
 return 1;
 }
 }
@@ -269,121 +269,121 @@
 aux_vect5[i] = boost::move(move_me);
 }

- shmset->insert(boost::make_move_iterator(&aux_vect[0]), boost::make_move_iterator(aux_vect + 50));
- shmset->insert(boost::make_move_iterator(&aux_vect3[0]), boost::make_move_iterator(aux_vect3 + 50));
+ boostset->insert(boost::make_move_iterator(&aux_vect[0]), boost::make_move_iterator(aux_vect + 50));
+ boostset->insert(boost::make_move_iterator(&aux_vect3[0]), boost::make_move_iterator(aux_vect3 + 50));
 stdset->insert(aux_vect2, aux_vect2 + 50);
 stdset->insert(aux_vect2, aux_vect2 + 50);
- shmmultiset->insert(boost::make_move_iterator(&aux_vect4[0]), boost::make_move_iterator(aux_vect4 + 50));
- shmmultiset->insert(boost::make_move_iterator(&aux_vect5[0]), boost::make_move_iterator(aux_vect5 + 50));
+ boostmultiset->insert(boost::make_move_iterator(&aux_vect4[0]), boost::make_move_iterator(aux_vect4 + 50));
+ boostmultiset->insert(boost::make_move_iterator(&aux_vect5[0]), boost::make_move_iterator(aux_vect5 + 50));
 stdmultiset->insert(aux_vect2, aux_vect2 + 50);
 stdmultiset->insert(aux_vect2, aux_vect2 + 50);
- if(!CheckEqualContainers(shmset, stdset)){
- std::cout << "Error in shmset->insert(boost::make_move_iterator(&aux_vect3[0])..." << std::endl;
+ if(!CheckEqualContainers(boostset, stdset)){
+ std::cout << "Error in boostset->insert(boost::make_move_iterator(&aux_vect3[0])..." << std::endl;
 return 1;
 }
- if(!CheckEqualContainers(shmmultiset, stdmultiset)){
- std::cout << "Error in shmmultiset->insert(boost::make_move_iterator(&aux_vect5[0])..." << std::endl;
+ if(!CheckEqualContainers(boostmultiset, stdmultiset)){
+ std::cout << "Error in boostmultiset->insert(boost::make_move_iterator(&aux_vect5[0])..." << std::endl;
 return 1;
 }

- shmset->erase(*shmset->begin());
+ boostset->erase(*boostset->begin());
 stdset->erase(*stdset->begin());
- shmmultiset->erase(*shmmultiset->begin());
+ boostmultiset->erase(*boostmultiset->begin());
 stdmultiset->erase(*stdmultiset->begin());
- if(!CheckEqualContainers(shmset, stdset)){
- std::cout << "Error in shmset->erase(*shmset->begin())" << std::endl;
+ if(!CheckEqualContainers(boostset, stdset)){
+ std::cout << "Error in boostset->erase(*boostset->begin())" << std::endl;
 return 1;
 }
- if(!CheckEqualContainers(shmmultiset, stdmultiset)){
- std::cout << "Error in shmmultiset->erase(*shmmultiset->begin())" << std::endl;
+ if(!CheckEqualContainers(boostmultiset, stdmultiset)){
+ std::cout << "Error in boostmultiset->erase(*boostmultiset->begin())" << std::endl;
 return 1;
 }
 }

 for(i = 0; i < max; ++i){
 IntType move_me(i);
- shmset->insert(boost::move(move_me));
+ boostset->insert(boost::move(move_me));
 stdset->insert(i);
 IntType move_me2(i);
- shmmultiset->insert(boost::move(move_me2));
+ boostmultiset->insert(boost::move(move_me2));
 stdmultiset->insert(i);
 }

- if(!CheckEqualContainers(shmset, stdset)){
- std::cout << "Error in shmset->insert(boost::move(move_me)) try 2" << std::endl;
+ if(!CheckEqualContainers(boostset, stdset)){
+ std::cout << "Error in boostset->insert(boost::move(move_me)) try 2" << std::endl;
 return 1;
 }
- if(!CheckEqualContainers(shmmultiset, stdmultiset)){
- std::cout << "Error in shmmultiset->insert(boost::move(move_me2)) try 2" << std::endl;
+ if(!CheckEqualContainers(boostmultiset, stdmultiset)){
+ std::cout << "Error in boostmultiset->insert(boost::move(move_me2)) try 2" << std::endl;
 return 1;
 }

 for(i = 0; i < max; ++i){
 IntType move_me(i);
- shmset->insert(shmset->begin(), boost::move(move_me));
+ boostset->insert(boostset->begin(), boost::move(move_me));
 stdset->insert(stdset->begin(), i);
- //PrintContainers(shmset, stdset);
+ //PrintContainers(boostset, stdset);
 IntType move_me2(i);
- shmmultiset->insert(shmmultiset->begin(), boost::move(move_me2));
+ boostmultiset->insert(boostmultiset->begin(), boost::move(move_me2));
 stdmultiset->insert(stdmultiset->begin(), i);
- //PrintContainers(shmmultiset, stdmultiset);
- if(!CheckEqualContainers(shmset, stdset)){
- std::cout << "Error in shmset->insert(shmset->begin(), boost::move(move_me))" << std::endl;
+ //PrintContainers(boostmultiset, stdmultiset);
+ if(!CheckEqualContainers(boostset, stdset)){
+ std::cout << "Error in boostset->insert(boostset->begin(), boost::move(move_me))" << std::endl;
 return 1;
 }
- if(!CheckEqualContainers(shmmultiset, stdmultiset)){
- std::cout << "Error in shmmultiset->insert(shmmultiset->begin(), boost::move(move_me2))" << std::endl;
+ if(!CheckEqualContainers(boostmultiset, stdmultiset)){
+ std::cout << "Error in boostmultiset->insert(boostmultiset->begin(), boost::move(move_me2))" << std::endl;
 return 1;
 }

 IntType move_me3(i);
- shmset->insert(shmset->end(), boost::move(move_me3));
+ boostset->insert(boostset->end(), boost::move(move_me3));
 stdset->insert(stdset->end(), i);
 IntType move_me4(i);
- shmmultiset->insert(shmmultiset->end(), boost::move(move_me4));
+ boostmultiset->insert(boostmultiset->end(), boost::move(move_me4));
 stdmultiset->insert(stdmultiset->end(), i);
- if(!CheckEqualContainers(shmset, stdset)){
- std::cout << "Error in shmset->insert(shmset->end(), boost::move(move_me3))" << std::endl;
+ if(!CheckEqualContainers(boostset, stdset)){
+ std::cout << "Error in boostset->insert(boostset->end(), boost::move(move_me3))" << std::endl;
 return 1;
 }
- if(!CheckEqualContainers(shmmultiset, stdmultiset)){
- std::cout << "Error in shmmultiset->insert(shmmultiset->end(), boost::move(move_me4))" << std::endl;
+ if(!CheckEqualContainers(boostmultiset, stdmultiset)){
+ std::cout << "Error in boostmultiset->insert(boostmultiset->end(), boost::move(move_me4))" << std::endl;
 return 1;
 }
 {
 IntType move_me(i);
- shmset->insert(shmset->upper_bound(move_me), boost::move(move_me));
+ boostset->insert(boostset->upper_bound(move_me), boost::move(move_me));
 stdset->insert(stdset->upper_bound(i), i);
- //PrintContainers(shmset, stdset);
+ //PrintContainers(boostset, stdset);
 IntType move_me2(i);
- shmmultiset->insert(shmmultiset->upper_bound(move_me2), boost::move(move_me2));
+ boostmultiset->insert(boostmultiset->upper_bound(move_me2), boost::move(move_me2));
 stdmultiset->insert(stdmultiset->upper_bound(i), i);
- //PrintContainers(shmmultiset, stdmultiset);
- if(!CheckEqualContainers(shmset, stdset)){
- std::cout << "Error in shmset->insert(shmset->upper_bound(move_me), boost::move(move_me))" << std::endl;
+ //PrintContainers(boostmultiset, stdmultiset);
+ if(!CheckEqualContainers(boostset, stdset)){
+ std::cout << "Error in boostset->insert(boostset->upper_bound(move_me), boost::move(move_me))" << std::endl;
 return 1;
 }
- if(!CheckEqualContainers(shmmultiset, stdmultiset)){
- std::cout << "Error in shmmultiset->insert(shmmultiset->upper_bound(move_me2), boost::move(move_me2))" << std::endl;
+ if(!CheckEqualContainers(boostmultiset, stdmultiset)){
+ std::cout << "Error in boostmultiset->insert(boostmultiset->upper_bound(move_me2), boost::move(move_me2))" << std::endl;
 return 1;
 }

 }
 {
 IntType move_me(i);
- shmset->insert(shmset->lower_bound(move_me), boost::move(move_me2));
+ boostset->insert(boostset->lower_bound(move_me), boost::move(move_me2));
 stdset->insert(stdset->lower_bound(i), i);
- //PrintContainers(shmset, stdset);
+ //PrintContainers(boostset, stdset);
 IntType move_me2(i);
- shmmultiset->insert(shmmultiset->lower_bound(move_me2), boost::move(move_me2));
+ boostmultiset->insert(boostmultiset->lower_bound(move_me2), boost::move(move_me2));
 stdmultiset->insert(stdmultiset->lower_bound(i), i);
- //PrintContainers(shmmultiset, stdmultiset);
- if(!CheckEqualContainers(shmset, stdset)){
- std::cout << "Error in shmset->insert(shmset->lower_bound(move_me), boost::move(move_me2))" << std::endl;
+ //PrintContainers(boostmultiset, stdmultiset);
+ if(!CheckEqualContainers(boostset, stdset)){
+ std::cout << "Error in boostset->insert(boostset->lower_bound(move_me), boost::move(move_me2))" << std::endl;
 return 1;
 }
- if(!CheckEqualContainers(shmmultiset, stdmultiset)){
- std::cout << "Error in shmmultiset->insert(shmmultiset->lower_bound(move_me2), boost::move(move_me2))" << std::endl;
+ if(!CheckEqualContainers(boostmultiset, stdmultiset)){
+ std::cout << "Error in boostmultiset->insert(boostmultiset->lower_bound(move_me2), boost::move(move_me2))" << std::endl;
 return 1;
 }
 }
@@ -392,102 +392,102 @@
 //Compare count with std containers
 for(i = 0; i < max; ++i){
 IntType count_me(i);
- if(shmset->count(count_me) != stdset->count(i)){
+ if(boostset->count(count_me) != stdset->count(i)){
 return -1;
 }
- if(shmmultiset->count(count_me) != stdmultiset->count(i)){
+ if(boostmultiset->count(count_me) != stdmultiset->count(i)){
 return -1;
 }
 }

 //Now do count exercise
- shmset->erase(shmset->begin(), shmset->end());
- shmmultiset->erase(shmmultiset->begin(), shmmultiset->end());
- shmset->clear();
- shmmultiset->clear();
+ boostset->erase(boostset->begin(), boostset->end());
+ boostmultiset->erase(boostmultiset->begin(), boostmultiset->end());
+ boostset->clear();
+ boostmultiset->clear();

 for(j = 0; j < 3; ++j)
 for(i = 0; i < 100; ++i){
 IntType move_me(i);
- shmset->insert(boost::move(move_me));
+ boostset->insert(boost::move(move_me));
 IntType move_me2(i);
- shmmultiset->insert(boost::move(move_me2));
+ boostmultiset->insert(boost::move(move_me2));
 IntType count_me(i);
- if(shmset->count(count_me) != typename MyShmMultiSet::size_type(1)){
- std::cout << "Error in shmset->count(count_me)" << std::endl;
+ if(boostset->count(count_me) != typename MyBoostMultiSet::size_type(1)){
+ std::cout << "Error in boostset->count(count_me)" << std::endl;
 return 1;
 }
- if(shmmultiset->count(count_me) != typename MyShmMultiSet::size_type(j+1)){
- std::cout << "Error in shmmultiset->count(count_me)" << std::endl;
+ if(boostmultiset->count(count_me) != typename MyBoostMultiSet::size_type(j+1)){
+ std::cout << "Error in boostmultiset->count(count_me)" << std::endl;
 return 1;
 }
 }

- delete shmset;
+ delete boostset;
 delete stdset;
- delete shmmultiset;
+ delete boostmultiset;
 delete stdmultiset;
 return 0;
}

-template<class MyShmSet
+template<class MyBoostSet
 ,class MyStdSet
- ,class MyShmMultiSet
+ ,class MyBoostMultiSet
 ,class MyStdMultiSet>
int set_test_copyable ()
{
- typedef typename MyShmSet::value_type IntType;
+ typedef typename MyBoostSet::value_type IntType;
 const int max = 100;

 try{
 //Shared memory allocator must be always be initialized
 //since it has no default constructor
- MyShmSet *shmset = new MyShmSet;
+ MyBoostSet *boostset = new MyBoostSet;
 MyStdSet *stdset = new MyStdSet;
- MyShmMultiSet *shmmultiset = new MyShmMultiSet;
+ MyBoostMultiSet *boostmultiset = new MyBoostMultiSet;
 MyStdMultiSet *stdmultiset = new MyStdMultiSet;

 int i;
 for(i = 0; i < max; ++i){
 IntType move_me(i);
- shmset->insert(boost::move(move_me));
+ boostset->insert(boost::move(move_me));
 stdset->insert(i);
 IntType move_me2(i);
- shmmultiset->insert(boost::move(move_me2));
+ boostmultiset->insert(boost::move(move_me2));
 stdmultiset->insert(i);
 }
- if(!CheckEqualContainers(shmset, stdset)) return 1;
- if(!CheckEqualContainers(shmmultiset, stdmultiset)) return 1;
+ if(!CheckEqualContainers(boostset, stdset)) return 1;
+ if(!CheckEqualContainers(boostmultiset, stdmultiset)) return 1;

 {
 //Now, test copy constructor
- MyShmSet shmsetcopy(*shmset);
+ MyBoostSet boostsetcopy(*boostset);
 MyStdSet stdsetcopy(*stdset);

- if(!CheckEqualContainers(&shmsetcopy, &stdsetcopy))
+ if(!CheckEqualContainers(&boostsetcopy, &stdsetcopy))
 return 1;

- MyShmMultiSet shmmsetcopy(*shmmultiset);
+ MyBoostMultiSet boostmsetcopy(*boostmultiset);
 MyStdMultiSet stdmsetcopy(*stdmultiset);

- if(!CheckEqualContainers(&shmmsetcopy, &stdmsetcopy))
+ if(!CheckEqualContainers(&boostmsetcopy, &stdmsetcopy))
 return 1;

 //And now assignment
- shmsetcopy = *shmset;
+ boostsetcopy = *boostset;
 stdsetcopy = *stdset;

- if(!CheckEqualContainers(&shmsetcopy, &stdsetcopy))
+ if(!CheckEqualContainers(&boostsetcopy, &stdsetcopy))
 return 1;

- shmmsetcopy = *shmmultiset;
+ boostmsetcopy = *boostmultiset;
 stdmsetcopy = *stdmultiset;

- if(!CheckEqualContainers(&shmmsetcopy, &stdmsetcopy))
+ if(!CheckEqualContainers(&boostmsetcopy, &stdmsetcopy))
 return 1;
 }
- delete shmset;
- delete shmmultiset;
+ delete boostset;
+ delete boostmultiset;
 }
 catch(...){
 throw;

Modified: sandbox/move/libs/container/test/slist_test.cpp
==============================================================================
--- sandbox/move/libs/container/test/slist_test.cpp (original)
+++ sandbox/move/libs/container/test/slist_test.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
@@ -10,8 +10,8 @@
#include <boost/container/detail/config_begin.hpp>
#include <boost/container/slist.hpp>
#include "dummy_test_allocator.hpp"
-#include "list_test.hpp"
#include "movable_int.hpp"
+#include "list_test.hpp"
#include "emplace_test.hpp"

using namespace boost::container;

Modified: sandbox/move/libs/container/test/string_test.cpp
==============================================================================
--- sandbox/move/libs/container/test/string_test.cpp (original)
+++ sandbox/move/libs/container/test/string_test.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
@@ -65,177 +65,177 @@
{
 typedef std::string StdString;
 typedef vector<StdString> StdStringVector;
- typedef basic_string<CharType> ShmString;
- typedef vector<ShmString> ShmStringVector;
+ typedef basic_string<CharType> BoostString;
+ typedef vector<BoostString> BoostStringVector;

 const int MaxSize = 100;

 //Create shared memory
 {
- ShmStringVector *shmStringVect = new ShmStringVector;
+ BoostStringVector *boostStringVect = new BoostStringVector;
 StdStringVector *stdStringVect = new StdStringVector;
- ShmString auxShmString;
- StdString auxStdString(StdString(auxShmString.begin(), auxShmString.end() ));
+ BoostString auxBoostString;
+ StdString auxStdString(StdString(auxBoostString.begin(), auxBoostString.end() ));

 CharType buffer [20];

 //First, push back
 for(int i = 0; i < MaxSize; ++i){
- auxShmString = "String";
+ auxBoostString = "String";
 auxStdString = "String";
 std::sprintf(buffer, "%i", i);
- auxShmString += buffer;
+ auxBoostString += buffer;
 auxStdString += buffer;
- shmStringVect->push_back(auxShmString);
+ boostStringVect->push_back(auxBoostString);
 stdStringVect->push_back(auxStdString);
 }

- if(!CheckEqualStringVector(shmStringVect, stdStringVect)){
+ if(!CheckEqualStringVector(boostStringVect, stdStringVect)){
 return 1;
 }

 //Now push back moving
 for(int i = 0; i < MaxSize; ++i){
- auxShmString = "String";
+ auxBoostString = "String";
 auxStdString = "String";
 std::sprintf(buffer, "%i", i);
- auxShmString += buffer;
+ auxBoostString += buffer;
 auxStdString += buffer;
- shmStringVect->push_back(boost::move(auxShmString));
+ boostStringVect->push_back(boost::move(auxBoostString));
 stdStringVect->push_back(auxStdString);
 }

- if(!CheckEqualStringVector(shmStringVect, stdStringVect)){
+ if(!CheckEqualStringVector(boostStringVect, stdStringVect)){
 return 1;
 }

 //push front
 for(int i = 0; i < MaxSize; ++i){
- auxShmString = "String";
+ auxBoostString = "String";
 auxStdString = "String";
 std::sprintf(buffer, "%i", i);
- auxShmString += buffer;
+ auxBoostString += buffer;
 auxStdString += buffer;
- shmStringVect->insert(shmStringVect->begin(), auxShmString);
+ boostStringVect->insert(boostStringVect->begin(), auxBoostString);
 stdStringVect->insert(stdStringVect->begin(), auxStdString);
 }

- if(!CheckEqualStringVector(shmStringVect, stdStringVect)){
+ if(!CheckEqualStringVector(boostStringVect, stdStringVect)){
 return 1;
 }

 //Now push front moving
 for(int i = 0; i < MaxSize; ++i){
- auxShmString = "String";
+ auxBoostString = "String";
 auxStdString = "String";
 std::sprintf(buffer, "%i", i);
- auxShmString += buffer;
+ auxBoostString += buffer;
 auxStdString += buffer;
- shmStringVect->insert(shmStringVect->begin(), boost::move(auxShmString));
+ boostStringVect->insert(boostStringVect->begin(), boost::move(auxBoostString));
 stdStringVect->insert(stdStringVect->begin(), auxStdString);
 }

- if(!CheckEqualStringVector(shmStringVect, stdStringVect)){
+ if(!CheckEqualStringVector(boostStringVect, stdStringVect)){
 return 1;
 }

 //Now test long and short representation swapping
- auxShmString = "String";
+ auxBoostString = "String";
 auxStdString = "String";
- ShmString shm_swapper;
+ BoostString boost_swapper;
 StdString std_swapper;
- shm_swapper.swap(auxShmString);
+ boost_swapper.swap(auxBoostString);
 std_swapper.swap(auxStdString);
- if(!StringEqual()(auxShmString, auxStdString))
+ if(!StringEqual()(auxBoostString, auxStdString))
 return 1;
- if(!StringEqual()(shm_swapper, std_swapper))
+ if(!StringEqual()(boost_swapper, std_swapper))
 return 1;

- shm_swapper.swap(auxShmString);
+ boost_swapper.swap(auxBoostString);
 std_swapper.swap(auxStdString);
- if(!StringEqual()(auxShmString, auxStdString))
+ if(!StringEqual()(auxBoostString, auxStdString))
 return 1;
- if(!StringEqual()(shm_swapper, std_swapper))
+ if(!StringEqual()(boost_swapper, std_swapper))
 return 1;

- auxShmString = "LongLongLongLongLongLongLongLongLongLongLongLongLongString";
+ auxBoostString = "LongLongLongLongLongLongLongLongLongLongLongLongLongString";
 auxStdString = "LongLongLongLongLongLongLongLongLongLongLongLongLongString";
- shm_swapper = ShmString();
+ boost_swapper = BoostString();
 std_swapper = StdString();
- shm_swapper.swap(auxShmString);
+ boost_swapper.swap(auxBoostString);
 std_swapper.swap(auxStdString);
- if(!StringEqual()(auxShmString, auxStdString))
+ if(!StringEqual()(auxBoostString, auxStdString))
 return 1;
- if(!StringEqual()(shm_swapper, std_swapper))
+ if(!StringEqual()(boost_swapper, std_swapper))
 return 1;

- shm_swapper.swap(auxShmString);
+ boost_swapper.swap(auxBoostString);
 std_swapper.swap(auxStdString);
- if(!StringEqual()(auxShmString, auxStdString))
+ if(!StringEqual()(auxBoostString, auxStdString))
 return 1;
- if(!StringEqual()(shm_swapper, std_swapper))
+ if(!StringEqual()(boost_swapper, std_swapper))
 return 1;

 //No sort
- std::sort(shmStringVect->begin(), shmStringVect->end());
+ std::sort(boostStringVect->begin(), boostStringVect->end());
 std::sort(stdStringVect->begin(), stdStringVect->end());
- if(!CheckEqualStringVector(shmStringVect, stdStringVect)) return 1;
+ if(!CheckEqualStringVector(boostStringVect, stdStringVect)) return 1;

 const CharType prefix [] = "Prefix";
 const int prefix_size = sizeof(prefix)/sizeof(prefix[0])-1;
 const CharType sufix [] = "Suffix";

 for(int i = 0; i < MaxSize; ++i){
- (*shmStringVect)[i].append(sufix);
+ (*boostStringVect)[i].append(sufix);
 (*stdStringVect)[i].append(sufix);
- (*shmStringVect)[i].insert((*shmStringVect)[i].begin(),
+ (*boostStringVect)[i].insert((*boostStringVect)[i].begin(),
 prefix, prefix + prefix_size);
 (*stdStringVect)[i].insert((*stdStringVect)[i].begin(),
 prefix, prefix + prefix_size);
 }

- if(!CheckEqualStringVector(shmStringVect, stdStringVect)) return 1;
+ if(!CheckEqualStringVector(boostStringVect, stdStringVect)) return 1;

 for(int i = 0; i < MaxSize; ++i){
- std::reverse((*shmStringVect)[i].begin(), (*shmStringVect)[i].end());
+ std::reverse((*boostStringVect)[i].begin(), (*boostStringVect)[i].end());
 std::reverse((*stdStringVect)[i].begin(), (*stdStringVect)[i].end());
 }

- if(!CheckEqualStringVector(shmStringVect, stdStringVect)) return 1;
+ if(!CheckEqualStringVector(boostStringVect, stdStringVect)) return 1;

 for(int i = 0; i < MaxSize; ++i){
- std::reverse((*shmStringVect)[i].begin(), (*shmStringVect)[i].end());
+ std::reverse((*boostStringVect)[i].begin(), (*boostStringVect)[i].end());
 std::reverse((*stdStringVect)[i].begin(), (*stdStringVect)[i].end());
 }

- if(!CheckEqualStringVector(shmStringVect, stdStringVect)) return 1;
+ if(!CheckEqualStringVector(boostStringVect, stdStringVect)) return 1;

 for(int i = 0; i < MaxSize; ++i){
- std::sort(shmStringVect->begin(), shmStringVect->end());
+ std::sort(boostStringVect->begin(), boostStringVect->end());
 std::sort(stdStringVect->begin(), stdStringVect->end());
 }

- if(!CheckEqualStringVector(shmStringVect, stdStringVect)) return 1;
+ if(!CheckEqualStringVector(boostStringVect, stdStringVect)) return 1;

 for(int i = 0; i < MaxSize; ++i){
- (*shmStringVect)[i].replace((*shmStringVect)[i].begin(),
- (*shmStringVect)[i].end(),
+ (*boostStringVect)[i].replace((*boostStringVect)[i].begin(),
+ (*boostStringVect)[i].end(),
 "String");
 (*stdStringVect)[i].replace((*stdStringVect)[i].begin(),
 (*stdStringVect)[i].end(),
 "String");
 }

- if(!CheckEqualStringVector(shmStringVect, stdStringVect)) return 1;
+ if(!CheckEqualStringVector(boostStringVect, stdStringVect)) return 1;

- shmStringVect->erase(std::unique(shmStringVect->begin(), shmStringVect->end()),
- shmStringVect->end());
+ boostStringVect->erase(std::unique(boostStringVect->begin(), boostStringVect->end()),
+ boostStringVect->end());
 stdStringVect->erase(std::unique(stdStringVect->begin(), stdStringVect->end()),
 stdStringVect->end());
- if(!CheckEqualStringVector(shmStringVect, stdStringVect)) return 1;
+ if(!CheckEqualStringVector(boostStringVect, stdStringVect)) return 1;

 //When done, delete vector
- delete shmStringVect;
+ delete boostStringVect;
 delete stdStringVect;
 }
 return 0;

Modified: sandbox/move/libs/container/test/tree_test.cpp
==============================================================================
--- sandbox/move/libs/container/test/tree_test.cpp (original)
+++ sandbox/move/libs/container/test/tree_test.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
@@ -27,28 +27,28 @@
typedef std::multimap<int, int> MyStdMultiMap;

//Alias non-movable types
-typedef set<int> MyShmSet;
-typedef multiset<int> MyShmMultiSet;
-typedef map<int, int> MyShmMap;
-typedef multimap<int, int> MyShmMultiMap;
+typedef set<int> MyBoostSet;
+typedef multiset<int> MyBoostMultiSet;
+typedef map<int, int> MyBoostMap;
+typedef multimap<int, int> MyBoostMultiMap;

//Alias movable types
-typedef set<test::movable_int> MyMovableShmSet;
-typedef multiset<test::movable_int> MyMovableShmMultiSet;
-typedef map<test::movable_int, test::movable_int> MyMovableShmMap;
-typedef multimap<test::movable_int, test::movable_int> MyMovableShmMultiMap;
-typedef set<test::movable_and_copyable_int> MyMoveCopyShmSet;
-typedef set<test::copyable_int> MyCopyShmSet;
-typedef multiset<test::movable_and_copyable_int> MyMoveCopyShmMultiSet;
-typedef multiset<test::copyable_int> MyCopyShmMultiSet;
+typedef set<test::movable_int> MyMovableBoostSet;
+typedef multiset<test::movable_int> MyMovableBoostMultiSet;
+typedef map<test::movable_int, test::movable_int> MyMovableBoostMap;
+typedef multimap<test::movable_int, test::movable_int> MyMovableBoostMultiMap;
+typedef set<test::movable_and_copyable_int> MyMoveCopyBoostSet;
+typedef set<test::copyable_int> MyCopyBoostSet;
+typedef multiset<test::movable_and_copyable_int> MyMoveCopyBoostMultiSet;
+typedef multiset<test::copyable_int> MyCopyBoostMultiSet;
typedef map<test::movable_and_copyable_int
- ,test::movable_and_copyable_int> MyMoveCopyShmMap;
+ ,test::movable_and_copyable_int> MyMoveCopyBoostMap;
typedef multimap<test::movable_and_copyable_int
- ,test::movable_and_copyable_int> MyMoveCopyShmMultiMap;
+ ,test::movable_and_copyable_int> MyMoveCopyBoostMultiMap;
typedef map<test::copyable_int
- ,test::copyable_int> MyCopyShmMap;
+ ,test::copyable_int> MyCopyBoostMap;
typedef multimap<test::copyable_int
- ,test::copyable_int> MyCopyShmMultiMap;
+ ,test::copyable_int> MyCopyBoostMultiMap;
//Test recursive structures
class recursive_set
{
@@ -117,101 +117,101 @@

 //using namespace boost::container::detail;

- if(0 != test::set_test<MyShmSet
+ if(0 != test::set_test<MyBoostSet
 ,MyStdSet
- ,MyShmMultiSet
+ ,MyBoostMultiSet
 ,MyStdMultiSet>()){
 return 1;
 }

- if(0 != test::set_test_copyable<MyShmSet
+ if(0 != test::set_test_copyable<MyBoostSet
 ,MyStdSet
- ,MyShmMultiSet
+ ,MyBoostMultiSet
 ,MyStdMultiSet>()){
 return 1;
 }

- if(0 != test::set_test<MyMovableShmSet
+ if(0 != test::set_test<MyMovableBoostSet
 ,MyStdSet
- ,MyMovableShmMultiSet
+ ,MyMovableBoostMultiSet
 ,MyStdMultiSet>()){
 return 1;
 }

- if(0 != test::set_test<MyMoveCopyShmSet
+ if(0 != test::set_test<MyMoveCopyBoostSet
 ,MyStdSet
- ,MyMoveCopyShmMultiSet
+ ,MyMoveCopyBoostMultiSet
 ,MyStdMultiSet>()){
 return 1;
 }

- if(0 != test::set_test_copyable<MyMoveCopyShmSet
+ if(0 != test::set_test_copyable<MyMoveCopyBoostSet
 ,MyStdSet
- ,MyMoveCopyShmMultiSet
+ ,MyMoveCopyBoostMultiSet
 ,MyStdMultiSet>()){
 return 1;
 }

- if(0 != test::set_test<MyCopyShmSet
+ if(0 != test::set_test<MyCopyBoostSet
 ,MyStdSet
- ,MyCopyShmMultiSet
+ ,MyCopyBoostMultiSet
 ,MyStdMultiSet>()){
 return 1;
 }

- if(0 != test::set_test_copyable<MyCopyShmSet
+ if(0 != test::set_test_copyable<MyCopyBoostSet
 ,MyStdSet
- ,MyCopyShmMultiSet
+ ,MyCopyBoostMultiSet
 ,MyStdMultiSet>()){
 return 1;
 }

- if (0 != test::map_test<MyShmMap
+ if (0 != test::map_test<MyBoostMap
 ,MyStdMap
- ,MyShmMultiMap
+ ,MyBoostMultiMap
 ,MyStdMultiMap>()){
 return 1;
 }

- if(0 != test::map_test_copyable<MyShmMap
+ if(0 != test::map_test_copyable<MyBoostMap
 ,MyStdMap
- ,MyShmMultiMap
+ ,MyBoostMultiMap
 ,MyStdMultiMap>()){
 return 1;
 }

// if (0 != test::map_test<my_managed_shared_memory
-// ,MyMovableShmMap
+// ,MyMovableBoostMap
// ,MyStdMap
-// ,MyMovableShmMultiMap
+// ,MyMovableBoostMultiMap
// ,MyStdMultiMap>()){
// return 1;
// }

- if (0 != test::map_test<MyMoveCopyShmMap
+ if (0 != test::map_test<MyMoveCopyBoostMap
 ,MyStdMap
- ,MyMoveCopyShmMultiMap
+ ,MyMoveCopyBoostMultiMap
 ,MyStdMultiMap>()){
 return 1;
 }

- if (0 != test::map_test_copyable<MyMoveCopyShmMap
+ if (0 != test::map_test_copyable<MyMoveCopyBoostMap
 ,MyStdMap
- ,MyMoveCopyShmMultiMap
+ ,MyMoveCopyBoostMultiMap
 ,MyStdMultiMap>()){
 return 1;
 }

- if (0 != test::map_test<MyCopyShmMap
+ if (0 != test::map_test<MyCopyBoostMap
 ,MyStdMap
- ,MyCopyShmMultiMap
+ ,MyCopyBoostMultiMap
 ,MyStdMultiMap>()){
 return 1;
 }

- if (0 != test::map_test_copyable<MyCopyShmMap
+ if (0 != test::map_test_copyable<MyCopyBoostMap
 ,MyStdMap
- ,MyCopyShmMultiMap
+ ,MyCopyBoostMultiMap
 ,MyStdMultiMap>()){
 return 1;
 }

Modified: sandbox/move/libs/container/test/vector_test.hpp
==============================================================================
--- sandbox/move/libs/container/test/vector_test.hpp (original)
+++ sandbox/move/libs/container/test/vector_test.hpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
@@ -37,95 +37,95 @@

//Function to check if both sets are equal
template<class V1, class V2>
-bool vector_copyable_only(V1 *shmvector, V2 *stdvector, boost::container::containers_detail::true_type)
+bool vector_copyable_only(V1 *boostvector, V2 *stdvector, boost::container::containers_detail::true_type)
{
 typedef typename V1::value_type IntType;
- std::size_t size = shmvector->size();
- shmvector->insert(shmvector->end(), 50, IntType(1));
+ std::size_t size = boostvector->size();
+ boostvector->insert(boostvector->end(), 50, IntType(1));
 stdvector->insert(stdvector->end(), 50, 1);
- if(!test::CheckEqualContainers(shmvector, stdvector)) return false;
+ if(!test::CheckEqualContainers(boostvector, stdvector)) return false;

 {
 IntType move_me(1);
- shmvector->insert(shmvector->begin()+size/2, 50, boost::move(move_me));
+ boostvector->insert(boostvector->begin()+size/2, 50, boost::move(move_me));
 stdvector->insert(stdvector->begin()+size/2, 50, 1);
- if(!test::CheckEqualContainers(shmvector, stdvector)) return false;
+ if(!test::CheckEqualContainers(boostvector, stdvector)) return false;
 }
 {
 IntType move_me(2);
- shmvector->assign(shmvector->size()/2, boost::move(move_me));
+ boostvector->assign(boostvector->size()/2, boost::move(move_me));
 stdvector->assign(stdvector->size()/2, 2);
- if(!test::CheckEqualContainers(shmvector, stdvector)) return false;
+ if(!test::CheckEqualContainers(boostvector, stdvector)) return false;
 }
 {
 IntType move_me(3);
- shmvector->assign(shmvector->size()*3-1, boost::move(move_me));
+ boostvector->assign(boostvector->size()*3-1, boost::move(move_me));
 stdvector->assign(stdvector->size()*3-1, 3);
- if(!test::CheckEqualContainers(shmvector, stdvector)) return false;
+ if(!test::CheckEqualContainers(boostvector, stdvector)) return false;
 }

 {
 IntType copy_me(3);
 const IntType ccopy_me(3);
- shmvector->push_back(copy_me);
+ boostvector->push_back(copy_me);
 stdvector->push_back(int(3));
- shmvector->push_back(ccopy_me);
+ boostvector->push_back(ccopy_me);
 stdvector->push_back(int(3));
- if(!test::CheckEqualContainers(shmvector, stdvector)) return false;
+ if(!test::CheckEqualContainers(boostvector, stdvector)) return false;
 }

 return true;
}

-template<class MyShmVector>
+template<class MyBoostVector>
int vector_test()
{
 typedef std::vector<int> MyStdVector;
- typedef typename MyShmVector::value_type IntType;
+ typedef typename MyBoostVector::value_type IntType;
 const int max = 100;

 {
 try{
- MyShmVector *shmvector = new MyShmVector;
+ MyBoostVector *boostvector = new MyBoostVector;
 MyStdVector *stdvector = new MyStdVector;
- shmvector->resize(100);
+ boostvector->resize(100);
 stdvector->resize(100);
- if(!test::CheckEqualContainers(shmvector, stdvector)) return 1;
+ if(!test::CheckEqualContainers(boostvector, stdvector)) return 1;

- shmvector->resize(200);
+ boostvector->resize(200);
 stdvector->resize(200);
- if(!test::CheckEqualContainers(shmvector, stdvector)) return 1;
+ if(!test::CheckEqualContainers(boostvector, stdvector)) return 1;

- shmvector->resize(0);
+ boostvector->resize(0);
 stdvector->resize(0);
- if(!test::CheckEqualContainers(shmvector, stdvector)) return 1;
+ if(!test::CheckEqualContainers(boostvector, stdvector)) return 1;

 for(int i = 0; i < max; ++i){
 IntType new_int(i);
- shmvector->insert(shmvector->end(), boost::move(new_int));
+ boostvector->insert(boostvector->end(), boost::move(new_int));
 stdvector->insert(stdvector->end(), i);
- if(!test::CheckEqualContainers(shmvector, stdvector)) return 1;
+ if(!test::CheckEqualContainers(boostvector, stdvector)) return 1;
 }
- if(!test::CheckEqualContainers(shmvector, stdvector)) return 1;
+ if(!test::CheckEqualContainers(boostvector, stdvector)) return 1;

- typename MyShmVector::iterator shmit(shmvector->begin());
+ typename MyBoostVector::iterator boostit(boostvector->begin());
 typename MyStdVector::iterator stdit(stdvector->begin());
- typename MyShmVector::const_iterator cshmit = shmit;
- ++shmit; ++stdit;
- shmvector->erase(shmit);
+ typename MyBoostVector::const_iterator cboostit = boostit;
+ ++boostit; ++stdit;
+ boostvector->erase(boostit);
 stdvector->erase(stdit);
- if(!test::CheckEqualContainers(shmvector, stdvector)) return 1;
+ if(!test::CheckEqualContainers(boostvector, stdvector)) return 1;

- shmvector->erase(shmvector->begin());
+ boostvector->erase(boostvector->begin());
 stdvector->erase(stdvector->begin());
- if(!test::CheckEqualContainers(shmvector, stdvector)) return 1;
+ if(!test::CheckEqualContainers(boostvector, stdvector)) return 1;

 {
 //Initialize values
 IntType aux_vect[50];
 for(int i = 0; i < 50; ++i){
 IntType new_int(-1);
- BOOST_STATIC_ASSERT((boost::is_movable<boost::container::test::movable_int>::value == true));
+ BOOST_STATIC_ASSERT((boost::container::test::is_copyable<boost::container::test::movable_int>::value == false));
 aux_vect[i] = boost::move(new_int);
 }
 int aux_vect2[50];
@@ -133,17 +133,17 @@
 aux_vect2[i] = -1;
 }

- shmvector->insert(shmvector->end()
+ boostvector->insert(boostvector->end()
 ,boost::make_move_iterator(&aux_vect[0])
 ,boost::make_move_iterator(aux_vect + 50));
 stdvector->insert(stdvector->end(), aux_vect2, aux_vect2 + 50);
- if(!test::CheckEqualContainers(shmvector, stdvector)) return 1;
+ if(!test::CheckEqualContainers(boostvector, stdvector)) return 1;

- for(int i = 0, j = static_cast<int>(shmvector->size()); i < j; ++i){
- shmvector->erase(shmvector->begin());
+ for(int i = 0, j = static_cast<int>(boostvector->size()); i < j; ++i){
+ boostvector->erase(boostvector->begin());
 stdvector->erase(stdvector->begin());
 }
- if(!test::CheckEqualContainers(shmvector, stdvector)) return 1;
+ if(!test::CheckEqualContainers(boostvector, stdvector)) return 1;
 }
 {
 IntType aux_vect[50];
@@ -155,67 +155,87 @@
 for(int i = 0; i < 50; ++i){
 aux_vect2[i] = -1;
 }
- shmvector->insert(shmvector->begin()
+ boostvector->insert(boostvector->begin()
 ,boost::make_move_iterator(&aux_vect[0])
 ,boost::make_move_iterator(aux_vect + 50));
 stdvector->insert(stdvector->begin(), aux_vect2, aux_vect2 + 50);
- if(!test::CheckEqualContainers(shmvector, stdvector)) return 1;
+ if(!test::CheckEqualContainers(boostvector, stdvector)) return 1;
 }
-
- //shmvector->reserve(shmvector->size()*2);
- //stdvector->reserve(stdvector->size()*2);
- //if(!test::CheckEqualContainers(shmvector, stdvector)) return 1;
+/*
+ boostvector->reserve(boostvector->size()*2);
+ stdvector->reserve(stdvector->size()*2);
+ if(!test::CheckEqualContainers(boostvector, stdvector)) return 1;
+*/
+ boostvector->shrink_to_fit();
+ MyStdVector(*stdvector).swap(*stdvector);
+ if(!test::CheckEqualContainers(boostvector, stdvector)) return 1;
+
+ boostvector->shrink_to_fit();
+ MyStdVector(*stdvector).swap(*stdvector);
+ if(!test::CheckEqualContainers(boostvector, stdvector)) return 1;

 IntType push_back_this(1);
- shmvector->push_back(boost::move(push_back_this));
+ boostvector->push_back(boost::move(push_back_this));
 stdvector->push_back(int(1));
- shmvector->push_back(IntType(1));
+ boostvector->push_back(IntType(1));
 stdvector->push_back(int(1));

- if(!test::CheckEqualContainers(shmvector, stdvector)) return 1;
+ if(!test::CheckEqualContainers(boostvector, stdvector)) return 1;

- if(!vector_copyable_only(shmvector, stdvector
- ,containers_detail::bool_<!is_movable<IntType>::value>())){
+ if(!vector_copyable_only(boostvector, stdvector
+ ,containers_detail::bool_<boost::container::test::is_copyable<IntType>::value>())){
 return 1;
 }

- shmvector->erase(shmvector->begin());
+ boostvector->erase(boostvector->begin());
 stdvector->erase(stdvector->begin());
- if(!test::CheckEqualContainers(shmvector, stdvector)) return 1;
+ if(!test::CheckEqualContainers(boostvector, stdvector)) return 1;

 for(int i = 0; i < max; ++i){
 IntType insert_this(i);
- shmvector->insert(shmvector->begin(), boost::move(insert_this));
+ boostvector->insert(boostvector->begin(), boost::move(insert_this));
 stdvector->insert(stdvector->begin(), i);
- shmvector->insert(shmvector->begin(), IntType(i));
+ boostvector->insert(boostvector->begin(), IntType(i));
 stdvector->insert(stdvector->begin(), int(i));
 }
- if(!test::CheckEqualContainers(shmvector, stdvector)) return 1;
+ if(!test::CheckEqualContainers(boostvector, stdvector)) return 1;

 //Test insertion from list
 {
 std::list<int> l(50, int(1));
- shmvector->insert(shmvector->begin(), l.begin(), l.end());
+ boostvector->insert(boostvector->begin(), l.begin(), l.end());
 stdvector->insert(stdvector->begin(), l.begin(), l.end());
- if(!test::CheckEqualContainers(shmvector, stdvector)) return 1;
- shmvector->assign(l.begin(), l.end());
+ if(!test::CheckEqualContainers(boostvector, stdvector)) return 1;
+ boostvector->assign(l.begin(), l.end());
 stdvector->assign(l.begin(), l.end());
- if(!test::CheckEqualContainers(shmvector, stdvector)) return 1;
+ if(!test::CheckEqualContainers(boostvector, stdvector)) return 1;
 }
/*
- std::size_t cap = shmvector->capacity();
- shmvector->reserve(cap*2);
+ std::size_t cap = boostvector->capacity();
+ boostvector->reserve(cap*2);
 stdvector->reserve(cap*2);
- if(!test::CheckEqualContainers(shmvector, stdvector)) return 1;
- shmvector->resize(0);
+ if(!test::CheckEqualContainers(boostvector, stdvector)) return 1;
+ boostvector->resize(0);
 stdvector->resize(0);
- if(!test::CheckEqualContainers(shmvector, stdvector)) return 1;
- shmvector->resize(cap*2);
+ if(!test::CheckEqualContainers(boostvector, stdvector)) return 1;
+
+ boostvector->resize(cap*2);
 stdvector->resize(cap*2);
- if(!test::CheckEqualContainers(shmvector, stdvector)) return 1;
+ if(!test::CheckEqualContainers(boostvector, stdvector)) return 1;
+
+ boostvector->clear();
+ stdvector->clear();
+ boostvector->shrink_to_fit();
+ MyStdVector(*stdvector).swap(*stdvector);
+ if(!test::CheckEqualContainers(boostvector, stdvector)) return 1;
+
+ boostvector->resize(cap*2);
+ stdvector->resize(cap*2);
+ if(!test::CheckEqualContainers(boostvector, stdvector)) return 1;
*/
+
 delete stdvector;
- delete shmvector;
+ delete boostvector;
 }
 catch(std::exception &ex){
 std::cout << ex.what() << std::endl;

Deleted: sandbox/move/libs/intrusive/CMakeLists.txt
==============================================================================
--- sandbox/move/libs/intrusive/CMakeLists.txt 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,22 +0,0 @@
-#----------------------------------------------------------------------------
-# This file was automatically generated from the original CMakeLists.txt file
-# Add a variable to hold the headers for the library
-set (lib_headers
- intrusive_ptr.hpp
- intrusive
-)
-
-# Add a library target to the build system
-boost_library_project(
- intrusive
- # SRCDIRS
- # TESTDIRS
- HEADERS ${lib_headers}
- # DOCDIRS
- # DESCRIPTION
- MODULARIZED
- # AUTHORS
- # MAINTAINERS
-)
-
-

Deleted: sandbox/move/libs/intrusive/doc/Jamfile.v2
==============================================================================
--- sandbox/move/libs/intrusive/doc/Jamfile.v2 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,58 +0,0 @@
-# Boost.Intrusive library documentation Jamfile
-#
-# Copyright Ion Gaztanaga 2006.
-# Distributed under the Boost Software License, Version 1.0.
-# (See accompanying file LICENSE_1_0.txt or copy at
-# http://www.boost.org/LICENSE_1_0.txt)
-#
-# See http://www.boost.org/libs/intrusive for documentation.
-
-
-import doxygen ;
-import quickbook ;
-
-doxygen autodoc
- :
- [ glob ../../../boost/intrusive/*.hpp ]
- :
- <doxygen:param>HIDE_UNDOC_MEMBERS=YES
- <doxygen:param>HIDE_UNDOC_MEMBERS=YES
- <doxygen:param>HIDE_UNDOC_CLASSES=YES
- <doxygen:param>EXTRACT_PRIVATE=NO
- <doxygen:param>ENABLE_PREPROCESSING=YES
- <doxygen:param>MACRO_EXPANSION=YES
- <doxygen:param>"PREDEFINED=BOOST_INTRUSIVE_DOXYGEN_INVOKED \\
- "list_impl=list" \\
- "slist_impl=slist" \\
- "set_impl=set" \\
- "multiset_impl=multiset" \\
- "rbtree_impl=rbtree" \\
- "unordered_set_impl=unordered_set" \\
- "unordered_multiset_impl=unordered_multiset" \\
- "hashtable_impl=hashtable" \\
- "splay_set_impl=splay_set" \\
- "splay_multiset_impl=splay_multiset" \\
- "splaytree_impl=splaytree" \\
- "sg_set_impl=sg_set" \\
- "sg_multiset_impl=sg_multiset" \\
- "sgtree_impl=sgtree" \\
- "avl_set_impl=avl_set" \\
- "avl_multiset_impl=avl_multiset" \\
- "avltree_impl=avltree" \\
- "treap_set_impl=treap_set" \\
- "treap_multiset_impl=treap_multiset" \\
- "treap_impl=treap""
- ;
-
-xml intrusive : intrusive.qbk ;
-
-boostbook standalone
- :
- intrusive
- :
- <xsl:param>boost.root=../../../..
- <xsl:param>boost.libraries=../../../../libs/libraries.htm
- <xsl:param>generate.section.toc.level=3
- <xsl:param>chunk.first.sections=1
- <dependency>autodoc
- ;

Deleted: sandbox/move/libs/intrusive/doc/html/boostbook.css
==============================================================================
--- sandbox/move/libs/intrusive/doc/html/boostbook.css 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,538 +0,0 @@
-/*=============================================================================
- Copyright (c) 2004 Joel de Guzman
- http://spirit.sourceforge.net/
-
- Use, modification and distribution is subject to the Boost Software
- License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
- http://www.boost.org/LICENSE_1_0.txt)
-=============================================================================*/
-
-/*=============================================================================
- Body defaults
-=============================================================================*/
-
- body
- {
- margin: 1em;
- font-family: sans-serif;
- }
-
-/*=============================================================================
- Paragraphs
-=============================================================================*/
-
- p
- {
- text-align: left;
- font-size: 10pt;
- line-height: 1.15;
- }
-
-/*=============================================================================
- Program listings
-=============================================================================*/
-
- /* Code on paragraphs */
- p tt.computeroutput
- {
- font-size: 10pt;
- }
-
- pre.synopsis
- {
- font-size: 10pt;
- margin: 1pc 4% 0pc 4%;
- padding: 0.5pc 0.5pc 0.5pc 0.5pc;
- }
-
- .programlisting,
- .screen
- {
- font-size: 10pt;
- display: block;
- margin: 1pc 4% 0pc 4%;
- padding: 0.5pc 0.5pc 0.5pc 0.5pc;
- }
-
-/*=============================================================================
- Headings
-=============================================================================*/
-
- h1, h2, h3, h4, h5, h6
- {
- text-align: left;
- margin: 1em 0em 0.5em 0em;
- font-weight: bold;
- }
-
- h1 { font: 140% }
- h2 { font: bold 140% }
- h3 { font: bold 130% }
- h4 { font: bold 120% }
- h5 { font: italic 110% }
- h6 { font: italic 100% }
-
- /* Top page titles */
- title,
- h1.title,
- h2.title
- h3.title,
- h4.title,
- h5.title,
- h6.title,
- .refentrytitle
- {
- font-weight: bold;
- margin-bottom: 1pc;
- }
-
- h1.title { font-size: 140% }
- h2.title { font-size: 140% }
- h3.title { font-size: 130% }
- h4.title { font-size: 120% }
- h5.title { font-size: 110% }
- h6.title { font-size: 100% }
-
- .section h1
- {
- margin: 0em 0em 0.5em 0em;
- font-size: 140%;
- }
-
- .section h2 { font-size: 140% }
- .section h3 { font-size: 130% }
- .section h4 { font-size: 120% }
- .section h5 { font-size: 110% }
- .section h6 { font-size: 100% }
-
- /* Code on titles */
- h1 tt.computeroutput { font-size: 140% }
- h2 tt.computeroutput { font-size: 140% }
- h3 tt.computeroutput { font-size: 130% }
- h4 tt.computeroutput { font-size: 120% }
- h5 tt.computeroutput { font-size: 110% }
- h6 tt.computeroutput { font-size: 100% }
-
-/*=============================================================================
- Author
-=============================================================================*/
-
- h3.author
- {
- font-size: 100%
- }
-
-/*=============================================================================
- Lists
-=============================================================================*/
-
- li
- {
- font-size: 10pt;
- line-height: 1.3;
- }
-
- /* Unordered lists */
- ul
- {
- text-align: left;
- }
-
- /* Ordered lists */
- ol
- {
- text-align: left;
- }
-
-/*=============================================================================
- Links
-=============================================================================*/
-
- a
- {
- text-decoration: none; /* no underline */
- }
-
- a:hover
- {
- text-decoration: underline;
- }
-
-/*=============================================================================
- Spirit style navigation
-=============================================================================*/
-
- .spirit-nav
- {
- text-align: right;
- }
-
- .spirit-nav a
- {
- color: white;
- padding-left: 0.5em;
- }
-
- .spirit-nav img
- {
- border-width: 0px;
- }
-
-/*=============================================================================
- Table of contents
-=============================================================================*/
-
- .toc
- {
- margin: 1pc 4% 0pc 4%;
- padding: 0.1pc 1pc 0.1pc 1pc;
- font-size: 10pt;
- line-height: 1.15;
- }
-
- .toc-main
- {
- width: 600;
- text-align: center;
- margin: 1pc 1pc 1pc 10%;
- padding: 2pc 1pc 3pc 1pc;
- line-height: 0.1;
- }
-
- .boost-toc
- {
- float: right;
- padding: 0.5pc;
- }
-
-/*=============================================================================
- Tables
-=============================================================================*/
-
- .table-title,
- div.table p.title
- {
- margin-left: 4%;
- padding-right: 0.5em;
- padding-left: 0.5em;
- }
-
- .informaltable table,
- .table table
- {
- width: 92%;
- margin-left: 4%;
- margin-right: 4%;
- }
-
- div.informaltable table,
- div.table table
- {
- padding: 4px;
- }
-
- /* Table Cells */
- div.informaltable table tr td,
- div.table table tr td
- {
- padding: 0.5em;
- text-align: left;
- }
-
- div.informaltable table tr th,
- div.table table tr th
- {
- padding: 0.5em 0.5em 0.5em 0.5em;
- border: 1pt solid white;
- font-size: 120%;
- }
-
-/*=============================================================================
- Blurbs
-=============================================================================*/
-
- div.note,
- div.tip,
- div.important,
- div.caution,
- div.warning,
- p.blurb
- {
- font-size: 10pt;
- line-height: 1.2;
- display: block;
- margin: 1pc 4% 0pc 4%;
- padding: 0.5pc 0.5pc 0.5pc 0.5pc;
- }
-
- p.blurb img
- {
- padding: 1pt;
- }
-
-/*=============================================================================
- Variable Lists
-=============================================================================*/
-
- span.term
- {
- font-weight: bold;
- font-size: 10pt;
- }
-
- div.variablelist table tbody tr td
- {
- text-align: left;
- vertical-align: top;
- padding: 0em 2em 0em 0em;
- font-size: 10pt;
- }
-
- div.variablelist table tbody tr td p
- {
- margin: 0em 0em 0.5em 0em;
- }
-
- /* Make the terms in definition lists bold */
- div.variablelist dl dt
- {
- font-weight: bold;
- font-size: 10pt;
- }
-
- div.variablelist dl dd
- {
- margin: 1em 0em 1em 2em;
- font-size: 10pt;
- }
-
-/*=============================================================================
- Misc
-=============================================================================*/
-
- /* Title of books and articles in bibliographies */
- span.title
- {
- font-style: italic;
- }
-
- span.underline
- {
- text-decoration: underline;
- }
-
- span.strikethrough
- {
- text-decoration: line-through;
- }
-
- /* Copyright, Legal Notice */
- div div.legalnotice p
- {
- font-size: 8pt;
- text-align: left
- }
-
-/*=============================================================================
- Colors
-=============================================================================*/
-
- @media screen
- {
- /* Links */
- a
- {
- color: #0C7445;
- }
-
- a:visited
- {
- color: #663974;
- }
-
- h1 a, h2 a, h3 a, h4 a, h5 a, h6 a,
- h1 a:hover, h2 a:hover, h3 a:hover, h4 a:hover, h5 a:hover, h6 a:hover,
- h1 a:visited, h2 a:visited, h3 a:visited, h4 a:visited, h5 a:visited, h6 a:visited
- {
- text-decoration: none; /* no underline */
- color: #000000;
- }
-
- /* Syntax Highlighting */
- .keyword { color: #0000AA; }
- .identifier { color: #000000; }
- .special { color: #707070; }
- .preprocessor { color: #402080; }
- .char { color: teal; }
- .comment { color: #800000; }
- .string { color: teal; }
- .number { color: teal; }
- .white_bkd { background-color: #E8FBE9; }
- .dk_grey_bkd { background-color: #A0DAAC; }
-
- /* Copyright, Legal Notice */
- .copyright
- {
- color: #666666;
- font-size: small;
- }
-
- div div.legalnotice p
- {
- color: #666666;
- }
-
- /* Program listing */
- pre.synopsis
- {
- border: 1px solid #DCDCDC;
- border-bottom: 3px solid #9D9D9D;
- border-right: 3px solid #9D9D9D;
- background-color: #FAFFFB;
- }
-
- .programlisting,
- .screen
- {
- border: 1px solid #DCDCDC;
- border-bottom: 3px solid #9D9D9D;
- border-right: 3px solid #9D9D9D;
- background-color: #FAFFFB;
- }
-
- /* Blurbs */
- div.note,
- div.tip,
- div.important,
- div.caution,
- div.warning,
- p.blurb
- {
- border: 1px solid #DCDCDC;
- border-bottom: 3px solid #9D9D9D;
- border-right: 3px solid #9D9D9D;
- background-color: #FAFFFB;
- }
-
- /* Table of contents */
- .toc
- {
- border: 1px solid #DCDCDC;
- border-bottom: 3px solid #9D9D9D;
- border-right: 3px solid #9D9D9D;
- background-color: #FAFFFB;
- }
-
- /* Table of contents */
- .toc-main
- {
- border: 1px solid #DCDCDC;
- border-bottom: 3px solid #9D9D9D;
- border-right: 3px solid #9D9D9D;
- background-color: #FAFFFB;
- }
-
-
- /* Tables */
- div.informaltable table tr td,
- div.table table tr td
- {
- border: 1px solid #DCDCDC;
- background-color: #FAFFFB;
- }
-
- div.informaltable table tr th,
- div.table table tr th
- {
- background-color: #E3F9E4;
- border: 1px solid #DCDCDC;
- }
-
- /* Misc */
- span.highlight
- {
- color: #00A000;
- }
- }
-
- @media print
- {
- /* Links */
- a
- {
- color: black;
- }
-
- a:visited
- {
- color: black;
- }
-
- .spirit-nav
- {
- display: none;
- }
-
- /* Program listing */
- pre.synopsis
- {
- border: 1px solid gray;
- background-color: #FAFFFB;
- }
-
- .programlisting,
- .screen
- {
- border: 1px solid gray;
- background-color: #FAFFFB;
- }
-
- /* Table of contents */
- .toc
- {
- border: 1px solid #DCDCDC;
- border-bottom: 3px solid #9D9D9D;
- border-right: 3px solid #9D9D9D;
- background-color: #FAFFFB;
- }
-
- /* Table of contents */
- .toc-main
- {
- border: 1px solid #DCDCDC;
- border-bottom: 3px solid #9D9D9D;
- border-right: 3px solid #9D9D9D;
- background-color: #FAFFFB;
- }
-
- .informaltable table,
- .table table
- {
- border: 1px solid #DCDCDC;
- border-bottom: 3px solid #9D9D9D;
- border-right: 3px solid #9D9D9D;
- border-collapse: collapse;
- background-color: #FAFFFB;
- }
-
- /* Tables */
- div.informaltable table tr td,
- div.table table tr td
- {
- border: 1px solid #DCDCDC;
- background-color: #FAFFFB;
- }
-
- div.informaltable table tr th,
- div.table table tr th
- {
- border: 1px solid #DCDCDC;
- background-color: #FAFFFB;
- }
-
- /* Misc */
- span.highlight
- {
- font-weight: bold;
- }
- }

Deleted: sandbox/move/libs/intrusive/doc/html/images/blank.png
==============================================================================
Binary file. No diff available.

Deleted: sandbox/move/libs/intrusive/doc/html/images/caution.png
==============================================================================
Binary file. No diff available.

Deleted: sandbox/move/libs/intrusive/doc/html/images/draft.png
==============================================================================
Binary file. No diff available.

Deleted: sandbox/move/libs/intrusive/doc/html/images/home.png
==============================================================================
Binary file. No diff available.

Deleted: sandbox/move/libs/intrusive/doc/html/images/important.png
==============================================================================
Binary file. No diff available.

Deleted: sandbox/move/libs/intrusive/doc/html/images/next.png
==============================================================================
Binary file. No diff available.

Deleted: sandbox/move/libs/intrusive/doc/html/images/note.png
==============================================================================
Binary file. No diff available.

Deleted: sandbox/move/libs/intrusive/doc/html/images/prev.png
==============================================================================
Binary file. No diff available.

Deleted: sandbox/move/libs/intrusive/doc/html/images/tip.png
==============================================================================
Binary file. No diff available.

Deleted: sandbox/move/libs/intrusive/doc/html/images/toc-blank.png
==============================================================================
Binary file. No diff available.

Deleted: sandbox/move/libs/intrusive/doc/html/images/toc-minus.png
==============================================================================
Binary file. No diff available.

Deleted: sandbox/move/libs/intrusive/doc/html/images/toc-plus.png
==============================================================================
Binary file. No diff available.

Deleted: sandbox/move/libs/intrusive/doc/html/images/up.png
==============================================================================
Binary file. No diff available.

Deleted: sandbox/move/libs/intrusive/doc/html/images/warning.png
==============================================================================
Binary file. No diff available.

Deleted: sandbox/move/libs/intrusive/doc/html/reference.css
==============================================================================
--- sandbox/move/libs/intrusive/doc/html/reference.css 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,13 +0,0 @@
-/*=============================================================================
- Copyright (c) 2004 Joel de Guzman
- http://spirit.sourceforge.net/
-
- Use, modification and distribution is subject to the Boost Software
- License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
- http://www.boost.org/LICENSE_1_0.txt)
-=============================================================================*/
-PRE.synopsis {
- background-color: #e0ffff;
- border: thin solid blue;
- padding: 1em
-}

Deleted: sandbox/move/libs/intrusive/doc/intrusive.qbk
==============================================================================
--- sandbox/move/libs/intrusive/doc/intrusive.qbk 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,3898 +0,0 @@
-[/
- / Copyright (c) 2007-2009 Ion Gaztanaga
- /
- / Distributed under the Boost Software License, Version 1.0. (See accompanying
- / file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- /]
-
-[library Boost.Intrusive
- [quickbook 1.4]
- [authors [Krzikalla, Olaf], [Gaztanaga, Ion]]
- [copyright 2005 Olaf Krzikalla, 2006-2009 Ion Gaztanaga]
- [id intrusive]
- [dirname intrusive]
- [purpose Intrusive containers]
- [license
- Distributed under the Boost Software License, Version 1.0.
- (See accompanying file LICENSE_1_0.txt or copy at
- [@http://www.boost.org/LICENSE_1_0.txt])
- ]
-]
-
-[section:introduction Introduction]
-
-[section:introduction_presenting Presenting Boost.Intrusive]
-
-[*Boost.Intrusive] is a library presenting some intrusive containers to
-the world of C++. Intrusive containers are special containers
-that offer [link intrusive.performance better performance]
-and exception safety guarantees than non-intrusive containers (like STL containers).
-
-The performance benefits of intrusive containers makes them ideal as a building
-block to efficiently construct complex containers like multi-index containers or
-to design high performance code like memory allocation algorithms.
-
-While intrusive containers were and are widely used in C, they
-became more and more forgotten in C++ due to the presence of the standard
-containers which don't support intrusive techniques.[*Boost.Intrusive] not only
-reintroduces this technique to C++, but also encapsulates the implementation in
-STL-like interfaces. Hence anyone familiar with standard containers can easily use
-[*Boost.Intrusive].
-
-[endsect]
-
-[section:introduction_building_intrusive Building Boost.Intrusive]
-
-There is no need to compile anything to use [*Boost.Intrusive], since it's
-a header only library. Just include your Boost header directory in your
-compiler include path.
-
-[endsect]
-
-[endsect]
-
-[section:intrusive_vs_nontrusive Intrusive and non-intrusive containers]
-
-[section:differences_intrusive_vs_nontrusive Differences between intrusive and non-intrusive containers]
-
-The main difference between intrusive containers and non-intrusive containers is
-that in C++ non-intrusive containers store [*copies] of values passed by the user.
-Containers use the `Allocator` template parameter to allocate the stored values:
-
-[c++]
-
- #include <list>
- #include <assert.h>
-
- int main()
- {
- std::list<MyClass> myclass_list;
-
- MyClass myclass(...);
- myclass_list.push_back(myclass);
-
- //The stored object is different from the original object
- assert(&myclass != &myclass_list.front());
- return 0;
- }
-
-
-To store the newly allocated copy of `myclass`, the container needs additional
-data: `std::list` usually allocates nodes that contain pointers to the
-next and previous node and the value itself. Something similar to:
-
-[c++]
-
- //A possible implementation of a std::list<MyClass> node
- class list_node
- {
- list_node *next;
- list_node *previous;
- MyClass value;
- };
-
-
-On the other hand, an intrusive container does not store copies of passed objects,
-but it stores the objects themselves. The additional data needed to insert the object
-in the container must be provided by the object itself. For example, to insert `MyClass`
-in an intrusive container that implements a linked list, `MyClass` must contain the
-needed ['next] and ['previous] pointers:
-
-[c++]
-
- class MyClass
- {
- MyClass *next;
- MyClass *previous;
- //Other members...
- };
-
- int main()
- {
- acme_intrusive_list<MyClass> list;
-
- MyClass myclass;
- list.push_back(myclass);
-
- //"myclass" object is stored in the list
- assert(&myclass == &list.front());
- return 0;
- }
-
-As we can see, knowing which additional data the class should contain is not
-an easy task. [*Boost.Intrusive] offers several intrusive containers and an easy
-way to make user classes compatible with those containers.
-
-[endsect]
-
-[section:properties_of_intrusive Properties of Boost.Intrusive containers]
-
-Semantically, a [*Boost.Intrusive] container is similar to a STL container
-holding pointers to objects. That is, if you have an intrusive list holding
-objects of type `T`, then `std::list<T*>` would allow you to do quite the
-same operations (maintaining and navigating a set of objects of type T and
-types derived from it).
-
-A non-intrusive container has some limitations:
-
-* An object can only belong to one container: If you want to share an object
- between two containers, you either have to store multiple copies of those
- objects or you need to use containers of pointers: `std::list<Object*>`.
-
-* The use of dynamic allocation to create copies of passed values can be a performance
- and size bottleneck in some applications. Normally, dynamic allocation imposes
- a size overhead for each allocation to store bookkeeping information and a
- synchronization to protected concurrent allocation from different threads.
-
-* Only copies of objects are stored in non-intrusive containers. Hence copy
- or move constructors and copy or move assignment operators are required. Non-copyable
- and non-movable objects can't be stored in non-intrusive containers.
-
-* It's not possible to store a derived object in a STL-container while
- retaining its original type.
-
-Intrusive containers have some important advantages:
-
-* Operating with intrusive containers doesn't invoke any memory management at all.
- The time and size overhead associated with dynamic memory can be minimized.
-
-* Iterating an Intrusive container needs less memory accesses than the semantically
- equivalent container of pointers: iteration is faster.
-
-* Intrusive containers offer better exception guarantees than non-intrusive containers.
- In some situations intrusive containers offer a no-throw guarantee that can't be
- achieved with non-intrusive containers.
-
-* The computation of an iterator to an element from a pointer or reference to that element
- is a constant time operation (computing the position of `T*` in a `std::list<T*>` has
- linear complexity).
-
-* Intrusive containers offer predictability when inserting and erasing objects since no
- memory management is done with intrusive containers. Memory management usually is not a predictable
- operation so complexity guarantees from non-intrusive containers are looser than the guarantees
- offered by intrusive containers.
-
-Intrusive containers have also downsides:
-
-* Each type stored in an intrusive container needs additional memory holding the
- maintenance information needed by the container. Hence, whenever a certain type will
- be stored in an intrusive container [*you have to change the definition of that type]
- appropriately. Although this task is easy with [*Boost.Intrusive], touching the
- definition of a type is sometimes a crucial issue.
-
-* In intrusive containers you don't store a copy of an object, [*but rather the original object
- is linked with other objects in the container]. Objects don't need copy-constructors or assignment
- operators to be stored in intrusive containers. But you have to take care of possible side effects,
- whenever you change the contents of an object (this is especially important for
- associative containers).
-
-* The user [*has to manage the lifetime of inserted objects] independently from the
- containers.
-
-* Again you have to be [*careful]: in contrast to STL containers [*it's easy to render an
- iterator invalid] without touching the intrusive container directly, because the object
- can be disposed before is erased from the container.
-
-* [*Boost.Intrusive] containers are [*non-copyable and non-assignable]. Since intrusive
- containers don't have allocation capabilities, these operations make no sense. However,
- swapping can be used to implement move capabilities. To ease the implementation of
- copy constructors and assignment operators of classes storing [*Boost.Intrusive]
- containers, [*Boost.Intrusive] offers special cloning functions. See
- [link intrusive.clone_from Cloning [*Boost.Intrusive] containers] section for more information.
-
-* Analyzing the thread safety of a program that uses containers is harder with intrusive containers, because
- the container might be modified indirectly without an explicit call to a container member.
-
-[table Summary of intrusive containers advantages and disadvantages
- [[Issue] [Intrusive] [Non-intrusive]]
- [[Memory management] [External] [Internal through allocator]]
- [[Insertion/Erasure time] [Faster] [Slower]]
- [[Memory locality] [Better] [Worse]]
- [[Can hold non-copyable and non-movable objects by value] [Yes] [No]]
- [[Exception guarantees] [Better] [Worse]]
- [[Computation of iterator from value] [Constant] [Non-constant]]
- [[Insertion/erasure predictability] [High] [Low]]
- [[Memory use] [Minimal] [More than minimal]]
- [[Insert objects by value retaining polymorphic behavior] [Yes] [No (slicing)]]
- [[User must modify the definition of the values to insert] [Yes] [No]]
- [[Containers are copyable] [No] [Yes]]
- [[Inserted object's lifetime managed by] [User (more complex)] [Container (less complex)]]
- [[Container invariants can be broken without using the container] [Easier] [Harder (only with containers of pointers)]]
- [[Thread-safety analysis] [Harder] [Easier]]
-]
-
-For a performance comparison between Intrusive and Non-intrusive containers see
-[link intrusive.performance Performance] section.
-
-[endsect]
-
-[endsect]
-
-[section:usage How to use Boost.Intrusive]
-
-If you plan to insert a class in an intrusive container, you have to make some decisions
-influencing the class definition itself. Each class that will be used in an intrusive
-container needs some appropriate data members storing the information needed by the
-container. We will take a simple intrusive container, the intrusive list
-([classref boost::intrusive::list boost::intrusive::list]), for the following
-examples, but all [*Boost.Intrusive] containers are very similar. To compile
-the example using [classref boost::intrusive::list boost::intrusive::list],
-just include:
-
-[c++]
-
- #include <boost/intrusive/list.hpp>
-
-Every class to be inserted in an intrusive container, needs to contain a hook that
-will offer the necessary data and resources to be insertable in the container.
-With [*Boost.Intrusive] you just choose the hook to be a public base class or
-a public member of the class to be inserted.
-
-[section:usage_base_hook Using base hooks]
-
-For [classref boost::intrusive::list list], you can publicly derive from
-[classref boost::intrusive::list_base_hook list_base_hook].
-
-[c++]
-
- template <class ...Options>
- class list_base_hook;
-
-The class can take several options. [*Boost.Intrusive] classes receive arguments in the
-form `option_name<option_value>`. You can specify the following options:
-
-* [*`tag<class Tag>`]: this argument serves as a tag, so you can derive from more than one
- [classref boost::intrusive::list_base_hook list_base_hook] and hence put an object in
- multiple intrusive lists at the same time. An incomplete type can serve as a tag.
- If you specify two base hooks, you [*must] specify a different
- tag for each one. Example: `list_base_hook< tag<tag1> >`. If no tag is specified
- a default one will be used (more on default tags later).
-
-* [*`link_mode<link_mode_type LinkMode>`]: The second template argument controls the
- linking policy. [*Boost.Intrusive] currently supports
- 3 modes: `normal_link`, `safe_link` and `auto_unlink`. By default, `safe_link`
- mode is used. More about these in sections
- [link intrusive.safe_hook Safe hooks] and [link intrusive.auto_unlink_hooks Auto-unlink hooks].
- Example: `list_base_hook< link_mode<auto_unlink> >`
-
-* [*`void_pointer<class VoidPointer>`]: this option is the pointer type to be used
- internally in the hook. The default value is `void *`, which means that raw pointers
- will be used in the hook. More about this in the section titled
- [link intrusive.using_smart_pointers Using smart pointers with Boost.Intrusive containers].
- Example: `list_base_hook< void_pointer< my_smart_ptr<void> >`
-
-For the following examples, let's forget the options and use the default values:
-
-[c++]
-
- #include <boost/intrusive/list.hpp>
-
- using namespace boost::intrusive;
-
- class Foo
- //Base hook with default tag, raw pointers and safe_link mode
- : public list_base_hook<>
- { /**/ };
-
-After that, we can define the intrusive list:
-
-[c++]
-
- template <class T, class ...Options>
- class list;
-
-`list` receives the type to be inserted in the container (`T`) as the first parameter
-and optionally, the user can specify options. We have 3 option types:
-
-* [*`base_hook<class Hook>`] / [*`member_hook<class T, class Hook, Hook T::* PtrToMember>`] /
- [*`value_traits<class ValueTraits>`]: All these options specify the relationship
- between the type `T` to be inserted in the list and the hook (since we can
- have several hooks in the same `T` type). `member_hook` will be explained
- a bit later and `value_traits` will be explained in the
- [link intrusive.value_traits Containers with custom ValueTraits] section.
- [*If no option is specified, the container will be configured to use the base
- hook with the default tag].
- Some options configured for the hook (the type of the pointers, link mode, etc.)
- will be propagated to the container.
-
-* [*`constant_time_size<bool Enabled>`]: Specifies if a constant time `size()`
- function is demanded for the container. This will instruct the intrusive
- container to store an additional member to keep track of the current size of the
- container. By default, constant-time size is activated.
-
-* [*`size_type<bool Enabled>`]: Specifies a type that can hold
- the size of the container. This type will be the type returned by `list.size()`
- and the type stored in the intrusive container if `constant_time_size<true>`
- is requested.
- The user normally will not need to change this type, but some
- containers can have a `size_type` that might be different from `std::size_t`
- (for example, STL-like containers use the `size_type` defined by their allocator).
- [*Boost.Intrusive] can be used to implement such containers specifying the
- the type of the size. By default the type is `std::size_t`.
-
-Example of a constant-time size intrusive list that will store Foo objects, using
-the base hook with the default tag:
-
-[c++]
-
- typedef list<Foo> FooList;
-
-Example of a intrusive list with non constant-time size that will store Foo objects:
-
-[c++]
-
- typedef list<Foo, constant_time_size<false> > FooList;
-
-Remember that the user must specify the base hook if the base hook has no default tag
-(e.g: if more than one base hook is used):
-
-[c++]
-
- #include <boost/intrusive/list.hpp>
-
- using namespace boost::intrusive;
-
- struct my_tag;
-
- typedef list_base_hook< tag<my_tag> > BaseHook;
- class Foo : public BaseHook
- { /**/ };
-
- typedef list< Foo, base_hook<BaseHook> > FooList;
-
-Once the list is defined, we can use it:
-
-[c++]
-
- //An object to be inserted in the list
- Foo foo_object;
- FooList list;
-
- list.push_back(object);
-
- assert(&list.front() == &foo_object);
-
-[endsect]
-
-[section:usage_member_hook Using member hooks]
-
-Sometimes an 'is-a' relationship between list hooks and the list value types
-is not desirable. In this case, using a member hook as a data member instead of
-'disturbing' the hierarchy might be the right way: you can add a public data
-member `list_member_hook<...>` to your class.
-This class can be configured with the same options as `list_base_hook`
-except the option `tag`:
-
-[c++]
-
- template <class ...Options>
- class list_member_hook;
-
-Example:
-
-[c++]
-
- #include <boost/intrusive/list.hpp>
-
- class Foo
- {
- public:
- list_member_hook<> hook_;
- //...
- };
-
-When member hooks are used, the `member_hook` option is used to configure the
-list:
-
-[c++]
-
- //This option will configure "list" to use the member hook
- typedef member_hook<Foo, list_member_hook<>, &Foo::hook_> MemberHookOption;
-
- //This list will use the member hook
- typedef list<Foo, MemberHookOption> FooList;
-
-Now we can use the container:
-
-[c++]
-
- //An object to be inserted in the list
- Foo foo_object;
- FooList list;
-
- list.push_back(object);
-
- assert(&list.front() == &foo_object);
-
-[endsect]
-
-[section:usage_both_hooks Using both hooks]
-
-You can insert the same object in several intrusive containers at the same time,
-using one hook per container. This is a full example using base and member hooks:
-
-[import ../example/doc_how_to_use.cpp]
-[doc_how_to_use_code]
-
-[endsect]
-
-[section:usage_lifetime Object lifetime]
-
-Even if the interface of [classref boost::intrusive::list list] is similar to
-`std::list`, its usage is a bit different: You always have to keep in mind that
-you directly store objects in intrusive containers, not copies. The lifetime of a
-stored object is not bound to or managed by the container:
-
-* When the container gets destroyed before the object, the object is not destroyed,
- so you have to be careful to avoid resource leaks.
-
-* When the object is destroyed before the container, your program is likely to crash,
- because the container contains a pointer to an non-existing object.
-
-[endsect]
-
-[endsect]
-
-[section:usage_when When to use?]
-
-Intrusive containers can be used for highly optimized algorithms, where speed is a crucial
-issue and:
-
-* additional memory management should be avoided.
-* the programmer needs to efficiently track the construction and destruction of objects.
-* exception safety, especially the no-throw guarantee, is needed.
-* the computation of an iterator to an element from a pointer or reference
- to that element should be a constant time operation.
-* it's important to achieve a well-known worst-time system response.
-* localization of data (e.g. for cache hit optimization) leads to measurable effects.
-
-The last point is important if you have a lot of containers over a set of elements. E.g. if
-you have a vector of objects (say, `std::vector<Object>`), and you also have a list
-storing a subset of those objects (`std::list<Object*>`), then operating on an Object
-from the list iterator (`std::list<Object*>::iterator`) requires two steps:
-
-* Access from the iterator (usually on the stack) to the list node storing a pointer to `Object`.
-* Access from the pointer to `Object` to the Object stored in the vector.
-
-While the objects themselves are tightly packed in the memory of the vector
-(a vector's memory is guaranteed to be contiguous), and form something
-like a data block, list nodes may be dispersed in the heap memory.
-Hence depending on your system you might get a lot of cache misses. The same doesn't hold
-for an intrusive list. Indeed, dereferencing an iterator from an intrusive list is performed in
-the same two steps as described above. But the list node is already embedded in the Object, so
-the memory is directly tracked from the iterator to the Object.
-
-It's also possible to use intrusive containers when the objects to be stored can
-have different or unknown size. This allows storing base and derived objects
-in the same container, as shown in the following example:
-
-[import ../example/doc_window.cpp]
-[doc_window_code]
-
-Due to certain properties of intrusive containers
-they are often more difficult to use than their STL-counterparts. That's why you
-should avoid them in public interfaces of libraries. Classes to be stored in intrusive
-containers must change their implementation to store the hook and this is not always
-possible or desirable.
-
-[endsect]
-
-[section:concepts_summary Concept summary]
-
-Here is a small summary of the basic concepts that will be used in the following
-chapters:
-
-[variablelist Brief Concepts Summary
-[[Node Algorithms][A class containing typedefs and static functions that define
- basic operations that can be applied to a group of nodes. It's independent
- from the node definition and configured using a NodeTraits template
- parameter that describes the node.]]
-[[Node Traits][A class that stores basic information and operations to insert a node into a group of nodes.]]
-[[Hook][A class that a user must add as a base class or as a member to make the user class compatible with intrusive containers.]]
-[[Intrusive Container][A class that stores user classes that have the needed hooks. It takes a ValueTraits template parameter as configuration information.]]
-[[Semi-Intrusive Container][Similar to an intrusive container but a semi-intrusive container needs additional memory (e.g. an auxiliary array) to work.]]
-[[Value Traits][A class containing typedefs and operations to obtain the node to be used by Node Algorithms from the user class and the inverse.]]
-]
-
-[endsect]
-
-[section:presenting_containers Presenting Boost.Intrusive containers]
-
-[*Boost.Intrusive] offers a wide range of intrusive containers:
-
-* [*slist]: An intrusive singly linked list. The size overhead is very small
- for user classes (usually the size of one pointer) but many operations have linear
- time complexity, so the user must be careful if he wants to avoid performance problems.
-
-* [*list]: A `std::list` like intrusive linked list. The size overhead is quite
- small for user classes (usually the size of two pointers). Many operations have
- constant time complexity.
-
-* [*set/multiset/rbtree]: `std::set/std::multiset` like intrusive associative containers
- based on red-black trees.
- The size overhead is moderate for user classes (usually the size of three pointers).
- Many operations have logarithmic time complexity.
-
-* [*avl_set/avl_multiset/avltree]: A `std::set/std::multiset` like intrusive associative
- containers based on AVL trees.
- The size overhead is moderate for user classes (usually the size of three pointers).
- Many operations have logarithmic time complexity.
-
-* [*splay_set/splay_multiset/splaytree]: `std::set/std::multiset` like intrusive associative
- containers based on splay trees. Splay trees have no constant operations, but they
- have some interesting caching properties.
- The size overhead is moderate for user classes (usually the size of three pointers).
- Many operations have logarithmic time complexity.
-
-* [*sg_set/sg_multiset/sgtree]: A `std::set/std::multiset` like intrusive associative
- containers based on scapegoat trees. Scapegoat can be configured with the desired
- balance factor to achieve the desired rebalancing frequency/search time compromise.
- The size overhead is moderate for user classes (usually the size of three pointers).
- Many operations have logarithmic time complexity.
-
-[*Boost.Intrusive] also offers semi-intrusive containers:
-
-* [*unordered_set/unordered_multiset]: `std::tr1::unordered_set/std::tr1::unordered_multiset`
- like intrusive unordered associative containers.
- The size overhead is moderate for user classes (an average of two pointers per element).
- Many operations have amortized constant time complexity.
-
-Most of these intrusive containers can be configured with constant or linear time
-size:
-
-* [*Linear time size]: The intrusive container doesn't hold a size member that is
-updated with every insertion/erasure. This implies that the `size()` function doesn't have constant
-time complexity. On the other hand, the container is smaller, and some operations, like
-`splice()` taking a range of iterators in linked lists, have constant time complexity
-instead of linear complexity.
-
-* [*Constant time size]: The intrusive container holds a size member that is updated
-with every insertion/erasure. This implies that the `size()` function has constant time
-complexity. On the other hand, increases the size of the container, and some operations,
-like `splice()` taking a range of iterators, have linear time complexity in linked lists.
-
-To make user classes compatible with these intrusive containers [*Boost.Intrusive]
-offers two types of hooks for each container type:
-
-* [*Base hook]: The hook is stored as a public base class of the user class.
-
-* [*Member hook]: The hook is stored as a public member of the user class.
-
-Apart from that, [*Boost.Intrusive] offers additional features:
-
-* [*Safe mode hooks]: Hook constructor initializes the internal data to a well-known
- safe state and intrusive containers check that state before inserting a value in the
- container. When erasing an element from the container, the container puts the hook
- in the safe state again. This allows a safer use mode and it can be used to detect
- programming errors. It implies a slight performance overhead in some operations
- and can convert some constant time operations to linear time operations.
-
-* [*Auto-unlink hooks]: The hook destructor removes the object from the container
- automatically and the user can safely unlink the object from the container without
- referring to the container.
-
-* [*Non-raw pointers]: If the user wants to use smart pointers instead of raw pointers,
- [*Boost.Intrusive] hooks can
- be configured to use any type of pointer. This configuration information is also
- transmitted to the containers, so all the internal pointers used by intrusive containers
- configured with these hooks will be smart pointers. As an example,
- [*Boost.Interprocess] defines a smart pointer compatible with shared memory,
- called `offset_ptr`. [*Boost.Intrusive] can be configured to use this smart pointer
- to allow shared memory intrusive containers.
-
-[endsect]
-
-[section:safe_hook Safe hooks]
-
-[section:features Features of the safe mode]
-
-[*Boost.Intrusive] hooks can be configured to operate in safe-link mode.
-The safe mode is activated by default, but it can be also explicitly activated:
-
-[c++]
-
- //Configuring the safe mode explicitly
- class Foo : public list_base_hook< link_mode<safe_link> >
- {};
-
-With the safe mode the user can detect if the object
-is actually inserted in a container without any external reference. Let's review the basic features of the safe mode:
-
-* Hook's constructor puts the hook in a well-known default state.
-
-* Hook's destructor checks if the hook is in the well-known default state. If not,
- an assertion is raised.
-
-* Every time an object is inserted in the intrusive container, the container
- checks if the hook is in the well-known default state. If not,
- an assertion is raised.
-
-* Every time an object is being erased from the intrusive container, the container
- puts the erased object in the well-known default state.
-
-With these features, without any external reference the user can know if the object
-has been inserted in a container by calling the `is_linked()` member function.
-If the object is not actually inserted
-in a container, the hook is in the default state, and if it is inserted in a container, the
-hook is not in the default state.
-
-[endsect]
-
-[section:configuring Configuring safe-mode assertions]
-
-By default, all safe-mode assertions raised by [*Boost-Intrusive] hooks
-and containers in are implemented using `BOOST_ASSERT`, which can be configured by
-the user. See [@http://www.boost.org/libs/utility/assert.html] for more
-information about `BOOST_ASSERT`.
-
-`BOOST_ASSERT` is globally configured, so the user might
-want to redefine intrusive safe-mode assertions without modifying the global
-`BOOST_ASSERT`. This can be achieved redefining the following macros:
-
-* `BOOST_INTRUSIVE_SAFE_HOOK_DEFAULT_ASSERT`: This assertion will be
- used in insertion functions of the intrusive containers to check that
- the hook of the value to be inserted is default constructed.
-* `BOOST_INTRUSIVE_SAFE_HOOK_DESTRUCTOR_ASSERT`: This assertion will be
- used in hooks' destructors to check that the hook is in a default state.
-
-If any of these macros is not redefined, the assertion will default to `BOOST_ASSERT`.
-If `BOOST_INTRUSIVE_SAFE_HOOK_DEFAULT_ASSERT` or `BOOST_INTRUSIVE_SAFE_HOOK_DESTRUCTOR_ASSERT`
-is defined and the programmer needs to include a file to configure that assertion, it can define
-`BOOST_INTRUSIVE_SAFE_HOOK_DESTRUCTOR_ASSERT_INCLUDE` or `BOOST_INTRUSIVE_SAFE_HOOK_DEFAULT_ASSERT_INCLUDE`
-with the name of the file to include:
-
-[c++]
-
- #define BOOST_INTRUSIVE_SAFE_HOOK_DESTRUCTOR_ASSERT MYASSERT
- #define BOOST_INTRUSIVE_SAFE_HOOK_DESTRUCTOR_ASSERT_INCLUDE <myassert.h>
-
-[endsect]
-
-[endsect]
-
-[section:auto_unlink_hooks Auto-unlink hooks]
-
-[section:auto_unlink_hooks_what What's an auto-unlink hook?]
-
-[*Boost.Intrusive] offers additional hooks with unique features:
-
-* When the destructor of the hook is called, the hook checks if the node is inserted
- in a container. If so, the hook removes the node from the container.
-* The hook has a member function called `unlink()` that can be used to unlink the
- node from the container at any time, without having any reference to the container,
- if the user wants to do so.
-
-These hooks have exactly the same size overhead as their analog non auto-unlinking
-hooks, but they have a restriction: they can only be used with
-[link intrusive.presenting_containers non-constant time containers].
-There is a reason for this:
-
-* Auto-unlink hooks don't store any reference to the container where they are inserted.
-* Only containers with non constant-time `size()` allow removing an object from the container
- without referring to the container.
-
-This auto-unlink feature is useful in certain applications
-but it must be used [*very carefully]:
-
-* If several threads are using the same container the destructor of the auto-unlink
- hook will be called without any thread synchronization so removing the object is
- thread-unsafe.
-
-* Container contents change silently without modifying the container directly.
- This can lead to surprising effects.
-
-These auto-unlink hooks have also safe-mode properties:
-
-* Hooks' constructors put the hook in a well-known default state.
-
-* Every time an object is inserted in the intrusive container, the container
- checks if the hook is in the well-known default state. If not,
- an assertion is raised.
-
-* Every time an object is erased from an intrusive container, the container
- puts the erased object in the well-known default state.
-
-[endsect]
-
-[section:auto_unlink_hooks_example Auto-unlink hook example]
-
-Let's see an example of an auto-unlink hook:
-
-[import ../example/doc_auto_unlink.cpp]
-[doc_auto_unlink_code]
-
-[endsect]
-
-[section:auto_unlink_and_constant_time Auto-unlink hooks and containers with constant-time `size()`]
-
-As explained, [*Boost.Intrusive] auto-unlink hooks are incompatible with containers
-that have constant-time `size()`, so if you try to define such container with an
-auto-unlink hook's value_traits, you will get a static assertion:
-
-[c++]
-
- #include <boost/intrusive/list.hpp>
-
- using boost::intrusive;
-
- struct MyTag;
-
- class MyClass : public list_base_hook< link_mode<auto_unlink> >
- {/**/};
-
- list <MyClass, constant_time_size<true> > bad_list;
-
- int main()
- {
- bad_list list;
- return 0;
- }
-
-leads to an error similar to:
-
-[pre
- error : use of undefined type 'boost::STATIC_ASSERTION_FAILURE<false>'
-]
-
-Pointing to code like this:
-
-[c++]
-
- //Constant-time size is incompatible with auto-unlink hooks!
- BOOST_STATIC_ASSERT(!(constant_time_size && ((int)value_traits::link_mode == (int)auto_unlink)));
-
-This way, there is no way to compile a program if you try to use auto-unlink hooks
-in constant-time size containers.
-
-[endsect]
-
-[endsect]
-
-[section:slist Intrusive singly linked list: slist]
-
-[classref boost::intrusive::slist slist] is the simplest intrusive container of
-[*Boost.Intrusive]: a singly linked list. The memory overhead
-it imposes is 1 pointer per node. The size of an empty, non constant-time size
-[classref boost::intrusive::slist slist] is the size of 1 pointer. This
-lightweight memory overhead comes with drawbacks, though: many operations have
-linear time complexity, even some that usually are constant time, like
-[classref boost::intrusive::slist::swap swap]. [classref boost::intrusive::slist slist]
-only provides forward iterators.
-
-For most cases, a doubly linked list is preferable because it offers more
-constant-time functions with a slightly bigger size overhead.
-However, for some applications like
-constructing more elaborate containers, singly linked lists are essential
-because of their low size overhead.
-
-[section:slist_hooks slist hooks]
-
-Like the rest of [*Boost.Intrusive] containers,
-[classref boost::intrusive::slist slist] has two hook types:
-
-[c++]
-
- template <class ...Options>
- class slist_base_hook;
-
-* [classref boost::intrusive::slist_base_hook slist_base_hook]:
- the user class derives publicly from
- [classref boost::intrusive::slist_base_hook slist_base_hook] to make
- it [classref boost::intrusive::slist slist]-compatible.
-
-[c++]
-
- template <class ...Options>
- class slist_member_hook;
-
-* [classref boost::intrusive::slist_member_hook slist_member_hook]:
- the user class contains a public
- [classref boost::intrusive::slist_member_hook slist_member_hook] to make
- it [classref boost::intrusive::slist slist]-compatible.
-
-[classref boost::intrusive::slist_base_hook slist_base_hook] and
-[classref boost::intrusive::slist_member_hook slist_member_hook]
-receive the same options explained in
-the section [link intrusive.usage How to use Boost.Intrusive]:
-
-* [*`tag<class Tag>`] (for base hooks only): This argument serves as a tag,
- so you can derive from more than one slist hook.
- Default: `tag<default_tag>`.
-
-* [*`link_mode<link_mode_type LinkMode>`]: The linking policy.
- Default: `link_mode<safe_link>`.
-
-* [*`void_pointer<class VoidPointer>`]: The pointer type to be used
- internally in the hook and propagated to the container.
- Default: `void_pointer<void*>`.
-
-[endsect]
-
-[section:slist_container slist container]
-
-[c++]
-
- template <class T, class ...Options>
- class slist;
-
-[classref boost::intrusive::slist slist] receives the options explained in
-the section [link intrusive.usage How to use Boost.Intrusive]:
-
-* [*`base_hook<class Hook>`] / [*`member_hook<class T, class Hook, Hook T::* PtrToMember>`] /
- [*`value_traits<class ValueTraits>`]: To specify the hook type or value traits used
- to configure the container. (To learn about value traits go to the section
- [link intrusive.value_traits Containers with custom ValueTraits].)
-
-* [*`constant_time_size<bool Enabled>`]: To activate the constant-time `size()` operation.
- Default: `constant_time_size<true>`
-
-* [*`size_type<bool Enabled>`]: To specify the type that will be used to store the size
- of the container. Default: `size_type<std::size_t>`.
-
-[classref boost::intrusive::slist slist] can receive additional options:
-
-* [*`linear<bool Enable>`]: the singly linked list is implemented as a
- null-terminated list instead of a circular list. This allows `O(1)` swap,
- but losses some operations like `container_from_end_iterator`.
-* [*`cache_last<bool Enable>`]: the singly linked also stores a pointer to the
- last element of the singly linked list. This allows `O(1)` swap,
- `splice_after(iterator, slist &)` and makes the list offer new functions
- like `push_back(reference)` and `back()`. Logically, the size an empty list is
- increased in `sizeof(void_pointer)` and the the cached last node pointer must
- be updated in every operation, and that might incur in a slight performance impact.
-
-`auto_unlink` hooks are not usable if `linear<true>` and/or `cache_last<true>` options are
-used. If `auto_unlink` hooks are used and those options are specified, a static
-assertion will be raised.
-
-[endsect]
-
-[section:slist_example Example]
-
-Now let's see a small example using both hooks:
-
-[import ../example/doc_slist.cpp]
-[doc_slist_code]
-
-[endsect]
-
-[endsect]
-
-[section:list Intrusive doubly linked list: list]
-
-[classref boost::intrusive::list list] is a doubly linked list. The memory overhead
-it imposes is 2 pointers per node. An empty, non constant-time size [classref boost::intrusive::list list]
-also has the size of 2 pointers. [classref boost::intrusive::list list]
-has many more constant-time operations than [classref boost::intrusive::slist slist]
-and provides a bidirectional iterator. It is recommended to use
-[classref boost::intrusive::list list] instead of
-[classref boost::intrusive::slist slist] if the size overhead is acceptable:
-
-[section:list_hooks list hooks]
-
-Like the rest of [*Boost.Intrusive] containers,
-[classref boost::intrusive::list list] has two hook types:
-
-[c++]
-
- template <class ...Options>
- class list_base_hook;
-
-* [classref boost::intrusive::list_base_hook list_base_hook]: the user class
- derives publicly from [classref boost::intrusive::list_base_hook list_base_hook]
- to make it [classref boost::intrusive::list list]-compatible.
-
-[c++]
-
- template <class ...Options>
- class list_member_hook;
-
-* [classref boost::intrusive::list_member_hook list_member_hook]:
- the user class contains a public
- [classref boost::intrusive::list_member_hook list_member_hook] to make
- it [classref boost::intrusive::list list]-compatible.
-
-[classref boost::intrusive::list_base_hook list_base_hook] and
-[classref boost::intrusive::list_member_hook list_member_hook] receive
-the same options explained in the section
-[link intrusive.usage How to use Boost.Intrusive]:
-
-* [*`tag<class Tag>`] (for base hooks only): This argument serves as a tag,
- so you can derive from more than one list hook.
- Default: `tag<default_tag>`.
-
-* [*`link_mode<link_mode_type LinkMode>`]: The linking policy.
- Default: `link_mode<safe_link>`.
-
-* [*`void_pointer<class VoidPointer>`]: The pointer type to be used
- internally in the hook and propagated to the container.
- Default: `void_pointer<void*>`.
-
-[endsect]
-
-[section:list_container list container]
-
-[c++]
-
- template <class T, class ...Options>
- class list;
-
-[classref boost::intrusive::list list] receives the same options explained in
-the section [link intrusive.usage How to use Boost.Intrusive]:
-
-* [*`base_hook<class Hook>`] / [*`member_hook<class T, class Hook, Hook T::* PtrToMember>`] /
- [*`value_traits<class ValueTraits>`]: To specify the hook type or value traits used
- to configure the container. (To learn about value traits go to the section
- [link intrusive.value_traits Containers with custom ValueTraits].)
-
-* [*`constant_time_size<bool Enabled>`]: To activate the constant-time `size()` operation.
- Default: `constant_time_size<true>`
-
-* [*`size_type<bool Enabled>`]: To specify the type that will be used to store the size
- of the container. Default: `size_type<std::size_t>`
-
-[endsect]
-
-[section:list_example Example]
-
-Now let's see a small example using both hooks:
-
-[import ../example/doc_list.cpp]
-[doc_list_code]
-
-[endsect]
-
-[endsect]
-
-[section:set_multiset Intrusive associative containers: set, multiset, rbtree]
-
-[*Boost.Intrusive] also offers associative containers that can be very useful
-when creating more complex associative containers, like containers maintaining
-one or more indices with different sorting semantics. Boost.Intrusive associative
-containers, like most STL associative container implementations are based on
-red-black trees.
-
-The memory overhead of these containers is usually 3 pointers and a bit (with
-alignment issues, this means 3 pointers and an integer).
-This size can be reduced to 3 pointers if pointers have even alignment
-(which is usually true in most systems).
-
-An empty, non constant-time size [classref boost::intrusive::set set],
-[classref boost::intrusive::multiset multiset] or
-[classref boost::intrusive::rbtree rbtree]
-has also the size of 3 pointers and an integer (3 pointers when optimized for size).
-These containers have logarithmic complexity in many
-operations like
-searches, insertions, erasures, etc. [classref boost::intrusive::set set] and
-[classref boost::intrusive::multiset multiset] are the
-intrusive equivalents of standard `std::set` and `std::multiset` containers.
-
-[classref boost::intrusive::rbtree rbtree] is a superset of
-[classref boost::intrusive::set set] and
-[classref boost::intrusive::multiset multiset] containers that offers
-functions to insert unique and multiple keys.
-
-[section:set_multiset_hooks set, multiset and rbtree hooks]
-
-[classref boost::intrusive::set set],
-[classref boost::intrusive::multiset multiset] and
-[classref boost::intrusive::rbtree rbtree] share the same hooks.
-This is an advantage, because the same
-user type can be inserted first in a [classref boost::intrusive::multiset multiset]
-and after that in [classref boost::intrusive::set set] without
-changing the definition of the user class.
-
-[c++]
-
- template <class ...Options>
- class set_base_hook;
-
-* [classref boost::intrusive::set_base_hook set_base_hook]:
- the user class derives publicly from
- [classref boost::intrusive::set_base_hook set_base_hook] to make
- it [classref boost::intrusive::set set]/[classref boost::intrusive::multiset multiset]-compatible.
-
-[c++]
-
- template <class ...Options>
- class set_member_hook;
-
-* [classref boost::intrusive::set_member_hook set_member_hook]:
- the user class contains a public
- [classref boost::intrusive::set_member_hook set_member_hook] to make
- it [classref boost::intrusive::set set]/[classref boost::intrusive::multiset multiset]-compatible.
-
-[classref boost::intrusive::set_base_hook set_base_hook] and
-[classref boost::intrusive::set_member_hook set_member_hook] receive
-the same options explained in the section
-[link intrusive.usage How to use Boost.Intrusive] plus a size optimization option:
-
-* [*`tag<class Tag>`] (for base hooks only): This argument serves as a tag,
- so you can derive from more than one base hook.
- Default: `tag<default_tag>`.
-
-* [*`link_mode<link_mode_type LinkMode>`]: The linking policy.
- Default: `link_mode<safe_link>`.
-
-* [*`void_pointer<class VoidPointer>`]: The pointer type to be used
- internally in the hook and propagated to the container.
- Default: `void_pointer<void*>`.
-
-* [*`optimize_size<bool Enable>`]: The hook will be optimized for size
- instead of speed. The hook will embed the color bit of the red-black
- tree node in the parent pointer if pointer alignment is even.
- In some platforms, optimizing the size might reduce speed performance a bit
- since masking operations will be needed to access parent pointer and color attributes,
- in other platforms this option improves performance due to improved memory locality.
- Default: `optimize_size<false>`.
-
-[endsect]
-
-[section:set_multiset_containers set, multiset and rbtree containers]
-
-[c++]
-
- template <class T, class ...Options>
- class set;
-
- template <class T, class ...Options>
- class multiset;
-
- template <class T, class ...Options>
- class rbtree;
-
-These containers receive the same options explained in the section
-[link intrusive.usage How to use Boost.Intrusive]:
-
-* [*`base_hook<class Hook>`] / [*`member_hook<class T, class Hook, Hook T::* PtrToMember>`] /
- [*`value_traits<class ValueTraits>`]: To specify the hook type or value traits used
- to configure the container. (To learn about value traits go to the section
- [link intrusive.value_traits Containers with custom ValueTraits].)
-
-* [*`constant_time_size<bool Enabled>`]: To activate the constant-time `size()` operation.
- Default: `constant_time_size<true>`
-
-* [*`size_type<bool Enabled>`]: To specify the type that will be used to store the size
- of the container. Default: `size_type<std::size_t>`
-
-And they also can receive an additional option:
-
-* [*`compare<class Compare>`]: Comparison function for the objects to be inserted
- in containers. The comparison functor must induce a strict weak ordering.
- Default: `compare< std::less<T> >`
-
-[endsect]
-
-[section:set_multiset_example Example]
-
-Now let's see a small example using both hooks and both containers:
-
-[import ../example/doc_set.cpp]
-[doc_set_code]
-
-[endsect]
-
-[endsect]
-
-[section:unordered_set_unordered_multiset Semi-Intrusive unordered associative containers: unordered_set, unordered_multiset]
-
-[*Boost.Intrusive] also offers hashed containers that can be very useful to implement
-fast-lookup containers. These containers
-([classref boost::intrusive::unordered_set unordered_set] and [classref boost::intrusive::unordered_multiset unordered_multiset])
-are semi-intrusive containers: they need additional memory apart from the hook
-stored in the `value_type`. This additional
-memory must be passed in the constructor of the container.
-
-Unlike C++ TR1 unordered associative containers (which are also hashed containers),
-the contents of these semi-intrusive containers are not rehashed to maintain a
-load factor: that would require memory management and intrusive containers don't
-implement any memory management at all. However, the user can request an explicit
-rehashing passing a new bucket array.
-This also offers an additional guarantee over TR1 unordered associative containers:
-[*iterators are not invalidated when inserting an element] in the container.
-
-As with TR1 unordered associative containers, rehashing invalidates iterators,
-changes ordering between elements and changes which buckets elements appear in,
-but does not invalidate pointers or references to elements.
-
-Apart from expected hash and equality function objects, [*Boost.Intrusive] unordered
-associative containers' constructors take an argument specifying an auxiliary
-bucket vector to be used by the container.
-
-[section:unordered_set_unordered_multiset_performance unordered_set and unordered_multiset performance notes]
-
-The size overhead for a hashed container is moderate: 1 pointer per value plus
-a bucket array per container. The size of an element of the bucket array
-is usually one pointer. To obtain a good performance hashed container,
-the bucket length is usually the same as the number of elements that the
-container contains, so a well-balanced hashed container (`bucket_count()` is
-equal to `size()` ) will have an equivalent overhead of two pointers per element.
-
-An empty, non constant-time size [classref boost::intrusive::unordered_set unordered_set] or
-[classref boost::intrusive::unordered_multiset unordered_multiset]
-has also the size of `bucket_count()` pointers.
-
-Insertions, erasures, and searches, have amortized constant-time complexity in
-hashed containers. However, some worst-case guarantees are linear. See
-[classref boost::intrusive::unordered_set unordered_set] or
-[classref boost::intrusive::unordered_multiset unordered_multiset] for complexity guarantees
-of each operation.
-
-[*Be careful with non constant-time size hashed containers]: some operations, like
-`empty()`, have linear complexity, unlike other [*Boost.Intrusive] containers.
-
-[endsect]
-
-[section:unordered_set_unordered_multiset_hooks unordered_set and unordered_multiset hooks]
-
-[classref boost::intrusive::unordered_set unordered_set] and [classref boost::intrusive::unordered_multiset unordered_multiset] share the same hooks. This is an advantage, because the same
-user type can be inserted first in a [classref boost::intrusive::unordered_multiset unordered_multiset] and after that in [classref boost::intrusive::unordered_set unordered_set] without
-changing the definition of the user class.
-
-[c++]
-
- template <class ...Options>
- class unordered_set_base_hook;
-
-* [classref boost::intrusive::unordered_set_base_hook unordered_set_base_hook]:
- the user class derives publicly from
- [classref boost::intrusive::unordered_set_base_hook unordered_set_base_hook] to make
- it [classref boost::intrusive::unordered_set unordered_set]/[classref boost::intrusive::unordered_multiset unordered_multiset]-compatible.
-
-[c++]
-
- template <class ...Options>
- class unordered_set_member_hook;
-
-* [classref boost::intrusive::unordered_set_member_hook unordered_set_member_hook]:
- the user class contains a public
- [classref boost::intrusive::unordered_set_member_hook unordered_set_member_hook] to make
- it [classref boost::intrusive::unordered_set unordered_set]/[classref boost::intrusive::unordered_multiset unordered_multiset]-compatible.
-
-[classref boost::intrusive::unordered_set_base_hook unordered_set_base_hook] and
-[classref boost::intrusive::unordered_set_member_hook unordered_set_member_hook] receive
-the same options explained in the section
-[link intrusive.usage How to use Boost.Intrusive]:
-
-* [*`tag<class Tag>`] (for base hooks only): This argument serves as a tag,
- so you can derive from more than one base hook.
- Default: `tag<default_tag>`.
-
-* [*`link_mode<link_mode_type LinkMode>`]: The linking policy.
- Default: `link_mode<safe_link>`.
-
-* [*`void_pointer<class VoidPointer>`]: The pointer type to be used
- internally in the hook and propagated to the container.
- Default: `void_pointer<void*>`.
-
-Apart from them, these hooks offer additional options:
-
-* [*`store_hash<bool Enabled>`]: This option reserves additional space in
- the hook to store the hash value of the object once it's introduced in the
- container. When this option is used, the unordered container will store
- the calculated hash value in the hook and rehashing operations won't need
- to recalculate the hash of the value.
- This option will improve the performance of unordered containers when
- rehashing is frequent or hashing the value is a slow operation.
- Default: `store_hash<false>`.
-
-* [*`optimize_multikey<bool Enabled>`]: This option reserves additional space in
- the hook that will be used to group equal elements in unordered multisets,
- improving significantly the performance when many equal values are inserted
- in these containers. Default: `optimize_multikey<false>`.
-
-[endsect]
-
-[section:unordered_set_unordered_multiset_containers unordered_set and unordered_multiset containers]
-
-[c++]
-
- template<class T, class ...Options>
- class unordered_set;
-
- template<class T, class ...Options>
- class unordered_multiset;
-
-As mentioned, unordered containers need an auxiliary array to work. [*Boost.Intrusive]
-unordered containers receive this auxiliary array packed in a type called `bucket_traits`
-(which can be also customized by a container option). All unordered containers receive
-a `bucket_traits` object in their constructors. The default `bucket_traits` class
-is initialized with a pointer to an array of buckets and its size:
-
-[c++]
-
- #include <boost/intrusive/unordered_set.hpp>
-
- using namespace boost::intrusive;
-
- struct MyClass : public unordered_set_base_hook<>
- {};
-
- typedef unordered_set<MyClass>::bucket_type bucket_type;
- typedef unordered_set<MyClass>::bucket_traits bucket_traits;
-
- int main()
- {
- bucket_type buckets[100];
- unordered_set<MyClass> uset(bucket_traits(buckets, 100));
- return 0;
- }
-
-Each hashed container needs [*its own bucket traits], that is, [*its own
-bucket vector]. Two hashed containers
-[*can't] share the same `bucket_type` elements. The bucket array [*must] be
-destroyed [*after] the container using it is destroyed, otherwise, the result
-is undefined.
-
-[classref boost::intrusive::unordered_set unordered_set] and
-[classref boost::intrusive::unordered_multiset unordered_multiset]
-receive the same options explained in the section
-[link intrusive.usage How to use Boost.Intrusive]:
-
-* [*`base_hook<class Hook>`] / [*`member_hook<class T, class Hook, Hook T::* PtrToMember>`] /
- [*`value_traits<class ValueTraits>`]: To specify the hook type or value traits used
- to configure the container. (To learn about value traits go to the section
- [link intrusive.value_traits Containers with custom ValueTraits].)
-
-* [*`constant_time_size<bool Enabled>`]: To activate the constant-time `size()` operation.
- Default: `constant_time_size<true>`
-
-* [*`size_type<bool Enabled>`]: To specify the type that will be used to store the size
- of the container. Default: `size_type<std::size_t>`
-
-And they also can receive additional options:
-
-* [*`equal<class Equal>`]: Equality function for the objects to be inserted
- in containers. Default: `equal< std::equal_to<T> >`
-
-* [*`hash<class Hash>`]: Hash function to be used in the container.
- Default: `hash< boost::hash<T> >`
-
-* [*`bucket_traits<class BucketTraits>`]: A type that wraps the bucket vector to
- be used by the unordered container. Default: a type initialized by the address
- and size of a bucket array and stores both variables internally.
-
-* [*`power_2_buckets<bool Enabled>`]: The user guarantees that only bucket arrays
- with power of two length will be used. The container will then use masks instead of modulo
- operations to obtain the bucket number from the hash value. Masks are faster than
- modulo operations and for some applications modulo operations can impose
- a considerable overhead. In debug mode an assertion will be raised if the user
- provides a bucket length that is not power of two.
- Default: `power_2_buckets<false>`.
-
-* [*`cache_begin<bool Enabled>`]:
- [*Note: this option is not compatible with `auto_unlink` hooks].
- Due to its internal structure, finding the first
- element of an unordered container (`begin()` operation) is
- amortized constant-time. It's possible to speed up `begin()` and other operations
- related to it (like `clear()`) if the container caches internally the position
- of the first element. This imposes the overhead of one pointer to the size
- of the container. Default: `cache_begin<false>`.
-
-* [*`compare_hash<bool Enabled>`]:
- [*Note: this option requires `store_hash<true>` option in the hook].
- When the comparison function is expensive,
- (e.g. strings with a long common predicate) sometimes (specially when the
- load factor is high or we have many equivalent elements in an
- [classref boost::intrusive::unordered_multiset unordered_multiset] and
- no `optimize_multikey<>` is activated in the hook)
- the equality function is a performance problem. Two equal values must have
- equal hashes, so comparing the hash values of two elements before using the
- comparison functor can speed up some implementations.
-
-* [*`incremental<bool Enabled>`]: Activates incremental hashing (also known as Linear Hashing).
- This option implies `power_2_buckets<true>` and the container will require power of two buckets.
- For more information on incremental hashing, see
- [@http://en.wikipedia.org/wiki/Linear_hashing `Linear hash` on Wikipedia]
- Default: `incremental<false>`
-
-[endsect]
-
-[section:unordered_set_unordered_multiset_example Example]
-
-Now let's see a small example using both hooks and both containers:
-
-[import ../example/doc_unordered_set.cpp]
-[doc_unordered_set_code]
-
-[endsect]
-
-[section:custom_bucket_traits Custom bucket traits]
-
-Instead of using the default `bucket_traits` class to store the bucket array, a user
-can define his own class to store the bucket array using the [*['bucket_traits<>]]
-option. A user-defined bucket-traits must fulfill the following interface:
-
-[c++]
-
- class my_bucket_traits
- {
- bucket_ptr bucket_begin();
- const_bucket_ptr bucket_begin() const;
- std::size_t bucket_count() const;
- };
-
-
-The following bucket traits just stores a pointer to the bucket
-array but the size is a compile-time constant. Note the use of the auxiliary
-[classref boost::intrusive::unordered_bucket unordered_bucket] and
-[classref boost::intrusive::unordered_bucket_ptr unordered_bucket_ptr]
-utilities to obtain the type of the bucket and its pointer before defining
-the unordered container:
-
-[import ../example/doc_bucket_traits.cpp]
-[doc_bucket_traits]
-
-[endsect]
-
-[endsect]
-
-[section:splay_set_multiset Intrusive splay tree based associative containers: splay_set, splay_multiset and , splay_tree]
-
-C++ associative containers are usually based on red-black tree implementations (e.g.: STL,
-Boost.Intrusive associative containers). However, there are other interesting data
-structures that offer some advantages (and also disadvantages).
-
-Splay trees are self-adjusting binary search trees used typically in caches, memory
-allocators and other applications, because splay trees have a "caching effect": recently
-accessed elements have better access times than elements accessed less frequently.
-For more information on splay trees see [@http://en.wikipedia.org/wiki/Splay_tree Wikipedia entry].
-
-[*Boost.Intrusive] offers 3 containers based on splay trees:
-[classref boost::intrusive::splay_set splay_set],
-[classref boost::intrusive::splay_multiset splay_multiset] and
-[classref boost::intrusive::splaytree splaytree]. The first two are similar to
-[classref boost::intrusive::set set] or
-[classref boost::intrusive::multiset multiset] and the latter is a generalization
-that offers functions both to insert unique and multiple keys.
-
-The memory overhead of these containers with Boost.Intrusive hooks is usually 3 pointers.
-An empty, non constant-time size splay container has also a size of 3 pointers.
-
-[section:splay_set_multiset_disadvantages Advantages and disadvantages of splay tree based containers]
-
-Splay tree based intrusive containers have logarithmic complexity in many
-operations like searches, insertions, erasures, etc., but if some elements are
-more frequently accessed than others, splay trees perform faster searches than equivalent
-balanced binary trees (such as red-black trees).
-
-The caching effect offered by splay trees comes with a cost: the tree must be
-rebalanced when an element is searched. This disallows const versions of search
-functions like `find()`, `lower_bound()`, `upper_bound()`, `equal_range()`,
-`count()`, etc.
-
-Because of this, splay-tree based associative containers are not drop-in
-replacements of [classref boost::intrusive::set set]/
-[classref boost::intrusive::multiset multiset].
-
-Apart from this, if element searches are randomized, the tree will be rebalanced
-without taking advantage of the cache effect, so splay trees can offer worse
-performance than other balanced trees for some search patterns.
-
-[endsect]
-
-[section:splay_set_multiset_hooks splay_set, splay_multiset and splaytree hooks]
-
-[classref boost::intrusive::splay_set splay_set],
-[classref boost::intrusive::splay_multiset splay_multiset] and
-[classref boost::intrusive::splaytree splaytree]
-share the same hooks.
-
-[c++]
-
- template <class ...Options>
- class splay_set_base_hook;
-
-* [classref boost::intrusive::splay_set_base_hook splay_set_base_hook]:
- the user class derives publicly from this class to make
- it compatible with splay tree based containers.
-
-[c++]
-
- template <class ...Options>
- class splay_set_member_hook;
-
-* [classref boost::intrusive::set_member_hook set_member_hook]:
- the user class contains a public member of this class to make
- it compatible with splay tree based containers.
-
-[classref boost::intrusive::splay_set_base_hook splay_set_base_hook] and
-[classref boost::intrusive::splay_set_member_hook splay_set_member_hook] receive
-the same options explained in the section
-[link intrusive.usage How to use Boost.Intrusive]:
-
-* [*`tag<class Tag>`] (for base hooks only): This argument serves as a tag,
- so you can derive from more than one base hook.
- Default: `tag<default_tag>`.
-
-* [*`link_mode<link_mode_type LinkMode>`]: The linking policy.
- Default: `link_mode<safe_link>`.
-
-* [*`void_pointer<class VoidPointer>`]: The pointer type to be used
- internally in the hook and propagated to the container.
- Default: `void_pointer<void*>`.
-
-[endsect]
-
-[section:set_multiset_containers splay_set, splay_multiset and splaytree containers]
-
-[c++]
-
- template <class T, class ...Options>
- class splay_set;
-
- template <class T, class ...Options>
- class splay_multiset;
-
- template <class T, class ...Options>
- class splaytree;
-
-These containers receive the same options explained in the section
-[link intrusive.usage How to use Boost.Intrusive]:
-
-* [*`base_hook<class Hook>`] / [*`member_hook<class T, class Hook, Hook T::* PtrToMember>`] /
- [*`value_traits<class ValueTraits>`]: To specify the hook type or value traits used
- to configure the container. (To learn about value traits go to the section
- [link intrusive.value_traits Containers with custom ValueTraits].)
-
-* [*`constant_time_size<bool Enabled>`]: To activate the constant-time `size()` operation.
- Default: `constant_time_size<true>`
-
-* [*`size_type<bool Enabled>`]: To specify the type that will be used to store the size
- of the container. Default: `size_type<std::size_t>`
-
-And they also can receive an additional option:
-
-* [*`compare<class Compare>`]: Comparison function for the objects to be inserted
- in containers. The comparison functor must induce a strict weak ordering.
- Default: `compare< std::less<T> >`
-
-[endsect]
-
-[section:splay_set_bst_hook Splay trees with BST hooks]
-
-Intrusive splay containers can also use plain binary search tree hooks
-[classref boost::intrusive::bs_set_base_hook bs_set_base_hook] and
-[classref boost::intrusive::bs_set_base_hook bs_set_base_hook].
-These hooks can be used by other intrusive containers like
-intrusive scapegoat containers
-[classref boost::intrusive::sg_set sg_set] and
-[classref boost::intrusive::sg_multiset sg_multiset]. A programmer
-might prefer using a binary search tree hook so that the same type
-can be inserted in some situations in a splay container but
-also inserted in other compatible containers when
-the hook is not being used in a splay container.
-
-[classref boost::intrusive::bs_set_base_hook bs_set_base_hook] and
-[classref boost::intrusive::bs_set_base_hook bs_set_member_hook] admit
-the same options as [classref boost::intrusive::splay_set_base_hook splay_set_base_hook].
-
-[endsect]
-
-[section:splay_set_multiset_example Example]
-
-Now let's see a small example using both splay hooks,
-binary search tree hooks and
-[classref boost::intrusive::splay_set splay_set]/
-[classref boost::intrusive::splay_multiset splay_multiset]
-containers:
-
-[import ../example/doc_splay_set.cpp]
-[doc_splay_set_code]
-
-[endsect]
-
-[endsect]
-
-[section:avl_set_multiset Intrusive avl tree based associative containers: avl_set, avl_multiset and avltree]
-
-Similar to red-black trees, AVL trees are balanced binary trees.
-AVL trees are often compared with red-black trees because they support the same set of operations
-and because both take O(log n) time for basic operations.
-AVL trees are more rigidly balanced than Red-Black trees, leading to slower insertion and
-removal but faster retrieval, so AVL trees perform better
-than red-black trees for lookup-intensive applications.
-
-[*Boost.Intrusive] offers 3 containers based on avl trees:
-[classref boost::intrusive::avl_set avl_set],
-[classref boost::intrusive::avl_multiset avl_multiset] and
-[classref boost::intrusive::avltree avltree]. The first two are similar to
-[classref boost::intrusive::set set] or
-[classref boost::intrusive::multiset multiset] and the latter is a generalization
-that offers functions both to insert unique and multiple keys.
-
-The memory overhead of these containers with Boost.Intrusive hooks is usually 3
-pointers and 2 bits (due to alignment, this usually means 3 pointers plus an integer).
-This size can be reduced to 3 pointers if pointers have 4 byte alignment
-(which is usually true in 32 bit systems).
-
-An empty, non constant-time size [classref boost::intrusive::avl_set avl_set],
-[classref boost::intrusive::avl_multiset avl_multiset] or
-[classref boost::intrusive::avltree avltree]
-also has a size of 3 pointers and an integer (3 pointers when optimized for size).
-
-[section:avl_set_multiset_hooks avl_set, avl_multiset and avltree hooks]
-
-[classref boost::intrusive::avl_set avl_set],
-[classref boost::intrusive::avl_multiset avl_multiset] and
-[classref boost::intrusive::avltree avltree]
-share the same hooks.
-
-[c++]
-
- template <class ...Options>
- class avl_set_base_hook;
-
-* [classref boost::intrusive::avl_set_base_hook avl_set_base_hook]:
- the user class derives publicly from this class to make
- it compatible with avl tree based containers.
-
-[c++]
-
- template <class ...Options>
- class avl_set_member_hook;
-
-* [classref boost::intrusive::set_member_hook set_member_hook]:
- the user class contains a public member of this class to make
- it compatible with avl tree based containers.
-
-[classref boost::intrusive::avl_set_base_hook avl_set_base_hook] and
-[classref boost::intrusive::avl_set_member_hook avl_set_member_hook] receive
-the same options explained in the section
-[link intrusive.usage How to use Boost.Intrusive] plus an option to optimize
-the size of the node:
-
-* [*`tag<class Tag>`] (for base hooks only): This argument serves as a tag,
- so you can derive from more than one base hook.
- Default: `tag<default_tag>`.
-
-* [*`link_mode<link_mode_type LinkMode>`]: The linking policy.
- Default: `link_mode<safe_link>`.
-
-* [*`void_pointer<class VoidPointer>`]: The pointer type to be used
- internally in the hook and propagated to the container.
- Default: `void_pointer<void*>`.
-
-* [*`optimize_size<bool Enable>`]: The hook will be optimized for size
- instead of speed. The hook will embed the balance bits of the AVL
- tree node in the parent pointer if pointer alignment is multiple of 4.
- In some platforms, optimizing the size might reduce speed performance a bit
- since masking operations will be needed to access parent pointer and balance factor attributes,
- in other platforms this option improves performance due to improved memory locality.
- Default: `optimize_size<false>`.
-
-[endsect]
-
-[section:set_multiset_containers avl_set, avl_multiset and avltree containers]
-
-[c++]
-
- template <class T, class ...Options>
- class avl_set;
-
- template <class T, class ...Options>
- class avl_multiset;
-
- template <class T, class ...Options>
- class avltree;
-
-These containers receive the same options explained in the section
-[link intrusive.usage How to use Boost.Intrusive]:
-
-* [*`base_hook<class Hook>`] / [*`member_hook<class T, class Hook, Hook T::* PtrToMember>`] /
- [*`value_traits<class ValueTraits>`]: To specify the hook type or value traits used
- to configure the container. (To learn about value traits go to the section
- [link intrusive.value_traits Containers with custom ValueTraits].)
-
-* [*`constant_time_size<bool Enabled>`]: To activate the constant-time `size()` operation.
- Default: `constant_time_size<true>`
-
-* [*`size_type<bool Enabled>`]: To specify the type that will be used to store the size
- of the container. Default: `size_type<std::size_t>`
-
-And they also can receive an additional option:
-
-* [*`compare<class Compare>`]: Comparison function for the objects to be inserted
- in containers. The comparison functor must induce a strict weak ordering.
- Default: `compare< std::less<T> >`
-
-[endsect]
-
-[section:avl_set_multiset_example Example]
-
-Now let's see a small example using both hooks and
-[classref boost::intrusive::avl_set avl_set]/
-[classref boost::intrusive::avl_multiset avl_multiset]
-containers:
-
-[import ../example/doc_avl_set.cpp]
-[doc_avl_set_code]
-
-[endsect]
-
-[endsect]
-
-
-[section:sg_set_multiset Intrusive scapegoat tree based associative containers: sg_set, sg_multiset and sgtree]
-
-A scapegoat tree is a self-balancing binary search tree, that provides worst-case O(log n)
-lookup time, and O(log n) amortized insertion and deletion time.
-Unlike other self-balancing binary search trees that provide worst case O(log n) lookup
-time, scapegoat trees have no additional per-node overhead compared to a regular binary
-search tree.
-
-A binary search tree is said to be weight balanced if half the nodes are on the left
-of the root, and half on the right. An a-height-balanced tree is defined with defined
-with the following equation:
-
-[*['height(tree) <= log1/a(tree.size())]]
-
-* [*['a == 1]]: A tree forming a linked list is considered balanced.
-* [*['a == 0.5]]: Only a perfectly balanced binary is considered balanced.
-
-Scapegoat trees are loosely ['a-height-balanced] so:
-
-[*['height(tree) <= log1/a(tree.size()) + 1]]
-
-Scapegoat trees support any a between 0.5 and 1. If a is higher, the tree is rebalanced
-less often, obtaining quicker insertions but slower searches. Lower
-a values improve search times. Scapegoat-trees implemented in [*Boost.Intrusive] offer the possibility of
-[*changing a at run-time] taking advantage of the flexibility of scapegoat trees.
-For more information on scapegoat trees see [@http://en.wikipedia.org/wiki/Scapegoat_tree Wikipedia entry].
-
-Scapegoat trees also have downsides:
-
-* They need additional storage of data on the
- root (the size of the tree, for example) to achieve logarithmic complexity operations
- so it's not possible to offer `auto_unlink` hooks. The size of an empty scapegoat
- tree is also considerably increased.
-
-* The operations needed to determine if the tree is unbalanced require floating-point
- operations like ['log1/a]. If the system has no floating point operations (like some
- embedded systems), scapegoat tree operations might become slow.
-
-[*Boost.Intrusive] offers 3 containers based on scapegoat trees:
-[classref boost::intrusive::sg_set sg_set],
-[classref boost::intrusive::sg_multiset sg_multiset] and
-[classref boost::intrusive::sgtree sgtree]. The first two are similar to
-[classref boost::intrusive::set set] or
-[classref boost::intrusive::multiset multiset] and the latter is a generalization
-that offers functions both to insert unique and multiple keys.
-
-The memory overhead of these containers with Boost.Intrusive hooks is 3
-pointers.
-
-An empty, [classref boost::intrusive::sg_set sg_set],
-[classref boost::intrusive::sg_multiset sg_multiset] or
-[classref boost::intrusive::sgtree sgtree]
-has also the size of 3 pointers, two integers and two floating point values
-(equivalent to the size of 7 pointers on most systems).
-
-[section:sg_set_multiset_hooks Using binary search tree hooks: bs_set_base_hook and bs_set_member_hook]
-
-[classref boost::intrusive::sg_set sg_set],
-[classref boost::intrusive::sg_multiset sg_multiset] and
-[classref boost::intrusive::sgtree sgtree] don't use their
-own hooks but plain binary search tree hooks. This has many advantages
-since binary search tree hooks can also be used to insert values in
-splay and treap containers.
-
-[c++]
-
- template <class ...Options>
- class bs_set_base_hook;
-
-* [classref boost::intrusive::bs_set_base_hook bs_set_base_hook]:
- the user class derives publicly from this class to make
- it compatible with scapegoat tree based containers.
-
-[c++]
-
- template <class ...Options>
- class bs_set_member_hook;
-
-* [classref boost::intrusive::set_member_hook set_member_hook]:
- the user class contains a public member of this class to make
- it compatible with scapegoat tree based containers.
-
-[classref boost::intrusive::bs_set_base_hook bs_set_base_hook] and
-[classref boost::intrusive::bs_set_member_hook bs_set_member_hook] receive
-the same options explained in the section
-[link intrusive.usage How to use Boost.Intrusive]:
-
-* [*`tag<class Tag>`] (for base hooks only): This argument serves as a tag,
- so you can derive from more than one base hook.
- Default: `tag<default_tag>`.
-
-* [*`link_mode<link_mode_type LinkMode>`]: The linking policy.
- Default: `link_mode<safe_link>`.
-
-* [*`void_pointer<class VoidPointer>`]: The pointer type to be used
- internally in the hook and propagated to the container.
- Default: `void_pointer<void*>`.
-
-[endsect]
-
-[section:sg_set_multiset_containers sg_set, sg_multiset and sgtree containers]
-
-[c++]
-
- template <class T, class ...Options>
- class sg_set;
-
- template <class T, class ...Options>
- class sg_multiset;
-
- template <class T, class ...Options>
- class sgtree;
-
-These containers receive the same options explained in the section
-[link intrusive.usage How to use Boost.Intrusive]:
-
-* [*`base_hook<class Hook>`] / [*`member_hook<class T, class Hook, Hook T::* PtrToMember>`] /
- [*`value_traits<class ValueTraits>`]: To specify the hook type or value traits used
- to configure the container. (To learn about value traits go to the section
- [link intrusive.value_traits Containers with custom ValueTraits].)
-
-* [*`size_type<bool Enabled>`]: To specify the type that will be used to store the size
- of the container. Default: `size_type<std::size_t>`
-
-And they also can receive additional options:
-
-* [*`compare<class Compare>`]: Comparison function for the objects to be inserted
- in containers. The comparison functor must induce a strict weak ordering.
- Default: `compare< std::less<T> >`
-
-* [*`floating_point<bool Enable>`]:
- When this option is deactivated, the scapegoat tree loses the ability to change
- the balance factor a at run-time, but the size of an empty container is reduced
- and no floating point operations are performed, normally increasing container
- performance. The fixed a factor that is used when this option is activated
- is ['1/sqrt(2) ~ 0,70711]. Default: `floating_point<true>`
-
-[endsect]
-
-[section:sg_set_multiset_example Example]
-
-Now let's see a small example using both hooks and
-[classref boost::intrusive::sg_set sg_set]/
-[classref boost::intrusive::sg_multiset sg_multiset]
-containers:
-
-[import ../example/doc_sg_set.cpp]
-[doc_sg_set_code]
-
-[endsect]
-
-[endsect]
-
-
-[section:treap_set_multiset Intrusive treap based associative containers: treap_set, treap_multiset and treap]
-
-The name ['treap] is a mixture of ['tree] and ['heap] indicating that Treaps exhibit the properties of both
-binary search trees and heaps. A treap is a binary search tree that orders the nodes
-by a key but also by a priority attribute. The nodes are ordered so that the keys form a binary search tree and
-the priorities obey the max heap order property.
-
-* If v is a left descendant of u, then key[v] < key[u];
-* If v is a right descendant of u, then key[v] > key[u];
-* If v is a child of u, then priority[v] <= priority[u];
-
-If priorities are non-random, the tree will usually be unbalanced; this worse theoretical average-case
-behavior may be outweighed by better expected-case behavior, as the most important items will be near the root.
-This means most important objects will be retrieved faster than less important items and for items keys with equal keys
-most important objects will be found first. These properties are important for some applications.
-
-The priority comparison will be provided just like the key comparison, via a function object that will be
-stored in the intrusive container. This means that the priority can be stored in the value to be introduced
-in the treap or computed on flight (via hashing or similar).
-
-[*Boost.Intrusive] offers 3 containers based on treaps:
-[classref boost::intrusive::treap_set treap_set],
-[classref boost::intrusive::treap_multiset treap_multiset] and
-[classref boost::intrusive::treap treap]. The first two are similar to
-[classref boost::intrusive::set set] or
-[classref boost::intrusive::multiset multiset] and the latter is a generalization
-that offers functions both to insert unique and multiple keys.
-
-The memory overhead of these containers with Boost.Intrusive hooks is 3
-pointers.
-
-An empty, [classref boost::intrusive::treap_set treap_set],
-[classref boost::intrusive::treap_multiset treap_multiset] or
-[classref boost::intrusive::treap treap]
-has also the size of 3 pointers and an integer (supposing empty function objects for key and priority
-comparison and constant-time size).
-
-[section:treap_set_multiset_hooks Using binary search tree hooks: bs_set_base_hook and bs_set_member_hook]
-
-[classref boost::intrusive::treap_set treap_set],
-[classref boost::intrusive::treap_multiset treap_multiset] and
-[classref boost::intrusive::treap treap] don't use their
-own hooks but plain binary search tree hooks. This has many advantages
-since binary search tree hooks can also be used to insert values in
-splay containers and scapegoat trees.
-
-[c++]
-
- template <class ...Options>
- class bs_set_base_hook;
-
-* [classref boost::intrusive::bs_set_base_hook bs_set_base_hook]:
- the user class derives publicly from this class to make
- it compatible with scapegoat tree based containers.
-
-[c++]
-
- template <class ...Options>
- class bs_set_member_hook;
-
-* [classref boost::intrusive::set_member_hook set_member_hook]:
- the user class contains a public member of this class to make
- it compatible with scapegoat tree based containers.
-
-[classref boost::intrusive::bs_set_base_hook bs_set_base_hook] and
-[classref boost::intrusive::bs_set_member_hook bs_set_member_hook] receive
-the same options explained in the section
-[link intrusive.usage How to use Boost.Intrusive]:
-
-* [*`tag<class Tag>`] (for base hooks only): This argument serves as a tag,
- so you can derive from more than one base hook.
- Default: `tag<default_tag>`.
-
-* [*`link_mode<link_mode_type LinkMode>`]: The linking policy.
- Default: `link_mode<safe_link>`.
-
-* [*`void_pointer<class VoidPointer>`]: The pointer type to be used
- internally in the hook and propagated to the container.
- Default: `void_pointer<void*>`.
-
-[endsect]
-
-[section:treap_set_multiset_containers treap_set, treap_multiset and treap containers]
-
-[c++]
-
- template <class T, class ...Options>
- class treap_set;
-
- template <class T, class ...Options>
- class treap_multiset;
-
- template <class T, class ...Options>
- class treap;
-
-These containers receive the same options explained in the section
-[link intrusive.usage How to use Boost.Intrusive]:
-
-* [*`base_hook<class Hook>`] / [*`member_hook<class T, class Hook, Hook T::* PtrToMember>`] /
- [*`value_traits<class ValueTraits>`]: To specify the hook type or value traits used
- to configure the container. (To learn about value traits go to the section
- [link intrusive.value_traits Containers with custom ValueTraits].)
-
-* [*`constant_time_size<bool Enabled>`]: To activate the constant-time `size()` operation.
- Default: `constant_time_size<true>`
-
-* [*`size_type<bool Enabled>`]: To specify the type that will be used to store the size
- of the container. Default: `size_type<std::size_t>`
-
-And they also can receive additional options:
-
-* [*`compare<class Compare>`]: Comparison function for the objects to be inserted
- in containers. The comparison functor must induce a strict weak ordering.
- Default: `compare< std::less<T> >`
-
-* [*`priority<class PriorityCompare>`]: Priority Comparison function for the objects to be inserted
- in containers. The comparison functor must induce a strict weak ordering.
- Default: `priority< priority_compare<T> >`
-
-The default `priority_compare<T>` object function will call an unqualified function `priority_order`
-passing two constant `T` references as arguments and should return true if the first argument has
-higher priority (it will be searched faster), inducing strict weak ordering.
-The function will be found using ADL lookup so that
-the user just needs to define a `priority_order` function in the same namespace as his class:
-
-[c++]
-
- struct MyType
- {
- friend bool priority_order(const MyType &a, const MyType &b)
- {...}
- };
-
-or
-
- namespace mytype {
-
- struct MyType{ ... };
-
- bool priority_order(const MyType &a, const MyType &b)
- {...}
-
- } //namespace mytype {
-
-[endsect]
-
-[section:treap_set_exceptions Exception safety of treap-based intrusive containers]
-
-In general, intrusive containers offer strong safety guarantees, but treap containers must deal
-with two possibly throwing functors (one for value ordering, another for priority ordering).
-Moreover, treap erasure operations require rotations based on the priority order function and
-this issue degrades usual `erase(const_iterator)` no-throw guarantee. However, intrusive offers
-the strongest possible behaviour in these situations. In summary:
-
-* If the priority order functor does not throw, treap-based containers, offer exactly the same
- guarantees as other tree-based containers.
-
-* If the priority order functor throws, treap-based containers offer strong guarantee.
-
-[endsect]
-
-[section:treap_set_multiset_example Example]
-
-Now let's see a small example using both hooks and
-[classref boost::intrusive::treap_set treap_set]/
-[classref boost::intrusive::treap_multiset treap_multiset]
-containers:
-
-[import ../example/doc_treap_set.cpp]
-[doc_treap_set_code]
-
-[endsect]
-
-[endsect]
-
-
-[section:advanced_lookups_insertions Advanced lookup and insertion functions for associative containers]
-
-[section:advanced_lookups Advanced lookups]
-
-[*Boost.Intrusive] associative containers offer the same interface as STL associative
-containers. However, STL and TR1 ordered and unordered simple associative containers
-(`std::set`, `std::multiset`, `std::tr1::unordered_set` and `std::tr1::unordered_multiset`)
-have some inefficiencies caused by the interface: the user can only operate with `value_type`
-objects. When using these containers we must use `iterator find(const value_type &value)`
-to find a value. The same happens in other functions
-like `equal_range`, `lower_bound`, `upper_bound`, etc.
-
-However, sometimes the object to be searched is quite expensive to construct:
-
-[import ../example/doc_assoc_optimized_code.cpp]
-[doc_assoc_optimized_code_normal_find]
-
-`Expensive` is an expensive object to construct. If "key" c-string is quite long
-`Expensive` has to construct a `std::string` using heap memory. Like
-`Expensive`, many times the only member taking part in ordering issues is just
-a small part of the class. For example, with `Expensive`, only the internal
-`std::string` is needed to compare the object.
-
-In both containers, if we call `get_from_set/get_from_unordered_set` in a loop, we might get a performance penalty,
-because we are forced to create a whole `Expensive` object to be able to find an
-equivalent one.
-
-Sometimes this interface limitation is severe, because
-we [*might not have enough information to construct the object] but we might
-[*have enough information to find the object]. In this case, a name is enough
-to search `Expensive` in the container but constructing an `Expensive`
-might require more information that the user might not have.
-
-To solve this, [classref boost::intrusive::set set]/[classref boost::intrusive::multiset multiset]
-offer alternative functions, which take any type comparable with the value and a
-functor that should be compatible with the
-ordering function of the associative container.
-[classref boost::intrusive::unordered_set unordered_set]/[classref boost::intrusive::unordered_multiset unordered_multiset]
-offers functions that take any key type and compatible hash and equality functions. Now, let's see the
-optimized search function:
-
-[doc_assoc_optimized_code_optimized_find]
-
-This new arbitrary key overload is also available for other functions taking
-values as arguments:
-
-* equal_range
-* lower_bound
-* upper_bound
-* count
-* find
-* erase
-
-Check [classref boost::intrusive::set set],
-[classref boost::intrusive::multiset multiset],
-[classref boost::intrusive::unordered_set unordered_set],
-[classref boost::intrusive::unordered_multiset unordered_multiset]
-references to know more about those functions.
-
-[endsect]
-
-[section:advanced_insertions Advanced insertions]
-
-A similar issue happens with insertions in simple ordered and unordered associative
-containers with unique keys (`std::set` and `std::tr1::unordered_set`). In these containers,
-if a value is already present, the value to be inserted is discarded. With expensive
-values, if the value is already present, we can suffer efficiency problems.
-
-[classref boost::intrusive::set set] and [classref boost::intrusive::unordered_set unordered_set]
-have insertion functions to check efficiently, without
-constructing the value, if a value is present or not and if it's not present, a
-function to insert it immediately without any further lookup.
-For example, using the same `Expensive` class,
-this function can be inefficient:
-
-[doc_assoc_optimized_code_normal_insert]
-
-If the object is already present, we are constructing an `Expensive` that
-will be discarded, and this is a waste of resources. Instead of that, let's use
-`insert_check` and `insert_commit` functions:
-
-[doc_assoc_optimized_code_optimized_insert]
-
-`insert_check` is similar to a normal `insert` but:
-
-* `insert_check` can be used with arbitrary keys
-* if the insertion is possible (there is no equivalent value) `insert_check` collects all the needed information
-in an `insert_commit_data` structure, so that `insert_commit`:
- * [*does not execute] further comparisons
- * can be executed with [*constant-time complexity]
- * has [*no-throw guarantee].
-
-These functions must be used with care, since
-no other insertion or erasure must be executed between an `insert_check` and an `insert_commit`
-pair. Otherwise, the behaviour is undefined.
-`insert_check` and `insert_commit` will come in handy
-for developers programming efficient non-intrusive associative containers.
-See [classref boost::intrusive::set set]
-and [classref boost::intrusive::unordered_set unordered_set] reference for more information about
-`insert_check` and `insert_commit`.
-
-With multiple ordered and unordered associative containers
-([classref boost::intrusive::multiset multiset] and
-[classref boost::intrusive::unordered_multiset unordered_multiset]) there is
-no need for these advanced insertion functions, since insertions are always successful.
-
-[endsect]
-
-[section:positional_insertions Positional insertions]
-
-Some ordered associative containers offer low-level functions to bypass ordering
-checks and insert nodes directly in desired tree positions. These functions are
-provided for performance reasons when values to be inserted in the container are
-known to fulfill order (sets and multisets) and uniqueness (sets) invariants. A
-typical usage of these functions is when intrusive associative containers are used
-to build non-intrusive containers and the programmer wants to speed up assignments
-from other associative containers: if the ordering and uniqueness properties are the same,
-there is no need to waste time checking the position of each source value, because values
-are already ordered: back insertions will be much more efficient.
-
-[*Note:] These functions [*don't check preconditions] so they must used with care. These
-are functions are low-level operations [*will break container invariants if
-ordering and uniqueness preconditions are not assured by the caller.]
-
-Let's see an example:
-
-[import ../example/doc_positional_insertion.cpp]
-[doc_positional_insertion]
-
-
-[endsect]
-
-For more information about advanced lookup and insertion functions see
-associative containers' documentation (e.g.
-[classref boost::intrusive::set set],
-[classref boost::intrusive::multiset multiset],
-[classref boost::intrusive::unordered_set unordered_set] and
-[classref boost::intrusive::unordered_multiset unordered_multiset] references).
-
-[endsect]
-
-[section:erasing_and_disposing Erasing and disposing values from Boost.Intrusive containers]
-
-One of the most tedious tasks when using intrusive containers is the management of the erased elements.
-When using STL containers, the container itself unlinks and destroys the contained elements, but with
-intrusive containers, the user must explicitly destroy the object after erasing an element from the container.
-This makes STL-like functions erasing multiple objects unhelpful: the user can't destroy every erased element.
-For example, let's take the function `remove_if` from [classref boost::intrusive::list list]:
-
-[c++]
-
- template<class Pred>
- void remove_if(Pred pred);
-
-How can the user destroy the elements (say, using `operator delete`) that will be erased according
-to the predicate? [*Boost.Intrusive] containers offer additional functions that take a function
-object that will be called after the element has been erased from the container. For example,
-[classref boost::intrusive::list list] offers:
-
-[c++]
-
- template<class Pred, class Disposer>
- void remove_and_dispose_if(Pred pred, Disposer disposer)
-
-With this function the user can efficiently remove and destroy elements if the disposer
-function destroys an object: `remove_and_dispose_if`
-will call the "disposer" function object for every removed element. [classref boost::intrusive::list list] offers
-more functions taking a disposer function object as argument, like `erase_and_dispose`, `clear_and_dispose`,
-`remove_and_dispose`, etc.
-
-Note that the disposing function does not need to just destroy the object. It can
-implement any other operation like inserting the remove object in another container.
-Let's see a small example:
-
-[import ../example/doc_erasing_and_disposing.cpp]
-[doc_erasing_and_disposing]
-
-All [*Boost.Intrusive] containers offer these "erase + dispose" additional members for all functions
-that erase an element from the container.
-
-
-
-[endsect]
-
-[section:clone_from Cloning [*Boost.Intrusive] containers]
-
-As previously mentioned, [*Boost.Intrusive] containers are [*non-copyable and non-assignable], because
-intrusive containers don't allocate memory at all. To implement a copy-constructor or assignment operator,
-the user must clone one by one all the elements of the container and insert them in another intrusive container.
-However, cloning by hand is usually more inefficient than a member cloning function and a specialized cloning
-function can offer more guarantees than the manual cloning (better exception safety guarantees, for example).
-
-To ease the implementation of copy constructors and assignment operators of classes containing [*Boost.Intrusive]
-containers, all [*Boost.Intrusive] containers offer a special cloning function called `clone_from`.
-
-Apart from the container to be cloned, `clone_from` takes two function objects as arguments. For example, consider the
-`clone_from` member function of [classref boost::intrusive::list list]:
-
-[c++]
-
- template <class Cloner, class Disposer>
- void clone_from(const list &src, Cloner cloner, Disposer disposer);
-
-This function will make `*this` a clone of `src`. Let's explain the arguments:
-
-* The first parameter is the list to be cloned.
-* The second parameter is a function object that will clone `value_type` objects and
- return a pointer to the clone. It must implement the following function:
- `pointer operator()(const value_type &)`.
-* The second parameter is a function object that will dispose `value_type` objects. It's used first
- to empty the container before cloning and to dispose the elements if an exception is thrown.
-
-The cloning function works as follows:
-
-* First it clears and disposes all the elements from *this using the disposer function object.
-* After that it starts cloning all the elements of the source container using the cloner function object.
-* If any operation in the cloning function (for example, the cloner function object) throws,
- all the constructed elements are disposed using the disposer function object.
-
-
-Here is an example of `clone_from`:
-
-[import ../example/doc_clone_from.cpp]
-[doc_clone_from]
-
-[endsect]
-
-[section:using_smart_pointers Using smart pointers with Boost.Intrusive containers]
-
-[*Boost.Intrusive] hooks can be configured to use other pointers than raw pointers.
-When a [*Boost.Intrusive] hook is configured with a smart pointer as an argument,
-this pointer configuration is passed to the containers. For example, if the following
-hook is configured with a smart pointer (for example, an offset pointer from
-[*Boost.Interprocess]):
-
-[import ../example/doc_offset_ptr.cpp]
-[doc_offset_ptr_0]
-
-Any intrusive list constructed using this hook will be ready for shared memory,
-because the intrusive list will also use offset pointers internally. For example,
-we can create an intrusive list in shared memory combining [*Boost.Interprocess]
-and [*Boost.Intrusive]:
-
-[doc_offset_ptr_1]
-
-[section:smart_pointers_requirements Requirements for smart pointers compatible with Boost.Intrusive]
-
-Not every smart pointer is compatible with [*Boost.Intrusive]; the smart pointer must
-have the following features:
-
-* It must support the same operations as a raw pointer, except casting.
-* It must be convertible to a raw pointer and constructible from a raw pointer.
-* It must have the same ownership semantics as a raw pointer. This means that
- resource management smart pointers (like `boost::shared_ptr`) can't be used.
-
-The conversion from the smart pointer to a raw pointer must be implemented following
-Boost smart pointer `detail::get_pointer()` function. This function will be found using
-ADL. For example, for `boost::interprocess::offset_ptr`, `detail::get_pointer` is defined
-as follows:
-
-[c++]
-
- template<class T>
- T * detail::get_pointer(boost::interprocess::offset_ptr<T> const & p)
- { return p.get(); }
-
-[endsect]
-
-[endsect]
-
-[section:obtaining_iterators_from_values Obtaining iterators from values]
-
-[*Boost.Intrusive] offers another useful feature that's not present in STL
-containers: it's possible to obtain an iterator to a value from the value itself.
-This feature is implemented in [*Boost.Intrusive] containers by a
-function called `iterator_to`:
-
-[c++]
-
- iterator iterator_to(reference value);
- const_iterator iterator_to(const_reference value);
-
-For [*Boost.Intrusive] containers that have local iterators, like unordered
-associative containers, we can also obtain local iterators:
-
-[c++]
-
- local_iterator local_iterator_to(reference value);
- const_local_iterator local_iterator_to(const_reference value) const;
-
-For most [*Boost.Intrusive] containers
-([classref boost::intrusive::list list],
-[classref boost::intrusive::slist slist],
-[classref boost::intrusive::set set],
-[classref boost::intrusive::multiset multiset]) we have an alternative
-static `s_iterator_to` function.
-
-For unordered associative containers
-([classref boost::intrusive::unordered_set unordered_set],
-[classref boost::intrusive::multiset multiset]),
-`iterator_to` has no static alternative function.
-On the other hand, `local_iterator_to` functions
-have their `s_local_iterator_to` static alternatives.
-
-Alternative static functions are available under certain circumstances
-explained in the [link intrusive.value_traits.stateful_value_traits Stateful value traits] section;
-if the programmer uses hooks provided by [*Boost.Intrusive], those functions
-will be available.
-
-Let's see a small function that shows the use of `iterator_to` and
-`local_iterator_to`:
-
-[import ../example/doc_iterator_from_value.cpp]
-[doc_iterator_from_value]
-
-[endsect]
-
-[section:any_hooks Any Hooks: A single hook for any Intrusive container]
-
-Sometimes, a class programmer wants to place a class in several intrusive
-containers but no at the same time. In this case, the programmer might
-decide to insert two hooks in the same class.
-
-[c++]
-
- class MyClass
- : public list_base_hook<>, public slist_base_hook<> //...
- {};
-
-However, there is a more size-efficient alternative in [*Boost.Intrusive]: "any" hooks
-([classref boost::intrusive::any_base_hook any_base_hook] and
-[classref boost::intrusive::any_member_hook any_member_hook]).
-These hooks can be used to store a type in several containers
-offered by [*Boost.Intrusive] minimizing the size of the class.
-
-These hooks support these options:
-
-* [*`tag<class Tag>`] (for base hooks only): This argument serves as a tag,
- so you can derive from more than one slist hook.
- Default: `tag<default_tag>`.
-
-* [*`link_mode<link_mode_type LinkMode>`]: The linking policy.
- `link_mode<auto_unlink>` is [*not] supported and `link_mode<safe_mode>`
- might offer weaker error detection in any hooks than in other hooks.
- Default: `link_mode<safe_link>`.
-
-* [*`void_pointer<class VoidPointer>`]: The pointer type to be used
- internally in the hook and propagated to the container.
- Default: `void_pointer<void*>`.
-
-`auto_unlink` can't be supported because the hook does not know in which type of
-container might be currently inserted. Additionally, these hooks don't support `unlink()` and
-`swap_nodes()` operations for the same reason.
-
-Here is an example that creates a class with two any hooks, and uses one to insert the
-class in a [classref slist] and the other one in a [classref list].
-
-[import ../example/doc_any_hook.cpp]
-[doc_any_hook]
-
-[endsect]
-
-[section:concepts Concepts explained]
-
-This section will expand the explanation of previously presented basic concepts
-before explaining the customization options of [*Boost.Intrusive].
-
-* [*Node Algorithms]: A set of static functions that implement basic operations
- on a group of nodes: initialize a node, link_mode_type a node to a group of nodes,
- unlink a node from another group of nodes, etc. For example, a circular
- singly linked list is a group of nodes, where each node has a pointer to the
- next node. [*Node Algorithms] just require a [*NodeTraits]
- template parameter and they can work with any [*NodeTraits] class that fulfills
- the needed interface. As an example, here is a class that implements operations7'
- to manage a group of nodes forming a circular singly linked list:
-
-[c++]
-
- template<class NodeTraits>
- struct my_slist_algorithms
- {
- typedef typename NodeTraits::node_ptr node_ptr;
- typedef typename NodeTraits::const_node_ptr const_node_ptr;
-
- //Get the previous node of "this_node"
- static node_ptr get_prev_node(node_ptr this_node)
- {
- node_ptr p = this_node;
- while (this_node != NodeTraits::get_next(p))
- p = NodeTraits::get_next(p);
- return p;
- }
-
- // number of elements in the group of nodes containing "this_node"
- static std::size_t count(const_node_ptr this_node)
- {
- std::size_t result = 0;
- const_node_ptr p = this_node;
- do{
- p = NodeTraits::get_next(p);
- ++result;
- } while (p != this_node);
- return result;
- }
-
- // More operations
- // ...
- };
-
-* [*Node Traits]: A class that encapsulates the basic information and
- operations on a node within a group of nodes:
- the type of the node, a function to obtain the pointer to the next node, etc.
- [*Node Traits] specify the configuration information [*Node Algorithms]
- need. Each type of [*Node Algorithm] expects an interface that compatible
- [*Node Traits] classes must implement.
- As an example, this is the definition of a [*Node Traits] class that
- is compatible with the previously presented `my_slist_algorithms`:
-
-[c++]
-
- struct my_slist_node_traits
- {
- //The type of the node
- struct node
- {
- node *next_;
- };
-
- typedef node * node_ptr;
- typedef const node * const_node_ptr;
-
- //A function to obtain a pointer to the next node
- static node_ptr get_next(const_node_ptr n)
- { return n->next_; }
-
- //A function to set the pointer to the next node
- static void set_next(node_ptr n, node_ptr next)
- { n->next_ = next; }
- };
-
-
-* [*Hook]: A class that the user must add as a base class or as a member to his own
- class to make that class insertable in an intrusive container. Usually the hook
- contains a node object that will be used to form the group of nodes:
- For example, the following class is a [*Hook] that the user can add as a base class,
- to make the user class compatible with a singly linked list container:
-
-[c++]
-
- class my_slist_base_hook
- //This hook contains a node, that will be used
- //to link the user object in the group of nodes
- : private my_slist_node_traits::node
- {
- typedef my_slist_node_traits::node_ptr node_ptr;
- typedef my_slist_node_traits::const_node_ptr const_node_ptr;
-
- //Converts the generic node to the hook
- static my_slist_base_hook *to_hook_ptr(node_ptr p)
- { return static_cast<my_slist_base_hook*>(p); }
-
- //Returns the generic node stored by this hook
- node_ptr to_node_ptr()
- { return static_cast<node *const>(this); }
-
- // More operations
- // ...
- };
-
- //To make MyClass compatible with an intrusive singly linked list
- //derive our class from the hook.
- class MyClass
- : public my_slist_base_hook
- {
- void set(int value);
- int get() const;
-
- private:
- int value_;
- };
-
-* [*Intrusive Container]: A container that offers a STL-like interface to store
- user objects. An intrusive container can be templatized to store different
- value types that use different hooks. An intrusive container is also more elaborate
- than a group of nodes: it can store the number of elements to achieve constant-time
- size information, it can offer debugging facilities, etc.
- For example, an [classref boost::intrusive::slist slist] container
- (intrusive singly linked list) should
- be able to hold `MyClass` objects that might have decided to store the hook
- as a base class or as a member. Internally, the container will use [*Node Algorithms]
- to implement its operations, and an intrusive container is configured using
- a template parameter called [*ValueTraits]. [*ValueTraits] will contain
- the information to convert user classes in nodes compatible with [*Node Algorithms].
- For example, this a possible [classref boost::intrusive::slist slist] implementation:
-
-[c++]
-
- template<class ValueTraits, ...>
- class slist
- {
- public:
- typedef typename ValueTraits::value_type value_type;
-
- //More typedefs and functions
- // ...
-
- //Insert the value as the first element of the list
- void push_front (reference value)
- {
- node_ptr to_insert(ValueTraits::to_node_ptr(value));
- circular_list_algorithms::link_after(to_insert, get_root_node());
- }
-
- // More operations
- // ...
- };
-
-* [*Semi-Intrusive Container]: A semi-intrusive container is similar to an
- intrusive container, but apart from the values to be inserted in the container,
- it needs additional memory (for example, auxiliary arrays or indexes).
-
-* [*Value Traits]: As we can see, to make our classes intrusive-friendly we add
- a simple hook as a member or base class. The hook contains a generic node
- that will be inserted in a group of nodes. [*Node Algorithms] just work
- with nodes and don't know anything about user classes. On the other
- hand, an intrusive container needs to know how to obtain a node from a user class,
- and also the inverse operation.
- So we can define [*ValueTraits] as the glue between user classes and nodes
- required by [*Node Algorithms].
- Let's see a possible implementation of a value traits class that glues MyClass
- and the node stored in the hook:
-
-[c++]
-
- struct my_slist_derivation_value_traits
- {
- public:
- typedef slist_node_traits node_traits;
- typedef MyClass value_type;
- typedef node_traits::node_ptr node_ptr;
- typedef value_type* pointer;
- //...
-
- //Converts user's value to a generic node
- static node_ptr to_node_ptr(reference value)
- { return static_cast<slist_base_hook &>(value).to_node_ptr(); }
-
- //Converts a generic node into user's value
- static value_type *to_value_ptr(node_traits::node *n)
- { static_cast<value_type*>(slist_base_hook::to_hook_ptr(n)); }
-
- // More operations
- // ...
- };
-
-[endsect]
-
-[section:node_algorithms Node algorithms with custom NodeTraits]
-
-As explained in the [link intrusive.concepts Concepts] section, [*Boost.Intrusive]
-containers are implemented using node algorithms that work on generic nodes.
-
-Sometimes, the use of intrusive containers is expensive for some environments
-and the programmer might want to avoid all the template instantiations
-related to [*Boost.Intrusive] containers. However, the user can still benefit
-from [*Boost.Intrusive] using the node algorithms, because some of those algorithms,
-like red-black tree algorithms, are not trivial to write.
-
-All node algorithm classes are
-templatized by a `NodeTraits` class. This class encapsulates the needed internal
-type declarations and operations to make a node compatible with node algorithms.
-Each type of node algorithms has its own requirements:
-
-[section:circular_slist_algorithms Intrusive singly linked list algorithms]
-
-These algorithms are static
-members of the [classref boost::intrusive::circular_slist_algorithms circular_slist_algorithms] class:
-
-[c++]
-
- template<class NodeTraits>
- struct circular_slist_algorithms;
-
-An empty list is formed by a node whose pointer to the next node points
-to itself. [classref boost::intrusive::circular_slist_algorithms circular_slist_algorithms]
-is configured with a NodeTraits class, which encapsulates
-the information about the node to be manipulated. NodeTraits must support the
-following interface:
-
-[*Typedefs]:
-
-* `node`: The type of the node that forms the circular list
-
-* `node_ptr`: The type of a pointer to a node (usually node*)
-
-* `const_node_ptr`: The type of a pointer to a const node (usually const node*)
-
-[*Static functions]:
-
-* `static node_ptr get_next(const_node_ptr n);`:
- Returns a pointer to the next node stored in "n".
-
-* `static void set_next(node_ptr n, node_ptr next);`:
- Sets the pointer to the next node stored in "n" to "next".
-
-Once we have a node traits configuration we can use [*Boost.Intrusive] algorithms
-with our nodes:
-
-[import ../example/doc_slist_algorithms.cpp]
-[doc_slist_algorithms_code]
-
-For a complete list of functions see
-[classref boost::intrusive::circular_slist_algorithms circular_slist_algorithms reference].
-
-[endsect]
-
-[section:circular_list_algorithms Intrusive doubly linked list algorithms]
-
-These algorithms are static
-members of the [classref boost::intrusive::circular_list_algorithms circular_list_algorithms] class:
-
-[c++]
-
- template<class NodeTraits>
- struct circular_list_algorithms;
-
-An empty list is formed by a node whose pointer to the next node points
-to itself. [classref boost::intrusive::circular_list_algorithms circular_list_algorithms]
-is configured with a NodeTraits class, which encapsulates
-the information about the node to be manipulated. NodeTraits must support the
-following interface:
-
-[*Typedefs]:
-
-* `node`: The type of the node that forms the circular list
-
-* `node_ptr`: The type of a pointer to a node (usually node*)
-
-* `const_node_ptr`: The type of a pointer to a const node (usually const node*)
-
-[*Static functions]:
-
-* `static node_ptr get_next(const_node_ptr n);`:
- Returns a pointer to the next node stored in "n".
-
-* `static void set_next(node_ptr n, node_ptr next);`:
- Sets the pointer to the next node stored in "n" to "next".
-
-* `static node_ptr get_previous(const_node_ptr n);`:
- Returns a pointer to the previous node stored in "n".
-
-* `static void set_previous(node_ptr n, node_ptr prev);`:
- Sets the pointer to the previous node stored in "n" to "prev".
-
-Once we have a node traits configuration we can use [*Boost.Intrusive] algorithms
-with our nodes:
-
-[import ../example/doc_list_algorithms.cpp]
-[doc_list_algorithms_code]
-
-For a complete list of functions see
-[classref boost::intrusive::circular_list_algorithms circular_list_algorithms reference].
-
-[endsect]
-
-[section:rbtree_algorithms Intrusive red-black tree algorithms]
-
-These algorithms are static
-members of the [classref boost::intrusive::rbtree_algorithms rbtree_algorithms] class:
-
-[c++]
-
- template<class NodeTraits>
- struct rbtree_algorithms;
-
-
-An empty tree is formed by a node whose pointer to the parent node is null,
-the left and right node pointers point to itself, and whose color is red.
-[classref boost::intrusive::rbtree_algorithms rbtree_algorithms]
-is configured with a NodeTraits class, which encapsulates
-the information about the node to be manipulated. NodeTraits must support the
-following interface:
-
-[*Typedefs]:
-
-* `node`: The type of the node that forms the circular rbtree
-
-* `node_ptr`: The type of a pointer to a node (usually node*)
-
-* `const_node_ptr`: The type of a pointer to a const node (usually const node*)
-
-* `color`: The type that can store the color of a node
-
-[*Static functions]:
-
-* `static node_ptr get_parent(const_node_ptr n);`:
- Returns a pointer to the parent node stored in "n".
-
-* `static void set_parent(node_ptr n, node_ptr p);`:
- Sets the pointer to the parent node stored in "n" to "p".
-
-* `static node_ptr get_left(const_node_ptr n);`:
- Returns a pointer to the left node stored in "n".
-
-* `static void set_left(node_ptr n, node_ptr l);`:
- Sets the pointer to the left node stored in "n" to "l".
-
-* `static node_ptr get_right(const_node_ptr n);`:
- Returns a pointer to the right node stored in "n".
-
-* `static void set_right(node_ptr n, node_ptr r);`:
- Sets the pointer to the right node stored in "n" to "r".
-
-* `static color get_color(const_node_ptr n);`:
- Returns the color stored in "n".
-
-* `static void set_color(node_ptr n, color c);`:
- Sets the color stored in "n" to "c".
-
-* `static color black();`:
- Returns a value representing the black color.
-
-* `static color red();`:
- Returns a value representing the red color.
-
-Once we have a node traits configuration we can use [*Boost.Intrusive] algorithms
-with our nodes:
-
-[import ../example/doc_rbtree_algorithms.cpp]
-[doc_rbtree_algorithms_code]
-
-For a complete list of functions see
-[classref boost::intrusive::rbtree_algorithms rbtree_algorithms reference].
-
-[endsect]
-
-[section:splaytree_algorithms Intrusive splay tree algorithms]
-
-These algorithms are static
-members of the [classref boost::intrusive::splaytree_algorithms splaytree_algorithms] class:
-
-[c++]
-
- template<class NodeTraits>
- struct splaytree_algorithms;
-
-
-An empty tree is formed by a node whose pointer to the parent node is null,
-and whose left and right nodes pointers point to itself.
-[classref boost::intrusive::splaytree_algorithms splaytree_algorithms]
-is configured with a NodeTraits class, which encapsulates
-the information about the node to be manipulated. NodeTraits must support the
-following interface:
-
-[*Typedefs]:
-
-* `node`: The type of the node that forms the circular splaytree
-
-* `node_ptr`: The type of a pointer to a node (usually node*)
-
-* `const_node_ptr`: The type of a pointer to a const node (usually const node*)
-
-[*Static functions]:
-
-* `static node_ptr get_parent(const_node_ptr n);`:
- Returns a pointer to the parent node stored in "n".
-
-* `static void set_parent(node_ptr n, node_ptr p);`:
- Sets the pointer to the parent node stored in "n" to "p".
-
-* `static node_ptr get_left(const_node_ptr n);`:
- Returns a pointer to the left node stored in "n".
-
-* `static void set_left(node_ptr n, node_ptr l);`:
- Sets the pointer to the left node stored in "n" to "l".
-
-* `static node_ptr get_right(const_node_ptr n);`:
- Returns a pointer to the right node stored in "n".
-
-* `static void set_right(node_ptr n, node_ptr r);`:
- Sets the pointer to the right node stored in "n" to "r".
-
-Once we have a node traits configuration we can use [*Boost.Intrusive] algorithms
-with our nodes:
-
-[import ../example/doc_splaytree_algorithms.cpp]
-[doc_splaytree_algorithms_code]
-
-For a complete list of functions see
-[classref boost::intrusive::splaytree_algorithms splaytree_algorithms reference].
-
-[endsect]
-
-[section:avltree_algorithms Intrusive avl tree algorithms]
-
-[classref boost::intrusive::avltree_algorithms avltree_algorithms] have the same
-interface as [classref boost::intrusive::rbtree_algorithms rbtree_algorithms].
-
-[c++]
-
- template<class NodeTraits>
- struct avltree_algorithms;
-
-[classref boost::intrusive::avltree_algorithms avltree_algorithms]
-is configured with a NodeTraits class, which encapsulates
-the information about the node to be manipulated. NodeTraits must support the
-following interface:
-
-[*Typedefs]:
-
-* `node`: The type of the node that forms the circular avltree
-
-* `node_ptr`: The type of a pointer to a node (usually node*)
-
-* `const_node_ptr`: The type of a pointer to a const node (usually const node*)
-
-* `balance`: A type that can represent 3 balance types (usually an integer)
-
-[*Static functions]:
-
-* `static node_ptr get_parent(const_node_ptr n);`:
- Returns a pointer to the parent node stored in "n".
-
-* `static void set_parent(node_ptr n, node_ptr p);`:
- Sets the pointer to the parent node stored in "n" to "p".
-
-* `static node_ptr get_left(const_node_ptr n);`:
- Returns a pointer to the left node stored in "n".
-
-* `static void set_left(node_ptr n, node_ptr l);`:
- Sets the pointer to the left node stored in "n" to "l".
-
-* `static node_ptr get_right(const_node_ptr n);`:
- Returns a pointer to the right node stored in "n".
-
-* `static void set_right(node_ptr n, node_ptr r);`:
- Sets the pointer to the right node stored in "n" to "r".
-
-* `static balance get_balance(const_node_ptr n);`:
- Returns the balance factor stored in "n".
-
-* `static void set_balance(node_ptr n, balance b);`:
- Sets the balance factor stored in "n" to "b".
-
-* `static balance negative();`:
- Returns a value representing a negative balance factor.
-
-* `static balance zero();`:
- Returns a value representing a zero balance factor.
-
-* `static balance positive();`:
- Returns a value representing a positive balance factor.
-
-Once we have a node traits configuration we can use [*Boost.Intrusive] algorithms
-with our nodes:
-
-[import ../example/doc_avltree_algorithms.cpp]
-[doc_avltree_algorithms_code]
-
-For a complete list of functions see
-[classref boost::intrusive::avltree_algorithms avltree_algorithms reference].
-
-[endsect]
-
-
-[section:treap_algorithms Intrusive treap algorithms]
-
-[classref boost::intrusive::treap_algorithms treap_algorithms] have the same
-interface as [classref boost::intrusive::rbtree_algorithms rbtree_algorithms].
-
-[c++]
-
- template<class NodeTraits>
- struct treap_algorithms;
-
-[classref boost::intrusive::treap_algorithms treap_algorithms]
-is configured with a NodeTraits class, which encapsulates
-the information about the node to be manipulated. NodeTraits must support the
-following interface:
-
-[*Typedefs]:
-
-* `node`: The type of the node that forms the circular treap
-
-* `node_ptr`: The type of a pointer to a node (usually node*)
-
-* `const_node_ptr`: The type of a pointer to a const node (usually const node*)
-
-[*Static functions]:
-
-* `static node_ptr get_parent(const_node_ptr n);`:
- Returns a pointer to the parent node stored in "n".
-
-* `static void set_parent(node_ptr n, node_ptr p);`:
- Sets the pointer to the parent node stored in "n" to "p".
-
-* `static node_ptr get_left(const_node_ptr n);`:
- Returns a pointer to the left node stored in "n".
-
-* `static void set_left(node_ptr n, node_ptr l);`:
- Sets the pointer to the left node stored in "n" to "l".
-
-* `static node_ptr get_right(const_node_ptr n);`:
- Returns a pointer to the right node stored in "n".
-
-* `static void set_right(node_ptr n, node_ptr r);`:
- Sets the pointer to the right node stored in "n" to "r".
-
-Once we have a node traits configuration we can use [*Boost.Intrusive] algorithms
-with our nodes:
-
-[import ../example/doc_treap_algorithms.cpp]
-[doc_treap_algorithms_code]
-
-For a complete list of functions see
-[classref boost::intrusive::treap_algorithms treap_algorithms reference].
-
-[endsect]
-
-
-[/
-/
-/[section:sgtree_algorithms Intrusive sg tree algorithms]
-/
-/
-/[classref boost::intrusive::sgtree_algorithms sgtree_algorithms] have the same
-/interface as [classref boost::intrusive::rbtree_algorithms rbtree_algorithms].
-/
-/[c++]
-/
-/ template<class NodeTraits>
-/ struct sgtree_algorithms;
-/
-/[classref boost::intrusive::sgtree_algorithms sgtree_algorithms]
-/is configured with a NodeTraits class, which encapsulates
-/the information about the node to be manipulated. NodeTraits must support the
-/following interface:
-/
-/[*Typedefs]:
-/
-/* `node`: The type of the node that forms the circular sgtree
-/
-/* `node_ptr`: The type of a pointer to a node (usually node*)
-/
-/* `const_node_ptr`: The type of a pointer to a const node (usually const node*)
-/
-/[*Static functions]:
-/
-/* `static node_ptr get_parent(const_node_ptr n);`:
-/ Returns a pointer to the parent node stored in "n".
-/
-/* `static void set_parent(node_ptr n, node_ptr p);`:
-/ Sets the pointer to the parent node stored in "n" to "p".
-/
-/* `static node_ptr get_left(const_node_ptr n);`:
-/ Returns a pointer to the left node stored in "n".
-/
-/* `static void set_left(node_ptr n, node_ptr l);`:
-/ Sets the pointer to the left node stored in "n" to "l".
-/
-/* `static node_ptr get_right(const_node_ptr n);`:
-/ Returns a pointer to the right node stored in "n".
-/
-/* `static void set_right(node_ptr n, node_ptr r);`:
-/ Sets the pointer to the right node stored in "n" to "r".
-/
-/Once we have a node traits configuration we can use [*Boost.Intrusive] algorithms
-/with our nodes:
-/
-/[import ../example/doc_sgtree_algorithms.cpp]
-/[doc_sgtree_algorithms_code]
-/
-/For a complete list of functions see
-/[classref boost::intrusive::sgtree_algorithms sgtree_algorithms reference].
-/
-/[endsect]
-/]
-[endsect]
-
-[section:value_traits Containers with custom ValueTraits]
-
-As explained in the [link intrusive.concepts Concepts] section, [*Boost.Intrusive]
-containers need a `ValueTraits` class to perform transformations between nodes and
-user values. `ValueTraits` can be explicitly configured (using the `value_traits<>` option)
-or implicitly configured (using hooks and their `base_hook<>`/`member_hook<>` options).
-`ValueTraits` contains
-all the information to glue the `value_type` of the containers and the node to be
-used in node algorithms, since these types can be different. Apart from this,
-`ValueTraits` also stores information about the link policy of the values to be inserted.
-
-Instead of using [*Boost.Intrusive] predefined hooks
-a user might want to develop customized containers, for example, using nodes that are
-optimized for a specific
-application or that are compatible with a legacy ABI. A user might want
-to have only two additional pointers in his class and insert the class in a doubly
-linked list sometimes and in a singly linked list in other situations. You can't
-achieve this using [*Boost.Intrusive] predefined hooks. Now, instead of using
-`base_hook<...>` or `member_hook<...>` options the user will specify the
-`value_traits<...>` options. Let's see how we can do this:
-
-[section:value_traits_interface ValueTraits interface]
-
-`ValueTraits` has the following interface:
-
-[c++]
-
- #include <boost/pointer_to_other.hpp>
- #include <boost/intrusive/link_mode.hpp>
-
- struct my_value_traits
- {
- typedef implementation_defined node_traits;
- typedef implementation_defined value_type;
- typedef node_traits::node_ptr node_ptr;
- typedef node_traits::const_node_ptr const_node_ptr;
- typedef boost::pointer_to_other<node_ptr, value_type>::type pointer;
- typedef boost::pointer_to_other<node_ptr, const value_type>::type const_pointer;
-
- static const link_mode_type link_mode = some_linking_policy;
-
- static node_ptr to_node_ptr (value_type &value);
- static const_node_ptr to_node_ptr (const value_type &value);
- static pointer to_value_ptr (node_ptr n);
- static const_pointer to_value_ptr (const_node_ptr n);
- };
-
-Let's explain each type and function:
-
-* [*['node_traits]]: The node configuration that is needed by node algorithms.
- These node traits and algorithms are
- described in the previous chapter: [link intrusive.node_algorithms Node Algorithms].
-
- * If my_value_traits is meant to be used with [classref boost::intrusive::slist slist],
- `node_traits` should follow
- the interface needed by [classref boost::intrusive::circular_slist_algorithms circular_slist_algorithms].
-
- * If my_value_traits is meant to be used with [classref boost::intrusive::list list],
- `node_traits` should follow
- the interface needed by [classref boost::intrusive::circular_list_algorithms circular_list_algorithms].
-
- * If my_value_traits is meant to be used with [classref boost::intrusive::set set]/[classref boost::intrusive::multiset multiset],
- `node_traits` should follow
- the interface needed by [classref boost::intrusive::rbtree_algorithms rbtree_algorithms].
-
- * If my_value_traits is meant to be used with [classref boost::intrusive::unordered_set unordered_set]/
- [classref boost::intrusive::unordered_multiset unordered_multiset], `node_traits`
- should follow the interface needed by [classref boost::intrusive::circular_slist_algorithms circular_slist_algorithms].
-
-* [*['node_ptr]]: A typedef for `node_traits::node_ptr`.
-
-* [*['const_node_ptr]]: A typedef for `node_traits::const_node_ptr`.
-
-* [*['value_type]]: The type that the user wants to insert in the container. This type can be
- the same as `node_traits::node` but it can be different (for example, `node_traits::node`
- can be a member type of `value_type`). If `value_type` and `node_traits::node` are the
- same type, the `to_node_ptr` and `to_value_ptr` functions are trivial.
-
-* [*['pointer]]: The type of a pointer to a `value_type`. It must be the same pointer type
- as `node_ptr`: If `node_ptr` is `node*`, `pointer` must be `value_type*`. If
- `node_ptr` is `smart_ptr<node_traits::node>`, `pointer` must be `smart_ptr<value_type>`.
- This can be generically achieved using `boost::pointer_to_other` utility from [*Boost SmartPointers]
- defined in `<boost/pointer_to_other.hpp>`.
-
-* [*['const_pointer]]: The type of a pointer to a `const value_type`. It must be the same pointer type
- as `node_ptr`: If `node_ptr` is `node*`, `const_pointer` must be `const value_type*`. If
- `node_ptr` is `smart_ptr<node_traits::node>`, `const_pointer` must be `smart_ptr<const value_type>`
- This can be generically achieved using `boost::pointer_to_other` utility from [*Boost SmartPointers]
- defined in `<boost/pointer_to_other.hpp>`.
-
-* [*['link_mode]]: Indicates that `value_traits` needs some additional work or checks from the
- container. The types are enumerations defined in the `link_mode.hpp` header.
- These are the possible types:
-
- * [*`normal_link`]: If this linking policy is specified in a `ValueTraits` class
- as the link mode, containers
- configured with such `ValueTraits` won't set the hooks
- of the erased values to a default state. Containers also won't
- check that the hooks of the new values are default initialized.
-
- * [*`safe_link`]: If this linking policy is specified as the link mode
- in a `ValueTraits` class, containers
- configured with this `ValueTraits` will set the hooks
- of the erased values to a default state. Containers also will
- check that the hooks of the new values are default initialized.
-
- * [*`auto_unlink`]: Same as "safe_link" but containers with
- constant-time size features won't be
- compatible with `ValueTraits` configured with this policy.
- Containers also know that a value can be silently erased from
- the container without using any function provided by the containers.
-
-* [*['static node_ptr to_node_ptr (value_type &value)]] and
- [*['static const_node_ptr to_node_ptr (const value_type &value)]]:
- These functions take a reference to a value_type and return a pointer to the node
- to be used with node algorithms.
-
-* [*['static pointer to_value_ptr (node_ptr n)]] and
- [*['static const_pointer to_value_ptr (const_node_ptr n)]]:
- These functions take a pointer to a node and return a pointer to the value
- that contains the node.
-
-[endsect]
-
-[section:value_traits_example Custom ValueTraits example]
-
-Let's define our own `value_traits` class to be able to use [*Boost.Intrusive]
-containers with an old C structure whose definition can't be changed.
-That legacy type has two pointers that can be used to build singly and doubly linked
-lists: in singly linked lists we only need a pointer, whereas in doubly
-linked lists, we need two pointers. Since we only have two pointers, we can't insert
-the object in both a singly and a doubly linked list at the same time.
-This is the definition of the old node:
-
-[import ../example/doc_value_traits.cpp]
-[doc_value_traits_code_legacy]
-
-Now we have to define a NodeTraits class that will implement the functions/typedefs
-that will make the legacy node compatible with [*Boost.Intrusive] algorithms. After that,
-we'll define a ValueTraits class that will configure [*Boost.Intrusive] containers:
-
-[doc_value_traits_value_traits]
-
-Defining a value traits class that simply defines `value_type` as
-`legacy_node_traits::node` is a common approach when defining customized
-intrusive containers, so [*Boost.Intrusive] offers a templatized
-[classref boost::intrusive::trivial_value_traits trivial_value_traits] class
-that does exactly what we want:
-
-[c++]
-
- #include <boost/intrusive/trivial_value_traits.hpp>
-
- //Now we can define legacy_value_traits just with a single line
- using namespace boost::intrusive;
- typedef trivial_value_traits<legacy_node_traits, normal_link> legacy_value_traits;
-
-
-Now we can just define the containers that will store the legacy abi objects and write
-a little test:
-
-[doc_value_traits_test]
-
-As seen, several key elements of [*Boost.Intrusive] can be reused with custom user types,
-if the user does not want to use the provided [*Boost.Intrusive] facilities.
-
-[endsect]
-
-[section:reusing_node_algorithms Reusing node algorithms for different values]
-
-In the previous example, `legacy_node_traits::node` type and
-`legacy_value_traits::value_type` are the same type, but this is not necessary. It's possible
-to have several `ValueTraits` defining the same `node_traits` type (and thus, the same `node_traits::node`).
-This reduces the number of node algorithm instantiations, but
-now `ValueTraits::to_node_ptr` and `ValueTraits::to_value_ptr` functions need to offer
-conversions between both types. Let's see a small example:
-
-First, we'll define the node to be used in the algorithms. For a linked list,
-we just need a node that stores two pointers:
-
-[import ../example/doc_advanced_value_traits.cpp]
-[doc_advanced_value_traits_code]
-
-Now we'll define two different types that will be inserted in intrusive lists and
-a templatized `ValueTraits` that will work for both types:
-
-[doc_advanced_value_traits_value_traits]
-
-Now define two containers. Both containers will instantiate the same list algorithms
-(`circular_list_algorithms<simple_node_traits>`),
-due to the fact that the value traits used to define the containers provide the same `node_traits` type:
-
-[doc_advanced_value_traits_containers]
-
-All [*Boost.Intrusive] containers using predefined hooks use this technique to minimize code size:
-all possible [classref boost::intrusive::list list] containers
-created with predefined hooks that define the same `VoidPointer` type
-share the same list algorithms.
-
-[endsect]
-
-[section:simplifying_value_traits Simplifying value traits definition]
-
-The previous example can be further simplified using the
-[classref boost::intrusive::derivation_value_traits derivation_value_traits]
-class to define a value traits class with a value that stores the
-`simple_node` as a base class:
-
-[c++]
-
- #include <boost/intrusive/derivation_value_traits.hpp>
-
- //value_1, value_2, simple_node and simple_node_traits are defined
- //as in the previous example...
- //...
-
- using namespace boost::intrusive;
-
- //Now define the needed value traits using
- typedef derivation_value_traits<value_1, simple_node_traits, normal_link> ValueTraits1;
- typedef derivation_value_traits<value_2, simple_node_traits, normal_link> ValueTraits2;
-
- //Now define the containers
- typedef list <value1, value_traits<ValueTraits1> > Value1List;
- typedef list <value2, value_traits<ValueTraits2> > Value2List;
-
-We can even choose to store `simple_node` as a member of `value_1` and `value_2`
-classes and use [classref boost::intrusive::member_value_traits member_value_traits]
-to define the needed value traits classes:
-
-[import ../example/doc_advanced_value_traits2.cpp]
-[doc_advanced_value_traits2_value_traits]
-
-[endsect]
-
-[section:stateful_value_traits Stateful value traits]
-
-Until now all shown custom value traits are stateless, that is, [*the transformation between nodes
-and values is implemented in terms of static functions]. It's possible to use [*stateful] value traits
-so that we can separate nodes and values and [*avoid modifying types to insert nodes].
-[*Boost.Intrusive] differentiates between stateful and stateless value traits by checking if all
-Node <-> Value transformation functions are static or not (except for Visual 7.1, since overloaded
-static function detection is not possible, in this case the implementation checks if the class is empty):
-
-* If all Node <-> Value transformation functions are static , a [*stateless]
- value traits is assumed. transformations must be static functions.
-* Otherwise a [*stateful] value traits is assumed.
-
-Using stateful value traits it's possible to create containers of non-copyable/movable objects [*without modifying]
-the definition of the class to be inserted. This interesting property is achieved without using global variables
-(stateless value traits could use global variables to achieve the same goal), so:
-
-* [*Thread-safety guarantees]: Better thread-safety guarantees can be achieved with stateful
- value traits, since accessing global resources might require synchronization primitives that
- can be avoided when using internal state.
-* [*Flexibility]: A stateful value traits type can be configured at run-time.
-* [*Run-time polymorphism]: A value traits might implement node <-> value
- transformations as virtual functions. A single container type could be
- configured at run-time to use different node <-> value relationships.
-
-Stateful value traits have many advantages but also some downsides:
-
-* [*Performance]: Value traits operations should be very efficient since they are basic operations used by containers.
- [*A heavy node <-> value transformation will hurt intrusive containers' performance].
-* [*Exception guarantees]: The stateful ValueTraits must maintain no-throw guarantees, otherwise, the
- container invariants won't be preserved.
-* [*Static functions]: Some static functions offered by intrusive containers are not
- available because node <-> value transformations are not static.
-* [*Bigger iterators]: The size of some iterators is increased because the iterator
- needs to store a pointer to the stateful value traits to implement node to value
- transformations (e.g. `operator*()` and `operator->()`).
-
-An easy and useful example of stateful value traits is when an array of values can be indirectly introduced
-in a list guaranteeing no additional allocation apart from the initial resource reservation:
-
-[import ../example/doc_stateful_value_traits.cpp]
-[doc_stateful_value_traits]
-
-[endsect]
-
-[endsect]
-
-[section:thread_safety Thread safety guarantees]
-
-Intrusive containers have thread safety guarantees similar to STL containers.
-
-* Several threads having read or write access to different instances is safe as long as inserted
- objects are different.
-* Concurrent read-only access to the same container is safe.
-
-Some Intrusive hooks (auto-unlink hooks, for example) modify containers without
-having a reference to them: this is considered a write access to the container.
-
-Other functions, like checking if an object is already inserted in a container using the `is_linked()`
-member of safe hooks, constitute read access on the container without having a reference to it, so no other
-thread should have write access (direct or indirect) to that container.
-
-Since the same object can be inserted in several containers at the same time using different hooks,
-the thread safety of [*Boost.Intrusive] is related to the containers and also to the object whose lifetime
-is manually managed by the user.
-
-As we can see, the analysis of the thread-safety of a program using [*Boost.Intrusive] is harder
-than with non-intrusive containers.
-
-To analyze the thread safety, consider the following points:
-
-* The auto-unlink hook's destructor and `unlink()` functions modify the container indirectly.
-* The safe mode and auto-unlink hooks' `is_linked()` functions are a read access to the container.
-* Inserting an object in containers that will be modified by different threads has no thread safety
- guarantee, although in most platforms it will be thread-safe without locking.
-
-[endsect]
-
-[section:obtaining_same_type_reducing_space Obtaining the same types and reducing symbol length]
-
-The flexible option specification mechanism used by [*Boost.Intrusive] for hooks and containers
-has a couple of downsides:
-
-* If a user specifies the same options in different order or specifies some options and leaves the
- rest as defaults, the type of the created container/hook will be different. Sometimes
- this is annoying, because two programmers specifying the same options might end up with incompatible
- types. For example, the following two lists, although using the same options, do not have
- the same type:
-
-[c++]
-
- #include <boost/intrusive/list.hpp>
-
- using namespace boost::intrusive;
-
- //Explicitly specify constant-time size and size type
- typedef list<T, constant_time_size<true>, size_type<std::size_t> List1;
-
- //Implicitly specify constant-time size and size type
- typedef list<T> List2;
-
-* Option specifiers lead to long template symbols for classes and functions. Option specifiers themselves
- are verbose and without variadic templates, several default template parameters are assigned for
- non-specified options. Object and debugging information files can grow and compilation times
- may suffer if long names are produced.
-
-To solve these issues [*Boost.Intrusive] offers some helper metafunctions that reduce symbol lengths
-and create the same type if the same options (either explicitly or implicitly) are used. These also
-improve compilation times. All containers and hooks have their respective `make_xxx` versions.
-The previously shown example can be rewritten like this to obtain the same list type:
-
-[c++]
-
- #include <boost/intrusive/list.hpp>
-
- using namespace boost::intrusive;
-
- #include <boost/intrusive/list.hpp>
-
- using namespace boost::intrusive;
-
- //Explicitly specify constant-time size and size type
- typedef make_list<T, constant_time_size<true>, size_type<std::size_t>::type List1;
-
- //Implicitly specify constant-time size and size type
- typedef make_list<T>::type List2;
-
-Produced symbol lengths and compilation times will usually be shorter and object/debug files smaller.
-If you are concerned with file sizes and compilation times, this option is your best choice.
-
-[endsect]
-
-[section:design_notes Design Notes]
-
-When designing [*Boost.Intrusive] the following guidelines have been taken into account:
-
-[section: Boost.Intrusive in performance sensitive environments]
-
-[*Boost.Intrusive] should be a valuable tool in performance sensitive environments,
-and following this guideline, [*Boost.Intrusive] has been designed to offer well
-known complexity guarantees. Apart from that, some options, like optional
-constant-time, have been designed to offer faster complexity guarantees in some
-functions, like `slist::splice`.
-
-The advanced lookup and insertion functions for associative containers, taking
-an arbitrary key type and predicates, were designed to avoid unnecessary object
-constructions.
-
-[endsect]
-
-[section: Boost.Intrusive in space constrained environments]
-
-[*Boost.Intrusive] should be useful in space constrained environments,
-and following this guideline [*Boost.Intrusive] separates node algorithms
-and intrusive containers to avoid instantiating node algorithms for each
-user type. For example, a single class of red-black algorithms will be instantiated
-to implement all set and multiset containers using raw pointers. This way,
-[*Boost.Intrusive] seeks to avoid any code size overhead associated with templates.
-
-Apart from that, [*Boost.Intrusive] implements some size improvements: for example,
-red-black trees embed the color bit in the parent pointer lower bit, if nodes
-are two-byte aligned. The option to forgo constant-time size operations can
-reduce container size, and this extra size optimization is noticeable
-when the container is empty or contains few values.
-
-[endsect]
-
-[section: Boost.Intrusive as a basic building block]
-
-[*Boost.Intrusive] can be a basic building block to build more complex containers
-and this potential has motivated many design decisions. For example, the ability
-to have more than one hook per user type opens the opportunity to implement multi-index
-containers on top of [*Boost.Intrusive].
-
-[*Boost.Intrusive] containers implement advanced functions taking function objects
-as arguments (`clone_from`, `erase_and_dispose`, `insert_check`, etc.). These
-functions come in handy when implementing non-intrusive containers
-(for example, STL-like containers) on top of intrusive containers.
-
-[endsect]
-
-[section: Extending Boost.Intrusive]
-
-[*Boost.Intrusive] offers a wide range of containers but also allows the
-construction of custom containers reusing [*Boost.Intrusive] elements.
-The programmer might want to use node algorithms directly or
-build special hooks that take advantage of an application environment.
-
-For example, the programmer can customize parts of [*Boost.Intrusive]
-to manage old data structures whose definition can't be changed.
-
-[endsect]
-
-[endsect]
-
-[section:performance Performance]
-
-[*Boost.Intrusive] containers offer speed improvements compared to non-intrusive containers
-primarily because:
-
-* They minimize memory allocation/deallocation calls.
-* They obtain better memory locality.
-
-This section will show performance tests comparing some operations on
-`boost::intrusive::list` and `std::list`:
-
-* Insertions using `push_back` and container destruction will show the
- overhead associated with memory allocation/deallocation.
-* The `reverse` member function will show the advantages of the compact
- memory representation that can be achieved with intrusive containers.
-* The `sort` and `write access` tests will show the advantage of intrusive containers
- minimizing memory accesses compared to containers of pointers.
-
-Given an object of type `T`, [classref boost::intrusive::list boost::intrusive::list<T>]
-can replace `std::list<T>` to avoid memory allocation overhead,
-or it can replace `std::list<T*>` when the user wants containers with
-polymorphic values or wants to share values between several containers.
-Because of this versatility, the performance tests will be executed for 6 different
-list types:
-
-* 3 intrusive lists holding a class named `itest_class`,
- each one with a different linking policy (`normal_link`, `safe_link`, `auto_unlink`).
- The `itest_class` objects will be tightly packed in a `std::vector<itest_class>` object.
-
-* `std::list<test_class>`, where `test_class` is exactly the same as `itest_class`,
- but without the intrusive hook.
-
-* `std::list<test_class*>`. The list will contain pointers to `test_class` objects
- tightly packed in a `std::vector<test_class>` object. We'll call this configuration ['compact pointer list]
-
-* `std::list<test_class*>`. The list will contain pointers to `test_class` objects owned by a
- `std::list<test_class>` object. We'll call this configuration ['disperse pointer list].
-
-Both `test_class` and `itest_class` are templatized classes that can be configured with
-a boolean to increase the size of the object. This way, the tests can be executed with
-small and big objects. Here is the first part of the testing code, which shows
-the definitions of `test_class` and `itest_class` classes, and some other
-utilities:
-
-[import ../perf/perf_list.cpp]
-[perf_list_value_type]
-
-As we can see, `test_class` is a very simple class holding an `int`. `itest_class`
-is just a class that has a base hook ([classref boost::intrusive::list_base_hook list_base_hook])
-and also derives from `test_class`.
-
-`func_ptr_adaptor` is just a functor adaptor to convert function objects taking
-`test_list` objects to function objects taking pointers to them.
-
-You can find the full test code code in the
-[@../../libs/intrusive/perf/perf_list.cpp perf_list.cpp] source file.
-
-[section:performance_results_push_back Back insertion and destruction]
-
-The first test will measure the benefits we can obtain with intrusive containers
-avoiding memory allocations and deallocations. All the objects to be
-inserted in intrusive containers are allocated in a single allocation call,
-whereas `std::list` will need to allocate memory for each object and deallocate it
-for every erasure (or container destruction).
-
-Let's compare the code to be executed for each container type for different insertion tests:
-
-[perf_list_push_back_intrusive]
-
-For intrusive containers, all the values are created in a vector and after that
-inserted in the intrusive list.
-
-[perf_list_push_back_stdlist]
-
-For a standard list, elements are pushed back using push_back().
-
-[perf_list_push_back_stdptrlist]
-
-For a standard compact pointer list, elements are created in a vector and pushed back
-in the pointer list using push_back().
-
-[perf_list_push_back_disperse_stdptrlist]
-
-For a ['disperse pointer list], elements are created in a list and pushed back
-in the pointer list using push_back().
-
-These are the times in microseconds for each case, and the normalized time:
-
-[table Back insertion + destruction times for Visual C++ 7.1 / Windows XP
- [[Container] [Time in us/iteration (small object / big object)] [Normalized time (small object / big object)]]
- [[`normal_link` intrusive list] [5000 / 22500] [1 / 1]]
- [[`safe_link` intrusive list] [7812 / 32187] [1.56 / 1.43]]
- [[`auto_unlink` intrusive list] [10156 / 41562] [2.03 / 1.84]]
- [[Standard list] [76875 / 97500] [5.37 / 4.33]]
- [[Standard compact pointer list] [76406 / 86718] [15.28 / 3.85]]
- [[Standard disperse pointer list] [146562 / 175625] [29.31 / 7.80]]
-]
-
-[table Back insertion + destruction times for GCC 4.1.1 / MinGW over Windows XP
- [[Container] [Time in us/iteration (small object / big object)] [Normalized time (small object / big object)]]
- [[`normal_link` intrusive list] [4375 / 22187] [1 / 1]]
- [[`safe_link` intrusive list] [7812 / 32812] [1.78 / 1.47]]
- [[`auto_unlink` intrusive list] [10468 / 42031] [2.39 / 1.89]]
- [[Standard list] [81250 / 98125] [18.57 / 4.42]]
- [[Standard compact pointer list] [83750 / 94218] [19.14 / 4.24]]
- [[Standard disperse pointer list] [155625 / 175625] [35.57 / 7.91]]
-]
-
-[table Back insertion + destruction times for GCC 4.1.2 / Linux Kernel 2.6.18 (OpenSuse 10.2)
- [[Container] [Time in us/iteration (small object / big object)] [Normalized time (small object / big object)]]
- [[`normal_link` intrusive list] [4792 / 20495] [1 / 1]]
- [[`safe_link` intrusive list] [7709 / 30803] [1.60 / 1.5]]
- [[`auto_unlink` intrusive list] [10180 / 41183] [2.12 / 2.0]]
- [[Standard list] [17031 / 32586] [3.55 / 1.58]]
- [[Standard compact pointer list] [27221 / 34823] [5.68 / 1.69]]
- [[Standard disperse pointer list] [102272 / 60056] [21.34 / 2.93]]
-]
-
-The results are logical: intrusive lists just need one allocation. The destruction
-time of the `normal_link` intrusive container is trivial (complexity: `O(1)`),
-whereas `safe_link` and `auto_unlink` intrusive containers need to put the hooks of
-erased values in the default state (complexity: `O(NumElements)`). That's why
-`normal_link` intrusive list shines in this test.
-
-Non-intrusive containers need to make many more allocations and that's why they
-lag behind. The `disperse pointer list` needs to make `NumElements*2` allocations,
-so the result is not surprising.
-
-The Linux test shows that standard containers perform very well against intrusive containers
-with big objects. Nearly the same GCC version in MinGW performs worse, so maybe
-a good memory allocator is the reason for these excellent results.
-
-[endsect]
-
-[section:performance_results_reversing Reversing]
-
-The next test measures the time needed to complete calls to the member function `reverse()`.
-Values (`test_class` and `itest_class`) and lists are created as explained in the
-previous section.
-
-Note that for pointer lists, `reverse` [*does not need to access `test_class` values
-stored in another list or vector],
-since this function just needs to adjust internal pointers, so in theory all tested
-lists need to perform the same operations.
-
-These are the results:
-
-[table Reverse times for Visual C++ 7.1 / Windows XP
- [[Container] [Time in us/iteration (small object / big object)] [Normalized time (small object / big object)]]
- [[`normal_link` intrusive list] [2656 / 10625] [1 / 1.83]]
- [[`safe_link` intrusive list] [2812 / 10937] [1.05 / 1.89]]
- [[`auto_unlink` intrusive list] [2710 / 10781] [1.02 / 1.86]]
- [[Standard list] [5781 / 14531] [2.17 / 2.51]]
- [[Standard compact pointer list] [5781 / 5781] [2.17 / 1]]
- [[Standard disperse pointer list] [10781 / 15781] [4.05 / 2.72]]
-]
-
-[table Reverse times for GCC 4.1.1 / MinGW over Windows XP
- [[Container] [Time in us/iteration (small object / big object)] [Normalized time (small object / big object)]]
- [[`normal_link` intrusive list] [2656 / 10781] [1 / 2.22]]
- [[`safe_link` intrusive list] [2656 / 10781] [1 / 2.22]]
- [[`auto_unlink` intrusive list] [2812 / 10781] [1.02 / 2.22]]
- [[Standard list] [4843 / 12500] [1.82 / 2.58]]
- [[Standard compact pointer list] [4843 / 4843] [1.82 / 1]]
- [[Standard disperse pointer list] [9218 / 12968] [3.47 / 2.67]]
-]
-
-[table Reverse times for GCC 4.1.2 / Linux Kernel 2.6.18 (OpenSuse 10.2)
- [[Container] [Time in us/iteration (small object / big object)] [Normalized time (small object / big object)]]
- [[`normal_link` intrusive list] [2742 / 10847] [1 / 3.41]]
- [[`safe_link` intrusive list] [2742 / 10847] [1 / 3.41]]
- [[`auto_unlink` intrusive list] [2742 / 11027] [1 / 3.47]]
- [[Standard list] [3184 / 10942] [1.16 / 3.44]]
- [[Standard compact pointer list] [3207 / 3176] [1.16 / 1]]
- [[Standard disperse pointer list] [5814 / 13381] [2.12 / 4.21]]
-]
-
-For small objects the results show that the compact storage of values in intrusive
-containers improve locality and reversing is faster than with standard containers,
-whose values might be dispersed in memory because each value is independently
-allocated. Note that the dispersed pointer list (a list of pointers to values
-allocated in another list) suffers more because nodes of the pointer list
-might be more dispersed, since allocations from both lists are interleaved
-in the code:
-
-[c++]
-
- //Object list (holding `test_class`)
- stdlist objects;
-
- //Pointer list (holding `test_class` pointers)
- stdptrlist l;
-
- for(int i = 0; i < NumElements; ++i){
- //Allocation from the object list
- objects.push_back(stdlist::value_type(i));
- //Allocation from the pointer list
- l.push_back(&objects.back());
- }
-
-For big objects the compact pointer list wins because the reversal test doesn't need access
-to values stored in another container. Since all the allocations for nodes of
-this pointer list are likely to be close (since there is no other allocation in the
-process until the pointer list is created) locality is better than with intrusive
-containers. The dispersed pointer list, as with small values, has poor locality.
-
-[endsect]
-
-[section:performance_results_sorting Sorting]
-
-The next test measures the time needed to complete calls to the member function
-`sort(Pred pred)`. Values (`test_class` and `itest_class`) and lists are created as explained in the
-first section. The values will be sorted in ascending and descending order each
-iteration. For example, if ['l] is a list:
-
-[c++]
-
- for(int i = 0; i < NumIter; ++i){
- if(!(i % 2))
- l.sort(std::greater<stdlist::value_type>());
- else
- l.sort(std::less<stdlist::value_type>());
- }
-
-For a pointer list, the function object will be adapted using `func_ptr_adaptor`:
-
-[c++]
-
- for(int i = 0; i < NumIter; ++i){
- if(!(i % 2))
- l.sort(func_ptr_adaptor<std::greater<stdlist::value_type> >());
- else
- l.sort(func_ptr_adaptor<std::less<stdlist::value_type> >());
- }
-
-Note that for pointer lists, `sort` will take a function object that [*will access
-`test_class` values stored in another list or vector], so pointer lists will suffer
-an extra indirection: they will need to access the `test_class` values stored in
-another container to compare two elements.
-
-These are the results:
-
-[table Sort times for Visual C++ 7.1 / Windows XP
- [[Container] [Time in us/iteration (small object / big object)] [Normalized time (small object / big object)]]
- [[`normal_link` intrusive list] [16093 / 38906] [1 / 1]]
- [[`safe_link` intrusive list] [16093 / 39062] [1 / 1]]
- [[`auto_unlink` intrusive list] [16093 / 38906] [1 / 1]]
- [[Standard list] [32343 / 56406] [2.0 / 1.44]]
- [[Standard compact pointer list] [33593 / 46093] [2.08 / 1.18]]
- [[Standard disperse pointer list] [46875 / 68593] [2.91 / 1.76]]
-]
-
-[table Sort times for GCC 4.1.1 / MinGW over Windows XP
- [[Container] [Time in us/iteration (small object / big object)] [Normalized time (small object / big object)]]
- [[`normal_link` intrusive list] [15000 / 39218] [1 / 1]]
- [[`safe_link` intrusive list] [15156 / 39531] [1.01 / 1.01]]
- [[`auto_unlink` intrusive list] [15156 / 39531] [1.01 / 1.01]]
- [[Standard list] [34218 / 56875] [2.28 / 1.45]]
- [[Standard compact pointer list] [35468 / 49218] [2.36 / 1.25]]
- [[Standard disperse pointer list] [47656 / 70156] [3.17 / 1.78]]
-]
-
-[table Sort times for GCC 4.1.2 / Linux Kernel 2.6.18 (OpenSuse 10.2)
- [[Container] [Time in us/iteration (small object / big object)] [Normalized time (small object / big object)]]
- [[`normal_link` intrusive list] [18003 / 40795] [1 / 1]]
- [[`safe_link` intrusive list] [18003 / 41017] [1 / 1]]
- [[`auto_unlink` intrusive list] [18230 / 40941] [1.01 / 1]]
- [[Standard list] [26273 / 49643] [1.45 / 1.21]]
- [[Standard compact pointer list] [28540 / 43172] [1.58 / 1.05]]
- [[Standard disperse pointer list] [35077 / 57638] [1.94 / 1.41]]
-]
-
-The results show that intrusive containers are faster than standard
-containers. We can see that the pointer
-list holding pointers to values stored in a vector is quite fast, so the extra
-indirection that is needed to access the value is minimized because all the values
-are tightly stored, improving caching. The disperse list, on the other hand, is
-slower because the indirection to access values stored in the object list is
-more expensive than accessing values stored in a vector.
-
-[endsect]
-
-[section:performance_results_write_access Write access]
-
-The next test measures the time needed to iterate through all the elements of a list, and
-increment the value of the internal `i_` member:
-
-[c++]
-
- stdlist::iterator it(l.begin()), end(l.end());
- for(; it != end; ++it)
- ++(it->i_);
-
-Values (`test_class` and `itest_class`) and lists are created as explained in
-the first section. Note that for pointer lists, the iteration will suffer
-an extra indirection: they will need to access the `test_class` values stored in
-another container:
-
-[c++]
-
- stdptrlist::iterator it(l.begin()), end(l.end());
- for(; it != end; ++it)
- ++((*it)->i_);
-
-These are the results:
-
-[table Write access times for Visual C++ 7.1 / Windows XP
- [[Container] [Time in us/iteration (small object / big object)] [Normalized time (small object / big object)]]
- [[`normal_link` intrusive list] [2031 / 8125] [1 / 1]]
- [[`safe_link` intrusive list] [2031 / 8281] [1 / 1.01]]
- [[`auto_unlink` intrusive list] [2031 / 8281] [1 / 1.01]]
- [[Standard list] [4218 / 10000] [2.07 / 1.23]]
- [[Standard compact pointer list] [4062 / 8437] [2.0 / 1.03]]
- [[Standard disperse pointer list] [8593 / 13125] [4.23 / 1.61]]
-]
-
-[table Write access times for GCC 4.1.1 / MinGW over Windows XP
- [[Container] [Time in us/iteration (small object / big object)] [Normalized time (small object / big object)]]
- [[`normal_link` intrusive list] [2343 / 8281] [1 / 1]]
- [[`safe_link` intrusive list] [2500 / 8281] [1.06 / 1]]
- [[`auto_unlink` intrusive list] [2500 / 8281] [1.06 / 1]]
- [[Standard list] [4218 / 10781] [1.8 / 1.3]]
- [[Standard compact pointer list] [3906 / 8281] [1.66 / 1]]
- [[Standard disperse pointer list] [8281 / 13750] [3.53 / 1.66]]
-]
-
-[table Write access times for GCC 4.1.2 / Linux Kernel 2.6.18 (OpenSuse 10.2)
- [[Container] [Time in us/iteration (small object / big object)] [Normalized time (small object / big object)]]
- [[`normal_link` intrusive list] [2286 / 8468] [1 / 1.1]]
- [[`safe_link` intrusive list] [2381 / 8412] [1.04 / 1.09]]
- [[`auto_unlink` intrusive list] [2301 / 8437] [1.01 / 1.1]]
- [[Standard list] [3044 / 9061] [1.33 / 1.18]]
- [[Standard compact pointer list] [2755 / 7660] [1.20 / 1]]
- [[Standard disperse pointer list] [6118 / 12453] [2.67 / 1.62]]
-]
-
-As with the read access test, the results show that intrusive containers outperform
-all other containers if the values are tightly packed in a vector.
-The disperse list is again the slowest.
-
-[endsect]
-
-[section:performance_results_conclusions Conclusions]
-
-Intrusive containers can offer performance benefits that cannot be achieved with
-equivalent non-intrusive containers. Memory locality improvements are noticeable
-when the objects to be inserted are small. Minimizing memory allocation/deallocation calls is also
-an important factor and intrusive containers make this simple if the user allocates
-all the objects to be inserted in intrusive containers in containers like `std::vector` or `std::deque`.
-
-[endsect]
-
-[endsect]
-
-[section:release_notes Release Notes]
-
-[section:release_notes_boost_1_43_00 Boost 1.43 Release]
-
-* Fixed bugs
- [@https://svn.boost.org/trac/boost/ticket/3668 #3668],
- [@https://svn.boost.org/trac/boost/ticket/3339 #3688],
- [@https://svn.boost.org/trac/boost/ticket/3698 #3698],
- [@https://svn.boost.org/trac/boost/ticket/3706 #3706],
- [@https://svn.boost.org/trac/boost/ticket/3721 #3721].
- [@https://svn.boost.org/trac/boost/ticket/3729 #3729],
- [@https://svn.boost.org/trac/boost/ticket/3746 #3746],
- [@https://svn.boost.org/trac/boost/ticket/3781 #3781],
- [@https://svn.boost.org/trac/boost/ticket/3829 #3829],
- [@https://svn.boost.org/trac/boost/ticket/3840 #3840],
- [@https://svn.boost.org/trac/boost/ticket/3339 #3339],
- [@https://svn.boost.org/trac/boost/ticket/3419 #3419],
- [@https://svn.boost.org/trac/boost/ticket/3431 #3431],
- [@https://svn.boost.org/trac/boost/ticket/4021 #4021],
-
-[endsect]
-
-
-[section:release_notes_boost_1_40_00 Boost 1.40 Release]
-
-* Code cleanup in tree_algorithms.hpp and avl_tree_algorithms.hpp
-* Fixed bug
- [@https://svn.boost.org/trac/boost/ticket/3164 #3164].
-
-[endsect]
-
-
-[section:release_notes_boost_1_39_00 Boost 1.39 Release]
-
-* Optimized `list::merge` and `slist::merge`
-* `list::sort` and `slist::sort` are now stable.
-* Fixed bugs
- [@https://svn.boost.org/trac/boost/ticket/2689 #2689],
- [@https://svn.boost.org/trac/boost/ticket/2755 #2755],
- [@https://svn.boost.org/trac/boost/ticket/2786 #2786],
- [@https://svn.boost.org/trac/boost/ticket/2807 #2807],
- [@https://svn.boost.org/trac/boost/ticket/2810 #2810],
- [@https://svn.boost.org/trac/boost/ticket/2862 #2862].
-
-[endsect]
-
-[section:release_notes_boost_1_38_00 Boost 1.38 Release]
-
-* New treap-based containers: treap, treap_set, treap_multiset.
-* Corrected compilation bug for Windows-based 64 bit compilers.
-* Corrected exception-safety bugs in container constructors.
-* Updated documentation to show rvalue-references functions instead of emulation functions.
-
-[endsect]
-
-[section:release_notes_boost_1_37_00 Boost 1.37 Release]
-
-* Intrusive now takes advantage of compilers with variadic templates.
-* `clone_from` functions now copy predicates and hash functions of associative containers.
-* Added incremental hashing to unordered containers via `incremental<>` option.
-* Update some function parameters from `iterator` to `const_iterator` in containers
- to keep up with the draft of the next standard.
-* Added an option to specify include files for intrusive configurable assertion macros.
-
-[endsect]
-
-[section:release_notes_boost_1_36_00 Boost 1.36 Release]
-
-* Added `linear<>` and `cache_last<>` options to singly linked lists.
-* Added `optimize_multikey<>` option to unordered container hooks.
-* Optimized unordered containers when `store_hash` option is used in the hook.
-* Implementation changed to be exception agnostic so that it can be used
- in environments without exceptions.
-* Added `container_from_iterator` function to tree-based containers.
-
-[endsect]
-
-[endsect]
-
-[section:tested_compilers Tested compilers]
-
-[*Boost.Intrusive] has been tested on the following compilers/platforms:
-
-* Visual 7.1/WinXP
-* Visual 8.0/WinXP
-* Visual 9.0/WinXP
-* GCC 4.1.1/MinGW
-* GCC 3.4.4/Cygwin
-* Intel 9.1/WinXP
-* GCC 4.1.2/Linux
-* GCC 3.4.3/Solaris 11
-* GCC 4.0/Mac Os 10.4.1
-
-[endsect]
-
-[section:references References]
-
-* SGI's [@http://www.sgi.com/tech/stl/ STL Programmer's Guide].
- [*Boost.Intrusive] is based on STL concepts and interfaces.
-
-* Dr. Dobb's, September 1, 2005: [@http://www.ddj.com/architect/184402007 ['Implementing Splay Trees in C++] ].
- [*Boost.Intrusive] splay containers code is based on this article.
-
-* Olaf's original intrusive container library: [@http://freenet-homepage.de/turtle++/intrusive.html ['STL-like intrusive containers] ].
-
-[endsect]
-
-[section:acknowledgements Acknowledgements]
-
-[*Olaf Krzikalla] would like to thank:
-
-* [*Markus Schaaf] for pointing out the possibility and the advantages of the derivation
-approach.
-
-* [*Udo Steinbach] for encouragements to present this work for boost, a lot of fixes and
-helpful discussions.
-
-* [*Jaap Suter] for the initial hint, which eventually lead to the member value_traits.
-
-[*Ion Gaztanaga] would like to thank:
-
-* [*Olaf Krzikalla] for the permission to continue his great work.
-
-* [*Joaquin M. Lopez Munoz] for his thorough review, help, and ideas.
-
-* [*Cory Nelson], [*Daniel James], [*Dave Harris], [*Guillaume Melquiond],
- [*Henri Bavestrello], [*HervÃ© Bronnimann], [*Kai Bruning], [*Kevin Sopp],
- [*Paul Rose], [*Pavel Vozelinek], [*Howard Hinnant], [*Olaf Krzikalla],
- [*Samuel Debionne], [*Stjepan Rajko], [*Thorsten Ottosen], [*Tobias Schwinger],
- [*Tom Brinkman] and [*Steven Watanabe]
- for their comments and reviews in the Boost.Intrusive formal review.
-
-* Thanks to [*Julienne Walker] and [*The EC Team] ([@http://eternallyconfuzzled.com])
- for their great algorithms.
-
-* Thanks to [*Daniel K. O.] for his AVL tree rebalancing code.
-
-* Thanks to [*Ralf Mattethat] for his splay tree article and code.
-
-* Special thanks to [*Steven Watanabe] and [*Tobias Schwinger] for their
- invaluable suggestions and improvements.
-
-[endsect]
-
-[xinclude autodoc.xml]
-
-[section:license_notices License notices]
-
-Most of the internal implementation of red-black trees is based on that of SGI STL stl_tree.h file:
-
-['Copyright (c) 1996,1997 Silicon Graphics Computer Systems, Inc.
-Permission to use, copy, modify, distribute and sell this software and its documentation for any purpose is hereby granted without fee, provided that the above copyright notice appear in all copies and that both that copyright notice and this permission notice appear in supporting documentation. Silicon Graphics makes no representations about the suitability of this software for any purpose. It is provided "as is" without express or implied warranty.]
-
-['Copyright (c) 1994 Hewlett-Packard Company
-Permission to use, copy, modify, distribute and sell this software and its documentation for any purpose is hereby granted without fee, provided that the above copyright notice appear in all copies and that both that copyright notice and this permission notice appear in supporting documentation. Hewlett-Packard Company makes no representations about the suitability of this software for any purpose. It is provided "as is" without express or implied warranty.]
-
-The tree destruction algorithm is based on Julienne Walker and The EC Team code:
-
-['This code is in the public domain. Anyone may
-use it or change it in any way that they see
-fit. The author assumes no responsibility for
-damages incurred through use of the original
-code or any variations thereof.]
-
-['It is requested, but not required, that due
-credit is given to the original author and
-anyone who has modified the code through
-a header comment, such as this one.]
-
-[endsect]

Deleted: sandbox/move/libs/intrusive/example/Jamfile.v2
==============================================================================
--- sandbox/move/libs/intrusive/example/Jamfile.v2 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,34 +0,0 @@
-# Boost Intrusive Library Example Jamfile
-
-# (C) Copyright Ion Gaztanaga 2006-2007.
-# Use, modification and distribution are subject to the
-# Boost Software License, Version 1.0. (See accompanying file
-# LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-
-# Adapted from John Maddock's TR1 Jamfile.v2
-# Copyright John Maddock 2005.
-# Use, modification and distribution are subject to the
-# Boost Software License, Version 1.0. (See accompanying file
-# LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-
-# this rule enumerates through all the sources and invokes
-# the run rule for each source, the result is a list of all
-# the run rules, which we can pass on to the test_suite rule:
-
-rule test_all
-{
- local all_rules = ;
-
- for local fileb in [ glob *.cpp ]
- {
- all_rules += [ run $(fileb) /boost/thread//boost_thread
- : # additional args
- : # test-files
- : # requirements
- ] ;
- }
-
- return $(all_rules) ;
-}
-
-test-suite intrusive_example : [ test_all r ] : <threading>multi ;
\ No newline at end of file

Deleted: sandbox/move/libs/intrusive/example/doc_advanced_value_traits.cpp
==============================================================================
--- sandbox/move/libs/intrusive/example/doc_advanced_value_traits.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,105 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2006-2009
-//
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-//[doc_advanced_value_traits_code
-#include <boost/intrusive/link_mode.hpp>
-#include <boost/intrusive/list.hpp>
-#include <vector>
-
-//This is the node that will be used with algorithms.
-struct simple_node
-{
- simple_node *prev_;
- simple_node *next_;
-};
-//]
-
-//[doc_advanced_value_traits_value_traits
-class base_1{};
-class base_2{};
-
-struct value_1 : public base_1, public simple_node
-{ int id_; };
-
-struct value_2 : public base_1, public base_2, public simple_node
-{ float id_; };
-
-//Define the node traits. A single node_traits will be enough.
-struct simple_node_traits
-{
- typedef simple_node node;
- typedef node * node_ptr;
- typedef const node * const_node_ptr;
- static node *get_next(const node *n) { return n->next_; }
- static void set_next(node *n, node *next) { n->next_ = next; }
- static node *get_previous(const node *n) { return n->prev_; }
- static void set_previous(node *n, node *prev) { n->prev_ = prev; }
-};
-
-//A templatized value traits for value_1 and value_2
-template<class ValueType>
-struct simple_value_traits
-{
- typedef simple_node_traits node_traits;
- typedef node_traits::node_ptr node_ptr;
- typedef node_traits::const_node_ptr const_node_ptr;
- typedef ValueType value_type;
- typedef ValueType * pointer;
- typedef const ValueType * const_pointer;
- static const boost::intrusive::link_mode_type link_mode = boost::intrusive::normal_link;
- static node_ptr to_node_ptr (value_type &value) { return node_ptr(&value); }
- static const_node_ptr to_node_ptr (const value_type &value) { return const_node_ptr(&value); }
- static pointer to_value_ptr(node_ptr n) { return static_cast<value_type*>(n); }
- static const_pointer to_value_ptr(const_node_ptr n) { return static_cast<const value_type*>(n); }
-};
-//]
-
-//[doc_advanced_value_traits_containers
-//Now define two intrusive lists. Both lists will use the same algorithms:
-// circular_list_algorithms<simple_node_traits>
-
-using namespace boost::intrusive;
-typedef list <value_1, value_traits<simple_value_traits<value_1> > > Value1List;
-typedef list <value_2, value_traits<simple_value_traits<value_2> > > Value2List;
-//]
-
-//[doc_advanced_value_traits_test
-int main()
-{
- typedef std::vector<value_1> Vect1;
- typedef std::vector<value_2> Vect2;
-
- //Create values, with a different internal number
- Vect1 values1;
- Vect2 values2;
- for(int i = 0; i < 100; ++i){
- value_1 v1; v1.id_ = i; values1.push_back(v1);
- value_2 v2; v2.id_ = (float)i; values2.push_back(v2);
- }
-
- //Create the lists with the objects
- Value1List list1(values1.begin(), values1.end());
- Value2List list2(values2.begin(), values2.end());
-
- //Now test both lists
- Value1List::const_iterator bit1(list1.begin()), bitend1(list1.end());
- Value2List::const_iterator bit2(list2.begin()), bitend2(list2.end());
-
- Vect1::const_iterator it1(values1.begin()), itend1(values1.end());
- Vect2::const_iterator it2(values2.begin()), itend2(values2.end());
-
- //Test the objects inserted in our lists
- for(; it1 != itend1; ++it1, ++bit1, ++it2, ++bit2){
- if(&*bit1 != &*it1 || &*bit2 != &*it2) return false;
- }
- return 0;
-}
-//]

Deleted: sandbox/move/libs/intrusive/example/doc_advanced_value_traits2.cpp
==============================================================================
--- sandbox/move/libs/intrusive/example/doc_advanced_value_traits2.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,95 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2006-2009
-//
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-#include <boost/intrusive/link_mode.hpp>
-#include <boost/intrusive/list.hpp>
-#include <boost/intrusive/member_value_traits.hpp>
-#include <vector>
-
-struct simple_node
-{
- simple_node *prev_;
- simple_node *next_;
-};
-
-//Define the node traits. A single node_traits will be enough.
-struct simple_node_traits
-{
- typedef simple_node node;
- typedef node * node_ptr;
- typedef const node * const_node_ptr;
- static node *get_next(const node *n) { return n->next_; }
- static void set_next(node *n, node *next) { n->next_ = next; }
- static node *get_previous(const node *n) { return n->prev_; }
- static void set_previous(node *n, node *prev) { n->prev_ = prev; }
-};
-
-//[doc_advanced_value_traits2_value_traits
-class base_1{};
-class base_2{};
-
-struct value_1 : public base_1, public simple_node
-{
- int id_;
- simple_node node_;
-};
-
-struct value_2 : public base_1, public base_2, public simple_node
-{
- simple_node node_;
- float id_;
-};
-
-using namespace boost::intrusive;
-
-typedef member_value_traits
- <value_1, simple_node_traits, &value_1::node_, normal_link> ValueTraits1;
-typedef member_value_traits
-<value_2, simple_node_traits, &value_2::node_, normal_link> ValueTraits2;
-
-//Now define two intrusive lists. Both lists will use the same algorithms:
-// circular_list_algorithms<simple_node_traits>
-typedef list <value_1, value_traits<ValueTraits1> > Value1List;
-typedef list <value_2, value_traits<ValueTraits2> > Value2List;
-//]
-
-//[doc_advanced_value_traits2_test
-int main()
-{
- typedef std::vector<value_1> Vect1;
- typedef std::vector<value_2> Vect2;
-
- //Create values, with a different internal number
- Vect1 values1;
- Vect2 values2;
- for(int i = 0; i < 100; ++i){
- value_1 v1; v1.id_ = i; values1.push_back(v1);
- value_2 v2; v2.id_ = (float)i; values2.push_back(v2);
- }
-
- //Create the lists with the objects
- Value1List list1(values1.begin(), values1.end());
- Value2List list2(values2.begin(), values2.end());
-
- //Now test both lists
- Value1List::const_iterator bit1(list1.begin()), bitend1(list1.end());
- Value2List::const_iterator bit2(list2.begin()), bitend2(list2.end());
-
- Vect1::const_iterator it1(values1.begin()), itend1(values1.end());
- Vect2::const_iterator it2(values2.begin()), itend2(values2.end());
-
- //Test the objects inserted in our lists
- for(; it1 != itend1; ++it1, ++bit1, ++it2, ++bit2){
- if(&*bit1 != &*it1 || &*bit2 != &*it2) return false;
- }
- return 0;
-}
-//]

Deleted: sandbox/move/libs/intrusive/example/doc_any_hook.cpp
==============================================================================
--- sandbox/move/libs/intrusive/example/doc_any_hook.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,62 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2008
-//
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-//[doc_any_hook
-#include <vector>
-#include <boost/intrusive/any_hook.hpp>
-#include <boost/intrusive/slist.hpp>
-#include <boost/intrusive/list.hpp>
-
-using namespace boost::intrusive;
-
-class MyClass : public any_base_hook<> //Base hook
-{
- int int_;
-
- public:
- any_member_hook<> member_hook_; //Member hook
-
- MyClass(int i = 0) : int_(i)
- {}
-};
-
-int main()
-{
- //Define a base hook option that converts any_base_hook to a slist hook
- typedef any_to_slist_hook < base_hook< any_base_hook<> > > BaseSlistOption;
- typedef slist<MyClass, BaseSlistOption> BaseSList;
-
- //Define a member hook option that converts any_member_hook to a list hook
- typedef any_to_list_hook< member_hook
- < MyClass, any_member_hook<>, &MyClass::member_hook_> > MemberListOption;
- typedef list<MyClass, MemberListOption> MemberList;
-
- //Create several MyClass objects, each one with a different value
- std::vector<MyClass> values;
- for(int i = 0; i < 100; ++i){ values.push_back(MyClass(i)); }
-
- BaseSList base_slist; MemberList member_list;
-
- //Now insert them in reverse order in the slist and in order in the list
- for(std::vector<MyClass>::iterator it(values.begin()), itend(values.end()); it != itend; ++it)
- base_slist.push_front(*it), member_list.push_back(*it);
-
- //Now test lists
- BaseSList::iterator bit(base_slist.begin()), bitend(base_slist.end());
- MemberList::reverse_iterator mrit(member_list.rbegin()), mritend(member_list.rend());
- std::vector<MyClass>::reverse_iterator rit(values.rbegin()), ritend(values.rend());
-
- //Test the objects inserted in the base hook list
- for(; rit != ritend; ++rit, ++bit, ++mrit)
- if(&*bit != &*rit || &*mrit != &*rit) return 1;
- return 0;
-}
-//]

Deleted: sandbox/move/libs/intrusive/example/doc_assoc_optimized_code.cpp
==============================================================================
--- sandbox/move/libs/intrusive/example/doc_assoc_optimized_code.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,260 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2006-2009
-//
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-//[doc_assoc_optimized_code_normal_find
-#include <boost/intrusive/set.hpp>
-#include <boost/intrusive/unordered_set.hpp>
-#include <cstring>
-
-using namespace boost::intrusive;
-
-// Hash function for strings
-struct StrHasher
-{
- std::size_t operator()(const char *str) const
- {
- std::size_t seed = 0;
- for(; *str; ++str) boost::hash_combine(seed, *str);
- return seed;
- }
-};
-
-class Expensive : public set_base_hook<>, public unordered_set_base_hook<>
-{
- std::string key_;
- // Other members...
-
- public:
- Expensive(const char *key)
- : key_(key)
- {} //other expensive initializations...
-
- const std::string & get_key() const
- { return key_; }
-
- friend bool operator < (const Expensive &a, const Expensive &b)
- { return a.key_ < b.key_; }
-
- friend bool operator == (const Expensive &a, const Expensive &b)
- { return a.key_ == b.key_; }
-
- friend std::size_t hash_value(const Expensive &object)
- { return StrHasher()(object.get_key().c_str()); }
-};
-
-// A set and unordered_set that store Expensive objects
-typedef set<Expensive> Set;
-typedef unordered_set<Expensive> UnorderedSet;
-
-// Search functions
-Expensive *get_from_set(const char* key, Set &set_object)
-{
- Set::iterator it = set_object.find(Expensive(key));
- if( it == set_object.end() ) return 0;
- return &*it;
-}
-
-Expensive *get_from_uset(const char* key, UnorderedSet &uset_object)
-{
- UnorderedSet::iterator it = uset_object.find(Expensive (key));
- if( it == uset_object.end() ) return 0;
- return &*it;
-}
-//]
-
-//[doc_assoc_optimized_code_optimized_find
-// These compare Expensive and a c-string
-struct StrExpComp
-{
- bool operator()(const char *str, const Expensive &c) const
- { return std::strcmp(str, c.get_key().c_str()) < 0; }
-
- bool operator()(const Expensive &c, const char *str) const
- { return std::strcmp(c.get_key().c_str(), str) < 0; }
-};
-
-struct StrExpEqual
-{
- bool operator()(const char *str, const Expensive &c) const
- { return std::strcmp(str, c.get_key().c_str()) == 0; }
-
- bool operator()(const Expensive &c, const char *str) const
- { return std::strcmp(c.get_key().c_str(), str) == 0; }
-};
-
-// Optimized search functions
-Expensive *get_from_set_optimized(const char* key, Set &set_object)
-{
- Set::iterator it = set_object.find(key, StrExpComp());
- if( it == set_object.end() ) return 0;
- return &*it;
-}
-
-Expensive *get_from_uset_optimized(const char* key, UnorderedSet &uset_object)
-{
- UnorderedSet::iterator it = uset_object.find(key, StrHasher(), StrExpEqual());
- if( it == uset_object.end() ) return 0;
- return &*it;
-}
-//]
-
-//[doc_assoc_optimized_code_normal_insert
-// Insertion functions
-bool insert_to_set(const char* key, Set &set_object)
-{
- Expensive *pobject = new Expensive(key);
- bool success = set_object.insert(*pobject).second;
- if(!success) delete pobject;
- return success;
-}
-
-bool insert_to_uset(const char* key, UnorderedSet &uset_object)
-{
- Expensive *pobject = new Expensive(key);
- bool success = uset_object.insert(*pobject).second;
- if(!success) delete pobject;
- return success;
-}
-//]
-
-//[doc_assoc_optimized_code_optimized_insert
-// Optimized insertion functions
-bool insert_to_set_optimized(const char* key, Set &set_object)
-{
- Set::insert_commit_data insert_data;
- bool success = set_object.insert_check(key, StrExpComp(), insert_data).second;
- if(success) set_object.insert_commit(*new Expensive(key), insert_data);
- return success;
-}
-
-bool insert_to_uset_optimized(const char* key, UnorderedSet &uset_object)
-{
- UnorderedSet::insert_commit_data insert_data;
- bool success = uset_object.insert_check
- (key, StrHasher(), StrExpEqual(), insert_data).second;
- if(success) uset_object.insert_commit(*new Expensive(key), insert_data);
- return success;
-}
-//]
-
-int main()
-{
- Set set;
- UnorderedSet::bucket_type buckets[10];
- UnorderedSet unordered_set(UnorderedSet::bucket_traits(buckets, 10));
-
- const char * const expensive_key
- = "A long string that avoids small string optimization";
-
- Expensive value(expensive_key);
-
- if(get_from_set(expensive_key, set)){
- return 1;
- }
-
- if(get_from_uset(expensive_key, unordered_set)){
- return 1;
- }
-
- if(get_from_set_optimized(expensive_key, set)){
- return 1;
- }
-
- if(get_from_uset_optimized(expensive_key, unordered_set)){
- return 1;
- }
-
- Set::iterator setit = set.insert(value).first;
- UnorderedSet::iterator unordered_setit = unordered_set.insert(value).first;
-
- if(!get_from_set(expensive_key, set)){
- return 1;
- }
-
- if(!get_from_uset(expensive_key, unordered_set)){
- return 1;
- }
-
- if(!get_from_set_optimized(expensive_key, set)){
- return 1;
- }
-
- if(!get_from_uset_optimized(expensive_key, unordered_set)){
- return 1;
- }
-
- set.erase(setit);
- unordered_set.erase(unordered_setit);
-
- if(!insert_to_set(expensive_key, set)){
- return 1;
- }
-
- if(!insert_to_uset(expensive_key, unordered_set)){
- return 1;
- }
-
- {
- Expensive *ptr = &*set.begin();
- set.clear();
- delete ptr;
- }
-
- {
- Expensive *ptr = &*unordered_set.begin();
- unordered_set.clear();
- delete ptr;
- }
-
- if(!insert_to_set_optimized(expensive_key, set)){
- return 1;
- }
-
- if(!insert_to_uset_optimized(expensive_key, unordered_set)){
- return 1;
- }
-
- {
- Expensive *ptr = &*set.begin();
- set.clear();
- delete ptr;
- }
-
- {
- Expensive *ptr = &*unordered_set.begin();
- unordered_set.clear();
- delete ptr;
- }
-
- setit = set.insert(value).first;
- unordered_setit = unordered_set.insert(value).first;
-
- if(insert_to_set(expensive_key, set)){
- return 1;
- }
-
- if(insert_to_uset(expensive_key, unordered_set)){
- return 1;
- }
-
- if(insert_to_set_optimized(expensive_key, set)){
- return 1;
- }
-
- if(insert_to_uset_optimized(expensive_key, unordered_set)){
- return 1;
- }
-
- set.erase(value);
- unordered_set.erase(value);
-
- return 0;
-}

Deleted: sandbox/move/libs/intrusive/example/doc_auto_unlink.cpp
==============================================================================
--- sandbox/move/libs/intrusive/example/doc_auto_unlink.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,82 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2006-2009
-//
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-//[doc_auto_unlink_code
-#include <boost/intrusive/list.hpp>
-#include <cassert>
-
-using namespace boost::intrusive;
-
-typedef list_base_hook<link_mode<auto_unlink> > auto_unlink_hook;
-
-class MyClass : public auto_unlink_hook
- //This hook removes the node in the destructor
-{
- int int_;
-
- public:
- MyClass(int i = 0) : int_(i) {}
- void unlink() { auto_unlink_hook::unlink(); }
- bool is_linked() { return auto_unlink_hook::is_linked(); }
-};
-
-//Define a list that will store values using the base hook
-//The list can't have constant-time size!
-typedef list< MyClass, constant_time_size<false> > List;
-
-int main()
-{
- //Create the list
- List l;
- {
- //Create myclass and check it's linked
- MyClass myclass;
- assert(myclass.is_linked() == false);
-
- //Insert the object
- l.push_back(myclass);
-
- //Check that we have inserted the object
- assert(l.empty() == false);
- assert(&l.front() == &myclass);
- assert(myclass.is_linked() == true);
-
- //Now myclass' destructor will unlink it
- //automatically
- }
-
- //Check auto-unlink has been executed
- assert(l.empty() == true);
-
- {
- //Now test the unlink() function
-
- //Create myclass and check it's linked
- MyClass myclass;
- assert(myclass.is_linked() == false);
-
- //Insert the object
- l.push_back(myclass);
-
- //Check that we have inserted the object
- assert(l.empty() == false);
- assert(&l.front() == &myclass);
- assert(myclass.is_linked() == true);
-
- //Now unlink the node
- myclass.unlink();
-
- //Check auto-unlink has been executed
- assert(l.empty() == true);
- }
- return 0;
-}
-//]

Deleted: sandbox/move/libs/intrusive/example/doc_avl_set.cpp
==============================================================================
--- sandbox/move/libs/intrusive/example/doc_avl_set.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,86 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2006-2009
-//
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-//[doc_avl_set_code
-#include <boost/intrusive/avl_set.hpp>
-#include <vector>
-#include <algorithm>
-#include <cassert>
-
-using namespace boost::intrusive;
-
- //This is a base hook optimized for size
-class MyClass : public avl_set_base_hook<optimize_size<true> >
-{
- int int_;
-
- public:
- //This is a member hook
- avl_set_member_hook<> member_hook_;
-
- MyClass(int i)
- : int_(i)
- {}
- friend bool operator< (const MyClass &a, const MyClass &b)
- { return a.int_ < b.int_; }
- friend bool operator> (const MyClass &a, const MyClass &b)
- { return a.int_ > b.int_; }
- friend bool operator== (const MyClass &a, const MyClass &b)
- { return a.int_ == b.int_; }
-};
-
-//Define an avl_set using the base hook that will store values in reverse order
-typedef avl_set< MyClass, compare<std::greater<MyClass> > > BaseSet;
-
-//Define an multiset using the member hook
-typedef member_hook<MyClass, avl_set_member_hook<>, &MyClass::member_hook_> MemberOption;
-typedef avl_multiset< MyClass, MemberOption> MemberMultiset;
-
-int main()
-{
- typedef std::vector<MyClass>::iterator VectIt;
- typedef std::vector<MyClass>::reverse_iterator VectRit;
-
- //Create several MyClass objects, each one with a different value
- std::vector<MyClass> values;
- for(int i = 0; i < 100; ++i) values.push_back(MyClass(i));
-
- BaseSet baseset;
- MemberMultiset membermultiset;
-
- //Check that size optimization is activated in the base hook
- assert(sizeof(avl_set_base_hook<optimize_size<true> >) == 3*sizeof(void*));
- //Check that size optimization is deactivated in the member hook
- assert(sizeof(avl_set_member_hook<>) > 3*sizeof(void*));
-
- //Now insert them in the sets
- for(VectIt it(values.begin()), itend(values.end()); it != itend; ++it){
- baseset.insert(*it);
- membermultiset.insert(*it);
- }
-
- //Now test avl_sets
- {
- BaseSet::reverse_iterator rbit(baseset.rbegin()), rbitend(baseset.rend());
- MemberMultiset::iterator mit(membermultiset.begin()), mitend(membermultiset.end());
- VectIt it(values.begin()), itend(values.end());
-
- //Test the objects inserted in the base hook avl_set
- for(; it != itend; ++it, ++rbit)
- if(&*rbit != &*it) return 1;
-
- //Test the objects inserted in the member hook avl_set
- for(it = values.begin(); it != itend; ++it, ++mit)
- if(&*mit != &*it) return 1;
- }
- return 0;
-}
-//]

Deleted: sandbox/move/libs/intrusive/example/doc_avltree_algorithms.cpp
==============================================================================
--- sandbox/move/libs/intrusive/example/doc_avltree_algorithms.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,85 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2007-2009
-//
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-//[doc_avltree_algorithms_code
-#include <boost/intrusive/avltree_algorithms.hpp>
-#include <cassert>
-
-struct my_node
-{
- my_node(int i = 0)
- : int_(i)
- {}
- my_node *parent_, *left_, *right_;
- int balance_;
- //other members
- int int_;
-};
-
-//Define our own avltree_node_traits
-struct my_avltree_node_traits
-{
- typedef my_node node;
- typedef my_node * node_ptr;
- typedef const my_node * const_node_ptr;
- typedef int balance;
-
- static node_ptr get_parent(const_node_ptr n) { return n->parent_; }
- static void set_parent(node_ptr n, node_ptr parent){ n->parent_ = parent; }
- static node_ptr get_left(const_node_ptr n) { return n->left_; }
- static void set_left(node_ptr n, node_ptr left) { n->left_ = left; }
- static node_ptr get_right(const_node_ptr n) { return n->right_; }
- static void set_right(node_ptr n, node_ptr right) { n->right_ = right; }
- static balance get_balance(const_node_ptr n) { return n->balance_; }
- static void set_balance(node_ptr n, balance b) { n->balance_ = b; }
- static balance negative() { return -1; }
- static balance zero() { return 0; }
- static balance positive() { return 1; }
-};
-
-struct node_ptr_compare
-{
- bool operator()(const my_node *a, const my_node *b)
- { return a->int_ < b->int_; }
-};
-
-int main()
-{
- typedef boost::intrusive::avltree_algorithms<my_avltree_node_traits> algo;
- my_node header, two(2), three(3);
-
- //Create an empty avltree container:
- //"header" will be the header node of the tree
- algo::init_header(&header);
-
- //Now insert node "two" in the tree using the sorting functor
- algo::insert_equal_upper_bound(&header, &two, node_ptr_compare());
-
- //Now insert node "three" in the tree using the sorting functor
- algo::insert_equal_lower_bound(&header, &three, node_ptr_compare());
-
- //Now take the first node (the left node of the header)
- my_node *n = header.left_;
- assert(n == &two);
-
- //Now go to the next node
- n = algo::next_node(n);
- assert(n == &three);
-
- //Erase a node just using a pointer to it
- algo::unlink(&two);
-
- //Erase a node using also the header (faster)
- algo::erase(&header, &three);
- return 0;
-}
-
-//]

Deleted: sandbox/move/libs/intrusive/example/doc_bucket_traits.cpp
==============================================================================
--- sandbox/move/libs/intrusive/example/doc_bucket_traits.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,83 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2007-2009
-//
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-//[doc_bucket_traits
-#include <boost/intrusive/unordered_set.hpp>
-#include <boost/functional/hash.hpp>
-#include <vector>
-
-using namespace boost::intrusive;
-
-//A class to be inserted in an unordered_set
-class MyClass : public unordered_set_base_hook<>
-{
- int int_;
-
- public:
- MyClass(int i = 0) : int_(i)
- {}
-
- friend bool operator==(const MyClass &l, const MyClass &r)
- { return l.int_ == r.int_; }
- friend std::size_t hash_value(const MyClass &v)
- { return boost::hash_value(v.int_); }
-};
-
-//Define the base hook option
-typedef base_hook< unordered_set_base_hook<> > BaseHookOption;
-
-//Obtain the types of the bucket and the bucket pointer
-typedef unordered_bucket<BaseHookOption>::type BucketType;
-typedef unordered_bucket_ptr<BaseHookOption>::type BucketPtr;
-
-//The custom bucket traits.
-class custom_bucket_traits
-{
- public:
- static const int NumBuckets = 100;
-
- custom_bucket_traits(BucketPtr buckets)
- : buckets_(buckets)
- {}
-
- //Functions to be implemented by custom bucket traits
- BucketPtr bucket_begin() const { return buckets_; }
- std::size_t bucket_count() const { return NumBuckets;}
-
- private:
- BucketPtr buckets_;
-};
-
-//Define the container using the custom bucket traits
-typedef unordered_set<MyClass, bucket_traits<custom_bucket_traits> > BucketTraitsUset;
-
-int main()
-{
- typedef std::vector<MyClass>::iterator VectIt;
- std::vector<MyClass> values;
-
- //Fill values
- for(int i = 0; i < 100; ++i) values.push_back(MyClass(i));
-
- //Now create the bucket array and the custom bucket traits object
- BucketType buckets[custom_bucket_traits::NumBuckets];
- custom_bucket_traits btraits(buckets);
-
- //Now create the unordered set
- BucketTraitsUset uset(btraits);
-
- //Insert the values in the unordered set
- for(VectIt it(values.begin()), itend(values.end()); it != itend; ++it)
- uset.insert(*it);
-
- return 0;
-}
-//]

Deleted: sandbox/move/libs/intrusive/example/doc_clone_from.cpp
==============================================================================
--- sandbox/move/libs/intrusive/example/doc_clone_from.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,74 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2006-2009
-//
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-//[doc_clone_from
-#include <boost/intrusive/list.hpp>
-#include <iostream>
-#include <vector>
-
-using namespace boost::intrusive;
-
-//A class that can be inserted in an intrusive list
-class my_class : public list_base_hook<>
-{
- public:
- friend bool operator==(const my_class &a, const my_class &b)
- { return a.int_ == b.int_; }
-
- int int_;
-
- //...
-};
-
-//Definition of the intrusive list
-typedef list<my_class> my_class_list;
-
-//Cloner object function
-struct new_cloner
-{
- my_class *operator()(const my_class &clone_this)
- { return new my_class(clone_this); }
-};
-
-//The disposer object function
-struct delete_disposer
-{
- void operator()(my_class *delete_this)
- { delete delete_this; }
-};
-
-int main()
-{
- const int MaxElem = 100;
- std::vector<my_class> nodes(MaxElem);
-
- //Fill all the nodes and insert them in the list
- my_class_list list;
-
- for(int i = 0; i < MaxElem; ++i) nodes[i].int_ = i;
-
- list.insert(list.end(), nodes.begin(), nodes.end());
-
- //Now clone "list" using "new" and "delete" object functions
- my_class_list cloned_list;
- cloned_list.clone_from(list, new_cloner(), delete_disposer());
-
- //Test that both are equal
- if(cloned_list != list)
- std::cout << "Both lists are different" << std::endl;
- else
- std::cout << "Both lists are equal" << std::endl;
-
- //Don't forget to free the memory from the second list
- cloned_list.clear_and_dispose(delete_disposer());
- return 0;
-}
-//]

Deleted: sandbox/move/libs/intrusive/example/doc_entity.cpp
==============================================================================
--- sandbox/move/libs/intrusive/example/doc_entity.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,60 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2006-2009
-//
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-//[doc_entity_code
-#include <boost/intrusive/list.hpp>
-
-using namespace boost::intrusive;
-
-//A class that can be inserted in an intrusive list
-class entity : public list_base_hook<>
-{
- public:
- virtual ~entity();
- //...
-};
-
-//"some_entity" derives from "entity"
-class some_entity : public entity
-{/**/};
-
-//Definition of the intrusive list
-typedef list<entity> entity_list;
-
-//A global list
-entity_list global_list;
-
-//The destructor removes itself from the global list
-entity::~entity()
-{ global_list.erase(entity_list::s_iterator_to(*this)); }
-
-//Function to insert a new "some_entity" in the global list
-void insert_some_entity()
-{ global_list.push_back (*new some_entity(/*...*/)); }
-
-//Function to clear an entity from the intrusive global list
-void clear_list ()
-{
- // entity's destructor removes itself from the global list implicitly
- while (!global_list.empty())
- delete &global_list.front();
-}
-
-int main()
-{
- //Insert some new entities
- insert_some_entity();
- insert_some_entity();
- //global_list's destructor will free objects
- return 0;
-}
-
-//]

Deleted: sandbox/move/libs/intrusive/example/doc_erasing_and_disposing.cpp
==============================================================================
--- sandbox/move/libs/intrusive/example/doc_erasing_and_disposing.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,70 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2006-2009
-//
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-//[doc_erasing_and_disposing
-#include <boost/intrusive/list.hpp>
-
-using namespace boost::intrusive;
-
-//A class that can be inserted in an intrusive list
-class my_class : public list_base_hook<>
-{
- public:
- my_class(int i)
- : int_(i)
- {}
-
- int int_;
- //...
-};
-
-//Definition of the intrusive list
-typedef list<my_class> my_class_list;
-
-//The predicate function
-struct is_even
-{
- bool operator()(const my_class &c) const
- { return 0 == (c.int_ % 2); }
-};
-
-//The disposer object function
-struct delete_disposer
-{
- void operator()(my_class *delete_this)
- { delete delete_this; }
-};
-
-int main()
-{
- const int MaxElem = 100;
-
- //Fill all the nodes and insert them in the list
- my_class_list list;
-
- try{
- //Insert new objects in the container
- for(int i = 0; i < MaxElem; ++i) list.push_back(*new my_class(i));
-
- //Now use remove_and_dispose_if to erase and delete the objects
- list.remove_and_dispose_if(is_even(), delete_disposer());
- }
- catch(...){
- //If something throws, make sure that all the memory is freed
- list.clear_and_dispose(delete_disposer());
- throw;
- }
-
- //Dispose remaining elements
- list.erase_and_dispose(list.begin(), list.end(), delete_disposer());
- return 0;
-}
-//]

Deleted: sandbox/move/libs/intrusive/example/doc_external_value_traits.cpp
==============================================================================
--- sandbox/move/libs/intrusive/example/doc_external_value_traits.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,129 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2007-2009
-//
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-//[doc_external_value_traits
-#include <boost/intrusive/list.hpp>
-#include <vector>
-
-using namespace boost::intrusive;
-
-//This type is not modifiable so we can't store hooks or custom nodes
-typedef int identifier_t;
-
-//This value traits will associate elements from an array of identifiers with
-//elements of an array of nodes. The element i of the value array will use the
-//node i of the node array:
-class external_traits
-{
- //Non-copyable
- external_traits(const external_traits &);
- external_traits& operator=(const external_traits &);
-
- public:
- typedef list_node_traits<void*> node_traits;
- typedef node_traits::node node;
- typedef node * node_ptr;
- typedef const node * const_node_ptr;
- typedef identifier_t value_type;
- typedef identifier_t * pointer;
- typedef const identifier_t * const_pointer;
- static const link_mode_type link_mode = normal_link;
-
- external_traits(pointer ids, std::size_t NumElements)
- : ids_(ids), nodes_(NumElements)
- {}
-
- ///Note: non static functions!
- node_ptr to_node_ptr (value_type &value)
- { return &this->nodes_[0] + (&value - this->ids_); }
- const_node_ptr to_node_ptr (const value_type &value) const
- { return &this->nodes_[0] + (&value - this->ids_); }
- pointer to_value_ptr(node_ptr n)
- { return this->ids_ + (n - &this->nodes_[0]); }
- const_pointer to_value_ptr(const_node_ptr n) const
- { return this->ids_ + (n - &this->nodes_[0]); }
-
- private:
- pointer ids_;
- //This is an array of nodes that is necessary to form the linked list
- std::vector<list_node_traits<void*>::node> nodes_;
-};
-
-//This is the value traits class that will be stored in the container
-//and that will lead to the external traits using the address
-//of the container.
-struct internal_traits
-{
- static const bool external_value_traits = true;
- typedef external_traits value_traits;
-
- template<class Container>
- value_traits &get_value_traits(Container &cont);
-
- template<class Container>
- const value_traits &get_value_traits(const Container &cont) const;
-};
-
-//The intrusive list that will use external value traits
-typedef list<identifier_t, value_traits<internal_traits> > List;
-
-class data_holder
- : public List
-{
- public:
- data_holder(identifier_t *ids, std::size_t NumElements)
- : List()
- , external_traits_(ids, NumElements)
- {}
- external_traits external_traits_;
-};
-
-template<class Container>
-internal_traits::value_traits &internal_traits::get_value_traits(Container &cont)
-{ return static_cast<data_holder&>(cont).external_traits_; }
-
-template<class Container>
-const internal_traits::value_traits &internal_traits::get_value_traits(const Container &cont) const
-{ return static_cast<const data_holder&>(cont).external_traits_; }
-
-int main()
-{
- const int NumElements = 100;
-
- //This is an array of ids that we want to "store"
- identifier_t ids [NumElements];
-
- //Initialize id objects, each one with a different number
- for(int i = 0; i != NumElements; ++i) ids[i] = i;
-
- //The data holding the list and the external traits
- data_holder data(ids, NumElements);
-
- //This list will store ids without modifying identifier_t instances
- //Stateful value traits must be explicitly passed in the constructor.
- List &my_list = data;
-
- //Insert ids in reverse order in the list
- for(identifier_t * it(&ids[0]), *itend(&ids[NumElements]); it != itend; ++it)
- my_list.push_front(*it);
-
- //Now test lists
- List::const_iterator list_it (my_list.cbegin());
- identifier_t *it_val(&ids[NumElements]-1), *it_rbeg_val(&ids[0] -1);
-
- //Test the objects inserted in the base hook list
- for(; it_val != it_rbeg_val; --it_val, ++list_it){
- if(&*list_it != &*it_val) return 1;
- }
-
- return 0;
-}
-//]

Deleted: sandbox/move/libs/intrusive/example/doc_how_to_use.cpp
==============================================================================
--- sandbox/move/libs/intrusive/example/doc_how_to_use.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,75 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2006-2009
-//
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-//[doc_how_to_use_code
-#include <boost/intrusive/list.hpp>
-#include <vector>
-
-using namespace boost::intrusive;
-
-class MyClass : public list_base_hook<>
-{
- int int_;
-
- public:
- list_member_hook<> member_hook_;
-
- MyClass(int i) : int_(i) {}
-};
-
-//Define a list that will store MyClass using the base hook
-typedef list<MyClass> BaseList;
-
-//Define a list that will store MyClass using the member hook
-typedef member_hook
- < MyClass, list_member_hook<>, &MyClass::member_hook_> MemberOption;
-typedef list<MyClass, MemberOption> MemberList;
-
-int main()
-{
- typedef std::vector<MyClass>::iterator VectIt;
- typedef std::vector<MyClass>::reverse_iterator VectRit;
-
- //Create several MyClass objects, each one with a different value
- std::vector<MyClass> values;
- for(int i = 0; i < 100; ++i) values.push_back(MyClass(i));
-
- BaseList baselist;
- MemberList memberlist;
-
- //Now insert them in the reverse order in the base hook list
- for(VectIt it(values.begin()), itend(values.end())
- ; it != itend ; ++it){
- baselist.push_front(*it);
- }
-
- //Now insert them in the same order as in vector in the member hook list
- for(VectIt it(values.begin()), itend(values.end()); it != itend; ++it)
- memberlist.push_back(*it);
-
- //Now test lists
- {
- BaseList::reverse_iterator rbit(baselist.rbegin()), rbitend(baselist.rend());
- MemberList::iterator mit(memberlist.begin()), mitend(memberlist.end());
- VectIt it(values.begin()), itend(values.end());
-
- //Test the objects inserted in the base hook list
- for(; it != itend; ++it, ++rbit)
- if(&*rbit != &*it) return 1;
-
- //Test the objects inserted in the member hook list
- for(it = values.begin(); it != itend; ++it, ++mit)
- if(&*mit != &*it) return 1;
- }
-
- return 0;
-}
-//]

Deleted: sandbox/move/libs/intrusive/example/doc_iterator_from_value.cpp
==============================================================================
--- sandbox/move/libs/intrusive/example/doc_iterator_from_value.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,97 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2006-2009
-//
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-//[doc_iterator_from_value
-#include <boost/intrusive/list.hpp>
-#include <boost/intrusive/unordered_set.hpp>
-#include <boost/functional/hash.hpp>
-#include <vector>
-
-using namespace boost::intrusive;
-
-class intrusive_data
-{
- int data_id_;
- public:
-
- void set(int id) { data_id_ = id; }
-
- //This class can be inserted in an intrusive list
- list_member_hook<> list_hook_;
-
- //This class can be inserted in an intrusive unordered_set
- unordered_set_member_hook<> unordered_set_hook_;
-
- //Comparison operators
- friend bool operator==(const intrusive_data &a, const intrusive_data &b)
- { return a.data_id_ == b.data_id_; }
-
- friend bool operator!=(const intrusive_data &a, const intrusive_data &b)
- { return a.data_id_ != b.data_id_; }
-
- //The hash function
- friend std::size_t hash_value(const intrusive_data &i)
- { return boost::hash<int>()(i.data_id_); }
-};
-
-//Definition of the intrusive list that will hold intrusive_data
-typedef member_hook<intrusive_data, list_member_hook<>
- , &intrusive_data::list_hook_> MemberListOption;
-typedef list<intrusive_data, MemberListOption> list_t;
-
-//Definition of the intrusive unordered_set that will hold intrusive_data
-typedef member_hook
- < intrusive_data, unordered_set_member_hook<>
- , &intrusive_data::unordered_set_hook_> MemberUsetOption;
-typedef boost::intrusive::unordered_set
- < intrusive_data, MemberUsetOption> unordered_set_t;
-
-int main()
-{
- //Create MaxElem objects
- const int MaxElem = 100;
- std::vector<intrusive_data> nodes(MaxElem);
-
- //Declare the intrusive containers
- list_t list;
- unordered_set_t::bucket_type buckets[MaxElem];
- unordered_set_t unordered_set
- (unordered_set_t::bucket_traits(buckets, MaxElem));
-
- //Initialize all the nodes
- for(int i = 0; i < MaxElem; ++i) nodes[i].set(i);
-
- //Now insert them in both intrusive containers
- list.insert(list.end(), nodes.begin(), nodes.end());
- unordered_set.insert(nodes.begin(), nodes.end());
-
- //Now check the iterator_to function
- list_t::iterator list_it(list.begin());
- for(int i = 0; i < MaxElem; ++i, ++list_it)
- if(list.iterator_to(nodes[i]) != list_it ||
- list_t::s_iterator_to(nodes[i]) != list_it)
- return 1;
-
- //Now check unordered_set::s_iterator_to (which is a member function)
- //and unordered_set::s_local_iterator_to (which is an static member function)
- unordered_set_t::iterator unordered_set_it(unordered_set.begin());
- for(int i = 0; i < MaxElem; ++i){
- unordered_set_it = unordered_set.find(nodes[i]);
- if(unordered_set.iterator_to(nodes[i]) != unordered_set_it)
- return 1;
- if(*unordered_set.local_iterator_to(nodes[i]) != *unordered_set_it ||
- *unordered_set_t::s_local_iterator_to(nodes[i]) != *unordered_set_it )
- return 1;
- }
-
- return 0;
-}
-//]

Deleted: sandbox/move/libs/intrusive/example/doc_list.cpp
==============================================================================
--- sandbox/move/libs/intrusive/example/doc_list.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,76 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2006-2009
-//
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-//[doc_list_code
-#include <boost/intrusive/list.hpp>
-#include <vector>
-
-using namespace boost::intrusive;
-
-class MyClass : public list_base_hook<> //This is a derivation hook
-{
- int int_;
-
- public:
- //This is a member hook
- list_member_hook<> member_hook_;
-
- MyClass(int i)
- : int_(i)
- {}
-};
-
-//Define a list that will store MyClass using the public base hook
-typedef list<MyClass> BaseList;
-
-//Define a list that will store MyClass using the public member hook
-typedef list< MyClass
- , member_hook< MyClass, list_member_hook<>, &MyClass::member_hook_>
- > MemberList;
-
-int main()
-{
- typedef std::vector<MyClass>::iterator VectIt;
- typedef std::vector<MyClass>::reverse_iterator VectRit;
-
- //Create several MyClass objects, each one with a different value
- std::vector<MyClass> values;
- for(int i = 0; i < 100; ++i) values.push_back(MyClass(i));
-
- BaseList baselist;
- MemberList memberlist;
-
- //Now insert them in the reverse order in the base hook list
- for(VectIt it(values.begin()), itend(values.end()); it != itend; ++it)
- baselist.push_front(*it);
-
- //Now insert them in the same order as in vector in the member hook list
- for(VectIt it(values.begin()), itend(values.end()); it != itend; ++it)
- memberlist.push_back(*it);
-
- //Now test lists
- {
- BaseList::reverse_iterator rbit(baselist.rbegin()), rbitend(baselist.rend());
- MemberList::iterator mit(memberlist.begin()), mitend(memberlist.end());
- VectIt it(values.begin()), itend(values.end());
-
- //Test the objects inserted in the base hook list
- for(; it != itend; ++it, ++rbit)
- if(&*rbit != &*it) return 1;
-
- //Test the objects inserted in the member hook list
- for(it = values.begin(); it != itend; ++it, ++mit)
- if(&*mit != &*it) return 1;
- }
-
- return 0;
-}
-//]

Deleted: sandbox/move/libs/intrusive/example/doc_list_algorithms.cpp
==============================================================================
--- sandbox/move/libs/intrusive/example/doc_list_algorithms.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,66 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2006-2009
-//
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-//[doc_list_algorithms_code
-#include <boost/intrusive/circular_list_algorithms.hpp>
-#include <cassert>
-
-struct my_node
-{
- my_node *next_, *prev_;
- //other members...
-};
-
-//Define our own list_node_traits
-struct my_list_node_traits
-{
- typedef my_node node;
- typedef my_node * node_ptr;
- typedef const my_node * const_node_ptr;
- static node_ptr get_next(const_node_ptr n) { return n->next_; }
- static void set_next(node_ptr n, node_ptr next) { n->next_ = next; }
- static node *get_previous(const_node_ptr n) { return n->prev_; }
- static void set_previous(node_ptr n, node_ptr prev){ n->prev_ = prev; }
-};
-
-int main()
-{
- typedef boost::intrusive::circular_list_algorithms<my_list_node_traits> algo;
- my_node one, two, three;
-
- //Create an empty doubly linked list container:
- //"one" will be the first node of the container
- algo::init_header(&one);
- assert(algo::count(&one) == 1);
-
- //Now add a new node before "one"
- algo::link_before(&one, &two);
- assert(algo::count(&one) == 2);
-
- //Now add a new node after "two"
- algo::link_after(&two, &three);
- assert(algo::count(&one) == 3);
-
- //Now unlink the node after one
- algo::unlink(&three);
- assert(algo::count(&one) == 2);
-
- //Now unlink two
- algo::unlink(&two);
- assert(algo::count(&one) == 1);
-
- //Now unlink one
- algo::unlink(&one);
- assert(algo::count(&one) == 1);
-
- return 0;
-}
-//]

Deleted: sandbox/move/libs/intrusive/example/doc_offset_ptr.cpp
==============================================================================
--- sandbox/move/libs/intrusive/example/doc_offset_ptr.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,100 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2006-2009
-//
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-
-//This is needed to allow concurrent test execution in
-//several platforms. The shared memory must be unique
-//for each process...
-#include <boost/interprocess/detail/os_thread_functions.hpp>
-#include <sstream>
-
-const char *get_shared_memory_name()
-{
- std::stringstream s;
- s << "process_" << boost::interprocess::detail::get_current_process_id();
- static std::string str = s.str();
- return str.c_str();
-}
-
-//[doc_offset_ptr_0
-#include <boost/intrusive/list.hpp>
-#include <boost/interprocess/offset_ptr.hpp>
-
-using namespace boost::intrusive;
-namespace ip = boost::interprocess;
-
-class shared_memory_data
- //Declare the hook with an offset_ptr from Boost.Interprocess
- //to make this class compatible with shared memory
- : public list_base_hook< void_pointer< ip::offset_ptr<void> > >
-{
- int data_id_;
- public:
-
- int get() const { return data_id_; }
- void set(int id) { data_id_ = id; }
-};
-//]
-
-//[doc_offset_ptr_1
-#include <boost/interprocess/managed_shared_memory.hpp>
-#include <boost/interprocess/containers/vector.hpp>
-#include <boost/interprocess/containers/list.hpp>
-#include <boost/interprocess/allocators/allocator.hpp>
-
-//Definition of the shared memory friendly intrusive list
-typedef ip::list<shared_memory_data> shm_list_t;
-
-int main()
-{
- //Now create an intrusive list in shared memory:
- //nodes and the container itself must be created in shared memory
- const int MaxElem = 100;
- const int ShmSize = 50000;
- const char *ShmName = get_shared_memory_name();
- {
- //Erase all old shared memory
- ip::shared_memory_object::remove(ShmName);
- ip::managed_shared_memory shm(ip::create_only, ShmName, ShmSize);
-
- //Create all nodes in shared memory using a shared memory vector
- //See Boost.Interprocess documentation for more information on this
- typedef ip::allocator
- < shared_memory_data, ip::managed_shared_memory::segment_manager>
- shm_allocator_t;
- typedef ip::vector<shared_memory_data, shm_allocator_t> shm_vector_t;
- shm_allocator_t shm_alloc(shm.get_segment_manager());
- shm_vector_t *pshm_vect =
- shm.construct<shm_vector_t>(ip::anonymous_instance)(shm_alloc);
- pshm_vect->resize(MaxElem);
-
- //Initialize all the nodes
- for(int i = 0; i < MaxElem; ++i) (*pshm_vect)[i].set(i);
-
- //Now create the shared memory intrusive list
- shm_list_t *plist = shm.construct<shm_list_t>(ip::anonymous_instance)();
- plist->insert(plist->end(), pshm_vect->begin(), pshm_vect->end());
-
- //Check all the inserted nodes
- int checker = 0;
- for( shm_list_t::const_iterator it = plist->begin(), itend(plist->end())
- ; it != itend; ++it, ++checker){
- if(it->get() != checker) return false;
- }
-
- //Now delete the list and after that, the nodes
- shm.destroy_ptr(plist);
- shm.destroy_ptr(pshm_vect);
- }
- ip::shared_memory_object::remove(ShmName);
- return 0;
-}
-//]

Deleted: sandbox/move/libs/intrusive/example/doc_positional_insertion.cpp
==============================================================================
--- sandbox/move/libs/intrusive/example/doc_positional_insertion.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,74 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2009-2009
-//
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-//[doc_positional_insertion
-#include <boost/intrusive/set.hpp>
-#include <vector>
-#include <algorithm>
-#include <cassert>
-
-using namespace boost::intrusive;
-
-//A simple class with a set hook
-class MyClass : public set_base_hook<>
-{
- public:
- int int_;
-
- MyClass(int i) : int_(i) {}
- friend bool operator< (const MyClass &a, const MyClass &b)
- { return a.int_ < b.int_; }
- friend bool operator> (const MyClass &a, const MyClass &b)
- { return a.int_ > b.int_; }
-};
-
-int main()
-{
- //Create some ORDERED elements
- std::vector<MyClass> values;
- for(int i = 0; i < 100; ++i) values.push_back(MyClass(i));
-
- { //Data is naturally ordered in the vector with the same criteria
- //as multiset's comparison predicate, so we can just push back
- //all elements, which is more efficient than normal insertion
- multiset<MyClass> mset;
- for(int i = 0; i < 100; ++i) mset.push_back(values[i]);
-
- //Now check orderd invariant
- multiset<MyClass>::const_iterator next(mset.cbegin()), it(next++);
- for(int i = 0; i < 99; ++i, ++it, ++next) assert(*it < *next);
- }
- { //Now the correct order for the set is the reverse order
- //so let's push front all elements
- multiset<MyClass, compare< std::greater<MyClass> > > mset;
- for(int i = 0; i < 100; ++i) mset.push_front(values[i]);
-
- //Now check orderd invariant
- multiset<MyClass, compare< std::greater<MyClass> > >::
- const_iterator next(mset.cbegin()), it(next++);
- for(int i = 0; i < 99; ++i, ++it, ++next) assert(*it > *next);
- }
- { //Now push the first and the last and insert the rest
- //before the last position using "insert_before"
- multiset<MyClass> mset;
- mset.insert_before(mset.begin(), values[0]);
- multiset<MyClass>::const_iterator pos =
- mset.insert_before(mset.end(), values[99]);
- for(int i = 1; i < 99; ++i) mset.insert_before(pos, values[i]);
-
- //Now check orderd invariant
- multiset<MyClass>::const_iterator next(mset.cbegin()), it(next++);
- for(int i = 0; i < 99; ++i, ++it, ++next) assert(*it < *next);
- }
-
- return 0;
-}
-//]

Deleted: sandbox/move/libs/intrusive/example/doc_rbtree_algorithms.cpp
==============================================================================
--- sandbox/move/libs/intrusive/example/doc_rbtree_algorithms.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,83 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2006-2009
-//
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-//[doc_rbtree_algorithms_code
-#include <boost/intrusive/rbtree_algorithms.hpp>
-#include <cassert>
-
-struct my_node
-{
- my_node(int i = 0)
- : int_(i)
- {}
- my_node *parent_, *left_, *right_;
- int color_;
- //other members
- int int_;
-};
-
-//Define our own rbtree_node_traits
-struct my_rbtree_node_traits
-{
- typedef my_node node;
- typedef my_node * node_ptr;
- typedef const my_node * const_node_ptr;
- typedef int color;
- static node_ptr get_parent(const_node_ptr n) { return n->parent_; }
- static void set_parent(node_ptr n, node_ptr parent){ n->parent_ = parent; }
- static node_ptr get_left(const_node_ptr n) { return n->left_; }
- static void set_left(node_ptr n, node_ptr left) { n->left_ = left; }
- static node_ptr get_right(const_node_ptr n) { return n->right_; }
- static void set_right(node_ptr n, node_ptr right) { n->right_ = right; }
- static color get_color(const_node_ptr n) { return n->color_; }
- static void set_color(node_ptr n, color c) { n->color_ = c; }
- static color black() { return color(0); }
- static color red() { return color(1); }
-};
-
-struct node_ptr_compare
-{
- bool operator()(const my_node *a, const my_node *b)
- { return a->int_ < b->int_; }
-};
-
-int main()
-{
- typedef boost::intrusive::rbtree_algorithms<my_rbtree_node_traits> algo;
- my_node header, two(2), three(3);
-
- //Create an empty rbtree container:
- //"header" will be the header node of the tree
- algo::init_header(&header);
-
- //Now insert node "two" in the tree using the sorting functor
- algo::insert_equal_upper_bound(&header, &two, node_ptr_compare());
-
- //Now insert node "three" in the tree using the sorting functor
- algo::insert_equal_lower_bound(&header, &three, node_ptr_compare());
-
- //Now take the first node (the left node of the header)
- my_node *n = header.left_;
- assert(n == &two);
-
- //Now go to the next node
- n = algo::next_node(n);
- assert(n == &three);
-
- //Erase a node just using a pointer to it
- algo::unlink(&two);
-
- //Erase a node using also the header (faster)
- algo::erase(&header, &three);
- return 0;
-}
-
-//]

Deleted: sandbox/move/libs/intrusive/example/doc_set.cpp
==============================================================================
--- sandbox/move/libs/intrusive/example/doc_set.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,86 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2006-2009
-//
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-//[doc_set_code
-#include <boost/intrusive/set.hpp>
-#include <vector>
-#include <algorithm>
-#include <cassert>
-
-using namespace boost::intrusive;
-
- //This is a base hook optimized for size
-class MyClass : public set_base_hook<optimize_size<true> >
-{
- int int_;
-
- public:
- //This is a member hook
- set_member_hook<> member_hook_;
-
- MyClass(int i)
- : int_(i)
- {}
- friend bool operator< (const MyClass &a, const MyClass &b)
- { return a.int_ < b.int_; }
- friend bool operator> (const MyClass &a, const MyClass &b)
- { return a.int_ > b.int_; }
- friend bool operator== (const MyClass &a, const MyClass &b)
- { return a.int_ == b.int_; }
-};
-
-//Define a set using the base hook that will store values in reverse order
-typedef set< MyClass, compare<std::greater<MyClass> > > BaseSet;
-
-//Define an multiset using the member hook
-typedef member_hook<MyClass, set_member_hook<>, &MyClass::member_hook_> MemberOption;
-typedef multiset< MyClass, MemberOption> MemberMultiset;
-
-int main()
-{
- typedef std::vector<MyClass>::iterator VectIt;
- typedef std::vector<MyClass>::reverse_iterator VectRit;
-
- //Create several MyClass objects, each one with a different value
- std::vector<MyClass> values;
- for(int i = 0; i < 100; ++i) values.push_back(MyClass(i));
-
- BaseSet baseset;
- MemberMultiset membermultiset;
-
- //Check that size optimization is activated in the base hook
- assert(sizeof(set_base_hook<optimize_size<true> >) == 3*sizeof(void*));
- //Check that size optimization is deactivated in the member hook
- assert(sizeof(set_member_hook<>) > 3*sizeof(void*));
-
- //Now insert them in the reverse order in the base hook set
- for(VectIt it(values.begin()), itend(values.end()); it != itend; ++it){
- baseset.insert(*it);
- membermultiset.insert(*it);
- }
-
- //Now test sets
- {
- BaseSet::reverse_iterator rbit(baseset.rbegin()), rbitend(baseset.rend());
- MemberMultiset::iterator mit(membermultiset.begin()), mitend(membermultiset.end());
- VectIt it(values.begin()), itend(values.end());
-
- //Test the objects inserted in the base hook set
- for(; it != itend; ++it, ++rbit)
- if(&*rbit != &*it) return 1;
-
- //Test the objects inserted in the member hook set
- for(it = values.begin(); it != itend; ++it, ++mit)
- if(&*mit != &*it) return 1;
- }
- return 0;
-}
-//]

Deleted: sandbox/move/libs/intrusive/example/doc_sg_set.cpp
==============================================================================
--- sandbox/move/libs/intrusive/example/doc_sg_set.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,85 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2007-2009
-//
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-//[doc_sg_set_code
-#include <boost/intrusive/sg_set.hpp>
-#include <vector>
-#include <algorithm>
-#include <cassert>
-
-using namespace boost::intrusive;
-
-class MyClass : public bs_set_base_hook<>
-{
- int int_;
-
- public:
- //This is a member hook
- bs_set_member_hook<> member_hook_;
-
- MyClass(int i)
- : int_(i)
- {}
- friend bool operator< (const MyClass &a, const MyClass &b)
- { return a.int_ < b.int_; }
- friend bool operator> (const MyClass &a, const MyClass &b)
- { return a.int_ > b.int_; }
- friend bool operator== (const MyClass &a, const MyClass &b)
- { return a.int_ == b.int_; }
-};
-
-//Define an sg_set using the base hook that will store values in reverse order
-//and won't execute floating point operations.
-typedef sg_set
- < MyClass, compare<std::greater<MyClass> >, floating_point<false> > BaseSet;
-
-//Define an multiset using the member hook
-typedef member_hook<MyClass, bs_set_member_hook<>, &MyClass::member_hook_> MemberOption;
-typedef sg_multiset< MyClass, MemberOption> MemberMultiset;
-
-int main()
-{
- typedef std::vector<MyClass>::iterator VectIt;
- typedef std::vector<MyClass>::reverse_iterator VectRit;
-
- //Create several MyClass objects, each one with a different value
- std::vector<MyClass> values;
- for(int i = 0; i < 100; ++i) values.push_back(MyClass(i));
-
- BaseSet baseset;
- MemberMultiset membermultiset;
-
- //Now insert them in the reverse order in the base hook sg_set
- for(VectIt it(values.begin()), itend(values.end()); it != itend; ++it){
- baseset.insert(*it);
- membermultiset.insert(*it);
- }
-
- //Change balance factor
- membermultiset.balance_factor(0.9f);
-
- //Now test sg_sets
- {
- BaseSet::reverse_iterator rbit(baseset.rbegin()), rbitend(baseset.rend());
- MemberMultiset::iterator mit(membermultiset.begin()), mitend(membermultiset.end());
- VectIt it(values.begin()), itend(values.end());
-
- //Test the objects inserted in the base hook sg_set
- for(; it != itend; ++it, ++rbit)
- if(&*rbit != &*it) return 1;
-
- //Test the objects inserted in the member hook sg_set
- for(it = values.begin(); it != itend; ++it, ++mit)
- if(&*mit != &*it) return 1;
- }
- return 0;
-}
-//]

Deleted: sandbox/move/libs/intrusive/example/doc_slist.cpp
==============================================================================
--- sandbox/move/libs/intrusive/example/doc_slist.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,79 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2006-2009
-//
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-//[doc_slist_code
-#include <boost/intrusive/slist.hpp>
-#include <vector>
-
-using namespace boost::intrusive;
-
- //This is a base hook
-class MyClass : public slist_base_hook<>
-{
- int int_;
-
- public:
- //This is a member hook
- slist_member_hook<> member_hook_;
-
- MyClass(int i)
- : int_(i)
- {}
-};
-
-//Define an slist that will store MyClass using the public base hook
-typedef slist<MyClass> BaseList;
-
-//Define an slist that will store MyClass using the public member hook
-typedef member_hook<MyClass, slist_member_hook<>, &MyClass::member_hook_> MemberOption;
-typedef slist<MyClass, MemberOption> MemberList;
-
-int main()
-{
- typedef std::vector<MyClass>::iterator VectIt;
- typedef std::vector<MyClass>::reverse_iterator VectRit;
-
- //Create several MyClass objects, each one with a different value
- std::vector<MyClass> values;
- for(int i = 0; i < 100; ++i) values.push_back(MyClass(i));
-
- BaseList baselist;
- MemberList memberlist;
-
- //Now insert them in the reverse order in the base hook list
- for(VectIt it(values.begin()), itend(values.end()); it != itend; ++it)
- baselist.push_front(*it);
-
- //Now insert them in the same order as in vector in the member hook list
- for(BaseList::iterator it(baselist.begin()), itend(baselist.end())
- ; it != itend; ++it){
- memberlist.push_front(*it);
- }
-
- //Now test lists
- {
- BaseList::iterator bit(baselist.begin()), bitend(baselist.end());
- MemberList::iterator mit(memberlist.begin()), mitend(memberlist.end());
- VectRit rit(values.rbegin()), ritend(values.rend());
- VectIt it(values.begin()), itend(values.end());
-
- //Test the objects inserted in the base hook list
- for(; rit != ritend; ++rit, ++bit)
- if(&*bit != &*rit) return 1;
-
- //Test the objects inserted in the member hook list
- for(; it != itend; ++it, ++mit)
- if(&*mit != &*it) return 1;
- }
-
- return 0;
-}
-//]

Deleted: sandbox/move/libs/intrusive/example/doc_slist_algorithms.cpp
==============================================================================
--- sandbox/move/libs/intrusive/example/doc_slist_algorithms.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,60 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2006-2009
-//
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-//[doc_slist_algorithms_code
-#include <boost/intrusive/circular_slist_algorithms.hpp>
-#include <cassert>
-
-struct my_node
-{
- my_node *next_;
- //other members...
-};
-
-//Define our own slist_node_traits
-struct my_slist_node_traits
-{
- typedef my_node node;
- typedef my_node * node_ptr;
- typedef const my_node * const_node_ptr;
- static node_ptr get_next(const_node_ptr n) { return n->next_; }
- static void set_next(node_ptr n, node_ptr next) { n->next_ = next; }
-};
-
-int main()
-{
- typedef boost::intrusive::circular_slist_algorithms<my_slist_node_traits> algo;
- my_node one, two, three;
-
- //Create an empty singly linked list container:
- //"one" will be the first node of the container
- algo::init_header(&one);
- assert(algo::count(&one) == 1);
-
- //Now add a new node
- algo::link_after(&one, &two);
- assert(algo::count(&one) == 2);
-
- //Now add a new node after "one"
- algo::link_after(&one, &three);
- assert(algo::count(&one) == 3);
-
- //Now unlink the node after one
- algo::unlink_after(&one);
- assert(algo::count(&one) == 2);
-
- //Now unlink two
- algo::unlink(&two);
- assert(algo::count(&one) == 1);
-
- return 0;
-}
-//]

Deleted: sandbox/move/libs/intrusive/example/doc_splay_algorithms.cpp
==============================================================================
--- sandbox/move/libs/intrusive/example/doc_splay_algorithms.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,78 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2006-2009
-//
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-//[doc_splaytree_algorithms_code
-#include <boost/intrusive/splaytree_algorithms.hpp>
-#include <cassert>
-
-struct my_node
-{
- my_node(int i = 0)
- : int_(i)
- {}
- my_node *parent_, *left_, *right_;
- int color_;
- //other members
- int int_;
-};
-
-//Define our own splaytree_node_traits
-struct my_splaytree_node_traits
-{
- typedef my_node node;
- typedef my_node * node_ptr;
- typedef const my_node * const_node_ptr;
-
- static node_ptr get_parent(const_node_ptr n) { return n->parent_; }
- static void set_parent(node_ptr n, node_ptr parent){ n->parent_ = parent; }
- static node_ptr get_left(const_node_ptr n) { return n->left_; }
- static void set_left(node_ptr n, node_ptr left) { n->left_ = left; }
- static node_ptr get_right(const_node_ptr n) { return n->right_; }
- static void set_right(node_ptr n, node_ptr right) { n->right_ = right; }
-};
-
-struct node_ptr_compare
-{
- bool operator()(const my_node *a, const my_node *b)
- { return a->int_ < b->int_; }
-};
-
-int main()
-{
- typedef boost::intrusive::splaytree_algorithms<my_splaytree_node_traits> algo;
- my_node header, two(2), three(3);
-
- //Create an empty splaytree container:
- //"header" will be the header node of the tree
- algo::init_header(&header);
-
- //Now insert node "two" in the tree using the sorting functor
- algo::insert_equal_upper_bound(&header, &two, node_ptr_compare());
-
- //Now insert node "three" in the tree using the sorting functor
- algo::insert_equal_lower_bound(&header, &three, node_ptr_compare());
-
- //Now take the first node (the left node of the header)
- my_node *n = header.left_;
- assert(n == &two);
-
- //Now go to the next node
- n = algo::next_node(n);
- assert(n == &three);
-
- //Erase a node just using a pointer to it
- algo::unlink(&two);
-
- //Erase a node using also the header (faster)
- algo::erase(&header, &three);
- return 0;
-}
-//]

Deleted: sandbox/move/libs/intrusive/example/doc_splay_set.cpp
==============================================================================
--- sandbox/move/libs/intrusive/example/doc_splay_set.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,93 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2006-2009
-//
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-//[doc_splay_set_code
-#include <boost/intrusive/splay_set.hpp>
-#include <boost/intrusive/bs_set_hook.hpp>
-#include <vector>
-#include <algorithm>
-
-using namespace boost::intrusive;
-
-class MyClass
- : public splay_set_base_hook<> //This is an splay tree base hook
- , public bs_set_base_hook<> //This is a binary search tree base hook
-
-{
- int int_;
-
- public:
- //This is a member hook
- splay_set_member_hook<> member_hook_;
-
- MyClass(int i)
- : int_(i)
- {}
- friend bool operator< (const MyClass &a, const MyClass &b)
- { return a.int_ < b.int_; }
- friend bool operator> (const MyClass &a, const MyClass &b)
- { return a.int_ > b.int_; }
- friend bool operator== (const MyClass &a, const MyClass &b)
- { return a.int_ == b.int_; }
-};
-
-//Define a set using the base hook that will store values in reverse order
-typedef splay_set< MyClass, compare<std::greater<MyClass> > > BaseSplaySet;
-
-//Define a set using the binary search tree hook
-typedef splay_set< MyClass, base_hook<bs_set_base_hook<> > > BaseBsSplaySet;
-
-//Define an multiset using the member hook
-typedef member_hook<MyClass, splay_set_member_hook<>, &MyClass::member_hook_> MemberOption;
-typedef splay_multiset< MyClass, MemberOption> MemberSplayMultiset;
-
-int main()
-{
- typedef std::vector<MyClass>::iterator VectIt;
- typedef std::vector<MyClass>::reverse_iterator VectRit;
-
- //Create several MyClass objects, each one with a different value
- std::vector<MyClass> values;
- for(int i = 0; i < 100; ++i) values.push_back(MyClass(i));
-
- BaseSplaySet baseset;
- BaseBsSplaySet bsbaseset;
- MemberSplayMultiset membermultiset;
-
-
- //Insert values in the container
- for(VectIt it(values.begin()), itend(values.end()); it != itend; ++it){
- baseset.insert(*it);
- bsbaseset.insert(*it);
- membermultiset.insert(*it);
- }
-
- //Now test sets
- {
- BaseSplaySet::reverse_iterator rbit(baseset.rbegin()), rbitend(baseset.rend());
- BaseBsSplaySet::iterator bsit(bsbaseset.begin()), bsitend(bsbaseset.end());
- MemberSplayMultiset::iterator mit(membermultiset.begin()), mitend(membermultiset.end());
- VectIt it(values.begin()), itend(values.end());
-
- //Test the objects inserted in the base hook set
- for(; it != itend; ++it, ++rbit){
- if(&*rbit != &*it) return 1;
- }
-
- //Test the objects inserted in member and binary search hook sets
- for(it = values.begin(); it != itend; ++it, ++bsit, ++mit){
- if(&*bsit != &*it) return 1;
- if(&*mit != &*it) return 1;
- }
- }
- return 0;
-}
-//]

Deleted: sandbox/move/libs/intrusive/example/doc_splaytree_algorithms.cpp
==============================================================================
--- sandbox/move/libs/intrusive/example/doc_splaytree_algorithms.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,78 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2007-2009
-//
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-//[doc_splaytree_algorithms_code
-#include <boost/intrusive/splaytree_algorithms.hpp>
-#include <cassert>
-
-struct my_node
-{
- my_node(int i = 0)
- : int_(i)
- {}
- my_node *parent_, *left_, *right_;
- //other members
- int int_;
-};
-
-//Define our own splaytree_node_traits
-struct my_splaytree_node_traits
-{
- typedef my_node node;
- typedef my_node * node_ptr;
- typedef const my_node * const_node_ptr;
-
- static node_ptr get_parent(const_node_ptr n) { return n->parent_; }
- static void set_parent(node_ptr n, node_ptr parent){ n->parent_ = parent; }
- static node_ptr get_left(const_node_ptr n) { return n->left_; }
- static void set_left(node_ptr n, node_ptr left) { n->left_ = left; }
- static node_ptr get_right(const_node_ptr n) { return n->right_; }
- static void set_right(node_ptr n, node_ptr right) { n->right_ = right; }
-};
-
-struct node_ptr_compare
-{
- bool operator()(const my_node *a, const my_node *b)
- { return a->int_ < b->int_; }
-};
-
-int main()
-{
- typedef boost::intrusive::splaytree_algorithms<my_splaytree_node_traits> algo;
- my_node header, two(2), three(3);
-
- //Create an empty splaytree container:
- //"header" will be the header node of the tree
- algo::init_header(&header);
-
- //Now insert node "two" in the tree using the sorting functor
- algo::insert_equal_upper_bound(&header, &two, node_ptr_compare());
-
- //Now insert node "three" in the tree using the sorting functor
- algo::insert_equal_lower_bound(&header, &three, node_ptr_compare());
-
- //Now take the first node (the left node of the header)
- my_node *n = header.left_;
- assert(n == &two);
-
- //Now go to the next node
- n = algo::next_node(n);
- assert(n == &three);
-
- //Erase a node just using a pointer to it
- algo::unlink(&two);
-
- //Erase a node using also the header (faster)
- algo::erase(&header, &three);
- return 0;
-}
-
-//]

Deleted: sandbox/move/libs/intrusive/example/doc_stateful_value_traits.cpp
==============================================================================
--- sandbox/move/libs/intrusive/example/doc_stateful_value_traits.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,87 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2007-2009
-//
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-//[doc_stateful_value_traits
-#include <boost/intrusive/list.hpp>
-
-using namespace boost::intrusive;
-
-//This type is not modifiable so we can't store hooks or custom nodes
-typedef int identifier_t;
-
-//This value traits will associate elements from an array of identifiers with
-//elements of an array of nodes. The element i of the value array will use the
-//node i of the node array:
-struct stateful_value_traits
-{
- typedef list_node_traits<void*> node_traits;
- typedef node_traits::node node;
- typedef node * node_ptr;
- typedef const node * const_node_ptr;
- typedef identifier_t value_type;
- typedef identifier_t * pointer;
- typedef const identifier_t * const_pointer;
- static const link_mode_type link_mode = normal_link;
-
- stateful_value_traits(pointer ids, node_ptr node_array)
- : ids_(ids), nodes_(node_array)
- {}
-
- ///Note: non static functions!
- node_ptr to_node_ptr (value_type &value)
- { return this->nodes_ + (&value - this->ids_); }
- const_node_ptr to_node_ptr (const value_type &value) const
- { return this->nodes_ + (&value - this->ids_); }
- pointer to_value_ptr(node_ptr n)
- { return this->ids_ + (n - this->nodes_); }
- const_pointer to_value_ptr(const_node_ptr n) const
- { return this->ids_ + (n - this->nodes_); }
-
- private:
- pointer ids_;
- node_ptr nodes_;
-};
-
-int main()
-{
- const int NumElements = 100;
-
- //This is an array of ids that we want to "store"
- identifier_t ids [NumElements];
-
- //This is an array of nodes that is necessary to form the linked list
- list_node_traits<void*>::node nodes [NumElements];
-
- //Initialize id objects, each one with a different number
- for(int i = 0; i != NumElements; ++i) ids[i] = i;
-
- //Define a list that will "link" identifiers using external nodes
- typedef list<identifier_t, value_traits<stateful_value_traits> > List;
-
- //This list will store ids without modifying identifier_t instances
- //Stateful value traits must be explicitly passed in the constructor.
- List my_list (stateful_value_traits (ids, nodes));
-
- //Insert ids in reverse order in the list
- for(identifier_t * it(&ids[0]), *itend(&ids[NumElements]); it != itend; ++it)
- my_list.push_front(*it);
-
- //Now test lists
- List::const_iterator list_it (my_list.cbegin());
- identifier_t *it_val(&ids[NumElements-1]), *it_rbeg_val(&ids[0]-1);
-
- //Test the objects inserted in the base hook list
- for(; it_val != it_rbeg_val; --it_val, ++list_it)
- if(&*list_it != &*it_val) return 1;
-
- return 0;
-}
-//]

Deleted: sandbox/move/libs/intrusive/example/doc_treap_algorithms.cpp
==============================================================================
--- sandbox/move/libs/intrusive/example/doc_treap_algorithms.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,79 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2007-2009
-//
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-//[doc_treap_algorithms_code
-#include <boost/intrusive/treap_algorithms.hpp>
-#include <cassert>
-
-struct my_node
-{
- my_node(int i = 0, unsigned int priority = 0)
- : prio_(priority), int_(i)
- {}
- my_node *parent_, *left_, *right_;
- int prio_;
- //other members
- int int_;
-};
-
-//Define our own treap_node_traits
-struct my_treap_node_traits
-{
- typedef my_node node;
- typedef my_node * node_ptr;
- typedef const my_node * const_node_ptr;
-
- static node_ptr get_parent(const_node_ptr n) { return n->parent_; }
- static void set_parent(node_ptr n, node_ptr parent){ n->parent_ = parent; }
- static node_ptr get_left(const_node_ptr n) { return n->left_; }
- static void set_left(node_ptr n, node_ptr left) { n->left_ = left; }
- static node_ptr get_right(const_node_ptr n) { return n->right_; }
- static void set_right(node_ptr n, node_ptr right) { n->right_ = right; }
-};
-
-struct node_ptr_compare
-{ bool operator()(const my_node *a, const my_node *b) { return a->int_ < b->int_; } };
-
-struct node_ptr_priority
-{ bool operator()(const my_node *a, const my_node *b) { return a->prio_ < b->prio_;} };
-
-int main()
-{
- typedef boost::intrusive::treap_algorithms<my_treap_node_traits> algo;
- my_node header, two(2, 5), three(3, 1);
-
- //Create an empty treap container:
- //"header" will be the header node of the tree
- algo::init_header(&header);
-
- //Now insert node "two" in the tree using the sorting functor
- algo::insert_equal_upper_bound(&header, &two, node_ptr_compare(), node_ptr_priority());
-
- //Now insert node "three" in the tree using the sorting functor
- algo::insert_equal_lower_bound(&header, &three, node_ptr_compare(), node_ptr_priority());
-
- //Now take the first node (the left node of the header)
- my_node *n = header.left_;
- assert(n == &two);
-
- //Now go to the next node
- n = algo::next_node(n);
- assert(n == &three);
-
- //Erase a node just using a pointer to it
- algo::unlink(&two, node_ptr_priority());
-
- //Erase a node using also the header (faster)
- algo::erase(&header, &three, node_ptr_priority());
- return 0;
-}
-
-//]

Deleted: sandbox/move/libs/intrusive/example/doc_treap_set.cpp
==============================================================================
--- sandbox/move/libs/intrusive/example/doc_treap_set.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,106 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2006-2009
-//
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-//[doc_treap_set_code
-#include <boost/intrusive/treap_set.hpp>
-#include <vector>
-#include <algorithm>
-#include <cassert>
-
-using namespace boost::intrusive;
-
-class MyClass : public bs_set_base_hook<> //This is a base hook
-{
- int int_;
- unsigned int prio_;
-
- public:
- //This is a member hook
- bs_set_member_hook<> member_hook_;
-
- MyClass(int i, unsigned int prio) : int_(i), prio_(prio)
- {}
-
- unsigned int get_priority() const
- { return this->prio_; }
-
- //Less and greater operators
- friend bool operator< (const MyClass &a, const MyClass &b)
- { return a.int_ < b.int_; }
- friend bool operator> (const MyClass &a, const MyClass &b)
- { return a.int_ > b.int_; }
- //Default priority compare
- friend bool priority_order (const MyClass &a, const MyClass &b)
- { return a.prio_ < b.prio_; } //Lower value means higher priority
- //Inverse priority compare
- friend bool priority_inverse_order (const MyClass &a, const MyClass &b)
- { return a.prio_ > b.prio_; } //Higher value means higher priority
-};
-
-struct inverse_priority
-{
- bool operator()(const MyClass &a, const MyClass &b) const
- { return priority_inverse_order(a, b); }
-};
-
-
-//Define an treap_set using the base hook that will store values in reverse order
-typedef treap_set< MyClass, compare<std::greater<MyClass> > > BaseSet;
-
-//Define an multiset using the member hook that will store
-typedef member_hook<MyClass, bs_set_member_hook<>, &MyClass::member_hook_> MemberOption;
-typedef treap_multiset
- < MyClass, MemberOption, priority<inverse_priority> > MemberMultiset;
-
-int main()
-{
- typedef std::vector<MyClass>::iterator VectIt;
-
- //Create several MyClass objects, each one with a different value
- std::vector<MyClass> values;
- for(int i = 0; i < 100; ++i) values.push_back(MyClass(i, (i % 10)));
-
- BaseSet baseset;
- MemberMultiset membermultiset;
-
- //Now insert them in the sets
- for(VectIt it(values.begin()), itend(values.end()); it != itend; ++it){
- baseset.insert(*it);
- membermultiset.insert(*it);
- }
-
- //Now test treap_sets
- {
- BaseSet::reverse_iterator rbit(baseset.rbegin()), rbitend(baseset.rend());
- MemberMultiset::iterator mit(membermultiset.begin()), mitend(membermultiset.end());
- VectIt it(values.begin()), itend(values.end());
-
- //Test the objects inserted in the base hook treap_set
- for(; it != itend; ++it, ++rbit)
- if(&*rbit != &*it) return 1;
-
- //Test the objects inserted in the member hook treap_set
- for(it = values.begin(); it != itend; ++it, ++mit)
- if(&*mit != &*it) return 1;
-
- //Test priority order
- for(int i = 0; i < 100; ++i){
- if(baseset.top()->get_priority() != static_cast<unsigned int>(i/10))
- return 1;
- if(membermultiset.top()->get_priority() != 9u - static_cast<unsigned int>(i/10))
- return 1;
- baseset.erase(baseset.top());
- membermultiset.erase(membermultiset.top());
- }
- }
- return 0;
-}
-//]

Deleted: sandbox/move/libs/intrusive/example/doc_unordered_set.cpp
==============================================================================
--- sandbox/move/libs/intrusive/example/doc_unordered_set.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,94 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2006-2009
-//
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-//[doc_unordered_set_code
-#include <boost/intrusive/unordered_set.hpp>
-#include <vector>
-#include <algorithm>
-#include <boost/functional/hash.hpp>
-
-using namespace boost::intrusive;
-
-class MyClass : public unordered_set_base_hook<>
-{ //This is a derivation hook
- int int_;
-
- public:
- unordered_set_member_hook<> member_hook_; //This is a member hook
-
- MyClass(int i)
- : int_(i)
- {}
-
- friend bool operator== (const MyClass &a, const MyClass &b)
- { return a.int_ == b.int_; }
-
- friend std::size_t hash_value(const MyClass &value)
- { return std::size_t(value.int_); }
-};
-
-//Define an unordered_set that will store MyClass objects using the base hook
-typedef unordered_set<MyClass> BaseSet;
-
-//Define an unordered_multiset that will store MyClass using the member hook
-typedef member_hook<MyClass, unordered_set_member_hook<>, &MyClass::member_hook_>
- MemberOption;
-typedef unordered_multiset< MyClass, MemberOption> MemberMultiSet;
-
-int main()
-{
- typedef std::vector<MyClass>::iterator VectIt;
- typedef std::vector<MyClass>::reverse_iterator VectRit;
-
- //Create a vector with 100 different MyClass objects
- std::vector<MyClass> values;
- for(int i = 0; i < 100; ++i) values.push_back(MyClass(i));
-
- //Create a copy of the vector
- std::vector<MyClass> values2(values);
-
- //Create a bucket array for base_set
- BaseSet::bucket_type base_buckets[100];
-
- //Create a bucket array for member_multi_set
- MemberMultiSet::bucket_type member_buckets[200];
-
- //Create unordered containers taking buckets as arguments
- BaseSet base_set(BaseSet::bucket_traits(base_buckets, 100));
- MemberMultiSet member_multi_set
- (MemberMultiSet::bucket_traits(member_buckets, 200));
-
- //Now insert values's elements in the unordered_set
- for(VectIt it(values.begin()), itend(values.end()); it != itend; ++it)
- base_set.insert(*it);
-
- //Now insert values's and values2's elements in the unordered_multiset
- for(VectIt it(values.begin()), itend(values.end()),
- it2(values2.begin()),itend2(values2.end())
- ; it != itend; ++it, ++it2){
- member_multi_set.insert(*it);
- member_multi_set.insert(*it2);
- }
-
- //Now find every element
- {
- VectIt it(values.begin()), itend(values.end());
-
- for(; it != itend; ++it){
- //base_set should contain one element for each key
- if(base_set.count(*it) != 1) return 1;
- //member_multi_set should contain two elements for each key
- if(member_multi_set.count(*it) != 2) return 1;
- }
- }
- return 0;
-}
-//]

Deleted: sandbox/move/libs/intrusive/example/doc_value_traits.cpp
==============================================================================
--- sandbox/move/libs/intrusive/example/doc_value_traits.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,103 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2006-2009
-//
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-//[doc_value_traits_code_legacy
-#include <boost/intrusive/link_mode.hpp>
-#include <boost/intrusive/list.hpp>
-#include <boost/intrusive/slist.hpp>
-#include <vector>
-
-//This node is the legacy type we can't modify and we want to insert in
-//intrusive list and slist containers using only two pointers, since
-//we know the object will never be at the same time in both lists.
-struct legacy_value
-{
- legacy_value *prev_;
- legacy_value *next_;
- int id_;
-};
-//]
-
-//[doc_value_traits_value_traits
-//Define our own NodeTraits that will configure singly and doubly linked
-//list algorithms. Note that this node traits is compatible with
-//circular_slist_algorithms and circular_list_algorithms.
-
-namespace bi = boost::intrusive;
-
-struct legacy_node_traits
-{
- typedef legacy_value node;
- typedef legacy_value * node_ptr;
- typedef const legacy_value * const_node_ptr;
-
- static node *get_next(const node *n) { return n->next_; }
- static void set_next(node *n, node *next) { n->next_ = next; }
- static node *get_previous(const node *n) { return n->prev_; }
- static void set_previous(node *n, node *prev) { n->prev_ = prev; }
-};
-
-//This ValueTraits will configure list and slist. In this case,
-//legacy_node_traits::node is the same as the
-//legacy_value_traits::value_type so to_node_ptr/to_value_ptr
-//functions are trivial.
-struct legacy_value_traits
-{
- typedef legacy_node_traits node_traits;
- typedef node_traits::node_ptr node_ptr;
- typedef node_traits::const_node_ptr const_node_ptr;
- typedef legacy_value value_type;
- typedef legacy_value * pointer;
- typedef const legacy_value * const_pointer;
- static const bi::link_mode_type link_mode = bi::normal_link;
- static node_ptr to_node_ptr (value_type &value) { return node_ptr(&value); }
- static const_node_ptr to_node_ptr (const value_type &value) { return const_node_ptr(&value); }
- static pointer to_value_ptr(node_ptr n) { return pointer(n); }
- static const_pointer to_value_ptr(const_node_ptr n) { return const_pointer(n); }
-};
-
-//]
-
-//[doc_value_traits_test
-//Now define an intrusive list and slist that will store legacy_value objects
-typedef bi::value_traits<legacy_value_traits> ValueTraitsOption;
-typedef bi::list<legacy_value, ValueTraitsOption> LegacyAbiList;
-typedef bi::slist<legacy_value, ValueTraitsOption> LegacyAbiSlist;
-
-template<class List>
-bool test_list()
-{
- typedef std::vector<legacy_value> Vect;
-
- //Create legacy_value objects, with a different internal number
- Vect legacy_vector;
- for(int i = 0; i < 100; ++i){
- legacy_value value; value.id_ = i; legacy_vector.push_back(value);
- }
-
- //Create the list with the objects
- List mylist(legacy_vector.begin(), legacy_vector.end());
-
- //Now test both lists
- typename List::const_iterator bit(mylist.begin()), bitend(mylist.end());
- typename Vect::const_iterator it(legacy_vector.begin()), itend(legacy_vector.end());
-
- //Test the objects inserted in our list
- for(; it != itend; ++it, ++bit)
- if(&*bit != &*it) return false;
- return true;
-}
-
-int main()
-{
- return test_list<LegacyAbiList>() && test_list<LegacyAbiSlist>() ? 0 : 1;
-}
-//]

Deleted: sandbox/move/libs/intrusive/example/doc_window.cpp
==============================================================================
--- sandbox/move/libs/intrusive/example/doc_window.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,83 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2006-2009
-//
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-//[doc_window_code
-#include <boost/intrusive/list.hpp>
-
-using namespace boost::intrusive;
-
-//An abstract class that can be inserted in an intrusive list
-class Window : public list_base_hook<>
-{
- public:
- //This is a container those value is an abstract class: you can't do this with std::list.
- typedef list<Window> win_list;
-
- //A static intrusive list declaration
- static win_list all_windows;
-
- //Constructor. Includes this window in the list
- Window() { all_windows.push_back(*this); }
- //Destructor. Removes this node from the list
- virtual ~Window() { all_windows.erase(win_list::s_iterator_to(*this)); }
- //Pure virtual function to be implemented by derived classes
- virtual void Paint() = 0;
-};
-
-//The static intrusive list declaration
-Window::win_list Window::all_windows;
-
-//Some Window derived classes
-class FrameWindow : public Window
-{ void Paint(){/**/} };
-
-class EditWindow : public Window
-{ void Paint(){/**/} };
-
-class CanvasWindow : public Window
-{ void Paint(){/**/} };
-
-//A function that prints all windows stored in the intrusive list
-void paint_all_windows()
-{
- for(Window::win_list::iterator i(Window::all_windows.begin())
- , e(Window::all_windows.end())
- ; i != e; ++i)
- i->Paint();
-}
-
-//...
-
-//A class derived from Window
-class MainWindow : public Window
-{
- FrameWindow frame_; //these are derived from Window too
- EditWindow edit_;
- CanvasWindow canvas_;
-
- public:
- void Paint(){/**/}
- //...
-};
-
-//Main function
-int main()
-{
- //When a Window class is created, is automatically registered in the global list
- MainWindow window;
-
- //Paint all the windows, sub-windows and so on
- paint_all_windows();
-
- //All the windows are automatically unregistered in their destructors.
- return 0;
-}
-//]

Deleted: sandbox/move/libs/intrusive/index.html
==============================================================================
--- sandbox/move/libs/intrusive/index.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,14 +0,0 @@
-
-<html>
-<head>
- <meta http-equiv="refresh" content="0; URL=../../doc/html/intrusive.html">
-</head>
-<body>
-Automatic redirection failed, please go to
-../../doc/html/intrusive.html
-</body>
-</html>

Deleted: sandbox/move/libs/intrusive/module.cmake
==============================================================================
--- sandbox/move/libs/intrusive/module.cmake 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1 +0,0 @@
-boost_module(intrusive DEPENDS utility)
\ No newline at end of file

Deleted: sandbox/move/libs/intrusive/perf/Jamfile.v2
==============================================================================
--- sandbox/move/libs/intrusive/perf/Jamfile.v2 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,34 +0,0 @@
-# Boost Intrusive Library Performance test Jamfile
-
-# (C) Copyright Ion Gaztanaga 2006-2007.
-# Use, modification and distribution are subject to the
-# Boost Software License, Version 1.0. (See accompanying file
-# LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-
-# Adapted from John Maddock's TR1 Jamfile.v2
-# Copyright John Maddock 2005.
-# Use, modification and distribution are subject to the
-# Boost Software License, Version 1.0. (See accompanying file
-# LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-
-# this rule enumerates through all the sources and invokes
-# the run rule for each source, the result is a list of all
-# the run rules, which we can pass on to the test_suite rule:
-
-rule test_all
-{
- local all_rules = ;
-
- for local fileb in [ glob *.cpp ]
- {
- all_rules += [ run $(fileb)
- : # additional args
- : # test-files
- : # requirements
- ] ;
- }
-
- return $(all_rules) ;
-}
-
-test-suite intrusive_perf : [ test_all r ] ;
\ No newline at end of file

Deleted: sandbox/move/libs/intrusive/perf/perf_list.cpp
==============================================================================
--- sandbox/move/libs/intrusive/perf/perf_list.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,550 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2007-2009
-//
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-
-//Includes for tests
-#include <boost/intrusive/detail/config_begin.hpp>
-#include <boost/config.hpp>
-#include <list>
-#include <functional>
-#include <iostream>
-#include <boost/intrusive/list.hpp>
-#include <boost/date_time/posix_time/posix_time.hpp>
-
-using namespace boost::posix_time;
-
-//[perf_list_value_type
-//Iteration and element count defines
-const int NumIter = 100;
-const int NumElements = 50000;
-
-using namespace boost::intrusive;
-
-template<bool BigSize> struct filler { int dummy[10]; };
-template <> struct filler<false> {};
-
-template<bool BigSize> //The object for non-intrusive containers
-struct test_class : private filler<BigSize>
-{
- int i_;
- test_class() {}
- test_class(int i) : i_(i) {}
- friend bool operator <(const test_class &l, const test_class &r) { return l.i_ < r.i_; }
- friend bool operator >(const test_class &l, const test_class &r) { return l.i_ > r.i_; }
-};
-
-template <bool BigSize, link_mode_type LinkMode>
-struct itest_class //The object for intrusive containers
- : public list_base_hook<link_mode<LinkMode> >, public test_class<BigSize>
-{
- itest_class() {}
- itest_class(int i) : test_class<BigSize>(i) {}
-};
-
-template<class FuncObj> //Adapts functors taking values to functors taking pointers
-struct func_ptr_adaptor : public FuncObj
-{
- typedef typename FuncObj::first_argument_type* first_argument_type;
- typedef typename FuncObj::second_argument_type* second_argument_type;
- typedef typename FuncObj::result_type result_type;
- result_type operator()(first_argument_type a, second_argument_type b) const
- { return FuncObj::operator()(*a, *b); }
-};
-//]
-
-template <bool BigSize, link_mode_type LinkMode>
-struct get_ilist //Helps to define an intrusive list from a policy
-{
- typedef list<itest_class<BigSize, LinkMode>, constant_time_size<false> > type;
-};
-
-template <bool BigSize> //Helps to define an std list
-struct get_list { typedef std::list<test_class<BigSize> > type; };
-
-template <bool BigSize> //Helps to define an std pointer list
-struct get_ptrlist { typedef std::list<test_class<BigSize>*> type; };
-
-////////////////////////////////////////////////////////////////////////
-//
-// PUSH_BACK
-//
-////////////////////////////////////////////////////////////////////////
-
-template <bool BigSize, link_mode_type LinkMode>
-void test_intrusive_list_push_back()
-{
- typedef typename get_ilist<BigSize, LinkMode>::type ilist;
- ptime tini = microsec_clock::universal_time();
- for(int i = 0; i < NumIter; ++i){
- //First create the elements and insert them in the intrusive list
- //[perf_list_push_back_intrusive
- std::vector<typename ilist::value_type> objects(NumElements);
- ilist l;
- for(int i = 0; i < NumElements; ++i)
- l.push_back(objects[i]);
- //Elements are unlinked in ilist's destructor
- //Elements are destroyed in vector's destructor
- //]
- }
- ptime tend = microsec_clock::universal_time();
- std::cout << "link_mode: " << LinkMode << ", usecs/iteration: "
- << (tend-tini).total_microseconds()/NumIter << std::endl;
-}
-
-template <bool BigSize>
-void test_std_list_push_back()
-{
- typedef typename get_list<BigSize>::type stdlist;
- ptime tini = microsec_clock::universal_time();
- for(int i = 0; i < NumIter; ++i){
- //Now create the std list and insert
- //[perf_list_push_back_stdlist
- stdlist l;
- for(int i = 0; i < NumElements; ++i)
- l.push_back(typename stdlist::value_type(i));
- //Elements unlinked and destroyed in stdlist's destructor
- //]
- }
- ptime tend = microsec_clock::universal_time();
- std::cout << "std::list usecs/iteration: "
- << (tend-tini).total_microseconds()/NumIter << std::endl;
-}
-
-template <bool BigSize>
-void test_compact_std_ptrlist_push_back()
-{
- typedef typename get_list<BigSize>::type stdlist;
- typedef typename get_ptrlist<BigSize>::type stdptrlist;
- //Now measure insertion time, including element creation
- ptime tini = microsec_clock::universal_time();
- for(int i = 0; i < NumIter; ++i){
- //Create elements and insert their pointer in the list
- //[perf_list_push_back_stdptrlist
- std::vector<typename stdlist::value_type> objects(NumElements);
- stdptrlist l;
- for(int i = 0; i < NumElements; ++i)
- l.push_back(&objects[i]);
- //Pointers to elements unlinked and destroyed in stdptrlist's destructor
- //Elements destroyed in vector's destructor
- //]
- }
- ptime tend = microsec_clock::universal_time();
- std::cout << "compact std::list usecs/iteration: "
- << (tend-tini).total_microseconds()/NumIter << std::endl;
-}
-
-template <bool BigSize>
-void test_disperse_std_ptrlist_push_back()
-{
- typedef typename get_list<BigSize>::type stdlist;
- typedef typename get_ptrlist<BigSize>::type stdptrlist;
- //Now measure insertion time, including element creation
- ptime tini = microsec_clock::universal_time();
- for(int i = 0; i < NumIter; ++i){
- //Create elements and insert their pointer in the list
- //[perf_list_push_back_disperse_stdptrlist
- stdlist objects; stdptrlist l;
- for(int i = 0; i < NumElements; ++i){
- objects.push_back(typename stdlist::value_type(i));
- l.push_back(&objects.back());
- }
- //Pointers to elements unlinked and destroyed in stdptrlist's destructor
- //Elements unlinked and destroyed in stdlist's destructor
- //]
- }
- ptime tend = microsec_clock::universal_time();
- std::cout << "disperse std::list usecs/iteration: "
- << (tend-tini).total_microseconds()/NumIter << std::endl;
-}
-
-////////////////////////////////////////////////////////////////////////
-//
-// REVERSE
-//
-////////////////////////////////////////////////////////////////////////
-
-//[perf_list_reverse
-template <bool BigSize, link_mode_type LinkMode>
-void test_intrusive_list_reverse()
-{
- typedef typename get_ilist<BigSize, LinkMode>::type ilist;
- //First create the elements
- std::vector<typename ilist::value_type> objects(NumElements);
-
- //Now create the intrusive list and insert data
- ilist l(objects.begin(), objects.end());
-
- //Now measure sorting time
- ptime tini = microsec_clock::universal_time();
- for(int i = 0; i < NumIter; ++i){
- l.reverse();
- }
- ptime tend = microsec_clock::universal_time();
- std::cout << "link_mode: " << LinkMode << ", usecs/iteration: "
- << (tend-tini).total_microseconds()/NumIter << std::endl;
-}
-
-template <bool BigSize>
-void test_std_list_reverse()
-{
- typedef typename get_list<BigSize>::type stdlist;
-
- //Create the list and insert values
- stdlist l;
- for(int i = 0; i < NumElements; ++i)
- l.push_back(typename stdlist::value_type());
-
- //Now measure sorting time
- ptime tini = microsec_clock::universal_time();
- for(int i = 0; i < NumIter; ++i){
- l.reverse();
- }
- ptime tend = microsec_clock::universal_time();
- std::cout << "std::list usecs/iteration: "
- << (tend-tini).total_microseconds()/NumIter << std::endl;
-}
-
-template <bool BigSize>
-void test_compact_std_ptrlist_reverse()
-{
- typedef typename get_list<BigSize>::type stdlist;
- typedef typename get_ptrlist<BigSize>::type stdptrlist;
-
- //First create the elements
- std::vector<typename stdlist::value_type> objects(NumElements);
-
- //Now create the std list and insert
- stdptrlist l;
- for(int i = 0; i < NumElements; ++i)
- l.push_back(&objects[i]);
-
- //Now measure sorting time
- ptime tini = microsec_clock::universal_time();
- for(int i = 0; i < NumIter; ++i){
- l.reverse();
- }
- ptime tend = microsec_clock::universal_time();
- std::cout << "compact std::list usecs/iteration: "
- << (tend-tini).total_microseconds()/NumIter << std::endl;
-}
-
-template <bool BigSize>
-void test_disperse_std_ptrlist_reverse()
-{
- typedef typename get_list<BigSize>::type stdlist;
- typedef typename get_ptrlist<BigSize>::type stdptrlist;
-
- //First create the elements
- std::list<typename stdlist::value_type> objects;
- //Now create the std list and insert
- stdptrlist l;
- for(int i = 0; i < NumElements; ++i){
- objects.push_back(typename stdlist::value_type());
- l.push_back(&objects.back());
- }
-
- //Now measure sorting time
- ptime tini = microsec_clock::universal_time();
- for(int i = 0; i < NumIter; ++i){
- l.reverse();
- }
- ptime tend = microsec_clock::universal_time();
- std::cout << "disperse std::list usecs/iteration: "
- << (tend-tini).total_microseconds()/NumIter << std::endl;
-}
-//]
-
-////////////////////////////////////////////////////////////////////////
-//
-// SORT
-//
-////////////////////////////////////////////////////////////////////////
-
-//[perf_list_sort
-template <bool BigSize, link_mode_type LinkMode>
-void test_intrusive_list_sort()
-{
- typedef typename get_ilist<BigSize, LinkMode>::type ilist;
-
- //First create the elements
- std::vector<typename ilist::value_type> objects(NumElements);
- for(int i = 0; i < NumElements; ++i)
- objects[i].i_ = i;
-
- //Now create the intrusive list and insert data
- ilist l(objects.begin(), objects.end());
-
- //Now measure sorting time
- ptime tini = microsec_clock::universal_time();
- for(int i = 0; i < NumIter; ++i){
- if(!(i % 2)){
- l.sort(std::greater<typename ilist::value_type>());
- }
- else{
- l.sort(std::less<typename ilist::value_type>());
- }
- }
- ptime tend = microsec_clock::universal_time();
- std::cout << "link_mode: " << LinkMode << ", usecs/iteration: "
- << (tend-tini).total_microseconds()/NumIter << std::endl;
-}
-
-template <bool BigSize>
-void test_std_list_sort()
-{
- typedef typename get_list<BigSize>::type stdlist;
-
- //Create the list and insert values
- stdlist l;
- for(int i = 0; i < NumElements; ++i)
- l.push_back(typename stdlist::value_type(i));
-
- //Now measure sorting time
- ptime tini = microsec_clock::universal_time();
- for(int i = 0; i < NumIter; ++i){
- if(!(i % 2)){
- l.sort(std::greater<typename stdlist::value_type>());
- }
- else{
- l.sort(std::less<typename stdlist::value_type>());
- }
- }
- ptime tend = microsec_clock::universal_time();
- std::cout << "std::list usecs/iteration: "
- << (tend-tini).total_microseconds()/NumIter << std::endl;
-}
-
-template <bool BigSize>
-void test_compact_std_ptrlist_sort()
-{
- typedef typename get_list<BigSize>::type stdlist;
- typedef typename get_ptrlist<BigSize>::type stdptrlist;
-
- //First create the elements
- std::vector<typename stdlist::value_type> objects(NumElements);
- for(int i = 0; i < NumElements; ++i)
- objects[i].i_ = i;
- //Now create the std list and insert
- stdptrlist l;
- for(int i = 0; i < NumElements; ++i)
- l.push_back(&objects[i]);
-
- //Now measure sorting time
- ptime tini = microsec_clock::universal_time();
- for(int i = 0; i < NumIter; ++i){
- if(!(i % 2)){
- l.sort(func_ptr_adaptor<std::greater<typename stdlist::value_type> >());
- }
- else{
- l.sort(func_ptr_adaptor<std::less<typename stdlist::value_type> >());
- }
- }
- ptime tend = microsec_clock::universal_time();
- std::cout << "compact std::list usecs/iteration: "
- << (tend-tini).total_microseconds()/NumIter << std::endl;
-}
-
-template <bool BigSize>
-void test_disperse_std_ptrlist_sort()
-{
- typedef typename get_list<BigSize>::type stdlist;
- typedef typename get_ptrlist<BigSize>::type stdptrlist;
-
- //First create the elements and the list
- std::list<typename stdlist::value_type> objects;
- stdptrlist l;
- for(int i = 0; i < NumElements; ++i){
- objects.push_back(typename stdlist::value_type(i));
- l.push_back(&objects.back());
- }
-
- //Now measure sorting time
- ptime tini = microsec_clock::universal_time();
- for(int i = 0; i < NumIter; ++i){
- if(!(i % 2)){
- l.sort(func_ptr_adaptor<std::greater<typename stdlist::value_type> >());
- }
- else{
- l.sort(func_ptr_adaptor<std::less<typename stdlist::value_type> >());
- }
- }
- ptime tend = microsec_clock::universal_time();
- std::cout << "disperse std::list usecs/iteration: "
- << (tend-tini).total_microseconds()/NumIter << std::endl;
-}
-//]
-
-////////////////////////////////////////////////////////////////////////
-//
-// WRITE ACCESS
-//
-////////////////////////////////////////////////////////////////////////
-//[perf_list_write_access
-template <bool BigSize, link_mode_type LinkMode>
-void test_intrusive_list_write_access()
-{
- typedef typename get_ilist<BigSize, LinkMode>::type ilist;
-
- //First create the elements
- std::vector<typename ilist::value_type> objects(NumElements);
- for(int i = 0; i < NumElements; ++i){
- objects[i].i_ = i;
- }
-
- //Now create the intrusive list and insert data
- ilist l(objects.begin(), objects.end());
-
- //Now measure access time to the value type
- ptime tini = microsec_clock::universal_time();
- for(int i = 0; i < NumIter; ++i){
- typename ilist::iterator it(l.begin()), end(l.end());
- for(; it != end; ++it){
- ++(it->i_);
- }
- }
- ptime tend = microsec_clock::universal_time();
- std::cout << "link_mode: " << LinkMode << ", usecs/iteration: "
- << (tend-tini).total_microseconds()/NumIter << std::endl;
-}
-
-template <bool BigSize>
-void test_std_list_write_access()
-{
- typedef typename get_list<BigSize>::type stdlist;
-
- //Create the list and insert values
- stdlist l;
- for(int i = 0; i < NumElements; ++i)
- l.push_back(typename stdlist::value_type(i));
-
- //Now measure access time to the value type
- ptime tini = microsec_clock::universal_time();
- for(int i = 0; i < NumIter; ++i){
- typename stdlist::iterator it(l.begin()), end(l.end());
- for(; it != end; ++it){
- ++(it->i_);
- }
- }
- ptime tend = microsec_clock::universal_time();
- std::cout << "std::list usecs/iteration: "
- << (tend-tini).total_microseconds()/NumIter << std::endl;
-}
-
-template <bool BigSize>
-void test_compact_std_ptrlist_write_access()
-{
- typedef typename get_list<BigSize>::type stdlist;
- typedef typename get_ptrlist<BigSize>::type stdptrlist;
-
- //First create the elements
- std::vector<typename stdlist::value_type> objects(NumElements);
- for(int i = 0; i < NumElements; ++i){
- objects[i].i_ = i;
- }
-
- //Now create the std list and insert
- stdptrlist l;
- for(int i = 0; i < NumElements; ++i)
- l.push_back(&objects[i]);
-
- //Now measure access time to the value type
- ptime tini = microsec_clock::universal_time();
- for(int i = 0; i < NumIter; ++i){
- typename stdptrlist::iterator it(l.begin()), end(l.end());
- for(; it != end; ++it){
- ++((*it)->i_);
- }
- }
- ptime tend = microsec_clock::universal_time();
- std::cout << "compact std::list usecs/iteration: "
- << (tend-tini).total_microseconds()/NumIter << std::endl;
-}
-
-template <bool BigSize>
-void test_disperse_std_ptrlist_write_access()
-{
- typedef typename get_list<BigSize>::type stdlist;
- typedef typename get_ptrlist<BigSize>::type stdptrlist;
-
- //First create the elements
- std::list<typename stdlist::value_type> objects;
- //Now create the std list and insert
- stdptrlist l;
- for(int i = 0; i < NumElements; ++i){
- objects.push_back(typename stdlist::value_type(i));
- l.push_back(&objects.back());
- }
-
- //Now measure access time to the value type
- ptime tini = microsec_clock::universal_time();
- for(int i = 0; i < NumIter; ++i){
- typename stdptrlist::iterator it(l.begin()), end(l.end());
- for(; it != end; ++it){
- ++((*it)->i_);
- }
- }
- ptime tend = microsec_clock::universal_time();
- std::cout << "disperse std::list usecs/iteration: "
- << (tend-tini).total_microseconds()/NumIter << std::endl;
-}
-//]
-
-////////////////////////////////////////////////////////////////////////
-//
-// ALL TESTS
-//
-////////////////////////////////////////////////////////////////////////
-template<bool BigSize>
-void do_all_tests()
-{
- std::cout << "\n\nTesting push back() with BigSize:" << BigSize << std::endl;
- test_intrusive_list_push_back<BigSize, normal_link>();
- test_intrusive_list_push_back<BigSize, safe_link>();
- test_intrusive_list_push_back<BigSize, auto_unlink>();
- test_std_list_push_back<BigSize> ();
- test_compact_std_ptrlist_push_back<BigSize>();
- test_disperse_std_ptrlist_push_back<BigSize>();
- //reverse
- std::cout << "\n\nTesting reverse() with BigSize:" << BigSize << std::endl;
- test_intrusive_list_reverse<BigSize, normal_link>();
- test_intrusive_list_reverse<BigSize, safe_link>();
- test_intrusive_list_reverse<BigSize, auto_unlink>();
- test_std_list_reverse<BigSize>();
- test_compact_std_ptrlist_reverse<BigSize>();
- test_disperse_std_ptrlist_reverse<BigSize>();
- //sort
- std::cout << "\n\nTesting sort() with BigSize:" << BigSize << std::endl;
- test_intrusive_list_sort<BigSize, normal_link>();
- test_intrusive_list_sort<BigSize, safe_link>();
- test_intrusive_list_sort<BigSize, auto_unlink>();
- test_std_list_sort<BigSize>();
- test_compact_std_ptrlist_sort<BigSize>();
- test_disperse_std_ptrlist_sort<BigSize>();
- //write_access
- std::cout << "\n\nTesting write_access() with BigSize:" << BigSize << std::endl;
- test_intrusive_list_write_access<BigSize, normal_link>();
- test_intrusive_list_write_access<BigSize, safe_link>();
- test_intrusive_list_write_access<BigSize, auto_unlink>();
- test_std_list_write_access<BigSize>();
- test_compact_std_ptrlist_write_access<BigSize>();
- test_disperse_std_ptrlist_write_access<BigSize>();
-}
-
-int main()
-{
- //First pass the tests with a small size class
- do_all_tests<false>();
- //Now pass the tests with a big size class
- do_all_tests<true>();
- return 0;
-}
-
-#include <boost/intrusive/detail/config_end.hpp>

Deleted: sandbox/move/libs/intrusive/proj/vc7ide/Intrusive.sln
==============================================================================
--- sandbox/move/libs/intrusive/proj/vc7ide/Intrusive.sln 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,197 +0,0 @@
-Microsoft Visual Studio Solution File, Format Version 8.00
-Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "list", "list\list.vcproj", "{977B61B4-9968-497C-9F0B-24A8145473B8}"
- ProjectSection(ProjectDependencies) = postProject
- EndProjectSection
-EndProject
-Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "slist", "slist\slist.vcproj", "{5A02061D-3728-4C49-AFC8-0130C1F161C0}"
- ProjectSection(ProjectDependencies) = postProject
- EndProjectSection
-EndProject
-Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "multiset", "multiset\multiset.vcproj", "{961F0E06-C092-4AF7-ABC5-2A49999F3B79}"
- ProjectSection(ProjectDependencies) = postProject
- EndProjectSection
-EndProject
-Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "_intrusivelib", "_intrusivelib\_intrusivelib.vcproj", "{90F3C5BD-8E6C-4629-BC71-A1009EC88059}"
- ProjectSection(ProjectDependencies) = postProject
- EndProjectSection
-EndProject
-Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "set", "set\set.vcproj", "{960E01F6-92C1-F74A-BCA5-2A9F3B994979}"
- ProjectSection(ProjectDependencies) = postProject
- EndProjectSection
-EndProject
-Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "unordered_set", "unordered_set\unordered_set.vcproj", "{90E701E6-2C91-F4A7-BA6C-A9F3B0949279}"
- ProjectSection(ProjectDependencies) = postProject
- EndProjectSection
-EndProject
-Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "unordered_multiset", "unordered_multiset\unordered_multiset.vcproj", "{9101EE76-BB6C-2C91-F4B7-A9F3B9490279}"
- ProjectSection(ProjectDependencies) = postProject
- EndProjectSection
-EndProject
-Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "perf_test", "perf_test\perf_test.vcproj", "{910E70E6-2C91-AA67-BF4C-A9C74A309927}"
- ProjectSection(ProjectDependencies) = postProject
- EndProjectSection
-EndProject
-Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "default_hook", "default_hook\default_hook.vcproj", "{761A79B4-9968-CB81-F02B-2A4497345475}"
- ProjectSection(ProjectDependencies) = postProject
- EndProjectSection
-EndProject
-Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "stateful_value_traits", "stateful_value_traits\stateful_value_traits.vcproj", "{9571A7B4-9968-B9C1-17FB-134547B46975}"
- ProjectSection(ProjectDependencies) = postProject
- EndProjectSection
-EndProject
-Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "virtual_base", "virtual_base\virtual_base.vcproj", "{3579B1A4-9894-02AB-CB81-297B46154345}"
- ProjectSection(ProjectDependencies) = postProject
- EndProjectSection
-EndProject
-Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "make_functions", "make_functions\make_functions.vcproj", "{7679B41B-F2B4-9176-CB81-35449467B435}"
- ProjectSection(ProjectDependencies) = postProject
- EndProjectSection
-EndProject
-Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "custom_bucket_traits", "custom_bucket_traits\custom_bucket_traits.vcproj", "{31C77B84-0B2C-9481-CB81-27A149F33825}"
- ProjectSection(ProjectDependencies) = postProject
- EndProjectSection
-EndProject
-Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "external_value_traits", "external_value_traits\external_value_traits.vcproj", "{97B69A72-B9D3-7389-17FB-74612F4A9543}"
- ProjectSection(ProjectDependencies) = postProject
- EndProjectSection
-EndProject
-Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "splay_multiset", "splay_multiset\splay_multiset.vcproj", "{01E70176-B6C5-BF47-2C91-A949077BA323}"
- ProjectSection(ProjectDependencies) = postProject
- EndProjectSection
-EndProject
-Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "splay_set", "splay_set\splay_set.vcproj", "{1E6909E7-C971-F24A-6C7B-A92094B71B59}"
- ProjectSection(ProjectDependencies) = postProject
- EndProjectSection
-EndProject
-Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "avl_multiset", "avl_multiset\avl_multiset.vcproj", "{0AE70176-5B8C-4BC7-392C-A4A312B07893}"
- ProjectSection(ProjectDependencies) = postProject
- EndProjectSection
-EndProject
-Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "avl_set", "avl_set\avl_set.vcproj", "{16909EE7-24AF-97C1-C76B-204B971BA959}"
- ProjectSection(ProjectDependencies) = postProject
- EndProjectSection
-EndProject
-Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "sg_multiset", "sg_multiset\sg_multiset.vcproj", "{07022E76-6CB5-92C1-B47F-A10772A79B43}"
- ProjectSection(ProjectDependencies) = postProject
- EndProjectSection
-EndProject
-Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "sg_set", "sg_set\sg_set.vcproj", "{1690A9E7-DB57-971C-F24A-09B752A942F7}"
- ProjectSection(ProjectDependencies) = postProject
- EndProjectSection
-EndProject
-Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "any_hook", "any_test\any_test.vcproj", "{97B61B24-4C97-9681-50BF-243175A813B6}"
- ProjectSection(ProjectDependencies) = postProject
- EndProjectSection
-EndProject
-Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "treap_set", "treap_set\treap_set.vcproj", "{1E09E697-4A2F-BC76-7C91-2BA479B29159}"
- ProjectSection(ProjectDependencies) = postProject
- EndProjectSection
-EndProject
-Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "treap_multiset", "treap_multiset\treap_multiset.vcproj", "{16E09E95-F4A2-C971-BC76-9BA407191C59}"
- ProjectSection(ProjectDependencies) = postProject
- EndProjectSection
-EndProject
-Global
- GlobalSection(SolutionConfiguration) = preSolution
- Debug = Debug
- Release = Release
- EndGlobalSection
- GlobalSection(ProjectConfiguration) = postSolution
- {977B61B4-9968-497C-9F0B-24A8145473B8}.Debug.ActiveCfg = Debug|Win32
- {977B61B4-9968-497C-9F0B-24A8145473B8}.Debug.Build.0 = Debug|Win32
- {977B61B4-9968-497C-9F0B-24A8145473B8}.Release.ActiveCfg = Release|Win32
- {977B61B4-9968-497C-9F0B-24A8145473B8}.Release.Build.0 = Release|Win32
- {5A02061D-3728-4C49-AFC8-0130C1F161C0}.Debug.ActiveCfg = Debug|Win32
- {5A02061D-3728-4C49-AFC8-0130C1F161C0}.Debug.Build.0 = Debug|Win32
- {5A02061D-3728-4C49-AFC8-0130C1F161C0}.Release.ActiveCfg = Release|Win32
- {5A02061D-3728-4C49-AFC8-0130C1F161C0}.Release.Build.0 = Release|Win32
- {961F0E06-C092-4AF7-ABC5-2A49999F3B79}.Debug.ActiveCfg = Debug|Win32
- {961F0E06-C092-4AF7-ABC5-2A49999F3B79}.Debug.Build.0 = Debug|Win32
- {961F0E06-C092-4AF7-ABC5-2A49999F3B79}.Release.ActiveCfg = Release|Win32
- {961F0E06-C092-4AF7-ABC5-2A49999F3B79}.Release.Build.0 = Release|Win32
- {90F3C5BD-8E6C-4629-BC71-A1009EC88059}.Debug.ActiveCfg = Debug|Win32
- {90F3C5BD-8E6C-4629-BC71-A1009EC88059}.Debug.Build.0 = Debug|Win32
- {90F3C5BD-8E6C-4629-BC71-A1009EC88059}.Release.ActiveCfg = Release|Win32
- {90F3C5BD-8E6C-4629-BC71-A1009EC88059}.Release.Build.0 = Release|Win32
- {960E01F6-92C1-F74A-BCA5-2A9F3B994979}.Debug.ActiveCfg = Debug|Win32
- {960E01F6-92C1-F74A-BCA5-2A9F3B994979}.Debug.Build.0 = Debug|Win32
- {960E01F6-92C1-F74A-BCA5-2A9F3B994979}.Release.ActiveCfg = Release|Win32
- {960E01F6-92C1-F74A-BCA5-2A9F3B994979}.Release.Build.0 = Release|Win32
- {90E701E6-2C91-F4A7-BA6C-A9F3B0949279}.Debug.ActiveCfg = Debug|Win32
- {90E701E6-2C91-F4A7-BA6C-A9F3B0949279}.Debug.Build.0 = Debug|Win32
- {90E701E6-2C91-F4A7-BA6C-A9F3B0949279}.Release.ActiveCfg = Release|Win32
- {90E701E6-2C91-F4A7-BA6C-A9F3B0949279}.Release.Build.0 = Release|Win32
- {9101EE76-BB6C-2C91-F4B7-A9F3B9490279}.Debug.ActiveCfg = Debug|Win32
- {9101EE76-BB6C-2C91-F4B7-A9F3B9490279}.Debug.Build.0 = Debug|Win32
- {9101EE76-BB6C-2C91-F4B7-A9F3B9490279}.Release.ActiveCfg = Release|Win32
- {9101EE76-BB6C-2C91-F4B7-A9F3B9490279}.Release.Build.0 = Release|Win32
- {910E70E6-2C91-AA67-BF4C-A9C74A309927}.Debug.ActiveCfg = Debug|Win32
- {910E70E6-2C91-AA67-BF4C-A9C74A309927}.Debug.Build.0 = Debug|Win32
- {910E70E6-2C91-AA67-BF4C-A9C74A309927}.Release.ActiveCfg = Release|Win32
- {910E70E6-2C91-AA67-BF4C-A9C74A309927}.Release.Build.0 = Release|Win32
- {761A79B4-9968-CB81-F02B-2A4497345475}.Debug.ActiveCfg = Debug|Win32
- {761A79B4-9968-CB81-F02B-2A4497345475}.Debug.Build.0 = Debug|Win32
- {761A79B4-9968-CB81-F02B-2A4497345475}.Release.ActiveCfg = Release|Win32
- {761A79B4-9968-CB81-F02B-2A4497345475}.Release.Build.0 = Release|Win32
- {9571A7B4-9968-B9C1-17FB-134547B46975}.Debug.ActiveCfg = Debug|Win32
- {9571A7B4-9968-B9C1-17FB-134547B46975}.Debug.Build.0 = Debug|Win32
- {9571A7B4-9968-B9C1-17FB-134547B46975}.Release.ActiveCfg = Release|Win32
- {9571A7B4-9968-B9C1-17FB-134547B46975}.Release.Build.0 = Release|Win32
- {3579B1A4-9894-02AB-CB81-297B46154345}.Debug.ActiveCfg = Debug|Win32
- {3579B1A4-9894-02AB-CB81-297B46154345}.Debug.Build.0 = Debug|Win32
- {3579B1A4-9894-02AB-CB81-297B46154345}.Release.ActiveCfg = Release|Win32
- {3579B1A4-9894-02AB-CB81-297B46154345}.Release.Build.0 = Release|Win32
- {7679B41B-F2B4-9176-CB81-35449467B435}.Debug.ActiveCfg = Debug|Win32
- {7679B41B-F2B4-9176-CB81-35449467B435}.Debug.Build.0 = Debug|Win32
- {7679B41B-F2B4-9176-CB81-35449467B435}.Release.ActiveCfg = Release|Win32
- {7679B41B-F2B4-9176-CB81-35449467B435}.Release.Build.0 = Release|Win32
- {31C77B84-0B2C-9481-CB81-27A149F33825}.Debug.ActiveCfg = Debug|Win32
- {31C77B84-0B2C-9481-CB81-27A149F33825}.Debug.Build.0 = Debug|Win32
- {31C77B84-0B2C-9481-CB81-27A149F33825}.Release.ActiveCfg = Release|Win32
- {31C77B84-0B2C-9481-CB81-27A149F33825}.Release.Build.0 = Release|Win32
- {97B69A72-B9D3-7389-17FB-74612F4A9543}.Debug.ActiveCfg = Debug|Win32
- {97B69A72-B9D3-7389-17FB-74612F4A9543}.Debug.Build.0 = Debug|Win32
- {97B69A72-B9D3-7389-17FB-74612F4A9543}.Release.ActiveCfg = Release|Win32
- {97B69A72-B9D3-7389-17FB-74612F4A9543}.Release.Build.0 = Release|Win32
- {01E70176-B6C5-BF47-2C91-A949077BA323}.Debug.ActiveCfg = Debug|Win32
- {01E70176-B6C5-BF47-2C91-A949077BA323}.Debug.Build.0 = Debug|Win32
- {01E70176-B6C5-BF47-2C91-A949077BA323}.Release.ActiveCfg = Release|Win32
- {01E70176-B6C5-BF47-2C91-A949077BA323}.Release.Build.0 = Release|Win32
- {1E6909E7-C971-F24A-6C7B-A92094B71B59}.Debug.ActiveCfg = Debug|Win32
- {1E6909E7-C971-F24A-6C7B-A92094B71B59}.Debug.Build.0 = Debug|Win32
- {1E6909E7-C971-F24A-6C7B-A92094B71B59}.Release.ActiveCfg = Release|Win32
- {1E6909E7-C971-F24A-6C7B-A92094B71B59}.Release.Build.0 = Release|Win32
- {0AE70176-5B8C-4BC7-392C-A4A312B07893}.Debug.ActiveCfg = Debug|Win32
- {0AE70176-5B8C-4BC7-392C-A4A312B07893}.Debug.Build.0 = Debug|Win32
- {0AE70176-5B8C-4BC7-392C-A4A312B07893}.Release.ActiveCfg = Release|Win32
- {0AE70176-5B8C-4BC7-392C-A4A312B07893}.Release.Build.0 = Release|Win32
- {16909EE7-24AF-97C1-C76B-204B971BA959}.Debug.ActiveCfg = Debug|Win32
- {16909EE7-24AF-97C1-C76B-204B971BA959}.Debug.Build.0 = Debug|Win32
- {16909EE7-24AF-97C1-C76B-204B971BA959}.Release.ActiveCfg = Release|Win32
- {16909EE7-24AF-97C1-C76B-204B971BA959}.Release.Build.0 = Release|Win32
- {07022E76-6CB5-92C1-B47F-A10772A79B43}.Debug.ActiveCfg = Debug|Win32
- {07022E76-6CB5-92C1-B47F-A10772A79B43}.Debug.Build.0 = Debug|Win32
- {07022E76-6CB5-92C1-B47F-A10772A79B43}.Release.ActiveCfg = Release|Win32
- {07022E76-6CB5-92C1-B47F-A10772A79B43}.Release.Build.0 = Release|Win32
- {1690A9E7-DB57-971C-F24A-09B752A942F7}.Debug.ActiveCfg = Debug|Win32
- {1690A9E7-DB57-971C-F24A-09B752A942F7}.Debug.Build.0 = Debug|Win32
- {1690A9E7-DB57-971C-F24A-09B752A942F7}.Release.ActiveCfg = Release|Win32
- {1690A9E7-DB57-971C-F24A-09B752A942F7}.Release.Build.0 = Release|Win32
- {97B61B24-4C97-9681-50BF-243175A813B6}.Debug.ActiveCfg = Debug|Win32
- {97B61B24-4C97-9681-50BF-243175A813B6}.Debug.Build.0 = Debug|Win32
- {97B61B24-4C97-9681-50BF-243175A813B6}.Release.ActiveCfg = Release|Win32
- {97B61B24-4C97-9681-50BF-243175A813B6}.Release.Build.0 = Release|Win32
- {1E09E697-4A2F-BC76-7C91-2BA479B29159}.Debug.ActiveCfg = Debug|Win32
- {1E09E697-4A2F-BC76-7C91-2BA479B29159}.Debug.Build.0 = Debug|Win32
- {1E09E697-4A2F-BC76-7C91-2BA479B29159}.Release.ActiveCfg = Release|Win32
- {1E09E697-4A2F-BC76-7C91-2BA479B29159}.Release.Build.0 = Release|Win32
- {16E09E95-F4A2-C971-BC76-9BA407191C59}.Debug.ActiveCfg = Debug|Win32
- {16E09E95-F4A2-C971-BC76-9BA407191C59}.Debug.Build.0 = Debug|Win32
- {16E09E95-F4A2-C971-BC76-9BA407191C59}.Release.ActiveCfg = Release|Win32
- {16E09E95-F4A2-C971-BC76-9BA407191C59}.Release.Build.0 = Release|Win32
- EndGlobalSection
- GlobalSection(ExtensibilityGlobals) = postSolution
- EndGlobalSection
- GlobalSection(ExtensibilityAddIns) = postSolution
- EndGlobalSection
-EndGlobal

Deleted: sandbox/move/libs/intrusive/proj/vc7ide/Intrusive.vcproj
==============================================================================
--- sandbox/move/libs/intrusive/proj/vc7ide/Intrusive.vcproj 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,129 +0,0 @@
-<?xml version="1.0" encoding="Windows-1252"?>
-<VisualStudioProject
- ProjectType="Visual C++"
- Version="7.10"
- Name="list"
- ProjectGUID="{B1F70826-C6CF-47EF-B7C9-FC9C8BB63A79}"
- Keyword="Win32Proj">
- <Platforms>
- <Platform
- Name="Win32"/>
- </Platforms>
- <Configurations>
- <Configuration
- Name="Debug|Win32"
- OutputDirectory="Debug"
- IntermediateDirectory="Debug"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- Optimization="0"
- PreprocessorDefinitions="WIN32;_DEBUG;_CONSOLE"
- MinimalRebuild="TRUE"
- BasicRuntimeChecks="3"
- RuntimeLibrary="5"
- UsePrecompiledHeader="0"
- WarningLevel="3"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="4"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- OutputFile="$(OutDir)/Intrusive.exe"
- LinkIncremental="2"
- GenerateDebugInformation="TRUE"
- ProgramDatabaseFile="$(OutDir)/Intrusive.pdb"
- SubSystem="1"
- TargetMachine="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- <Configuration
- Name="Release|Win32"
- OutputDirectory="Release"
- IntermediateDirectory="Release"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- PreprocessorDefinitions="WIN32;NDEBUG;_CONSOLE"
- RuntimeLibrary="4"
- UsePrecompiledHeader="0"
- WarningLevel="3"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="3"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- OutputFile="$(OutDir)/Intrusive.exe"
- LinkIncremental="1"
- GenerateDebugInformation="TRUE"
- SubSystem="1"
- OptimizeReferences="2"
- EnableCOMDATFolding="2"
- TargetMachine="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- </Configurations>
- <References>
- </References>
- <Files>
- <Filter
- Name="Source Files"
- Filter="cpp;c;cxx;def;odl;idl;hpj;bat;asm;asmx"
- UniqueIdentifier="{4FC737F1-C7A5-4376-A066-2A32D752A2FF}">
- </Filter>
- <Filter
- Name="Header Files"
- Filter="h;hpp;hxx;hm;inl;inc;xsd"
- UniqueIdentifier="{93995380-89BD-4b04-88EB-625FBE52EBFB}">
- </Filter>
- <Filter
- Name="Resource Files"
- Filter="rc;ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe;resx"
- UniqueIdentifier="{67DA6AB6-F800-4c08-8B7A-83BB121AAD01}">
- </Filter>
- </Files>
- <Globals>
- </Globals>
-</VisualStudioProject>

Deleted: sandbox/move/libs/intrusive/proj/vc7ide/_intrusivelib/_intrusivelib.vcproj
==============================================================================
--- sandbox/move/libs/intrusive/proj/vc7ide/_intrusivelib/_intrusivelib.vcproj 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,462 +0,0 @@
-<?xml version="1.0" encoding="Windows-1252"?>
-<VisualStudioProject
- ProjectType="Visual C++"
- Version="7.10"
- Name="_intrusivelib"
- ProjectGUID="{90F3C5BD-8E6C-4629-BC71-A1009EC88059}"
- Keyword="Win32Proj">
- <Platforms>
- <Platform
- Name="Win32"/>
- </Platforms>
- <Configurations>
- <Configuration
- Name="Debug|Win32"
- OutputDirectory="Debug"
- IntermediateDirectory="Debug"
- ConfigurationType="4"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- Optimization="0"
- PreprocessorDefinitions="WIN32;_DEBUG;_LIB"
- MinimalRebuild="TRUE"
- BasicRuntimeChecks="3"
- RuntimeLibrary="5"
- UsePrecompiledHeader="0"
- WarningLevel="3"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="4"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLibrarianTool"
- OutputFile="$(OutDir)/_intrusivelib.lib"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- <Configuration
- Name="Release|Win32"
- OutputDirectory="Release"
- IntermediateDirectory="Release"
- ConfigurationType="4"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- PreprocessorDefinitions="WIN32;NDEBUG;_LIB"
- RuntimeLibrary="4"
- UsePrecompiledHeader="0"
- WarningLevel="3"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="3"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLibrarianTool"
- OutputFile="$(OutDir)/_intrusivelib.lib"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- </Configurations>
- <References>
- </References>
- <Files>
- <Filter
- Name="Jamfile"
- Filter=""
- UniqueIdentifier="{4FC737F1-C7A5-4376-A066-2A32D752A2FF}">
- <File
- RelativePath="..\..\..\test\Jamfile.v2">
- </File>
- </Filter>
- <Filter
- Name="Header Files"
- Filter="h;hpp;hxx;hm;inl;inc;xsd"
- UniqueIdentifier="{93995380-89BD-4b04-88EB-625FBE52EBFB}">
- <File
- RelativePath="..\..\..\..\..\boost\intrusive\any_hook.hpp">
- </File>
- <File
- RelativePath="..\..\..\..\..\boost\intrusive\avl_set.hpp">
- </File>
- <File
- RelativePath="..\..\..\..\..\boost\intrusive\avl_set_hook.hpp">
- </File>
- <File
- RelativePath="..\..\..\..\..\boost\intrusive\avltree.hpp">
- </File>
- <File
- RelativePath="..\..\..\..\..\boost\intrusive\avltree_algorithms.hpp">
- </File>
- <File
- RelativePath="..\..\..\..\..\boost\intrusive\bs_set_hook.hpp">
- </File>
- <File
- RelativePath="..\..\..\..\..\boost\intrusive\circular_list_algorithms.hpp">
- </File>
- <File
- RelativePath="..\..\..\..\..\boost\intrusive\circular_slist_algorithms.hpp">
- </File>
- <File
- RelativePath="..\..\..\..\..\boost\intrusive\derivation_value_traits.hpp">
- </File>
- <File
- RelativePath="..\..\..\..\..\boost\intrusive\hashtable.hpp">
- </File>
- <File
- RelativePath="..\..\..\..\..\boost\intrusive\intrusive_fwd.hpp">
- </File>
- <File
- RelativePath="..\..\..\..\..\boost\intrusive\linear_slist_algorithms.hpp">
- </File>
- <File
- RelativePath="..\..\..\..\..\boost\intrusive\link_mode.hpp">
- </File>
- <File
- RelativePath="..\..\..\..\..\boost\intrusive\list.hpp">
- </File>
- <File
- RelativePath="..\..\..\..\..\boost\intrusive\list_hook.hpp">
- </File>
- <File
- RelativePath="..\..\..\..\..\boost\intrusive\member_value_traits.hpp">
- </File>
- <File
- RelativePath="..\..\..\..\..\boost\intrusive\options.hpp">
- </File>
- <File
- RelativePath="..\..\..\..\..\boost\intrusive\pointer_plus_bits.hpp">
- </File>
- <File
- RelativePath="..\..\..\..\..\boost\intrusive\rbtree.hpp">
- </File>
- <File
- RelativePath="..\..\..\..\..\boost\intrusive\rbtree_algorithms.hpp">
- </File>
- <File
- RelativePath="..\..\..\..\..\boost\intrusive\set.hpp">
- </File>
- <File
- RelativePath="..\..\..\..\..\boost\intrusive\set_hook.hpp">
- </File>
- <File
- RelativePath="..\..\..\..\..\boost\intrusive\sg_set.hpp">
- </File>
- <File
- RelativePath="..\..\..\..\..\boost\intrusive\sgtree.hpp">
- </File>
- <File
- RelativePath="..\..\..\..\..\boost\intrusive\sgtree_algorithms.hpp">
- </File>
- <File
- RelativePath="..\..\..\..\..\boost\intrusive\slist.hpp">
- </File>
- <File
- RelativePath="..\..\..\..\..\boost\intrusive\slist_hook.hpp">
- </File>
- <File
- RelativePath="..\..\..\..\..\boost\intrusive\splay_set.hpp">
- </File>
- <File
- RelativePath="..\..\..\..\..\boost\intrusive\splay_set_hook.hpp">
- </File>
- <File
- RelativePath="..\..\..\..\..\boost\intrusive\splaytree.hpp">
- </File>
- <File
- RelativePath="..\..\..\..\..\boost\intrusive\splaytree_algorithms.hpp">
- </File>
- <File
- RelativePath="..\..\..\..\..\boost\intrusive\treap.hpp">
- </File>
- <File
- RelativePath="..\..\..\..\..\boost\intrusive\treap_algorithms.hpp">
- </File>
- <File
- RelativePath="..\..\..\..\..\boost\intrusive\treap_set.hpp">
- </File>
- <File
- RelativePath="..\..\..\..\..\boost\intrusive\trivial_value_traits.hpp">
- </File>
- <File
- RelativePath="..\..\..\..\..\boost\intrusive\unordered_set.hpp">
- </File>
- <File
- RelativePath="..\..\..\..\..\boost\intrusive\unordered_set_hook.hpp">
- </File>
- <Filter
- Name="detail"
- Filter="">
- <File
- RelativePath="..\..\..\..\..\boost\intrusive\detail\any_node_and_algorithms.hpp">
- </File>
- <File
- RelativePath="..\..\..\..\..\boost\intrusive\detail\assert.hpp">
- </File>
- <File
- RelativePath="..\..\..\..\..\boost\intrusive\detail\avltree_node.hpp">
- </File>
- <File
- RelativePath="..\..\..\..\..\boost\intrusive\detail\clear_on_destructor_base.hpp">
- </File>
- <File
- RelativePath="..\..\..\..\..\boost\intrusive\detail\common_slist_algorithms.hpp">
- </File>
- <File
- RelativePath="..\..\..\..\..\boost\intrusive\detail\config_begin.hpp">
- </File>
- <File
- RelativePath="..\..\..\..\..\boost\intrusive\detail\config_end.hpp">
- </File>
- <File
- RelativePath="..\..\..\..\..\boost\intrusive\detail\ebo_functor_holder.hpp">
- </File>
- <File
- RelativePath="..\..\..\..\..\boost\intrusive\detail\function_detector.hpp">
- </File>
- <File
- RelativePath="..\..\..\..\..\boost\intrusive\detail\generic_hook.hpp">
- </File>
- <File
- RelativePath="..\..\..\..\..\boost\intrusive\detail\hashtable_node.hpp">
- </File>
- <File
- RelativePath="..\..\..\..\..\boost\intrusive\detail\is_stateful_value_traits.hpp">
- </File>
- <File
- RelativePath="..\..\..\..\..\boost\intrusive\detail\list_node.hpp">
- </File>
- <File
- RelativePath="..\..\..\..\..\boost\intrusive\detail\mpl.hpp">
- </File>
- <File
- RelativePath="..\..\..\..\..\boost\intrusive\detail\parent_from_member.hpp">
- </File>
- <File
- RelativePath="..\..\..\..\..\boost\intrusive\detail\pointer_to_other.hpp">
- </File>
- <File
- RelativePath="..\..\..\..\..\boost\intrusive\detail\rbtree_node.hpp">
- </File>
- <File
- RelativePath="..\..\..\..\..\boost\intrusive\detail\slist_node.hpp">
- </File>
- <File
- RelativePath="..\..\..\..\..\boost\intrusive\detail\transform_iterator.hpp">
- </File>
- <File
- RelativePath="..\..\..\..\..\boost\intrusive\detail\tree_algorithms.hpp">
- </File>
- <File
- RelativePath="..\..\..\..\..\boost\intrusive\detail\tree_node.hpp">
- </File>
- <File
- RelativePath="..\..\..\..\..\boost\intrusive\detail\utilities.hpp">
- </File>
- <File
- RelativePath="..\..\..\..\..\boost\intrusive\detail\workaround.hpp">
- </File>
- </Filter>
- </Filter>
- <Filter
- Name="doc"
- Filter="">
- <File
- RelativePath="..\..\..\doc\intrusive.qbk">
- </File>
- <File
- RelativePath="..\..\..\doc\Jamfile.v2">
- </File>
- </Filter>
- <Filter
- Name="Test headers"
- Filter="">
- <File
- RelativePath="..\..\..\test\common_functors.hpp">
- </File>
- <File
- RelativePath="..\..\..\test\generic_assoc_test.hpp">
- </File>
- <File
- RelativePath="..\..\..\test\generic_multiset_test.hpp">
- </File>
- <File
- RelativePath="..\..\..\test\generic_set_test.hpp">
- </File>
- <File
- RelativePath="..\..\..\test\itestvalue.hpp">
- </File>
- <File
- RelativePath="..\..\..\test\smart_ptr.hpp">
- </File>
- <File
- RelativePath="..\..\..\test\stateful_value_traits.hpp">
- </File>
- <File
- RelativePath="..\..\..\test\test_container.hpp">
- </File>
- <File
- RelativePath="..\..\..\test\test_macros.hpp">
- </File>
- <File
- RelativePath="..\..\..\test\test_templates.hpp">
- </File>
- </Filter>
- <Filter
- Name="example"
- Filter="">
- <File
- RelativePath="..\..\..\example\doc_advanced_value_traits.cpp">
- </File>
- <File
- RelativePath="..\..\..\example\doc_advanced_value_traits2.cpp">
- </File>
- <File
- RelativePath="..\..\..\example\doc_any_hook.cpp">
- </File>
- <File
- RelativePath="..\..\..\example\doc_assoc_optimized_code.cpp">
- </File>
- <File
- RelativePath="..\..\..\example\doc_auto_unlink.cpp">
- </File>
- <File
- RelativePath="..\..\..\example\doc_avl_set.cpp">
- </File>
- <File
- RelativePath="..\..\..\example\doc_avltree_algorithms.cpp">
- </File>
- <File
- RelativePath="..\..\..\example\doc_bucket_traits.cpp">
- </File>
- <File
- RelativePath="..\..\..\example\doc_clone_from.cpp">
- </File>
- <File
- RelativePath="..\..\..\example\doc_entity.cpp">
- </File>
- <File
- RelativePath="..\..\..\example\doc_erasing_and_disposing.cpp">
- </File>
- <File
- RelativePath="..\..\..\example\doc_external_value_traits.cpp">
- </File>
- <File
- RelativePath="..\..\..\example\doc_how_to_use.cpp">
- </File>
- <File
- RelativePath="..\..\..\example\doc_iterator_from_value.cpp">
- </File>
- <File
- RelativePath="..\..\..\example\doc_list.cpp">
- </File>
- <File
- RelativePath="..\..\..\example\doc_list_algorithms.cpp">
- </File>
- <File
- RelativePath="..\..\..\example\doc_offset_ptr.cpp">
- </File>
- <File
- RelativePath="..\..\..\example\doc_positional_insertion.cpp">
- </File>
- <File
- RelativePath="..\..\..\example\doc_rbtree_algorithms.cpp">
- </File>
- <File
- RelativePath="..\..\..\example\doc_set.cpp">
- </File>
- <File
- RelativePath="..\..\..\example\doc_sg_set.cpp">
- </File>
- <File
- RelativePath="..\..\..\example\doc_slist.cpp">
- </File>
- <File
- RelativePath="..\..\..\example\doc_slist_algorithms.cpp">
- </File>
- <File
- RelativePath="..\..\..\example\doc_splay_algorithms.cpp">
- </File>
- <File
- RelativePath="..\..\..\example\doc_splay_set.cpp">
- </File>
- <File
- RelativePath="..\..\..\example\doc_splaytree_algorithms.cpp">
- </File>
- <File
- RelativePath="..\..\..\example\doc_stateful_value_traits.cpp">
- </File>
- <File
- RelativePath="..\..\..\example\doc_treap_algorithms.cpp">
- </File>
- <File
- RelativePath="..\..\..\example\doc_treap_set.cpp">
- </File>
- <File
- RelativePath="..\..\..\example\doc_unordered_set.cpp">
- </File>
- <File
- RelativePath="..\..\..\example\doc_value_traits.cpp">
- </File>
- <File
- RelativePath="..\..\..\example\doc_window.cpp">
- </File>
- <File
- RelativePath="..\..\..\example\Jamfile.v2">
- </File>
- </Filter>
- <Filter
- Name="perf"
- Filter="">
- <File
- RelativePath="..\..\..\perf\Jamfile.v2">
- <FileConfiguration
- Name="Debug|Win32"
- ExcludedFromBuild="TRUE">
- <Tool
- Name="VCCustomBuildTool"/>
- </FileConfiguration>
- </File>
- <File
- RelativePath="..\..\..\perf\perf_list.cpp">
- </File>
- </Filter>
- <File
- RelativePath="..\to-do.txt">
- </File>
- </Files>
- <Globals>
- </Globals>
-</VisualStudioProject>

Deleted: sandbox/move/libs/intrusive/proj/vc7ide/any_test/any_test.vcproj
==============================================================================
--- sandbox/move/libs/intrusive/proj/vc7ide/any_test/any_test.vcproj 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,133 +0,0 @@
-<?xml version="1.0" encoding="Windows-1252"?>
-<VisualStudioProject
- ProjectType="Visual C++"
- Version="7.10"
- Name="any_hook"
- ProjectGUID="{97B61B24-4C97-9681-50BF-243175A813B6}"
- RootNamespace="any_hook"
- Keyword="Win32Proj">
- <Platforms>
- <Platform
- Name="Win32"/>
- </Platforms>
- <Configurations>
- <Configuration
- Name="Debug|Win32"
- OutputDirectory="Debug"
- IntermediateDirectory="Debug"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- Optimization="0"
- AdditionalIncludeDirectories="../../../../../"
- PreprocessorDefinitions="BOOST_DATE_TIME_NO_LIB"
- GeneratePreprocessedFile="0"
- KeepComments="FALSE"
- MinimalRebuild="TRUE"
- BasicRuntimeChecks="3"
- RuntimeLibrary="5"
- DisableLanguageExtensions="TRUE"
- TreatWChar_tAsBuiltInType="TRUE"
- ForceConformanceInForLoopScope="TRUE"
- UsePrecompiledHeader="0"
- WarningLevel="4"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="4"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- OutputFile="$(OutDir)/any_hook.exe"
- LinkIncremental="2"
- GenerateDebugInformation="TRUE"
- ProgramDatabaseFile="$(OutDir)/any_hook.pdb"
- GenerateMapFile="FALSE"
- SubSystem="1"
- TargetMachine="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- <Configuration
- Name="Release|Win32"
- OutputDirectory="Release"
- IntermediateDirectory="Release"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- AdditionalIncludeDirectories="../../../../../"
- PreprocessorDefinitions="BOOST_DATE_TIME_NO_LIB"
- RuntimeLibrary="4"
- DisableLanguageExtensions="FALSE"
- ForceConformanceInForLoopScope="TRUE"
- UsePrecompiledHeader="0"
- WarningLevel="3"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="3"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- OutputFile="$(OutDir)/any_hook.exe"
- LinkIncremental="1"
- GenerateDebugInformation="TRUE"
- SubSystem="1"
- OptimizeReferences="2"
- EnableCOMDATFolding="2"
- TargetMachine="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- </Configurations>
- <References>
- </References>
- <Files>
- <Filter
- Name="Source Files"
- Filter="cpp;c;cxx;def;odl;idl;hpj;bat;asm;asmx"
- UniqueIdentifier="{4737FFC1-76A6-A5C7-4376-2EA02C41523F}">
- <File
- RelativePath="..\..\..\test\any_test.cpp">
- </File>
- </Filter>
- </Files>
- <Globals>
- </Globals>
-</VisualStudioProject>

Deleted: sandbox/move/libs/intrusive/proj/vc7ide/avl_multiset/avl_multiset.vcproj
==============================================================================
--- sandbox/move/libs/intrusive/proj/vc7ide/avl_multiset/avl_multiset.vcproj 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,128 +0,0 @@
-<?xml version="1.0" encoding="Windows-1252"?>
-<VisualStudioProject
- ProjectType="Visual C++"
- Version="7.10"
- Name="avl_multiset"
- ProjectGUID="{0AE70176-5B8C-4BC7-392C-A4A312B07893}"
- Keyword="Win32Proj">
- <Platforms>
- <Platform
- Name="Win32"/>
- </Platforms>
- <Configurations>
- <Configuration
- Name="Debug|Win32"
- OutputDirectory="Debug"
- IntermediateDirectory="Debug"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- Optimization="0"
- AdditionalIncludeDirectories="../../../../../"
- PreprocessorDefinitions="WIN32;_DEBUG;_CONSOLE"
- GeneratePreprocessedFile="0"
- MinimalRebuild="TRUE"
- BasicRuntimeChecks="3"
- RuntimeLibrary="5"
- DisableLanguageExtensions="TRUE"
- TreatWChar_tAsBuiltInType="TRUE"
- ForceConformanceInForLoopScope="TRUE"
- UsePrecompiledHeader="0"
- WarningLevel="4"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="4"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- OutputFile="$(OutDir)/avl_multiset.exe"
- LinkIncremental="2"
- GenerateDebugInformation="TRUE"
- ProgramDatabaseFile="$(OutDir)/avl_multiset.pdb"
- SubSystem="1"
- TargetMachine="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- <Configuration
- Name="Release|Win32"
- OutputDirectory="Release"
- IntermediateDirectory="Release"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- AdditionalIncludeDirectories="../../../../../"
- PreprocessorDefinitions="WIN32;NDEBUG;_CONSOLE"
- RuntimeLibrary="4"
- UsePrecompiledHeader="0"
- WarningLevel="3"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="3"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- OutputFile="$(OutDir)/avl_multiset.exe"
- LinkIncremental="1"
- GenerateDebugInformation="TRUE"
- SubSystem="1"
- OptimizeReferences="2"
- EnableCOMDATFolding="2"
- TargetMachine="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- </Configurations>
- <References>
- </References>
- <Files>
- <Filter
- Name="Source Files"
- Filter="cpp;c;cxx;def;odl;idl;hpj;bat;asm;asmx"
- UniqueIdentifier="{F9A837FC-4236-A8D7-745E-2D383A2E13EA}">
- <File
- RelativePath="..\..\..\test\avl_multiset_test.cpp">
- </File>
- </Filter>
- </Files>
- <Globals>
- </Globals>
-</VisualStudioProject>

Deleted: sandbox/move/libs/intrusive/proj/vc7ide/avl_set/avl_set.vcproj
==============================================================================
--- sandbox/move/libs/intrusive/proj/vc7ide/avl_set/avl_set.vcproj 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,127 +0,0 @@
-<?xml version="1.0" encoding="Windows-1252"?>
-<VisualStudioProject
- ProjectType="Visual C++"
- Version="7.10"
- Name="avl_set"
- ProjectGUID="{16909EE7-24AF-97C1-C76B-204B971BA959}"
- Keyword="Win32Proj">
- <Platforms>
- <Platform
- Name="Win32"/>
- </Platforms>
- <Configurations>
- <Configuration
- Name="Debug|Win32"
- OutputDirectory="Debug"
- IntermediateDirectory="Debug"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- Optimization="0"
- AdditionalIncludeDirectories="../../../../../"
- PreprocessorDefinitions="WIN32;_DEBUG;_CONSOLE"
- MinimalRebuild="TRUE"
- BasicRuntimeChecks="3"
- RuntimeLibrary="5"
- DisableLanguageExtensions="TRUE"
- TreatWChar_tAsBuiltInType="TRUE"
- ForceConformanceInForLoopScope="TRUE"
- UsePrecompiledHeader="0"
- WarningLevel="4"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="4"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- OutputFile="$(OutDir)/avl_set.exe"
- LinkIncremental="2"
- GenerateDebugInformation="TRUE"
- ProgramDatabaseFile="$(OutDir)/avl_set.pdb"
- SubSystem="1"
- TargetMachine="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- <Configuration
- Name="Release|Win32"
- OutputDirectory="Release"
- IntermediateDirectory="Release"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- AdditionalIncludeDirectories="../../../../../"
- PreprocessorDefinitions="WIN32;NDEBUG;_CONSOLE"
- RuntimeLibrary="4"
- UsePrecompiledHeader="0"
- WarningLevel="3"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="3"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- OutputFile="$(OutDir)/avl_set.exe"
- LinkIncremental="1"
- GenerateDebugInformation="TRUE"
- SubSystem="1"
- OptimizeReferences="2"
- EnableCOMDATFolding="2"
- TargetMachine="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- </Configurations>
- <References>
- </References>
- <Files>
- <Filter
- Name="Source Files"
- Filter="cpp;c;cxx;def;odl;idl;hpj;bat;asm;asmx"
- UniqueIdentifier="{FC776C11-2A4F-326F-1E35-4C72A23B325A}">
- <File
- RelativePath="..\..\..\test\avl_set_test.cpp">
- </File>
- </Filter>
- </Files>
- <Globals>
- </Globals>
-</VisualStudioProject>

Deleted: sandbox/move/libs/intrusive/proj/vc7ide/custom_bucket_traits/custom_bucket_traits.vcproj
==============================================================================
--- sandbox/move/libs/intrusive/proj/vc7ide/custom_bucket_traits/custom_bucket_traits.vcproj 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,133 +0,0 @@
-<?xml version="1.0" encoding="Windows-1252"?>
-<VisualStudioProject
- ProjectType="Visual C++"
- Version="7.10"
- Name="custom_bucket_traits"
- ProjectGUID="{31C77B84-0B2C-9481-CB81-27A149F33825}"
- RootNamespace="custom_bucket_traits"
- Keyword="Win32Proj">
- <Platforms>
- <Platform
- Name="Win32"/>
- </Platforms>
- <Configurations>
- <Configuration
- Name="Debug|Win32"
- OutputDirectory="Debug"
- IntermediateDirectory="Debug"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- Optimization="0"
- AdditionalIncludeDirectories="../../../../../"
- PreprocessorDefinitions="BOOST_DATE_TIME_NO_LIB"
- GeneratePreprocessedFile="0"
- KeepComments="FALSE"
- MinimalRebuild="TRUE"
- BasicRuntimeChecks="3"
- RuntimeLibrary="5"
- DisableLanguageExtensions="TRUE"
- TreatWChar_tAsBuiltInType="TRUE"
- ForceConformanceInForLoopScope="TRUE"
- UsePrecompiledHeader="0"
- WarningLevel="4"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="4"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- OutputFile="$(OutDir)/custom_bucket_traits.exe"
- LinkIncremental="2"
- GenerateDebugInformation="TRUE"
- ProgramDatabaseFile="$(OutDir)/custom_bucket_traits.pdb"
- GenerateMapFile="TRUE"
- SubSystem="1"
- TargetMachine="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- <Configuration
- Name="Release|Win32"
- OutputDirectory="Release"
- IntermediateDirectory="Release"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- AdditionalIncludeDirectories="../../../../../"
- PreprocessorDefinitions="BOOST_DATE_TIME_NO_LIB"
- RuntimeLibrary="4"
- DisableLanguageExtensions="FALSE"
- ForceConformanceInForLoopScope="TRUE"
- UsePrecompiledHeader="0"
- WarningLevel="3"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="3"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- OutputFile="$(OutDir)/custom_bucket_traits.exe"
- LinkIncremental="1"
- GenerateDebugInformation="TRUE"
- SubSystem="1"
- OptimizeReferences="2"
- EnableCOMDATFolding="2"
- TargetMachine="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- </Configurations>
- <References>
- </References>
- <Files>
- <Filter
- Name="Source Files"
- Filter="cpp;c;cxx;def;odl;idl;hpj;bat;asm;asmx"
- UniqueIdentifier="{51BA5F47-A612-6376-7AB5-73F17F5C84BC}">
- <File
- RelativePath="..\..\..\test\custom_bucket_traits_test.cpp">
- </File>
- </Filter>
- </Files>
- <Globals>
- </Globals>
-</VisualStudioProject>

Deleted: sandbox/move/libs/intrusive/proj/vc7ide/default_hook/default_hook.vcproj
==============================================================================
--- sandbox/move/libs/intrusive/proj/vc7ide/default_hook/default_hook.vcproj 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,133 +0,0 @@
-<?xml version="1.0" encoding="Windows-1252"?>
-<VisualStudioProject
- ProjectType="Visual C++"
- Version="7.10"
- Name="default_hook"
- ProjectGUID="{761A79B4-9968-CB81-F02B-2A4497345475}"
- RootNamespace="default_hook"
- Keyword="Win32Proj">
- <Platforms>
- <Platform
- Name="Win32"/>
- </Platforms>
- <Configurations>
- <Configuration
- Name="Debug|Win32"
- OutputDirectory="Debug"
- IntermediateDirectory="Debug"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- Optimization="0"
- AdditionalIncludeDirectories="../../../../../"
- PreprocessorDefinitions="BOOST_DATE_TIME_NO_LIB"
- GeneratePreprocessedFile="0"
- KeepComments="FALSE"
- MinimalRebuild="TRUE"
- BasicRuntimeChecks="3"
- RuntimeLibrary="5"
- DisableLanguageExtensions="TRUE"
- TreatWChar_tAsBuiltInType="TRUE"
- ForceConformanceInForLoopScope="TRUE"
- UsePrecompiledHeader="0"
- WarningLevel="4"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="4"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- OutputFile="$(OutDir)/default_hook.exe"
- LinkIncremental="2"
- GenerateDebugInformation="TRUE"
- ProgramDatabaseFile="$(OutDir)/default_hook.pdb"
- GenerateMapFile="TRUE"
- SubSystem="1"
- TargetMachine="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- <Configuration
- Name="Release|Win32"
- OutputDirectory="Release"
- IntermediateDirectory="Release"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- AdditionalIncludeDirectories="../../../../../"
- PreprocessorDefinitions="BOOST_DATE_TIME_NO_LIB"
- RuntimeLibrary="4"
- DisableLanguageExtensions="FALSE"
- ForceConformanceInForLoopScope="TRUE"
- UsePrecompiledHeader="0"
- WarningLevel="3"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="3"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- OutputFile="$(OutDir)/default_hook.exe"
- LinkIncremental="1"
- GenerateDebugInformation="TRUE"
- SubSystem="1"
- OptimizeReferences="2"
- EnableCOMDATFolding="2"
- TargetMachine="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- </Configurations>
- <References>
- </References>
- <Files>
- <Filter
- Name="Source Files"
- Filter="cpp;c;cxx;def;odl;idl;hpj;bat;asm;asmx"
- UniqueIdentifier="{4C737FF1-7AB5-3764-A066-252B75A372FF}">
- <File
- RelativePath="..\..\..\test\default_hook_test.cpp">
- </File>
- </Filter>
- </Files>
- <Globals>
- </Globals>
-</VisualStudioProject>

Deleted: sandbox/move/libs/intrusive/proj/vc7ide/external_value_traits/external_value_traits.vcproj
==============================================================================
--- sandbox/move/libs/intrusive/proj/vc7ide/external_value_traits/external_value_traits.vcproj 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,133 +0,0 @@
-<?xml version="1.0" encoding="Windows-1252"?>
-<VisualStudioProject
- ProjectType="Visual C++"
- Version="7.10"
- Name="external_value_traits"
- ProjectGUID="{97B69A72-B9D3-7389-17FB-74612F4A9543}"
- RootNamespace="external_value_traits"
- Keyword="Win32Proj">
- <Platforms>
- <Platform
- Name="Win32"/>
- </Platforms>
- <Configurations>
- <Configuration
- Name="Debug|Win32"
- OutputDirectory="Debug"
- IntermediateDirectory="Debug"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- Optimization="0"
- AdditionalIncludeDirectories="../../../../../"
- PreprocessorDefinitions="BOOST_DATE_TIME_NO_LIB"
- GeneratePreprocessedFile="0"
- KeepComments="FALSE"
- MinimalRebuild="TRUE"
- BasicRuntimeChecks="3"
- RuntimeLibrary="5"
- DisableLanguageExtensions="TRUE"
- TreatWChar_tAsBuiltInType="TRUE"
- ForceConformanceInForLoopScope="TRUE"
- UsePrecompiledHeader="0"
- WarningLevel="4"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="4"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- OutputFile="$(OutDir)/external_value_traits.exe"
- LinkIncremental="2"
- GenerateDebugInformation="TRUE"
- ProgramDatabaseFile="$(OutDir)/external_value_traits.pdb"
- GenerateMapFile="TRUE"
- SubSystem="1"
- TargetMachine="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- <Configuration
- Name="Release|Win32"
- OutputDirectory="Release"
- IntermediateDirectory="Release"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- AdditionalIncludeDirectories="../../../../../"
- PreprocessorDefinitions="BOOST_DATE_TIME_NO_LIB"
- RuntimeLibrary="4"
- DisableLanguageExtensions="FALSE"
- ForceConformanceInForLoopScope="TRUE"
- UsePrecompiledHeader="0"
- WarningLevel="3"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="3"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- OutputFile="$(OutDir)/external_value_traits.exe"
- LinkIncremental="1"
- GenerateDebugInformation="TRUE"
- SubSystem="1"
- OptimizeReferences="2"
- EnableCOMDATFolding="2"
- TargetMachine="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- </Configurations>
- <References>
- </References>
- <Files>
- <Filter
- Name="Source Files"
- Filter="cpp;c;cxx;def;odl;idl;hpj;bat;asm;asmx"
- UniqueIdentifier="{7FAFEA31-6364-FB35-16A6-77AF315C236A}">
- <File
- RelativePath="..\..\..\test\external_value_traits_test.cpp">
- </File>
- </Filter>
- </Files>
- <Globals>
- </Globals>
-</VisualStudioProject>

Deleted: sandbox/move/libs/intrusive/proj/vc7ide/list/list.vcproj
==============================================================================
--- sandbox/move/libs/intrusive/proj/vc7ide/list/list.vcproj 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,133 +0,0 @@
-<?xml version="1.0" encoding="Windows-1252"?>
-<VisualStudioProject
- ProjectType="Visual C++"
- Version="7.10"
- Name="list"
- ProjectGUID="{977B61B4-9968-497C-9F0B-24A8145473B8}"
- RootNamespace="list"
- Keyword="Win32Proj">
- <Platforms>
- <Platform
- Name="Win32"/>
- </Platforms>
- <Configurations>
- <Configuration
- Name="Debug|Win32"
- OutputDirectory="Debug"
- IntermediateDirectory="Debug"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- Optimization="0"
- AdditionalIncludeDirectories="../../../../../"
- PreprocessorDefinitions="BOOST_DATE_TIME_NO_LIB"
- GeneratePreprocessedFile="0"
- KeepComments="FALSE"
- MinimalRebuild="TRUE"
- BasicRuntimeChecks="3"
- RuntimeLibrary="5"
- DisableLanguageExtensions="TRUE"
- TreatWChar_tAsBuiltInType="TRUE"
- ForceConformanceInForLoopScope="TRUE"
- UsePrecompiledHeader="0"
- WarningLevel="4"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="4"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- OutputFile="$(OutDir)/list.exe"
- LinkIncremental="2"
- GenerateDebugInformation="TRUE"
- ProgramDatabaseFile="$(OutDir)/list.pdb"
- GenerateMapFile="FALSE"
- SubSystem="1"
- TargetMachine="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- <Configuration
- Name="Release|Win32"
- OutputDirectory="Release"
- IntermediateDirectory="Release"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- AdditionalIncludeDirectories="../../../../../"
- PreprocessorDefinitions="BOOST_DATE_TIME_NO_LIB"
- RuntimeLibrary="4"
- DisableLanguageExtensions="FALSE"
- ForceConformanceInForLoopScope="TRUE"
- UsePrecompiledHeader="0"
- WarningLevel="3"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="3"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- OutputFile="$(OutDir)/list.exe"
- LinkIncremental="1"
- GenerateDebugInformation="TRUE"
- SubSystem="1"
- OptimizeReferences="2"
- EnableCOMDATFolding="2"
- TargetMachine="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- </Configurations>
- <References>
- </References>
- <Files>
- <Filter
- Name="Source Files"
- Filter="cpp;c;cxx;def;odl;idl;hpj;bat;asm;asmx"
- UniqueIdentifier="{4FC737F1-C7A5-4376-A066-2A32D752A2FF}">
- <File
- RelativePath="..\..\..\test\list_test.cpp">
- </File>
- </Filter>
- </Files>
- <Globals>
- </Globals>
-</VisualStudioProject>

Deleted: sandbox/move/libs/intrusive/proj/vc7ide/make_functions/make_functions.vcproj
==============================================================================
--- sandbox/move/libs/intrusive/proj/vc7ide/make_functions/make_functions.vcproj 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,133 +0,0 @@
-<?xml version="1.0" encoding="Windows-1252"?>
-<VisualStudioProject
- ProjectType="Visual C++"
- Version="7.10"
- Name="make_functions"
- ProjectGUID="{7679B41B-F2B4-9176-CB81-35449467B435}"
- RootNamespace="make_functions"
- Keyword="Win32Proj">
- <Platforms>
- <Platform
- Name="Win32"/>
- </Platforms>
- <Configurations>
- <Configuration
- Name="Debug|Win32"
- OutputDirectory="Debug"
- IntermediateDirectory="Debug"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- Optimization="0"
- AdditionalIncludeDirectories="../../../../../"
- PreprocessorDefinitions="BOOST_DATE_TIME_NO_LIB"
- GeneratePreprocessedFile="0"
- KeepComments="FALSE"
- MinimalRebuild="TRUE"
- BasicRuntimeChecks="3"
- RuntimeLibrary="5"
- DisableLanguageExtensions="TRUE"
- TreatWChar_tAsBuiltInType="TRUE"
- ForceConformanceInForLoopScope="TRUE"
- UsePrecompiledHeader="0"
- WarningLevel="4"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="4"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- OutputFile="$(OutDir)/make_functions.exe"
- LinkIncremental="2"
- GenerateDebugInformation="TRUE"
- ProgramDatabaseFile="$(OutDir)/make_functions.pdb"
- GenerateMapFile="TRUE"
- SubSystem="1"
- TargetMachine="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- <Configuration
- Name="Release|Win32"
- OutputDirectory="Release"
- IntermediateDirectory="Release"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- AdditionalIncludeDirectories="../../../../../"
- PreprocessorDefinitions="BOOST_DATE_TIME_NO_LIB"
- RuntimeLibrary="4"
- DisableLanguageExtensions="FALSE"
- ForceConformanceInForLoopScope="TRUE"
- UsePrecompiledHeader="0"
- WarningLevel="3"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="3"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- OutputFile="$(OutDir)/make_functions.exe"
- LinkIncremental="1"
- GenerateDebugInformation="TRUE"
- SubSystem="1"
- OptimizeReferences="2"
- EnableCOMDATFolding="2"
- TargetMachine="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- </Configurations>
- <References>
- </References>
- <Files>
- <Filter
- Name="Source Files"
- Filter="cpp;c;cxx;def;odl;idl;hpj;bat;asm;asmx"
- UniqueIdentifier="{4F537F31-AB85-7644-A616-25727F35FA5F}">
- <File
- RelativePath="..\..\..\test\make_functions_test.cpp">
- </File>
- </Filter>
- </Files>
- <Globals>
- </Globals>
-</VisualStudioProject>

Deleted: sandbox/move/libs/intrusive/proj/vc7ide/multiset/multiset.vcproj
==============================================================================
--- sandbox/move/libs/intrusive/proj/vc7ide/multiset/multiset.vcproj 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,127 +0,0 @@
-<?xml version="1.0" encoding="Windows-1252"?>
-<VisualStudioProject
- ProjectType="Visual C++"
- Version="7.10"
- Name="multiset"
- ProjectGUID="{961F0E06-C092-4AF7-ABC5-2A49999F3B79}"
- Keyword="Win32Proj">
- <Platforms>
- <Platform
- Name="Win32"/>
- </Platforms>
- <Configurations>
- <Configuration
- Name="Debug|Win32"
- OutputDirectory="Debug"
- IntermediateDirectory="Debug"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- Optimization="0"
- AdditionalIncludeDirectories="../../../../../"
- PreprocessorDefinitions="WIN32;_DEBUG;_CONSOLE;BOOST_DATE_TIME_NO_LIB"
- MinimalRebuild="TRUE"
- BasicRuntimeChecks="3"
- RuntimeLibrary="5"
- DisableLanguageExtensions="TRUE"
- TreatWChar_tAsBuiltInType="TRUE"
- ForceConformanceInForLoopScope="TRUE"
- UsePrecompiledHeader="0"
- WarningLevel="4"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="4"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- OutputFile="$(OutDir)/multiset.exe"
- LinkIncremental="2"
- GenerateDebugInformation="TRUE"
- ProgramDatabaseFile="$(OutDir)/multiset.pdb"
- SubSystem="1"
- TargetMachine="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- <Configuration
- Name="Release|Win32"
- OutputDirectory="Release"
- IntermediateDirectory="Release"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- AdditionalIncludeDirectories="../../../../../"
- PreprocessorDefinitions="_WIN32;NDEBUG;_CONSOLE;BOOST_DATE_TIME_NO_LIB"
- RuntimeLibrary="4"
- UsePrecompiledHeader="0"
- WarningLevel="3"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="3"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- OutputFile="$(OutDir)/multiset.exe"
- LinkIncremental="1"
- GenerateDebugInformation="TRUE"
- SubSystem="1"
- OptimizeReferences="2"
- EnableCOMDATFolding="2"
- TargetMachine="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- </Configurations>
- <References>
- </References>
- <Files>
- <Filter
- Name="Source Files"
- Filter="cpp;c;cxx;def;odl;idl;hpj;bat;asm;asmx"
- UniqueIdentifier="{4FC737F1-C7A5-4376-A066-2A32D752A2FF}">
- <File
- RelativePath="..\..\..\test\multiset_test.cpp">
- </File>
- </Filter>
- </Files>
- <Globals>
- </Globals>
-</VisualStudioProject>

Deleted: sandbox/move/libs/intrusive/proj/vc7ide/perf_test/perf_test.vcproj
==============================================================================
--- sandbox/move/libs/intrusive/proj/vc7ide/perf_test/perf_test.vcproj 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,128 +0,0 @@
-<?xml version="1.0" encoding="Windows-1252"?>
-<VisualStudioProject
- ProjectType="Visual C++"
- Version="7.10"
- Name="perf_test"
- ProjectGUID="{910E70E6-2C91-AA67-BF4C-A9C74A309927}"
- Keyword="Win32Proj">
- <Platforms>
- <Platform
- Name="Win32"/>
- </Platforms>
- <Configurations>
- <Configuration
- Name="Debug|Win32"
- OutputDirectory="Debug"
- IntermediateDirectory="Debug"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- Optimization="0"
- AdditionalIncludeDirectories="../../../../../"
- PreprocessorDefinitions="BOOST_DATE_TIME_NO_LIB"
- MinimalRebuild="TRUE"
- BasicRuntimeChecks="3"
- RuntimeLibrary="5"
- DisableLanguageExtensions="FALSE"
- TreatWChar_tAsBuiltInType="TRUE"
- ForceConformanceInForLoopScope="TRUE"
- UsePrecompiledHeader="0"
- WarningLevel="4"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="4"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- OutputFile="$(OutDir)/perf_test.exe"
- LinkIncremental="2"
- GenerateDebugInformation="TRUE"
- ProgramDatabaseFile="$(OutDir)/perf_test.pdb"
- SubSystem="1"
- TargetMachine="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- <Configuration
- Name="Release|Win32"
- OutputDirectory="Release"
- IntermediateDirectory="Release"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- AdditionalIncludeDirectories="../../../../../"
- PreprocessorDefinitions="BOOST_DATE_TIME_NO_LIB"
- RuntimeLibrary="4"
- DisableLanguageExtensions="FALSE"
- UsePrecompiledHeader="0"
- WarningLevel="3"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="3"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- OutputFile="$(OutDir)/perf_test.exe"
- LinkIncremental="1"
- GenerateDebugInformation="TRUE"
- SubSystem="1"
- OptimizeReferences="2"
- EnableCOMDATFolding="2"
- TargetMachine="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- </Configurations>
- <References>
- </References>
- <Files>
- <Filter
- Name="Source Files"
- Filter="cpp;c;cxx;def;odl;idl;hpj;bat;asm;asmx"
- UniqueIdentifier="{43C77EF1-B78A-73C5-7346-2D7522AE2C3F}">
- <File
- RelativePath="..\..\..\perf\perf_list.cpp">
- </File>
- </Filter>
- </Files>
- <Globals>
- </Globals>
-</VisualStudioProject>

Deleted: sandbox/move/libs/intrusive/proj/vc7ide/set/set.vcproj
==============================================================================
--- sandbox/move/libs/intrusive/proj/vc7ide/set/set.vcproj 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,127 +0,0 @@
-<?xml version="1.0" encoding="Windows-1252"?>
-<VisualStudioProject
- ProjectType="Visual C++"
- Version="7.10"
- Name="set"
- ProjectGUID="{960E01F6-92C1-F74A-BCA5-2A9F3B994979}"
- Keyword="Win32Proj">
- <Platforms>
- <Platform
- Name="Win32"/>
- </Platforms>
- <Configurations>
- <Configuration
- Name="Debug|Win32"
- OutputDirectory="Debug"
- IntermediateDirectory="Debug"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- Optimization="0"
- AdditionalIncludeDirectories="../../../../../"
- PreprocessorDefinitions="WIN32;_DEBUG;_CONSOLE"
- MinimalRebuild="TRUE"
- BasicRuntimeChecks="3"
- RuntimeLibrary="5"
- DisableLanguageExtensions="TRUE"
- TreatWChar_tAsBuiltInType="TRUE"
- ForceConformanceInForLoopScope="TRUE"
- UsePrecompiledHeader="0"
- WarningLevel="4"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="4"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- OutputFile="$(OutDir)/set.exe"
- LinkIncremental="2"
- GenerateDebugInformation="TRUE"
- ProgramDatabaseFile="$(OutDir)/set.pdb"
- SubSystem="1"
- TargetMachine="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- <Configuration
- Name="Release|Win32"
- OutputDirectory="Release"
- IntermediateDirectory="Release"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- AdditionalIncludeDirectories="../../../../../"
- PreprocessorDefinitions="WIN32;NDEBUG;_CONSOLE"
- RuntimeLibrary="4"
- UsePrecompiledHeader="0"
- WarningLevel="3"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="3"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- OutputFile="$(OutDir)/set.exe"
- LinkIncremental="1"
- GenerateDebugInformation="TRUE"
- SubSystem="1"
- OptimizeReferences="2"
- EnableCOMDATFolding="2"
- TargetMachine="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- </Configurations>
- <References>
- </References>
- <Files>
- <Filter
- Name="Source Files"
- Filter="cpp;c;cxx;def;odl;idl;hpj;bat;asm;asmx"
- UniqueIdentifier="{4F73C7F1-C745-4726-06A6-2D752AA322FF}">
- <File
- RelativePath="..\..\..\test\set_test.cpp">
- </File>
- </Filter>
- </Files>
- <Globals>
- </Globals>
-</VisualStudioProject>

Deleted: sandbox/move/libs/intrusive/proj/vc7ide/sg_multiset/sg_multiset.vcproj
==============================================================================
--- sandbox/move/libs/intrusive/proj/vc7ide/sg_multiset/sg_multiset.vcproj 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,128 +0,0 @@
-<?xml version="1.0" encoding="Windows-1252"?>
-<VisualStudioProject
- ProjectType="Visual C++"
- Version="7.10"
- Name="sg_multiset"
- ProjectGUID="{07022E76-6CB5-92C1-B47F-A10772A79B43}"
- Keyword="Win32Proj">
- <Platforms>
- <Platform
- Name="Win32"/>
- </Platforms>
- <Configurations>
- <Configuration
- Name="Debug|Win32"
- OutputDirectory="Debug"
- IntermediateDirectory="Debug"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- Optimization="0"
- AdditionalIncludeDirectories="../../../../../"
- PreprocessorDefinitions="WIN32;_DEBUG;_CONSOLE"
- GeneratePreprocessedFile="0"
- MinimalRebuild="TRUE"
- BasicRuntimeChecks="3"
- RuntimeLibrary="5"
- DisableLanguageExtensions="TRUE"
- TreatWChar_tAsBuiltInType="TRUE"
- ForceConformanceInForLoopScope="TRUE"
- UsePrecompiledHeader="0"
- WarningLevel="4"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="4"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- OutputFile="$(OutDir)/sg_multiset.exe"
- LinkIncremental="2"
- GenerateDebugInformation="TRUE"
- ProgramDatabaseFile="$(OutDir)/sg_multiset.pdb"
- SubSystem="1"
- TargetMachine="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- <Configuration
- Name="Release|Win32"
- OutputDirectory="Release"
- IntermediateDirectory="Release"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- AdditionalIncludeDirectories="../../../../../"
- PreprocessorDefinitions="WIN32;NDEBUG;_CONSOLE"
- RuntimeLibrary="4"
- UsePrecompiledHeader="0"
- WarningLevel="3"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="3"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- OutputFile="$(OutDir)/sg_multiset.exe"
- LinkIncremental="1"
- GenerateDebugInformation="TRUE"
- SubSystem="1"
- OptimizeReferences="2"
- EnableCOMDATFolding="2"
- TargetMachine="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- </Configurations>
- <References>
- </References>
- <Files>
- <Filter
- Name="Source Files"
- Filter="cpp;c;cxx;def;odl;idl;hpj;bat;asm;asmx"
- UniqueIdentifier="{7F97AC3C-5426-8CA7-5D74-2B385DAA232F}">
- <File
- RelativePath="..\..\..\test\sg_multiset_test.cpp">
- </File>
- </Filter>
- </Files>
- <Globals>
- </Globals>
-</VisualStudioProject>

Deleted: sandbox/move/libs/intrusive/proj/vc7ide/sg_set/sg_set.vcproj
==============================================================================
--- sandbox/move/libs/intrusive/proj/vc7ide/sg_set/sg_set.vcproj 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,127 +0,0 @@
-<?xml version="1.0" encoding="Windows-1252"?>
-<VisualStudioProject
- ProjectType="Visual C++"
- Version="7.10"
- Name="sg_set"
- ProjectGUID="{1690A9E7-DB57-971C-F24A-09B752A942F7}"
- Keyword="Win32Proj">
- <Platforms>
- <Platform
- Name="Win32"/>
- </Platforms>
- <Configurations>
- <Configuration
- Name="Debug|Win32"
- OutputDirectory="Debug"
- IntermediateDirectory="Debug"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- Optimization="0"
- AdditionalIncludeDirectories="../../../../../"
- PreprocessorDefinitions="WIN32;_DEBUG;_CONSOLE"
- MinimalRebuild="TRUE"
- BasicRuntimeChecks="3"
- RuntimeLibrary="5"
- DisableLanguageExtensions="TRUE"
- TreatWChar_tAsBuiltInType="TRUE"
- ForceConformanceInForLoopScope="TRUE"
- UsePrecompiledHeader="0"
- WarningLevel="4"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="4"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- OutputFile="$(OutDir)/sg_set.exe"
- LinkIncremental="2"
- GenerateDebugInformation="TRUE"
- ProgramDatabaseFile="$(OutDir)/sg_set.pdb"
- SubSystem="1"
- TargetMachine="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- <Configuration
- Name="Release|Win32"
- OutputDirectory="Release"
- IntermediateDirectory="Release"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- AdditionalIncludeDirectories="../../../../../"
- PreprocessorDefinitions="WIN32;NDEBUG;_CONSOLE"
- RuntimeLibrary="4"
- UsePrecompiledHeader="0"
- WarningLevel="3"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="3"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- OutputFile="$(OutDir)/sg_set.exe"
- LinkIncremental="1"
- GenerateDebugInformation="TRUE"
- SubSystem="1"
- OptimizeReferences="2"
- EnableCOMDATFolding="2"
- TargetMachine="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- </Configurations>
- <References>
- </References>
- <Files>
- <Filter
- Name="Source Files"
- Filter="cpp;c;cxx;def;odl;idl;hpj;bat;asm;asmx"
- UniqueIdentifier="{FC770E61-A263-71E5-72AF-2E7D2C33A42A}">
- <File
- RelativePath="..\..\..\test\sg_set_test.cpp">
- </File>
- </Filter>
- </Files>
- <Globals>
- </Globals>
-</VisualStudioProject>

Deleted: sandbox/move/libs/intrusive/proj/vc7ide/slist/slist.vcproj
==============================================================================
--- sandbox/move/libs/intrusive/proj/vc7ide/slist/slist.vcproj 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,127 +0,0 @@
-<?xml version="1.0" encoding="Windows-1252"?>
-<VisualStudioProject
- ProjectType="Visual C++"
- Version="7.10"
- Name="slist"
- ProjectGUID="{5A02061D-3728-4C49-AFC8-0130C1F161C0}"
- Keyword="Win32Proj">
- <Platforms>
- <Platform
- Name="Win32"/>
- </Platforms>
- <Configurations>
- <Configuration
- Name="Debug|Win32"
- OutputDirectory="Debug"
- IntermediateDirectory="Debug"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- Optimization="0"
- AdditionalIncludeDirectories="../../../../../"
- PreprocessorDefinitions="WIN32;_DEBUG;_CONSOLE"
- MinimalRebuild="TRUE"
- BasicRuntimeChecks="3"
- RuntimeLibrary="5"
- DisableLanguageExtensions="TRUE"
- TreatWChar_tAsBuiltInType="TRUE"
- ForceConformanceInForLoopScope="TRUE"
- UsePrecompiledHeader="0"
- WarningLevel="4"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="4"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- OutputFile="$(OutDir)/slist.exe"
- LinkIncremental="2"
- GenerateDebugInformation="TRUE"
- ProgramDatabaseFile="$(OutDir)/slist.pdb"
- SubSystem="1"
- TargetMachine="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- <Configuration
- Name="Release|Win32"
- OutputDirectory="Release"
- IntermediateDirectory="Release"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- AdditionalIncludeDirectories="../../../../../"
- PreprocessorDefinitions="WIN32;NDEBUG;_CONSOLE"
- RuntimeLibrary="4"
- UsePrecompiledHeader="0"
- WarningLevel="3"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="3"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- OutputFile="$(OutDir)/slist.exe"
- LinkIncremental="1"
- GenerateDebugInformation="TRUE"
- SubSystem="1"
- OptimizeReferences="2"
- EnableCOMDATFolding="2"
- TargetMachine="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- </Configurations>
- <References>
- </References>
- <Files>
- <Filter
- Name="Source Files"
- Filter="cpp;c;cxx;def;odl;idl;hpj;bat;asm;asmx"
- UniqueIdentifier="{4FC737F1-C7A5-4376-A066-2A32D752A2FF}">
- <File
- RelativePath="..\..\..\test\slist_test.cpp">
- </File>
- </Filter>
- </Files>
- <Globals>
- </Globals>
-</VisualStudioProject>

Deleted: sandbox/move/libs/intrusive/proj/vc7ide/splay_multiset/splay_multiset.vcproj
==============================================================================
--- sandbox/move/libs/intrusive/proj/vc7ide/splay_multiset/splay_multiset.vcproj 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,128 +0,0 @@
-<?xml version="1.0" encoding="Windows-1252"?>
-<VisualStudioProject
- ProjectType="Visual C++"
- Version="7.10"
- Name="splay_multiset"
- ProjectGUID="{01E70176-B6C5-BF47-2C91-A949077BA323}"
- Keyword="Win32Proj">
- <Platforms>
- <Platform
- Name="Win32"/>
- </Platforms>
- <Configurations>
- <Configuration
- Name="Debug|Win32"
- OutputDirectory="Debug"
- IntermediateDirectory="Debug"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- Optimization="0"
- AdditionalIncludeDirectories="../../../../../"
- PreprocessorDefinitions="WIN32;_DEBUG;_CONSOLE"
- GeneratePreprocessedFile="0"
- MinimalRebuild="TRUE"
- BasicRuntimeChecks="3"
- RuntimeLibrary="5"
- DisableLanguageExtensions="TRUE"
- TreatWChar_tAsBuiltInType="TRUE"
- ForceConformanceInForLoopScope="TRUE"
- UsePrecompiledHeader="0"
- WarningLevel="4"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="4"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- OutputFile="$(OutDir)/splay_multiset.exe"
- LinkIncremental="2"
- GenerateDebugInformation="TRUE"
- ProgramDatabaseFile="$(OutDir)/splay_multiset.pdb"
- SubSystem="1"
- TargetMachine="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- <Configuration
- Name="Release|Win32"
- OutputDirectory="Release"
- IntermediateDirectory="Release"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- AdditionalIncludeDirectories="../../../../../"
- PreprocessorDefinitions="WIN32;NDEBUG;_CONSOLE"
- RuntimeLibrary="4"
- UsePrecompiledHeader="0"
- WarningLevel="3"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="3"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- OutputFile="$(OutDir)/splay_multiset.exe"
- LinkIncremental="1"
- GenerateDebugInformation="TRUE"
- SubSystem="1"
- OptimizeReferences="2"
- EnableCOMDATFolding="2"
- TargetMachine="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- </Configurations>
- <References>
- </References>
- <Files>
- <Filter
- Name="Source Files"
- Filter="cpp;c;cxx;def;odl;idl;hpj;bat;asm;asmx"
- UniqueIdentifier="{C737F9AC-78CA-745E-5426-2DA33852B2FA}">
- <File
- RelativePath="..\..\..\test\splay_multiset_test.cpp">
- </File>
- </Filter>
- </Files>
- <Globals>
- </Globals>
-</VisualStudioProject>

Deleted: sandbox/move/libs/intrusive/proj/vc7ide/splay_set/splay_set.vcproj
==============================================================================
--- sandbox/move/libs/intrusive/proj/vc7ide/splay_set/splay_set.vcproj 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,127 +0,0 @@
-<?xml version="1.0" encoding="Windows-1252"?>
-<VisualStudioProject
- ProjectType="Visual C++"
- Version="7.10"
- Name="splay_set"
- ProjectGUID="{1E6909E7-C971-F24A-6C7B-A92094B71B59}"
- Keyword="Win32Proj">
- <Platforms>
- <Platform
- Name="Win32"/>
- </Platforms>
- <Configurations>
- <Configuration
- Name="Debug|Win32"
- OutputDirectory="Debug"
- IntermediateDirectory="Debug"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- Optimization="0"
- AdditionalIncludeDirectories="../../../../../"
- PreprocessorDefinitions="WIN32;_DEBUG;_CONSOLE"
- MinimalRebuild="TRUE"
- BasicRuntimeChecks="3"
- RuntimeLibrary="5"
- DisableLanguageExtensions="TRUE"
- TreatWChar_tAsBuiltInType="TRUE"
- ForceConformanceInForLoopScope="TRUE"
- UsePrecompiledHeader="0"
- WarningLevel="4"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="4"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- OutputFile="$(OutDir)/splay_set.exe"
- LinkIncremental="2"
- GenerateDebugInformation="TRUE"
- ProgramDatabaseFile="$(OutDir)/splay_set.pdb"
- SubSystem="1"
- TargetMachine="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- <Configuration
- Name="Release|Win32"
- OutputDirectory="Release"
- IntermediateDirectory="Release"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- AdditionalIncludeDirectories="../../../../../"
- PreprocessorDefinitions="WIN32;NDEBUG;_CONSOLE"
- RuntimeLibrary="4"
- UsePrecompiledHeader="0"
- WarningLevel="3"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="3"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- OutputFile="$(OutDir)/splay_set.exe"
- LinkIncremental="1"
- GenerateDebugInformation="TRUE"
- SubSystem="1"
- OptimizeReferences="2"
- EnableCOMDATFolding="2"
- TargetMachine="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- </Configurations>
- <References>
- </References>
- <Files>
- <Filter
- Name="Source Files"
- Filter="cpp;c;cxx;def;odl;idl;hpj;bat;asm;asmx"
- UniqueIdentifier="{FF1C7761-72AF-26A3-71E5-2743AA32D2CA}">
- <File
- RelativePath="..\..\..\test\splay_set_test.cpp">
- </File>
- </Filter>
- </Files>
- <Globals>
- </Globals>
-</VisualStudioProject>

Deleted: sandbox/move/libs/intrusive/proj/vc7ide/stateful_value_traits/stateful_value_traits.vcproj
==============================================================================
--- sandbox/move/libs/intrusive/proj/vc7ide/stateful_value_traits/stateful_value_traits.vcproj 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,133 +0,0 @@
-<?xml version="1.0" encoding="Windows-1252"?>
-<VisualStudioProject
- ProjectType="Visual C++"
- Version="7.10"
- Name="stateful_value_traits"
- ProjectGUID="{9571A7B4-9968-B9C1-17FB-134547B46975}"
- RootNamespace="stateful_value_traits"
- Keyword="Win32Proj">
- <Platforms>
- <Platform
- Name="Win32"/>
- </Platforms>
- <Configurations>
- <Configuration
- Name="Debug|Win32"
- OutputDirectory="Debug"
- IntermediateDirectory="Debug"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- Optimization="0"
- AdditionalIncludeDirectories="../../../../../"
- PreprocessorDefinitions="BOOST_DATE_TIME_NO_LIB"
- GeneratePreprocessedFile="0"
- KeepComments="FALSE"
- MinimalRebuild="TRUE"
- BasicRuntimeChecks="3"
- RuntimeLibrary="5"
- DisableLanguageExtensions="TRUE"
- TreatWChar_tAsBuiltInType="TRUE"
- ForceConformanceInForLoopScope="TRUE"
- UsePrecompiledHeader="0"
- WarningLevel="4"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="4"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- OutputFile="$(OutDir)/stateful_value_traits.exe"
- LinkIncremental="2"
- GenerateDebugInformation="TRUE"
- ProgramDatabaseFile="$(OutDir)/stateful_value_traits.pdb"
- GenerateMapFile="TRUE"
- SubSystem="1"
- TargetMachine="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- <Configuration
- Name="Release|Win32"
- OutputDirectory="Release"
- IntermediateDirectory="Release"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- AdditionalIncludeDirectories="../../../../../"
- PreprocessorDefinitions="BOOST_DATE_TIME_NO_LIB"
- RuntimeLibrary="4"
- DisableLanguageExtensions="FALSE"
- ForceConformanceInForLoopScope="TRUE"
- UsePrecompiledHeader="0"
- WarningLevel="3"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="3"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- OutputFile="$(OutDir)/stateful_value_traits.exe"
- LinkIncremental="1"
- GenerateDebugInformation="TRUE"
- SubSystem="1"
- OptimizeReferences="2"
- EnableCOMDATFolding="2"
- TargetMachine="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- </Configurations>
- <References>
- </References>
- <Files>
- <Filter
- Name="Source Files"
- Filter="cpp;c;cxx;def;odl;idl;hpj;bat;asm;asmx"
- UniqueIdentifier="{C7F4F831-AB76-7634-16A6-2A37523FB75A}">
- <File
- RelativePath="..\..\..\test\stateful_value_traits_test.cpp">
- </File>
- </Filter>
- </Files>
- <Globals>
- </Globals>
-</VisualStudioProject>

Deleted: sandbox/move/libs/intrusive/proj/vc7ide/to-do.txt
==============================================================================
--- sandbox/move/libs/intrusive/proj/vc7ide/to-do.txt 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,17 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2006-2009
-//
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
--> Implement C++0x features (rvalue references)
--> Offer bidirectional iterator for hashtables
--> Non-array buckets
--> Document incremental<> option better
--> Assure stable order for optimize_multikey and inverse order otherwise
--> add an option to unordered containers to get O(1) traversal and begin()/end() even with very low load factors

Deleted: sandbox/move/libs/intrusive/proj/vc7ide/treap_multiset/treap_multiset.vcproj
==============================================================================
--- sandbox/move/libs/intrusive/proj/vc7ide/treap_multiset/treap_multiset.vcproj 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,127 +0,0 @@
-<?xml version="1.0" encoding="Windows-1252"?>
-<VisualStudioProject
- ProjectType="Visual C++"
- Version="7.10"
- Name="treap_multiset"
- ProjectGUID="{16E09E95-F4A2-C971-BC76-9BA407191C59}"
- Keyword="Win32Proj">
- <Platforms>
- <Platform
- Name="Win32"/>
- </Platforms>
- <Configurations>
- <Configuration
- Name="Debug|Win32"
- OutputDirectory="Debug"
- IntermediateDirectory="Debug"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- Optimization="0"
- AdditionalIncludeDirectories="../../../../../"
- PreprocessorDefinitions="WIN32;_DEBUG;_CONSOLE"
- MinimalRebuild="TRUE"
- BasicRuntimeChecks="3"
- RuntimeLibrary="5"
- DisableLanguageExtensions="TRUE"
- TreatWChar_tAsBuiltInType="TRUE"
- ForceConformanceInForLoopScope="TRUE"
- UsePrecompiledHeader="0"
- WarningLevel="4"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="4"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- OutputFile="$(OutDir)/treap_multiset.exe"
- LinkIncremental="2"
- GenerateDebugInformation="TRUE"
- ProgramDatabaseFile="$(OutDir)/treap_multiset.pdb"
- SubSystem="1"
- TargetMachine="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- <Configuration
- Name="Release|Win32"
- OutputDirectory="Release"
- IntermediateDirectory="Release"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- AdditionalIncludeDirectories="../../../../../"
- PreprocessorDefinitions="WIN32;NDEBUG;_CONSOLE"
- RuntimeLibrary="4"
- UsePrecompiledHeader="0"
- WarningLevel="3"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="3"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- OutputFile="$(OutDir)/treap_multiset.exe"
- LinkIncremental="1"
- GenerateDebugInformation="TRUE"
- SubSystem="1"
- OptimizeReferences="2"
- EnableCOMDATFolding="2"
- TargetMachine="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- </Configurations>
- <References>
- </References>
- <Files>
- <Filter
- Name="Source Files"
- Filter="cpp;c;cxx;def;odl;idl;hpj;bat;asm;asmx"
- UniqueIdentifier="{F0B77631-E357-26F3-A4F5-2FA254B7E734}">
- <File
- RelativePath="..\..\..\test\treap_multiset_test.cpp">
- </File>
- </Filter>
- </Files>
- <Globals>
- </Globals>
-</VisualStudioProject>

Deleted: sandbox/move/libs/intrusive/proj/vc7ide/treap_set/treap_set.vcproj
==============================================================================
--- sandbox/move/libs/intrusive/proj/vc7ide/treap_set/treap_set.vcproj 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,127 +0,0 @@
-<?xml version="1.0" encoding="Windows-1252"?>
-<VisualStudioProject
- ProjectType="Visual C++"
- Version="7.10"
- Name="treap_set"
- ProjectGUID="{1E09E697-4A2F-BC76-7C91-2BA479B29159}"
- Keyword="Win32Proj">
- <Platforms>
- <Platform
- Name="Win32"/>
- </Platforms>
- <Configurations>
- <Configuration
- Name="Debug|Win32"
- OutputDirectory="Debug"
- IntermediateDirectory="Debug"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- Optimization="0"
- AdditionalIncludeDirectories="../../../../../"
- PreprocessorDefinitions="WIN32;_DEBUG;_CONSOLE"
- MinimalRebuild="TRUE"
- BasicRuntimeChecks="3"
- RuntimeLibrary="5"
- DisableLanguageExtensions="TRUE"
- TreatWChar_tAsBuiltInType="TRUE"
- ForceConformanceInForLoopScope="TRUE"
- UsePrecompiledHeader="0"
- WarningLevel="4"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="4"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- OutputFile="$(OutDir)/treap_set.exe"
- LinkIncremental="2"
- GenerateDebugInformation="TRUE"
- ProgramDatabaseFile="$(OutDir)/treap_set.pdb"
- SubSystem="1"
- TargetMachine="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- <Configuration
- Name="Release|Win32"
- OutputDirectory="Release"
- IntermediateDirectory="Release"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- AdditionalIncludeDirectories="../../../../../"
- PreprocessorDefinitions="WIN32;NDEBUG;_CONSOLE"
- RuntimeLibrary="4"
- UsePrecompiledHeader="0"
- WarningLevel="3"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="3"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- OutputFile="$(OutDir)/treap_set.exe"
- LinkIncremental="1"
- GenerateDebugInformation="TRUE"
- SubSystem="1"
- OptimizeReferences="2"
- EnableCOMDATFolding="2"
- TargetMachine="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- </Configurations>
- <References>
- </References>
- <Files>
- <Filter
- Name="Source Files"
- Filter="cpp;c;cxx;def;odl;idl;hpj;bat;asm;asmx"
- UniqueIdentifier="{FB776C10-E357-A4F5-326F-42A2D7254B3F}">
- <File
- RelativePath="..\..\..\test\treap_set_test.cpp">
- </File>
- </Filter>
- </Files>
- <Globals>
- </Globals>
-</VisualStudioProject>

Deleted: sandbox/move/libs/intrusive/proj/vc7ide/unordered_multiset/unordered_multiset.vcproj
==============================================================================
--- sandbox/move/libs/intrusive/proj/vc7ide/unordered_multiset/unordered_multiset.vcproj 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,128 +0,0 @@
-<?xml version="1.0" encoding="Windows-1252"?>
-<VisualStudioProject
- ProjectType="Visual C++"
- Version="7.10"
- Name="unordered_multiset"
- ProjectGUID="{9101EE76-BB6C-2C91-F4B7-A9F3B9490279}"
- Keyword="Win32Proj">
- <Platforms>
- <Platform
- Name="Win32"/>
- </Platforms>
- <Configurations>
- <Configuration
- Name="Debug|Win32"
- OutputDirectory="Debug"
- IntermediateDirectory="Debug"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- Optimization="0"
- AdditionalIncludeDirectories="../../../../../"
- PreprocessorDefinitions="WIN32;_DEBUG;_CONSOLE"
- GeneratePreprocessedFile="0"
- MinimalRebuild="TRUE"
- BasicRuntimeChecks="3"
- RuntimeLibrary="5"
- DisableLanguageExtensions="TRUE"
- TreatWChar_tAsBuiltInType="TRUE"
- ForceConformanceInForLoopScope="TRUE"
- UsePrecompiledHeader="0"
- WarningLevel="4"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="4"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- OutputFile="$(OutDir)/unordered_multiset.exe"
- LinkIncremental="2"
- GenerateDebugInformation="TRUE"
- ProgramDatabaseFile="$(OutDir)/unordered_multiset.pdb"
- SubSystem="1"
- TargetMachine="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- <Configuration
- Name="Release|Win32"
- OutputDirectory="Release"
- IntermediateDirectory="Release"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- AdditionalIncludeDirectories="../../../../../"
- PreprocessorDefinitions="WIN32;NDEBUG;_CONSOLE"
- RuntimeLibrary="4"
- UsePrecompiledHeader="0"
- WarningLevel="3"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="3"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- OutputFile="$(OutDir)/unordered_multiset.exe"
- LinkIncremental="1"
- GenerateDebugInformation="TRUE"
- SubSystem="1"
- OptimizeReferences="2"
- EnableCOMDATFolding="2"
- TargetMachine="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- </Configurations>
- <References>
- </References>
- <Files>
- <Filter
- Name="Source Files"
- Filter="cpp;c;cxx;def;odl;idl;hpj;bat;asm;asmx"
- UniqueIdentifier="{4F3C77F1-B78A-C745-4726-2D752AA322FF}">
- <File
- RelativePath="..\..\..\test\unordered_multiset_test.cpp">
- </File>
- </Filter>
- </Files>
- <Globals>
- </Globals>
-</VisualStudioProject>

Deleted: sandbox/move/libs/intrusive/proj/vc7ide/unordered_set/unordered_set.vcproj
==============================================================================
--- sandbox/move/libs/intrusive/proj/vc7ide/unordered_set/unordered_set.vcproj 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,128 +0,0 @@
-<?xml version="1.0" encoding="Windows-1252"?>
-<VisualStudioProject
- ProjectType="Visual C++"
- Version="7.10"
- Name="unordered_set"
- ProjectGUID="{9101EE76-BB6C-2C91-F4B7-A27B94908F19}"
- Keyword="Win32Proj">
- <Platforms>
- <Platform
- Name="Win32"/>
- </Platforms>
- <Configurations>
- <Configuration
- Name="Debug|Win32"
- OutputDirectory="Debug"
- IntermediateDirectory="Debug"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- Optimization="0"
- AdditionalIncludeDirectories="../../../../../"
- PreprocessorDefinitions="WIN32;_DEBUG;_CONSOLE"
- GeneratePreprocessedFile="0"
- MinimalRebuild="TRUE"
- BasicRuntimeChecks="3"
- RuntimeLibrary="5"
- DisableLanguageExtensions="TRUE"
- TreatWChar_tAsBuiltInType="TRUE"
- ForceConformanceInForLoopScope="TRUE"
- UsePrecompiledHeader="0"
- WarningLevel="4"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="4"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- OutputFile="$(OutDir)/unordered_set.exe"
- LinkIncremental="2"
- GenerateDebugInformation="TRUE"
- ProgramDatabaseFile="$(OutDir)/unordered_set.pdb"
- SubSystem="1"
- TargetMachine="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- <Configuration
- Name="Release|Win32"
- OutputDirectory="Release"
- IntermediateDirectory="Release"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- AdditionalIncludeDirectories="../../../../../"
- PreprocessorDefinitions="WIN32;NDEBUG;_CONSOLE"
- RuntimeLibrary="4"
- UsePrecompiledHeader="0"
- WarningLevel="3"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="3"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- OutputFile="$(OutDir)/unordered_set.exe"
- LinkIncremental="1"
- GenerateDebugInformation="TRUE"
- SubSystem="1"
- OptimizeReferences="2"
- EnableCOMDATFolding="2"
- TargetMachine="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- </Configurations>
- <References>
- </References>
- <Files>
- <Filter
- Name="Source Files"
- Filter="cpp;c;cxx;def;odl;idl;hpj;bat;asm;asmx"
- UniqueIdentifier="{4F3C77F1-B78A-C745-4726-252AD75C322E}">
- <File
- RelativePath="..\..\..\test\unordered_set_test.cpp">
- </File>
- </Filter>
- </Files>
- <Globals>
- </Globals>
-</VisualStudioProject>

Deleted: sandbox/move/libs/intrusive/proj/vc7ide/virtual_base/virtual_base.vcproj
==============================================================================
--- sandbox/move/libs/intrusive/proj/vc7ide/virtual_base/virtual_base.vcproj 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,133 +0,0 @@
-<?xml version="1.0" encoding="Windows-1252"?>
-<VisualStudioProject
- ProjectType="Visual C++"
- Version="7.10"
- Name="virtual_base"
- ProjectGUID="{3579B1A4-9894-02AB-CB81-297B46154345}"
- RootNamespace="virtual_base"
- Keyword="Win32Proj">
- <Platforms>
- <Platform
- Name="Win32"/>
- </Platforms>
- <Configurations>
- <Configuration
- Name="Debug|Win32"
- OutputDirectory="Debug"
- IntermediateDirectory="Debug"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- Optimization="0"
- AdditionalIncludeDirectories="../../../../../"
- PreprocessorDefinitions="BOOST_DATE_TIME_NO_LIB"
- GeneratePreprocessedFile="0"
- KeepComments="FALSE"
- MinimalRebuild="TRUE"
- BasicRuntimeChecks="3"
- RuntimeLibrary="5"
- DisableLanguageExtensions="TRUE"
- TreatWChar_tAsBuiltInType="TRUE"
- ForceConformanceInForLoopScope="TRUE"
- UsePrecompiledHeader="0"
- WarningLevel="4"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="4"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- OutputFile="$(OutDir)/virtual_base.exe"
- LinkIncremental="2"
- GenerateDebugInformation="TRUE"
- ProgramDatabaseFile="$(OutDir)/virtual_base.pdb"
- GenerateMapFile="TRUE"
- SubSystem="1"
- TargetMachine="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- <Configuration
- Name="Release|Win32"
- OutputDirectory="Release"
- IntermediateDirectory="Release"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- AdditionalIncludeDirectories="../../../../../"
- PreprocessorDefinitions="BOOST_DATE_TIME_NO_LIB"
- RuntimeLibrary="4"
- DisableLanguageExtensions="FALSE"
- ForceConformanceInForLoopScope="TRUE"
- UsePrecompiledHeader="0"
- WarningLevel="3"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="3"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- OutputFile="$(OutDir)/virtual_base.exe"
- LinkIncremental="1"
- GenerateDebugInformation="TRUE"
- SubSystem="1"
- OptimizeReferences="2"
- EnableCOMDATFolding="2"
- TargetMachine="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- </Configurations>
- <References>
- </References>
- <Files>
- <Filter
- Name="Source Files"
- Filter="cpp;c;cxx;def;odl;idl;hpj;bat;asm;asmx"
- UniqueIdentifier="{75137BAF-6764-7AB5-3A06-25A73D48B7FC}">
- <File
- RelativePath="..\..\..\test\virtual_base_test.cpp">
- </File>
- </Filter>
- </Files>
- <Globals>
- </Globals>
-</VisualStudioProject>

Deleted: sandbox/move/libs/intrusive/test/Jamfile.v2
==============================================================================
--- sandbox/move/libs/intrusive/test/Jamfile.v2 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,33 +0,0 @@
-# Boost Intrusive Library Test Jamfile
-# (C) Copyright Ion Gaztanaga 2006.
-# Use, modification and distribution are subject to the
-# Boost Software License, Version 1.0. (See accompanying file
-# LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-
-# Adapted from John Maddock's TR1 Jamfile.v2
-# Copyright John Maddock 2005.
-# Use, modification and distribution are subject to the
-# Boost Software License, Version 1.0. (See accompanying file
-# LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-
-# this rule enumerates through all the sources and invokes
-# the run rule for each source, the result is a list of all
-# the run rules, which we can pass on to the test_suite rule:
-
-rule test_all
-{
- local all_rules = ;
-
- for local fileb in [ glob *.cpp ]
- {
- all_rules += [ run $(fileb)
- : # additional args
- : # test-files
- : # requirements
- ] ;
- }
-
- return $(all_rules) ;
-}
-
-test-suite intrusive_test : [ test_all r ] : <threading>multi ;
\ No newline at end of file

Deleted: sandbox/move/libs/intrusive/test/any_test.cpp
==============================================================================
--- sandbox/move/libs/intrusive/test/any_test.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,191 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Olaf Krzikalla 2004-2006.
-// (C) Copyright Ion Gaztanaga 2006-2009.
-//
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-#include<boost/intrusive/detail/config_begin.hpp>
-#include<boost/intrusive/any_hook.hpp>
-#include<boost/intrusive/slist.hpp>
-#include<boost/intrusive/rbtree.hpp>
-#include<boost/intrusive/list.hpp>
-#include<boost/intrusive/avltree.hpp>
-#include<boost/intrusive/sgtree.hpp>
-#include<boost/intrusive/splaytree.hpp>
-#include<boost/intrusive/treap.hpp>
-#include<boost/intrusive/hashtable.hpp>
-#include<boost/functional/hash.hpp>
-#include <vector> //std::vector
-#include <cstddef> //std::size_t
-
-using namespace boost::intrusive;
-
-class MyClass : public any_base_hook<>
-{
- int int_;
-
- public:
- //This is a member hook
- any_member_hook<> member_hook_;
-
- MyClass(int i = 0)
- : int_(i)
- {}
-
- int get() const
- { return this->int_; }
-
- friend bool operator < (const MyClass &l, const MyClass &r)
- { return l.int_ < r.int_; }
-
- friend bool operator == (const MyClass &l, const MyClass &r)
- { return l.int_ == r.int_; }
-
- friend std::size_t hash_value(const MyClass &o)
- { return boost::hash<int>()(o.get()); }
-
- friend bool priority_order(const MyClass &a, const MyClass &b)
- { return a.int_ < b.int_; }
-};
-
-
-void instantiation_test()
-{
- typedef member_hook< MyClass, any_member_hook<>, &MyClass::member_hook_> MemberHook;
- typedef base_hook< any_base_hook<> > BaseHook;
-
- MyClass myclass;
- {
- slist < MyClass, any_to_slist_hook< BaseHook > > slist_base;
- slist_base.push_front(myclass);
- }
- {
- slist < MyClass, any_to_slist_hook< MemberHook > > slist_member;
- slist_member.push_front(myclass);
- }
- {
- list < MyClass, any_to_list_hook< BaseHook > > list_base;
- list_base.push_front(myclass);
- }
- {
- list < MyClass, any_to_list_hook< MemberHook > > list_member;
- list_member.push_front(myclass);
- }
- {
- rbtree < MyClass, any_to_set_hook< BaseHook > > rbtree_base;
- rbtree_base.insert_unique(myclass);
- }
- {
- rbtree < MyClass, any_to_set_hook< MemberHook > > rbtree_member;
- rbtree_member.insert_unique(myclass);
- }
- {
- avltree < MyClass, any_to_avl_set_hook< BaseHook > > avltree_base;
- avltree_base.insert_unique(myclass);
- }
- {
- avltree < MyClass, any_to_avl_set_hook< MemberHook > > avltree_member;
- avltree_member.insert_unique(myclass);
- }
- {
- sgtree < MyClass, any_to_bs_set_hook< BaseHook > > sgtree_base;
- sgtree_base.insert_unique(myclass);
- }
- {
- sgtree < MyClass, any_to_bs_set_hook< MemberHook > > sgtree_member;
- sgtree_member.insert_unique(myclass);
- }
- {
- treap < MyClass, any_to_bs_set_hook< BaseHook > > treap_base;
- treap_base.insert_unique(myclass);
- }
- {
- treap < MyClass, any_to_bs_set_hook< MemberHook > > treap_member;
- treap_member.insert_unique(myclass);
- }
- {
- splaytree < MyClass, any_to_bs_set_hook< BaseHook > > splaytree_base;
- splaytree_base.insert_unique(myclass);
- }
- {
- splaytree < MyClass, any_to_bs_set_hook< MemberHook > > splaytree_member;
- splaytree_member.insert_unique(myclass);
- }
- typedef unordered_bucket<any_to_unordered_set_hook< BaseHook > >::type bucket_type;
- typedef unordered_default_bucket_traits<any_to_unordered_set_hook< BaseHook > >::type bucket_traits;
- bucket_type buckets[2];
- {
- hashtable < MyClass, any_to_unordered_set_hook< BaseHook > >
- hashtable_base(bucket_traits(&buckets[0], 1));
- hashtable_base.insert_unique(myclass);
- }
- {
- hashtable < MyClass, any_to_unordered_set_hook< MemberHook > >
- hashtable_member(bucket_traits(&buckets[1], 1));
- hashtable_member.insert_unique(myclass);
- }
-}
-
-bool simple_slist_test()
-{
- //Define an slist that will store MyClass using the public base hook
- typedef any_to_slist_hook< base_hook< any_base_hook<> > >BaseOption;
- typedef slist<MyClass, BaseOption, constant_time_size<false> > BaseList;
-
- //Define an slist that will store MyClass using the public member hook
- typedef any_to_slist_hook< member_hook<MyClass, any_member_hook<>, &MyClass::member_hook_> > MemberOption;
- typedef slist<MyClass, MemberOption> MemberList;
-
- typedef std::vector<MyClass>::iterator VectIt;
- typedef std::vector<MyClass>::reverse_iterator VectRit;
-
- //Create several MyClass objects, each one with a different value
- std::vector<MyClass> values;
- for(int i = 0; i < 100; ++i) values.push_back(MyClass(i));
-
- BaseList baselist;
- MemberList memberlist;
-
- //Now insert them in the reverse order in the base hook list
- for(VectIt it(values.begin()), itend(values.end()); it != itend; ++it)
- baselist.push_front(*it);
-
- //Now insert them in the same order as in vector in the member hook list
- for(BaseList::iterator it(baselist.begin()), itend(baselist.end())
- ; it != itend; ++it){
- memberlist.push_front(*it);
- }
-
- //Now test lists
- {
- BaseList::iterator bit(baselist.begin()), bitend(baselist.end());
- MemberList::iterator mit(memberlist.begin()), mitend(memberlist.end());
- VectRit rit(values.rbegin()), ritend(values.rend());
- VectIt it(values.begin()), itend(values.end());
-
- //Test the objects inserted in the base hook list
- for(; rit != ritend; ++rit, ++bit)
- if(&*bit != &*rit) return false;
-
- //Test the objects inserted in the member hook list
- for(; it != itend; ++it, ++mit)
- if(&*mit != &*it) return false;
- }
- return true;
-}
-
-int main()
-{
- if(!simple_slist_test())
- return 1;
- instantiation_test();
- return 0;
-}
-
-#include <boost/intrusive/detail/config_end.hpp>

Deleted: sandbox/move/libs/intrusive/test/avl_multiset_test.cpp
==============================================================================
--- sandbox/move/libs/intrusive/test/avl_multiset_test.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,158 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Olaf Krzikalla 2004-2006.
-// (C) Copyright Ion Gaztanaga 2006-2009.
-//
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-#include <boost/intrusive/detail/config_begin.hpp>
-#include <boost/intrusive/avl_set.hpp>
-#include <boost/intrusive/detail/pointer_to_other.hpp>
-#include "itestvalue.hpp"
-#include "smart_ptr.hpp"
-#include "generic_multiset_test.hpp"
-
-namespace boost { namespace intrusive { namespace test {
-
-#if !defined (BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template<class T, class O1, class O2, class O3, class O4>
-#else
-template<class T, class ...Options>
-#endif
-struct has_insert_before<boost::intrusive::avl_multiset<T,
- #if !defined (BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
- O1, O2, O3, O4
- #else
- Options...
- #endif
-> >
-{
- static const bool value = true;
-};
-
-}}}
-
-using namespace boost::intrusive;
-
-struct my_tag;
-
-template<class VoidPointer>
-struct hooks
-{
- typedef avl_set_base_hook<void_pointer<VoidPointer> > base_hook_type;
- typedef avl_set_base_hook
- <link_mode<auto_unlink>
- , void_pointer<VoidPointer>
- , tag<my_tag>
- , optimize_size<true> > auto_base_hook_type;
- typedef avl_set_member_hook
- <void_pointer<VoidPointer> > member_hook_type;
- typedef avl_set_member_hook
- < link_mode<auto_unlink>
- , void_pointer<VoidPointer> > auto_member_hook_type;
-};
-
-template< class ValueType
- , class Option1 = boost::intrusive::none
- , class Option2 = boost::intrusive::none
- , class Option3 = boost::intrusive::none
- >
-struct GetContainer
-{
- typedef boost::intrusive::avl_multiset
- < ValueType
- , Option1
- , Option2
- , Option3
- > type;
-};
-
-template<class VoidPointer, bool constant_time_size>
-class test_main_template
-{
- public:
- int operator()()
- {
- using namespace boost::intrusive;
- typedef testvalue<hooks<VoidPointer> , constant_time_size> value_type;
-
- test::test_generic_multiset < typename detail::get_base_value_traits
- < value_type
- , typename hooks<VoidPointer>::base_hook_type
- >::type
- , GetContainer
- >::test_all();
- test::test_generic_multiset < typename detail::get_member_value_traits
- < value_type
- , member_hook< value_type
- , typename hooks<VoidPointer>::member_hook_type
- , &value_type::node_
- >
- >::type
- , GetContainer
- >::test_all();
- return 0;
- }
-};
-
-template<class VoidPointer>
-class test_main_template<VoidPointer, false>
-{
- public:
- int operator()()
- {
- using namespace boost::intrusive;
- typedef testvalue<hooks<VoidPointer> , false> value_type;
-
- test::test_generic_multiset < typename detail::get_base_value_traits
- < value_type
- , typename hooks<VoidPointer>::base_hook_type
- >::type
- , GetContainer
- >::test_all();
-
- test::test_generic_multiset < typename detail::get_member_value_traits
- < value_type
- , member_hook< value_type
- , typename hooks<VoidPointer>::member_hook_type
- , &value_type::node_
- >
- >::type
- , GetContainer
- >::test_all();
-
- test::test_generic_multiset < typename detail::get_base_value_traits
- < value_type
- , typename hooks<VoidPointer>::auto_base_hook_type
- >::type
- , GetContainer
- >::test_all();
-
- test::test_generic_multiset < typename detail::get_member_value_traits
- < value_type
- , member_hook< value_type
- , typename hooks<VoidPointer>::auto_member_hook_type
- , &value_type::auto_node_
- >
- >::type
- , GetContainer
- >::test_all();
- return 0;
- }
-};
-
-int main( int, char* [] )
-{
- test_main_template<void*, false>()();
- test_main_template<boost::intrusive::smart_ptr<void>, false>()();
- test_main_template<void*, true>()();
- test_main_template<boost::intrusive::smart_ptr<void>, true>()();
- return boost::report_errors();
-}
-
-#include <boost/intrusive/detail/config_end.hpp>

Deleted: sandbox/move/libs/intrusive/test/avl_set_test.cpp
==============================================================================
--- sandbox/move/libs/intrusive/test/avl_set_test.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,160 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Olaf Krzikalla 2004-2006.
-// (C) Copyright Ion Gaztanaga 2006-2009.
-//
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-#include <boost/intrusive/detail/config_begin.hpp>
-#include <boost/intrusive/avl_set.hpp>
-#include "itestvalue.hpp"
-#include "smart_ptr.hpp"
-#include "generic_set_test.hpp"
-
-namespace boost { namespace intrusive { namespace test {
-
-#if !defined (BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template<class T, class O1, class O2, class O3, class O4>
-#else
-template<class T, class ...Options>
-#endif
-struct has_insert_before<boost::intrusive::avl_set<T,
- #if !defined (BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
- O1, O2, O3, O4
- #else
- Options...
- #endif
-> >
-{
- static const bool value = true;
-};
-
-}}}
-
-
-using namespace boost::intrusive;
-
-struct my_tag;
-
-template<class VoidPointer>
-struct hooks
-{
- typedef avl_set_base_hook<void_pointer<VoidPointer> > base_hook_type;
- typedef avl_set_base_hook
- <link_mode<auto_unlink>
- , void_pointer<VoidPointer>
- , tag<my_tag>
- , optimize_size<true> > auto_base_hook_type;
- typedef avl_set_member_hook
- <void_pointer<VoidPointer> > member_hook_type;
- typedef avl_set_member_hook
- < link_mode<auto_unlink>
- , void_pointer<VoidPointer> > auto_member_hook_type;
-};
-
-template< class ValueType
- , class Option1 = boost::intrusive::none
- , class Option2 = boost::intrusive::none
- , class Option3 = boost::intrusive::none
- >
-struct GetContainer
-{
- typedef boost::intrusive::avl_set
- < ValueType
- , Option1
- , Option2
- , Option3
- > type;
-};
-
-template<class VoidPointer, bool constant_time_size>
-class test_main_template
-{
- public:
- int operator()()
- {
- using namespace boost::intrusive;
- typedef testvalue<hooks<VoidPointer> , constant_time_size> value_type;
-
- test::test_generic_set < typename detail::get_base_value_traits
- < value_type
- , typename hooks<VoidPointer>::base_hook_type
- >::type
- , GetContainer
- >::test_all();
- test::test_generic_set < typename detail::get_member_value_traits
- < value_type
- , member_hook< value_type
- , typename hooks<VoidPointer>::member_hook_type
- , &value_type::node_
- >
- >::type
- , GetContainer
- >::test_all();
- return 0;
- }
-};
-
-template<class VoidPointer>
-class test_main_template<VoidPointer, false>
-{
- public:
- int operator()()
- {
- using namespace boost::intrusive;
- typedef testvalue<hooks<VoidPointer> , false> value_type;
-
- test::test_generic_set < typename detail::get_base_value_traits
- < value_type
- , typename hooks<VoidPointer>::base_hook_type
- >::type
- , GetContainer
- >::test_all();
-
- test::test_generic_set < typename detail::get_member_value_traits
- < value_type
- , member_hook< value_type
- , typename hooks<VoidPointer>::member_hook_type
- , &value_type::node_
- >
- >::type
- , GetContainer
- >::test_all();
-
- test::test_generic_set < typename detail::get_base_value_traits
- < value_type
- , typename hooks<VoidPointer>::auto_base_hook_type
- >::type
- , GetContainer
- >::test_all();
-
- test::test_generic_set < typename detail::get_member_value_traits
- < value_type
- , member_hook< value_type
- , typename hooks<VoidPointer>::auto_member_hook_type
- , &value_type::auto_node_
- >
- >::type
- , GetContainer
- >::test_all();
-
- return 0;
- }
-};
-
-int main( int, char* [] )
-{
- test_main_template<void*, false>()();
- test_main_template<boost::intrusive::smart_ptr<void>, false>()();
- test_main_template<void*, true>()();
- test_main_template<boost::intrusive::smart_ptr<void>, true>()();
-
- return boost::report_errors();
-}
-
-#include <boost/intrusive/detail/config_end.hpp>

Deleted: sandbox/move/libs/intrusive/test/common_functors.hpp
==============================================================================
--- sandbox/move/libs/intrusive/test/common_functors.hpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,56 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2006-2009
-//
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTRUSIVE_TEST_COMMON_FUNCTORS_HPP
-#define BOOST_INTRUSIVE_TEST_COMMON_FUNCTORS_HPP
-
-#include<boost/intrusive/detail/utilities.hpp>
-#include<boost/intrusive/detail/mpl.hpp>
-
-namespace boost {
-namespace intrusive {
-namespace test {
-
-template<class T>
-class delete_disposer
-{
- public:
- template <class Pointer>
- void operator()(Pointer p)
- {
- typedef typename std::iterator_traits<Pointer>::value_type value_type;
- BOOST_INTRUSIVE_INVARIANT_ASSERT(( detail::is_same<T, value_type>::value ));
- delete detail::boost_intrusive_get_pointer(p);
- }
-};
-
-template<class T>
-class new_cloner
-{
- public:
- T *operator()(const T &t)
- { return new T(t); }
-};
-
-template<class T>
-class new_default_factory
-{
- public:
- T *operator()()
- { return new T(); }
-};
-
-} //namespace test {
-} //namespace intrusive {
-} //namespace boost {
-
-#endif

Deleted: sandbox/move/libs/intrusive/test/custom_bucket_traits_test.cpp
==============================================================================
--- sandbox/move/libs/intrusive/test/custom_bucket_traits_test.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,127 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2007-2009
-//
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-#include <boost/intrusive/unordered_set.hpp>
-#include <boost/intrusive/detail/mpl.hpp>
-#include <boost/functional/hash.hpp>
-#include <vector>
-
-using namespace boost::intrusive;
-
-class MyClass : public unordered_set_base_hook<>
-{
- int int_;
-
- public:
- MyClass(int i = 0) : int_(i)
- {}
- unordered_set_member_hook<> member_hook_;
-
- friend bool operator==(const MyClass &l, const MyClass &r)
- { return l.int_ == r.int_; }
-
- friend std::size_t hash_value(const MyClass &v)
- { return boost::hash_value(v.int_); }
-};
-
-struct uset_value_traits
-{
- typedef slist_node_traits<void*> node_traits;
- typedef node_traits::node_ptr node_ptr;
- typedef node_traits::const_node_ptr const_node_ptr;
- typedef MyClass value_type;
- typedef MyClass * pointer;
- typedef const MyClass * const_pointer;
- static const link_mode_type link_mode = normal_link;
-
- static node_ptr to_node_ptr (value_type &value)
- { return node_ptr(&value); }
- static const_node_ptr to_node_ptr (const value_type &value)
- { return const_node_ptr(&value); }
- static pointer to_value_ptr(node_ptr n)
- { return static_cast<value_type*>(n); }
- static const_pointer to_value_ptr(const_node_ptr n)
- { return static_cast<const value_type*>(n); }
-};
-
-//Base
-typedef base_hook< unordered_set_base_hook<> > BaseHook;
-typedef unordered_bucket<BaseHook>::type BaseBucketType;
-typedef unordered_set<MyClass, BaseHook> BaseUset;
-//Member
-typedef member_hook
- < MyClass, unordered_set_member_hook<>
- , &MyClass::member_hook_ > MemberHook;
-typedef unordered_bucket<MemberHook>::type MemberBucketType;
-typedef unordered_set<MyClass, MemberHook> MemberUset;
-//Explicit
-typedef value_traits< uset_value_traits > Traits;
-typedef unordered_bucket<Traits>::type TraitsBucketType;
-typedef unordered_set<MyClass, Traits> TraitsUset;
-
-struct uset_bucket_traits
-{
- //Power of two bucket length
- static const std::size_t NumBuckets = 128;
-
- uset_bucket_traits(BaseBucketType *buckets)
- : buckets_(buckets)
- {}
-
- uset_bucket_traits(const uset_bucket_traits &other)
- : buckets_(other.buckets_)
- {}
-
- BaseBucketType * bucket_begin() const
- { return buckets_; }
-
- std::size_t bucket_count() const
- { return NumBuckets; }
-
- BaseBucketType *buckets_;
-};
-
-typedef unordered_set
- <MyClass, bucket_traits<uset_bucket_traits>, power_2_buckets<true> >
- BucketTraitsUset;
-
-int main()
-{
- if(!detail::is_same<BaseUset::bucket_type, BaseBucketType>::value)
- return 1;
- if(!detail::is_same<MemberUset::bucket_type, MemberBucketType>::value)
- return 1;
- if(!detail::is_same<TraitsUset::bucket_type, TraitsBucketType>::value)
- return 1;
- if(!detail::is_same<BaseBucketType, MemberBucketType>::value)
- return 1;
- if(!detail::is_same<BaseBucketType, TraitsBucketType>::value)
- return 1;
-
- typedef std::vector<MyClass>::iterator VectIt;
- typedef std::vector<MyClass>::reverse_iterator VectRit;
- std::vector<MyClass> values;
-
- for(int i = 0; i < 100; ++i) values.push_back(MyClass(i));
-
- BaseBucketType buckets[uset_bucket_traits::NumBuckets];
- uset_bucket_traits btraits(buckets);
- BucketTraitsUset uset(btraits);
-
- for(VectIt it(values.begin()), itend(values.end()); it != itend; ++it)
- uset.insert(*it);
-
- for( VectRit it(values.rbegin()), itend(values.rend()); it != itend; ++it){
- if(uset.find(*it) == uset.cend()) return 1;
- }
-
- return 0;
-}

Deleted: sandbox/move/libs/intrusive/test/default_hook_test.cpp
==============================================================================
--- sandbox/move/libs/intrusive/test/default_hook_test.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,126 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2007-2009
-//
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-#include <boost/intrusive/list.hpp>
-#include <boost/intrusive/slist.hpp>
-#include <boost/intrusive/set.hpp>
-#include <boost/intrusive/unordered_set.hpp>
-#include <boost/intrusive/splay_set.hpp>
-#include <boost/intrusive/avl_set.hpp>
-#include <boost/intrusive/sg_set.hpp>
-#include "smart_ptr.hpp"
-#include <vector>
-
-using namespace boost::intrusive;
-
-class MyClass
-
-: public list_base_hook
- < void_pointer<smart_ptr<void> >, link_mode<normal_link> >
-, public slist_base_hook
- < void_pointer<smart_ptr<void> >, link_mode<normal_link> >
-, public set_base_hook
- < void_pointer<smart_ptr<void> >, link_mode<normal_link> >
-, public unordered_set_base_hook
- < void_pointer<smart_ptr<void> >, link_mode<normal_link> >
-, public avl_set_base_hook
- < void_pointer<smart_ptr<void> >, link_mode<normal_link> >
-, public splay_set_base_hook
- < void_pointer<smart_ptr<void> >, link_mode<normal_link> >
-, public bs_set_base_hook
- < void_pointer<smart_ptr<void> >, link_mode<normal_link> >
-{
- int int_;
-
- public:
- MyClass(int i)
- : int_(i)
- {}
-
- friend bool operator<(const MyClass &l, const MyClass &r)
- { return l.int_ < r.int_; }
-
- friend bool operator==(const MyClass &l, const MyClass &r)
- { return l.int_ == r.int_; }
-
- friend std::size_t hash_value(const MyClass &v)
- { return boost::hash_value(v.int_); }
-};
-
-//Define a list that will store MyClass using the public base hook
-typedef list<MyClass> List;
-typedef slist<MyClass> Slist;
-typedef set<MyClass> Set;
-typedef unordered_set<MyClass> USet;
-typedef avl_set<MyClass> AvlSet;
-typedef splay_set<MyClass> SplaySet;
-typedef sg_set<MyClass> SgSet;
-
-int main()
-{
- typedef std::vector<MyClass>::iterator VectIt;
- typedef std::vector<MyClass>::reverse_iterator VectRit;
-
- //Create several MyClass objects, each one with a different value
- std::vector<MyClass> values;
- for(int i = 0; i < 100; ++i) values.push_back(MyClass(i));
-
- USet::bucket_type buckets[100];
-
- List my_list;
- Slist my_slist;
- Set my_set;
- USet my_uset(USet::bucket_traits(buckets, 100));
- AvlSet my_avlset;
- SplaySet my_splayset;
- SgSet my_sgset;
-
- //Now insert them in the reverse order
- //in the base hook intrusive list
- for(VectIt it(values.begin()), itend(values.end()); it != itend; ++it){
- my_list.push_front(*it);
- my_slist.push_front(*it);
- my_set.insert(*it);
- my_uset.insert(*it);
- my_avlset.insert(*it);
- my_splayset.insert(*it);
- my_sgset.insert(*it);
- }
-
- //Now test lists
- {
- List::const_iterator list_it(my_list.cbegin());
- Slist::const_iterator slist_it(my_slist.cbegin());
- Set::const_reverse_iterator set_rit(my_set.crbegin());
- AvlSet::const_reverse_iterator avl_set_rit(my_avlset.crbegin());
- SplaySet::const_reverse_iterator splay_set_rit(my_splayset.crbegin());
- SgSet::const_reverse_iterator sg_set_rit(my_sgset.crbegin());
-
- VectRit vect_it(values.rbegin()), vect_itend(values.rend());
-
- //Test the objects inserted in the base hook list
- for(; vect_it != vect_itend
- ; ++vect_it, ++list_it
- , ++slist_it, ++set_rit
- , ++avl_set_rit, ++splay_set_rit
- , ++sg_set_rit){
- if(&*list_it != &*vect_it) return 1;
- if(&*slist_it != &*vect_it) return 1;
- if(&*set_rit != &*vect_it) return 1;
- if(&*avl_set_rit != &*vect_it) return 1;
- if(&*splay_set_rit != &*vect_it)return 1;
- if(&*sg_set_rit != &*vect_it) return 1;
- if(my_uset.find(*set_rit) == my_uset.cend()) return 1;
- }
- }
-
- return 0;
-}

Deleted: sandbox/move/libs/intrusive/test/external_value_traits_test.cpp
==============================================================================
--- sandbox/move/libs/intrusive/test/external_value_traits_test.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,239 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2007-2009
-//
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-#include <boost/intrusive/list.hpp>
-#include <boost/intrusive/slist.hpp>
-#include <boost/intrusive/rbtree.hpp>
-#include <boost/intrusive/hashtable.hpp>
-#include <boost/pointer_to_other.hpp>
-#include <functional>
-#include <vector>
-
-using namespace boost::intrusive;
-
-class MyClass
-{
- public:
- int int_;
-
- MyClass(int i = 0)
- : int_(i)
- {}
- friend bool operator > (const MyClass &l, const MyClass &r)
- { return l.int_ > r.int_; }
- friend bool operator == (const MyClass &l, const MyClass &r)
- { return l.int_ == r.int_; }
- friend std::size_t hash_value(const MyClass &v)
- { return boost::hash_value(v.int_); }
-};
-
-const int NumElements = 100;
-
-template<class NodeTraits>
-struct external_traits
-{
- typedef NodeTraits node_traits;
- typedef typename node_traits::node node;
- typedef typename node_traits::node_ptr node_ptr;
- typedef typename node_traits::const_node_ptr const_node_ptr;
- typedef MyClass value_type;
- typedef typename boost::pointer_to_other
- <node_ptr, MyClass>::type pointer;
- typedef typename boost::pointer_to_other
- <node_ptr, const MyClass>::type const_pointer;
- static const link_mode_type link_mode = normal_link;
-
- external_traits(pointer values, std::size_t NumElem)
- : values_(values), node_array_(NumElem)
- {}
-
- node_ptr to_node_ptr (value_type &value)
- { return (&node_array_[0]) + (&value - values_); }
-
- const_node_ptr to_node_ptr (const value_type &value) const
- { return &node_array_[0] + (&value - values_); }
-
- pointer to_value_ptr(node_ptr n)
- { return values_ + (n - &node_array_[0]); }
-
- const_pointer to_value_ptr(const_node_ptr n) const
- { return values_ + (n - &node_array_[0]); }
-
- pointer values_;
- std::vector<node> node_array_;
-};
-
-template<class NodeTraits>
-struct value_traits_proxy;
-
-template<class T>
-struct traits_holder
- : public T
-{};
-
-typedef value_traits_proxy<list_node_traits<void*> > list_value_traits_proxy;
-typedef value_traits_proxy<slist_node_traits<void*> > slist_value_traits_proxy;
-typedef value_traits_proxy<rbtree_node_traits<void*> > rbtree_value_traits_proxy;
-typedef value_traits_proxy<traits_holder<slist_node_traits<void*> > > hash_value_traits_proxy;
-
-struct uset_bucket_traits
-{
- private:
- typedef unordered_bucket<value_traits<external_traits
- <traits_holder<slist_node_traits<void*> > > > >::type bucket_type;
-
- //Non-copyable
- uset_bucket_traits(const uset_bucket_traits &other);
- uset_bucket_traits & operator=(const uset_bucket_traits &other);
-
- public:
- static const std::size_t NumBuckets = 100;
-
- uset_bucket_traits(){}
-
- bucket_type * bucket_begin() const
- { return buckets_; }
-
- std::size_t bucket_count() const
- { return NumBuckets; }
-
- mutable bucket_type buckets_[NumBuckets];
-};
-
-struct bucket_traits_proxy
-{
- static const bool external_bucket_traits = true;
- typedef uset_bucket_traits bucket_traits;
-
- template<class Container>
- bucket_traits &get_bucket_traits(Container &cont);
-
- template<class Container>
- const bucket_traits &get_bucket_traits(const Container &cont) const;
-};
-
-//Define a list that will store MyClass using the external hook
-typedef list<MyClass, value_traits<list_value_traits_proxy> > List;
-//Define a slist that will store MyClass using the external hook
-typedef slist<MyClass, value_traits<slist_value_traits_proxy> > Slist;
-//Define a rbtree that will store MyClass using the external hook
-typedef rbtree< MyClass
- , value_traits<rbtree_value_traits_proxy>
- , compare<std::greater<MyClass> > > Rbtree;
-//Define a hashtable that will store MyClass using the external hook
-typedef hashtable< MyClass
- , value_traits<hash_value_traits_proxy>
- , bucket_traits<bucket_traits_proxy>
- > Hash;
-
-template<class NodeTraits>
-struct value_traits_proxy
-{
- static const bool external_value_traits = true;
- typedef external_traits<NodeTraits> value_traits;
-
- template<class Container>
- const value_traits &get_value_traits(const Container &cont) const;
-
- template<class Container>
- value_traits &get_value_traits(Container &cont);
-};
-
-struct ContainerHolder
- : public uset_bucket_traits
- , public List
- , public external_traits<list_node_traits<void*> >
- , public Slist
- , public external_traits<slist_node_traits<void*> >
- , public Rbtree
- , public external_traits<rbtree_node_traits<void*> >
- , public Hash
- , public external_traits<traits_holder<slist_node_traits<void*> > >
-{
- static const std::size_t NumBucket = 100;
- ContainerHolder(MyClass *values, std::size_t num_elem)
- : uset_bucket_traits()
- , List()
- , external_traits<list_node_traits<void*> >(values, num_elem)
- , Slist()
- , external_traits<slist_node_traits<void*> >(values, num_elem)
- , Rbtree()
- , external_traits<rbtree_node_traits<void*> >(values, num_elem)
- , Hash(Hash::bucket_traits())
- , external_traits<traits_holder<slist_node_traits<void*> > >(values, num_elem)
- {}
-};
-
-template<class NodeTraits>
-template<class Container>
-typename value_traits_proxy<NodeTraits>::value_traits &
- value_traits_proxy<NodeTraits>::get_value_traits(Container &cont)
-{ return static_cast<value_traits&>(static_cast<ContainerHolder&>(cont)); }
-
-template<class NodeTraits>
-template<class Container>
-const typename value_traits_proxy<NodeTraits>::value_traits &
- value_traits_proxy<NodeTraits>::get_value_traits(const Container &cont) const
-{ return static_cast<const value_traits&>(static_cast<const ContainerHolder&>(cont)); }
-
-template<class Container>
-typename bucket_traits_proxy::bucket_traits &
- bucket_traits_proxy::get_bucket_traits(Container &cont)
-{ return static_cast<bucket_traits&>(static_cast<ContainerHolder&>(cont)); }
-
-template<class Container>
-const typename bucket_traits_proxy::bucket_traits &
- bucket_traits_proxy::get_bucket_traits(const Container &cont) const
-{ return static_cast<const bucket_traits&>(static_cast<const ContainerHolder&>(cont)); }
-
-int main()
-{
- MyClass values [NumElements];
- //Create several MyClass objects, each one with a different value
- for(int i = 0; i < NumElements; ++i)
- values[i].int_ = i;
-
- ContainerHolder cont_holder(values, NumElements);
- List &my_list = static_cast<List &> (cont_holder);
- Slist &my_slist = static_cast<Slist &> (cont_holder);
- Rbtree &my_rbtree = static_cast<Rbtree &> (cont_holder);
- Hash &my_hash = static_cast<Hash &> (cont_holder);
-
- //Now insert them in containers
- for(MyClass * it(&values[0]), *itend(&values[NumElements])
- ; it != itend; ++it){
- my_list.push_front(*it);
- my_slist.push_front(*it);
- my_rbtree.insert_unique(*it);
- my_hash.insert_unique(*it);
- }
-
- //Now test containers
- {
- List::const_iterator list_it (my_list.cbegin());
- Slist::const_iterator slist_it (my_slist.cbegin());
- Rbtree::const_iterator rbtree_it (my_rbtree.cbegin());
- Hash::const_iterator hash_it (my_hash.cbegin());
- MyClass *it_val(&values[NumElements] - 1), *it_rbeg_val(&values[0]-1);
-
- //Test inserted objects
- for(; it_val != it_rbeg_val; --it_val, ++list_it, ++slist_it, ++rbtree_it){
- if(&*list_it != &*it_val) return 1;
- if(&*slist_it != &*it_val) return 1;
- if(&*rbtree_it != &*it_val) return 1;
- hash_it = my_hash.find(*it_val);
- if(hash_it == my_hash.cend() || &*hash_it != &*it_val)
- return 1;
- }
- }
-
- return 0;
-}

Deleted: sandbox/move/libs/intrusive/test/generic_assoc_test.hpp
==============================================================================
--- sandbox/move/libs/intrusive/test/generic_assoc_test.hpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,449 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Olaf Krzikalla 2004-2006.
-// (C) Copyright Ion Gaztanaga 2006-2009.
-//
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-#include <vector> //vector
-#include <algorithm> //sort, random_shuffle
-#include <boost/intrusive/detail/config_begin.hpp>
-#include "common_functors.hpp"
-#include <boost/intrusive/options.hpp>
-#include <boost/detail/lightweight_test.hpp>
-#include "test_macros.hpp"
-#include "test_container.hpp"
-
-namespace boost{
-namespace intrusive{
-namespace test{
-
-template<class T>
-struct has_splay
-{
- static const bool value = false;
-};
-
-template<class T>
-struct has_rebalance
-{
- static const bool value = false;
-};
-
-template<class T>
-struct has_insert_before
-{
- static const bool value = false;
-};
-
-template<class ValueTraits, template <class = ::boost::intrusive::none, class = ::boost::intrusive::none, class = ::boost::intrusive::none, class = ::boost::intrusive::none> class ContainerDefiner>
-struct test_generic_assoc
-{
- typedef typename ValueTraits::value_type value_type;
- static void test_all(std::vector<value_type>& values);
- static void test_clone(std::vector<value_type>& values);
- static void test_insert_erase_burst();
- static void test_container_from_end(std::vector<value_type>& values);
- static void test_splay_up(std::vector<value_type>& values);
- static void test_splay_up(std::vector<value_type>& values, boost::intrusive::detail::true_type);
- static void test_splay_up(std::vector<value_type>& values, boost::intrusive::detail::false_type);
- static void test_splay_down(std::vector<value_type>& values);
- static void test_splay_down(std::vector<value_type>& values, boost::intrusive::detail::true_type);
- static void test_splay_down(std::vector<value_type>& values, boost::intrusive::detail::false_type);
- static void test_rebalance(std::vector<value_type>& values);
- static void test_rebalance(std::vector<value_type>& values, boost::intrusive::detail::true_type);
- static void test_rebalance(std::vector<value_type>& values, boost::intrusive::detail::false_type);
- static void test_insert_before(std::vector<value_type>& values);
- static void test_insert_before(std::vector<value_type>& values, boost::intrusive::detail::true_type);
- static void test_insert_before(std::vector<value_type>& values, boost::intrusive::detail::false_type);
- static void test_container_from_iterator(std::vector<value_type>& values);
-};
-
-template<class ValueTraits, template <class = ::boost::intrusive::none, class = ::boost::intrusive::none, class = ::boost::intrusive::none, class = ::boost::intrusive::none> class ContainerDefiner>
-void test_generic_assoc<ValueTraits, ContainerDefiner>::
- test_container_from_iterator(std::vector<value_type>& values)
-{
- typedef typename ContainerDefiner
- < value_type
- , value_traits<ValueTraits>
- , constant_time_size<value_type::constant_time_size>
- >::type assoc_type;
-
- assoc_type testset(values.begin(), values.end());
- typedef typename assoc_type::iterator it_type;
- typedef typename assoc_type::const_iterator cit_type;
- typedef typename assoc_type::size_type sz_type;
- sz_type sz = testset.size();
- for(it_type b(testset.begin()), e(testset.end()); b != e; ++b)
- {
- assoc_type &s = assoc_type::container_from_iterator(b);
- const assoc_type &cs = assoc_type::container_from_iterator(cit_type(b));
- BOOST_TEST(&s == &cs);
- BOOST_TEST(&s == &testset);
- s.erase(b);
- BOOST_TEST(testset.size() == (sz-1));
- s.insert(*b);
- BOOST_TEST(testset.size() == sz);
- }
-}
-
-template<class ValueTraits, template <class = ::boost::intrusive::none, class = ::boost::intrusive::none, class = ::boost::intrusive::none, class = ::boost::intrusive::none> class ContainerDefiner>
-void test_generic_assoc<ValueTraits, ContainerDefiner>::test_insert_erase_burst()
-{
- typedef typename ValueTraits::value_type value_type;
-
- std::vector<value_type> values;
- const int MaxValues = 100;
- for(int i = 0; i != MaxValues; ++i){
- values.push_back(value_type(i));
- }
-
- typedef typename ContainerDefiner
- < value_type
- , value_traits<ValueTraits>
- , constant_time_size<value_type::constant_time_size>
- >::type assoc_type;
- typedef typename assoc_type::iterator iterator;
-
- //First ordered insertions
- assoc_type testset (&values[0], &values[0] + values.size());
- TEST_INTRUSIVE_SEQUENCE_EXPECTED(testset, testset.begin());
-
- //Ordered erasure
- iterator it(testset.begin()), itend(testset.end());
- for(int i = 0; it != itend; ++i){
- BOOST_TEST(&*it == &values[i]);
- it = testset.erase(it);
- }
-
- BOOST_TEST(testset.empty());
-
- //Now random insertions
- std::random_shuffle(values.begin(), values.end());
- testset.insert(&values[0], &values[0] + values.size());
- std::vector<value_type> values_ordered(values);
- std::sort(values_ordered.begin(), values_ordered.end());
- TEST_INTRUSIVE_SEQUENCE_EXPECTED(testset, testset.begin());
-
- {
- typedef typename std::vector<value_type>::const_iterator cvec_iterator;
- //Random erasure
- std::vector<cvec_iterator> it_vector;
-
- for(cvec_iterator it(values.begin()), itend(values.end())
- ; it != itend
- ; ++it){
- it_vector.push_back(it);
- }
- std::random_shuffle(it_vector.begin(), it_vector.end());
- for(int i = 0; i != MaxValues; ++i){
- testset.erase(testset.iterator_to(*it_vector[i]));
- }
-
- BOOST_TEST(testset.empty());
- }
-}
-
-template<class ValueTraits, template <class = ::boost::intrusive::none, class = ::boost::intrusive::none, class = ::boost::intrusive::none, class = ::boost::intrusive::none> class ContainerDefiner>
-void test_generic_assoc<ValueTraits, ContainerDefiner>::test_all(std::vector<typename ValueTraits::value_type>& values)
-{
- typedef typename ValueTraits::value_type value_type;
- test_clone(values);
- test_container_from_end(values);
- test_splay_up(values);
- test_splay_down(values);
- test_rebalance(values);
- test_insert_before(values);
- test_insert_erase_burst();
- test_container_from_iterator(values);
-}
-
-template<class ValueTraits, template <class = ::boost::intrusive::none, class = ::boost::intrusive::none, class = ::boost::intrusive::none, class = ::boost::intrusive::none> class ContainerDefiner>
-void test_generic_assoc<ValueTraits, ContainerDefiner>
- ::test_clone(std::vector<typename ValueTraits::value_type>& values)
-{
- typedef typename ValueTraits::value_type value_type;
- typedef typename ContainerDefiner
- < value_type
- , value_traits<ValueTraits>
- , constant_time_size<value_type::constant_time_size>
- >::type assoc_type;
-
- assoc_type testset1 (&values[0], &values[0] + values.size());
- assoc_type testset2;
-
- testset2.clone_from(testset1, test::new_cloner<value_type>(), test::delete_disposer<value_type>());
- BOOST_TEST (testset2 == testset1);
- testset2.clear_and_dispose(test::delete_disposer<value_type>());
- BOOST_TEST (testset2.empty());
-}
-
-template<class ValueTraits, template <class = ::boost::intrusive::none, class = ::boost::intrusive::none, class = ::boost::intrusive::none, class = ::boost::intrusive::none> class ContainerDefiner>
-void test_generic_assoc<ValueTraits, ContainerDefiner>
- ::test_container_from_end(std::vector<typename ValueTraits::value_type>& values)
-{
- typedef typename ValueTraits::value_type value_type;
- typedef typename ContainerDefiner
- < value_type
- , value_traits<ValueTraits>
- , constant_time_size<value_type::constant_time_size>
- >::type assoc_type;
- assoc_type testset (&values[0], &values[0] + values.size());
- BOOST_TEST (testset == assoc_type::container_from_end_iterator(testset.end()));
- BOOST_TEST (testset == assoc_type::container_from_end_iterator(testset.cend()));
-}
-
-template<class ValueTraits, template <class = ::boost::intrusive::none, class = ::boost::intrusive::none, class = ::boost::intrusive::none, class = ::boost::intrusive::none> class ContainerDefiner>
-void test_generic_assoc<ValueTraits, ContainerDefiner>::test_splay_up
-(std::vector<typename ValueTraits::value_type>& values, boost::intrusive::detail::true_type)
-{
- typedef typename ValueTraits::value_type value_type;
- typedef typename ContainerDefiner
- < value_type
- , value_traits<ValueTraits>
- , constant_time_size<value_type::constant_time_size>
- >::type assoc_type;
- typedef typename assoc_type::iterator iterator;
- typedef std::vector<value_type> orig_set_t;
- std::size_t num_values;
- orig_set_t original_testset;
- {
- assoc_type testset (values.begin(), values.end());
- num_values = testset.size();
- original_testset.insert(original_testset.end(), testset.begin(), testset.end());
- }
-
- for(std::size_t i = 0; i != num_values; ++i){
- assoc_type testset (values.begin(), values.end());
- {
- iterator it = testset.begin();
- for(std::size_t j = 0; j != i; ++j, ++it){}
- testset.splay_up(it);
- }
- BOOST_TEST (testset.size() == num_values);
- iterator it = testset.begin();
- for( typename orig_set_t::const_iterator origit = original_testset.begin()
- , origitend = original_testset.end()
- ; origit != origitend
- ; ++origit, ++it){
- BOOST_TEST(*origit == *it);
- }
- }
-}
-
-template<class ValueTraits, template <class = ::boost::intrusive::none, class = ::boost::intrusive::none, class = ::boost::intrusive::none, class = ::boost::intrusive::none> class ContainerDefiner>
-void test_generic_assoc<ValueTraits, ContainerDefiner>::test_splay_up
-(std::vector<typename ValueTraits::value_type>&, boost::intrusive::detail::false_type)
-{}
-
-template<class ValueTraits, template <class = ::boost::intrusive::none, class = ::boost::intrusive::none, class = ::boost::intrusive::none, class = ::boost::intrusive::none> class ContainerDefiner>
-void test_generic_assoc<ValueTraits, ContainerDefiner>::test_splay_up
-(std::vector<typename ValueTraits::value_type>& values)
-{
- typedef typename ContainerDefiner
- < value_type
- , value_traits<ValueTraits>
- , constant_time_size<value_type::constant_time_size>
- >::type assoc_type;
- typedef typename detail::remove_const<assoc_type>::type Type;
- typedef detail::bool_<has_splay<Type>::value> enabler;
- test_splay_up(values, enabler());
-}
-
-template<class ValueTraits, template <class = ::boost::intrusive::none, class = ::boost::intrusive::none, class = ::boost::intrusive::none, class = ::boost::intrusive::none> class ContainerDefiner>
-void test_generic_assoc<ValueTraits, ContainerDefiner>::test_splay_down
-(std::vector<typename ValueTraits::value_type>& values, boost::intrusive::detail::true_type)
-{
- typedef typename ValueTraits::value_type value_type;
- typedef typename ContainerDefiner
- < value_type
- , value_traits<ValueTraits>
- , constant_time_size<value_type::constant_time_size>
- >::type assoc_type;
- typedef typename assoc_type::iterator iterator;
- typedef std::vector<value_type> orig_set_t;
- std::size_t num_values;
- orig_set_t original_testset;
- {
- assoc_type testset (values.begin(), values.end());
- num_values = testset.size();
- original_testset.insert(original_testset.end(), testset.begin(), testset.end());
- }
-
- for(std::size_t i = 0; i != num_values; ++i){
- assoc_type testset (values.begin(), values.end());
- BOOST_TEST(testset.size() == num_values);
- {
- iterator it = testset.begin();
- for(std::size_t j = 0; j != i; ++j, ++it){}
- BOOST_TEST(*it == *testset.splay_down(*it));
- }
- BOOST_TEST (testset.size() == num_values);
- iterator it = testset.begin();
- for( typename orig_set_t::const_iterator origit = original_testset.begin()
- , origitend = original_testset.end()
- ; origit != origitend
- ; ++origit, ++it){
- BOOST_TEST(*origit == *it);
- }
- }
-}
-
-template<class ValueTraits, template <class = ::boost::intrusive::none, class = ::boost::intrusive::none, class = ::boost::intrusive::none, class = ::boost::intrusive::none> class ContainerDefiner>
-void test_generic_assoc<ValueTraits, ContainerDefiner>::test_splay_down
-(std::vector<typename ValueTraits::value_type>&, boost::intrusive::detail::false_type)
-{}
-
-template<class ValueTraits, template <class = ::boost::intrusive::none, class = ::boost::intrusive::none, class = ::boost::intrusive::none, class = ::boost::intrusive::none> class ContainerDefiner>
-void test_generic_assoc<ValueTraits, ContainerDefiner>::test_splay_down
-(std::vector<typename ValueTraits::value_type>& values)
-{
- typedef typename ContainerDefiner
- < value_type
- , value_traits<ValueTraits>
- , constant_time_size<value_type::constant_time_size>
- >::type assoc_type;
- typedef typename detail::remove_const<assoc_type>::type Type;
- typedef detail::bool_<has_splay<Type>::value> enabler;
- test_splay_down(values, enabler());
-}
-
-template<class ValueTraits, template <class = ::boost::intrusive::none, class = ::boost::intrusive::none, class = ::boost::intrusive::none, class = ::boost::intrusive::none> class ContainerDefiner>
-void test_generic_assoc<ValueTraits, ContainerDefiner>::test_rebalance
-(std::vector<typename ValueTraits::value_type>& values, boost::intrusive::detail::true_type)
-{
- typedef typename ValueTraits::value_type value_type;
- typedef typename ContainerDefiner
- < value_type
- , value_traits<ValueTraits>
- , constant_time_size<value_type::constant_time_size>
- >::type assoc_type;
- typedef std::vector<value_type> orig_set_t;
- typedef typename orig_set_t::iterator iterator_t;
- std::size_t num_values;
- orig_set_t original_testset;
- {
- assoc_type testset (values.begin(), values.end());
- num_values = testset.size();
- original_testset.insert(original_testset.end(), testset.begin(), testset.end());
- }
- {
- assoc_type testset(values.begin(), values.end());
- testset.rebalance();
- iterator_t it = original_testset.begin();
- TEST_INTRUSIVE_SEQUENCE_EXPECTED(original_testset, testset.begin());
- }
-
- {
- std::size_t numdata;
- {
- assoc_type testset(values.begin(), values.end());
- numdata = testset.size();
- }
-
- for(int i = 0; i != (int)numdata; ++i){
- assoc_type testset(values.begin(), values.end());
- typename assoc_type::iterator it = testset.begin();
- for(int j = 0; j != i; ++j) ++it;
- testset.rebalance_subtree(it);
- TEST_INTRUSIVE_SEQUENCE_EXPECTED(original_testset, testset.begin());
- }
- }
-}
-
-template<class ValueTraits, template <class = ::boost::intrusive::none, class = ::boost::intrusive::none, class = ::boost::intrusive::none, class = ::boost::intrusive::none> class ContainerDefiner>
-void test_generic_assoc<ValueTraits, ContainerDefiner>::test_rebalance
-(std::vector<typename ValueTraits::value_type>&, boost::intrusive::detail::false_type)
-{}
-
-template<class ValueTraits, template <class = ::boost::intrusive::none, class = ::boost::intrusive::none, class = ::boost::intrusive::none, class = ::boost::intrusive::none> class ContainerDefiner>
-void test_generic_assoc<ValueTraits, ContainerDefiner>::test_rebalance
-(std::vector<typename ValueTraits::value_type>& values)
-{
- typedef typename ContainerDefiner
- < value_type
- , value_traits<ValueTraits>
- , constant_time_size<value_type::constant_time_size>
- >::type assoc_type;
- typedef typename detail::remove_const<assoc_type>::type Type;
- typedef detail::bool_<has_rebalance<Type>::value> enabler;
- test_rebalance(values, enabler());
-}
-
-template<class ValueTraits, template <class = ::boost::intrusive::none, class = ::boost::intrusive::none, class = ::boost::intrusive::none, class = ::boost::intrusive::none> class ContainerDefiner>
-void test_generic_assoc<ValueTraits, ContainerDefiner>::test_insert_before
-(std::vector<typename ValueTraits::value_type>& values, boost::intrusive::detail::true_type)
-{
- typedef typename ValueTraits::value_type value_type;
- typedef typename ContainerDefiner
- < value_type
- , value_traits<ValueTraits>
- , constant_time_size<value_type::constant_time_size>
- >::type assoc_type;
- {
- assoc_type testset;
- typedef typename std::vector<value_type>::iterator vec_iterator;
- for(vec_iterator it(values.begin()), itend(values.end())
- ; it != itend
- ; ++it){
- testset.push_back(*it);
- }
- BOOST_TEST(testset.size() == values.size());
- TEST_INTRUSIVE_SEQUENCE_EXPECTED(values, testset.begin());
- }
- {
- assoc_type testset;
- typedef typename std::vector<value_type>::iterator vec_iterator;
-
- for(vec_iterator it(--values.end()); true; --it){
- testset.push_front(*it);
- if(it == values.begin()){
- break;
- }
- }
- BOOST_TEST(testset.size() == values.size());
- TEST_INTRUSIVE_SEQUENCE_EXPECTED(values, testset.begin());
- }
- {
- assoc_type testset;
- typedef typename std::vector<value_type>::iterator vec_iterator;
- typename assoc_type::iterator it_pos =
- testset.insert_before(testset.end(), *values.rbegin());
- testset.insert_before(testset.begin(), *values.begin());
- for(vec_iterator it(++values.begin()), itend(--values.end())
- ; it != itend
- ; ++it){
- testset.insert_before(it_pos, *it);
- }
- BOOST_TEST(testset.size() == values.size());
- TEST_INTRUSIVE_SEQUENCE_EXPECTED(values, testset.begin());
- }
-}
-
-template<class ValueTraits, template <class = ::boost::intrusive::none, class = ::boost::intrusive::none, class = ::boost::intrusive::none, class = ::boost::intrusive::none> class ContainerDefiner>
-void test_generic_assoc<ValueTraits, ContainerDefiner>::test_insert_before
-(std::vector<typename ValueTraits::value_type>&, boost::intrusive::detail::false_type)
-{}
-
-template<class ValueTraits, template <class = ::boost::intrusive::none, class = ::boost::intrusive::none, class = ::boost::intrusive::none, class = ::boost::intrusive::none> class ContainerDefiner>
-void test_generic_assoc<ValueTraits, ContainerDefiner>::test_insert_before
-(std::vector<typename ValueTraits::value_type>& values)
-{
- typedef typename ContainerDefiner
- < value_type
- , value_traits<ValueTraits>
- , constant_time_size<value_type::constant_time_size>
- >::type assoc_type;
- typedef typename detail::remove_const<assoc_type>::type Type;
- typedef detail::bool_<has_insert_before<Type>::value> enabler;
- test_insert_before(values, enabler());
-}
-
-}}} //namespace boost::intrusive::test
-
-#include <boost/intrusive/detail/config_end.hpp>

Deleted: sandbox/move/libs/intrusive/test/generic_multiset_test.hpp
==============================================================================
--- sandbox/move/libs/intrusive/test/generic_multiset_test.hpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,227 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Olaf Krzikalla 2004-2006.
-// (C) Copyright Ion Gaztanaga 2006-2009.
-//
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-#include <vector>
-#include <boost/intrusive/detail/config_begin.hpp>
-#include "common_functors.hpp"
-#include <boost/detail/lightweight_test.hpp>
-#include <boost/intrusive/options.hpp>
-#include "test_macros.hpp"
-#include "test_container.hpp"
-#include "generic_assoc_test.hpp"
-
-namespace boost{
-namespace intrusive{
-namespace test{
-
-template<class ValueTraits, template <class = ::boost::intrusive::none, class = ::boost::intrusive::none, class = ::boost::intrusive::none, class = ::boost::intrusive::none> class ContainerDefiner>
-struct test_generic_multiset
-{
- typedef typename ValueTraits::value_type value_type;
- static void test_all ();
- static void test_sort(std::vector<value_type>& values);
- static void test_insert(std::vector<value_type>& values);
- static void test_swap(std::vector<value_type>& values);
- static void test_find(std::vector<value_type>& values);
- static void test_impl();
-};
-
-template<class ValueTraits, template <class = ::boost::intrusive::none, class = ::boost::intrusive::none, class = ::boost::intrusive::none, class = ::boost::intrusive::none> class ContainerDefiner>
-void test_generic_multiset<ValueTraits, ContainerDefiner>::test_all ()
-{
- typedef typename ValueTraits::value_type value_type;
- static const int random_init[6] = { 3, 2, 4, 1, 5, 2 };
- std::vector<value_type> values (6);
- for (int i = 0; i < 6; ++i)
- values[i].value_ = random_init[i];
-
- typedef typename ContainerDefiner
- < value_type
- , value_traits<ValueTraits>
- , constant_time_size<value_type::constant_time_size>
- >::type multiset_type;
- {
- multiset_type testset(values.begin(), values.end());
- test::test_container(testset);
- testset.clear();
- testset.insert(values.begin(), values.end());
- test::test_common_unordered_and_associative_container(testset, values);
- testset.clear();
- testset.insert(values.begin(), values.end());
- test::test_associative_container(testset, values);
- testset.clear();
- testset.insert(values.begin(), values.end());
- test::test_non_unique_container(testset, values);
- }
- test_sort(values);
- test_insert(values);
- test_swap(values);
- test_find(values);
- test_impl();
- test_generic_assoc<ValueTraits, ContainerDefiner>::test_all(values);
-}
-
-//test case due to an error in tree implementation:
-template<class ValueTraits, template <class = ::boost::intrusive::none, class = ::boost::intrusive::none, class = ::boost::intrusive::none, class = ::boost::intrusive::none> class ContainerDefiner>
-void test_generic_multiset<ValueTraits, ContainerDefiner>::test_impl()
-{
- typedef typename ValueTraits::value_type value_type;
- std::vector<value_type> values (5);
- for (int i = 0; i < 5; ++i)
- values[i].value_ = i;
- typedef typename ValueTraits::value_type value_type;
- typedef typename ContainerDefiner
- < value_type
- , value_traits<ValueTraits>
- , constant_time_size<value_type::constant_time_size>
- >::type multiset_type;
-
- multiset_type testset;
- for (int i = 0; i < 5; ++i)
- testset.insert (values[i]);
-
- testset.erase (testset.iterator_to (values[0]));
- testset.erase (testset.iterator_to (values[1]));
- testset.insert (values[1]);
-
- testset.erase (testset.iterator_to (values[2]));
- testset.erase (testset.iterator_to (values[3]));
-}
-
-//test: constructor, iterator, clear, reverse_iterator, front, back, size:
-template<class ValueTraits, template <class = ::boost::intrusive::none, class = ::boost::intrusive::none, class = ::boost::intrusive::none, class = ::boost::intrusive::none> class ContainerDefiner>
-void test_generic_multiset<ValueTraits, ContainerDefiner>::test_sort(std::vector<typename ValueTraits::value_type>& values)
-{
- typedef typename ValueTraits::value_type value_type;
- typedef typename ContainerDefiner
- < value_type
- , value_traits<ValueTraits>
- , constant_time_size<value_type::constant_time_size>
- >::type multiset_type;
-
- multiset_type testset1 (values.begin(), values.end());
- { int init_values [] = { 1, 2, 2, 3, 4, 5 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testset1.begin() ); }
-
- testset1.clear();
- BOOST_TEST (testset1.empty());
-
- typedef typename ContainerDefiner
- <value_type
- , compare<even_odd>
- , value_traits<ValueTraits>
- , constant_time_size<value_type::constant_time_size>
- >::type multiset_type2;
- multiset_type2 testset2 (&values[0], &values[0] + 6);
- { int init_values [] = { 5, 3, 1, 4, 2, 2 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testset2.rbegin() ); }
-
- BOOST_TEST (testset2.begin()->value_ == 2);
- BOOST_TEST (testset2.rbegin()->value_ == 5);
-}
-
-//test: insert, const_iterator, const_reverse_iterator, erase, iterator_to:
-template<class ValueTraits, template <class = ::boost::intrusive::none, class = ::boost::intrusive::none, class = ::boost::intrusive::none, class = ::boost::intrusive::none> class ContainerDefiner>
-void test_generic_multiset<ValueTraits, ContainerDefiner>::test_insert(std::vector<typename ValueTraits::value_type>& values)
-{
- typedef typename ValueTraits::value_type value_type;
- typedef typename ContainerDefiner
- < value_type
- , value_traits<ValueTraits>
- , size_type<std::size_t>
- , constant_time_size<value_type::constant_time_size>
- >::type multiset_type;
-
- multiset_type testset;
- testset.insert(&values[0] + 2, &values[0] + 5);
- { int init_values [] = { 1, 4, 5 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testset.begin() ); }
-
- typename multiset_type::iterator i = testset.begin();
- BOOST_TEST (i->value_ == 1);
-
- i = testset.insert (i, values[0]);
- BOOST_TEST (&*i == &values[0]);
-
- { int init_values [] = { 5, 4, 3, 1 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testset.rbegin() ); }
-
- i = testset.iterator_to (values[2]);
- BOOST_TEST (&*i == &values[2]);
-
- i = multiset_type::s_iterator_to (values[2]);
- BOOST_TEST (&*i == &values[2]);
-
- testset.erase(i);
-
- { int init_values [] = { 1, 3, 5 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testset.begin() ); }
-}
-
-//test: insert (seq-version), swap, erase (seq-version), size:
-template<class ValueTraits, template <class = ::boost::intrusive::none, class = ::boost::intrusive::none, class = ::boost::intrusive::none, class = ::boost::intrusive::none> class ContainerDefiner>
-void test_generic_multiset<ValueTraits, ContainerDefiner>::test_swap(std::vector<typename ValueTraits::value_type>& values)
-{
- typedef typename ValueTraits::value_type value_type;
- typedef typename ContainerDefiner
- < value_type
- , value_traits<ValueTraits>
- , size_type<std::size_t>
- , constant_time_size<value_type::constant_time_size>
- >::type multiset_type;
- multiset_type testset1 (&values[0], &values[0] + 2);
- multiset_type testset2;
- testset2.insert (&values[0] + 2, &values[0] + 6);
- testset1.swap (testset2);
-
- { int init_values [] = { 1, 2, 4, 5 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testset1.begin() ); }
- { int init_values [] = { 2, 3 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testset2.begin() ); }
-
- testset1.erase (testset1.iterator_to(values[5]), testset1.end());
- BOOST_TEST (testset1.size() == 1);
- BOOST_TEST (&*testset1.begin() == &values[3]);
-}
-
-//test: find, equal_range (lower_bound, upper_bound):
-template<class ValueTraits, template <class = ::boost::intrusive::none, class = ::boost::intrusive::none, class = ::boost::intrusive::none, class = ::boost::intrusive::none> class ContainerDefiner>
-void test_generic_multiset<ValueTraits, ContainerDefiner>::test_find(std::vector<typename ValueTraits::value_type>& values)
-{
- typedef typename ValueTraits::value_type value_type;
- typedef typename ContainerDefiner
- < value_type
- , value_traits<ValueTraits>
- , size_type<std::size_t>
- , constant_time_size<value_type::constant_time_size>
- >::type multiset_type;
- multiset_type testset (values.begin(), values.end());
- typedef typename multiset_type::iterator iterator;
-
- value_type cmp_val;
- cmp_val.value_ = 2;
- iterator i = testset.find (cmp_val);
- BOOST_TEST (i->value_ == 2);
- BOOST_TEST ((++i)->value_ == 2);
- std::pair<iterator,iterator> range = testset.equal_range (cmp_val);
-
- BOOST_TEST (range.first->value_ == 2);
- BOOST_TEST (range.second->value_ == 3);
- BOOST_TEST (std::distance (range.first, range.second) == 2);
-
- cmp_val.value_ = 7;
- BOOST_TEST (testset.find (cmp_val) == testset.end());
-}
-
-}}} //namespace boost::intrusive::test
-
-#include <boost/intrusive/detail/config_end.hpp>

Deleted: sandbox/move/libs/intrusive/test/generic_set_test.hpp
==============================================================================
--- sandbox/move/libs/intrusive/test/generic_set_test.hpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,298 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Olaf Krzikalla 2004-2006.
-// (C) Copyright Ion Gaztanaga 2006-2009.
-//
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-#include <vector>
-#include <boost/intrusive/detail/config_begin.hpp>
-#include "common_functors.hpp"
-#include <boost/detail/lightweight_test.hpp>
-#include <boost/intrusive/options.hpp>
-#include "test_macros.hpp"
-#include "test_container.hpp"
-#include "generic_assoc_test.hpp"
-
-namespace boost{
-namespace intrusive{
-namespace test{
-
-template<class T>
-struct is_treap
-{
- static const bool value = false;
-};
-
-template<class ValueTraits, template <class = ::boost::intrusive::none, class = ::boost::intrusive::none, class = ::boost::intrusive::none, class = ::boost::intrusive::none> class ContainerDefiner>
-struct test_generic_set
-{
- typedef typename ValueTraits::value_type value_type;
- static void test_all();
- static void test_sort(std::vector<value_type>& values);
- static void test_insert(std::vector<value_type>& values);
- static void test_insert_advanced(std::vector<value_type>& values, boost::intrusive::detail::true_type);
- static void test_insert_advanced(std::vector<value_type>& values, boost::intrusive::detail::false_type);
- static void test_insert_advanced(std::vector<value_type>& values);
- static void test_swap(std::vector<value_type>& values);
- static void test_find(std::vector<value_type>& values);
- static void test_impl();
-};
-
-
-template<class ValueTraits, template <class = ::boost::intrusive::none, class = ::boost::intrusive::none, class = ::boost::intrusive::none, class = ::boost::intrusive::none> class ContainerDefiner>
-void test_generic_set<ValueTraits, ContainerDefiner>::test_all()
-{
- typedef typename ValueTraits::value_type value_type;
- static const int random_init[6] = { 3, 2, 4, 1, 5, 2 };
- std::vector<value_type> values (6);
- for (int i = 0; i < 6; ++i)
- values[i].value_ = random_init[i];
-
- typedef typename ContainerDefiner
- < value_type
- , value_traits<ValueTraits>
- , constant_time_size<value_type::constant_time_size>
- >::type set_type;
- {
- set_type testset(values.begin(), values.end());
- test::test_container(testset);
- testset.clear();
- testset.insert(values.begin(), values.end());
- test::test_common_unordered_and_associative_container(testset, values);
- testset.clear();
- testset.insert(values.begin(), values.end());
- test::test_associative_container(testset, values);
- testset.clear();
- testset.insert(values.begin(), values.end());
- test::test_unique_container(testset, values);
- }
- test_sort(values);
- test_insert(values);
- test_insert_advanced(values);
- test_swap(values);
- test_find(values);
- test_impl();
- test_generic_assoc<ValueTraits, ContainerDefiner>::test_all(values);
-}
-
-//test case due to an error in tree implementation:
-template<class ValueTraits, template <class = ::boost::intrusive::none, class = ::boost::intrusive::none, class = ::boost::intrusive::none, class = ::boost::intrusive::none> class ContainerDefiner>
-void test_generic_set<ValueTraits, ContainerDefiner>::test_impl()
-{
- typedef typename ValueTraits::value_type value_type;
- std::vector<value_type> values (5);
- for (int i = 0; i < 5; ++i)
- values[i].value_ = i;
-
- typedef typename ValueTraits::value_type value_type;
- typedef typename ContainerDefiner
- < value_type
- , value_traits<ValueTraits>
- , constant_time_size<value_type::constant_time_size>
- >::type set_type;
- set_type testset;
- for (int i = 0; i < 5; ++i)
- testset.insert (values[i]);
-
- testset.erase (testset.iterator_to (values[0]));
- testset.erase (testset.iterator_to (values[1]));
- testset.insert (values[1]);
-
- testset.erase (testset.iterator_to (values[2]));
- testset.erase (testset.iterator_to (values[3]));
-}
-
-//test: constructor, iterator, clear, reverse_iterator, front, back, size:
-template<class ValueTraits, template <class = ::boost::intrusive::none, class = ::boost::intrusive::none, class = ::boost::intrusive::none, class = ::boost::intrusive::none> class ContainerDefiner>
-void test_generic_set<ValueTraits, ContainerDefiner>::test_sort(std::vector<typename ValueTraits::value_type>& values)
-{
- typedef typename ValueTraits::value_type value_type;
- typedef typename ContainerDefiner
- < value_type
- , value_traits<ValueTraits>
- , constant_time_size<value_type::constant_time_size>
- >::type set_type;
- set_type testset1 (values.begin(), values.end());
- { int init_values [] = { 1, 2, 3, 4, 5 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testset1.begin() ); }
-
- testset1.clear();
- BOOST_TEST (testset1.empty());
-
- typedef typename ValueTraits::value_type value_type;
- typedef typename ContainerDefiner
- < value_type
- , compare<even_odd>
- , value_traits<ValueTraits>
- , constant_time_size<value_type::constant_time_size>
- >::type set_type2;
- set_type2 testset2 (&values[0], &values[0] + 6);
- { int init_values [] = { 5, 3, 1, 4, 2 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testset2.rbegin() ); }
- BOOST_TEST (testset2.begin()->value_ == 2);
- BOOST_TEST (testset2.rbegin()->value_ == 5);
-}
-
-//test: insert, const_iterator, const_reverse_iterator, erase, s_iterator_to:
-template<class ValueTraits, template <class = ::boost::intrusive::none, class = ::boost::intrusive::none, class = ::boost::intrusive::none, class = ::boost::intrusive::none> class ContainerDefiner>
-void test_generic_set<ValueTraits, ContainerDefiner>::test_insert(std::vector<typename ValueTraits::value_type>& values)
-{
- typedef typename ValueTraits::value_type value_type;
- typedef typename ContainerDefiner
- < value_type
- , value_traits<ValueTraits>
- , constant_time_size<value_type::constant_time_size>
- >::type set_type;
- {
- set_type testset;
- testset.insert(&values[0] + 2, &values[0] + 5);
-
- const set_type& const_testset = testset;
- { int init_values [] = { 1, 4, 5 };
- TEST_INTRUSIVE_SEQUENCE( init_values, const_testset.begin() ); }
-
- typename set_type::iterator i = testset.begin();
- BOOST_TEST (i->value_ == 1);
-
- i = testset.insert (i, values[0]);
- BOOST_TEST (&*i == &values[0]);
-
- { int init_values [] = { 5, 4, 3, 1 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testset.rbegin() ); }
-
- i = testset.iterator_to (values[2]);
- BOOST_TEST (&*i == &values[2]);
-
- i = set_type::s_iterator_to(values[2]);
- BOOST_TEST (&*i == &values[2]);
-
- testset.erase (i);
- { int init_values [] = { 1, 3, 5 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testset.begin() ); }
- }
-}
-
-template<class ValueTraits, template <class = ::boost::intrusive::none, class = ::boost::intrusive::none, class = ::boost::intrusive::none, class = ::boost::intrusive::none> class ContainerDefiner>
-void test_generic_set<ValueTraits, ContainerDefiner>::test_insert_advanced
-(std::vector<typename ValueTraits::value_type>& values, boost::intrusive::detail::true_type)
-{
- typedef typename ValueTraits::value_type value_type;
- typedef typename ContainerDefiner
- < value_type
- , value_traits<ValueTraits>
- , constant_time_size<value_type::constant_time_size>
- >::type set_type;
- {
- set_type testset;
- testset.insert(&values[0], &values[0] + values.size());
- value_type v(1);
- typename set_type::insert_commit_data data;
- BOOST_TEST (!testset.insert_check(v, testset.value_comp(), testset.priority_comp(), data).second);
- BOOST_TEST (!testset.insert_check(testset.begin(), v, testset.value_comp(), testset.priority_comp(), data).second);
- }
-}
-
-
-template<class ValueTraits, template <class = ::boost::intrusive::none, class = ::boost::intrusive::none, class = ::boost::intrusive::none, class = ::boost::intrusive::none> class ContainerDefiner>
-void test_generic_set<ValueTraits, ContainerDefiner>::test_insert_advanced
-(std::vector<typename ValueTraits::value_type>& values)
-{
- typedef typename ValueTraits::value_type value_type;
- typedef typename ContainerDefiner
- < value_type
- , value_traits<ValueTraits>
- , constant_time_size<value_type::constant_time_size>
- >::type set_type;
- typedef typename detail::remove_const<set_type>::type Type;
- typedef detail::bool_<is_treap<Type>::value> enabler;
- test_insert_advanced(values, enabler());
-}
-
-
-//test: insert, const_iterator, const_reverse_iterator, erase, s_iterator_to:
-template<class ValueTraits, template <class = ::boost::intrusive::none, class = ::boost::intrusive::none, class = ::boost::intrusive::none, class = ::boost::intrusive::none> class ContainerDefiner>
-void test_generic_set<ValueTraits, ContainerDefiner>::test_insert_advanced
- ( std::vector<typename ValueTraits::value_type>& values
- , boost::intrusive::detail::false_type)
-{
- typedef typename ValueTraits::value_type value_type;
- typedef typename ContainerDefiner
- < value_type
- , value_traits<ValueTraits>
- , constant_time_size<value_type::constant_time_size>
- >::type set_type;
- {
- set_type testset;
- testset.insert(&values[0], &values[0] + values.size());
- value_type v(1);
- typename set_type::insert_commit_data data;
- BOOST_TEST (!testset.insert_check(v, testset.value_comp(), data).second);
- BOOST_TEST (!testset.insert_check(testset.begin(), v, testset.value_comp(), data).second);
- }
-}
-
-
-//test: insert (seq-version), swap, erase (seq-version), size:
-template<class ValueTraits, template <class = ::boost::intrusive::none, class = ::boost::intrusive::none, class = ::boost::intrusive::none, class = ::boost::intrusive::none> class ContainerDefiner>
-void test_generic_set<ValueTraits, ContainerDefiner>::test_swap(std::vector<typename ValueTraits::value_type>& values)
-{
- typedef typename ValueTraits::value_type value_type;
- typedef typename ContainerDefiner
- < value_type
- , value_traits<ValueTraits>
- , constant_time_size<value_type::constant_time_size>
- >::type set_type;
- set_type testset1 (&values[0], &values[0] + 2);
- set_type testset2;
- testset2.insert (&values[0] + 2, &values[0] + 6);
- testset1.swap (testset2);
-
- { int init_values [] = { 1, 2, 4, 5 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testset1.begin() ); }
-
- { int init_values [] = { 2, 3 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testset2.begin() ); }
-
- testset1.erase (testset1.iterator_to(values[5]), testset1.end());
- BOOST_TEST (testset1.size() == 1);
- // BOOST_TEST (&testset1.front() == &values[3]);
- BOOST_TEST (&*testset1.begin() == &values[3]);
-}
-
-//test: find, equal_range (lower_bound, upper_bound):
-template<class ValueTraits, template <class = ::boost::intrusive::none, class = ::boost::intrusive::none, class = ::boost::intrusive::none, class = ::boost::intrusive::none> class ContainerDefiner>
-void test_generic_set<ValueTraits, ContainerDefiner>::test_find(std::vector<typename ValueTraits::value_type>& values)
-{
- typedef typename ValueTraits::value_type value_type;
- typedef typename ContainerDefiner
- < value_type
- , value_traits<ValueTraits>
- , constant_time_size<value_type::constant_time_size>
- >::type set_type;
- set_type testset (values.begin(), values.end());
- typedef typename set_type::iterator iterator;
-
- value_type cmp_val;
- cmp_val.value_ = 2;
- iterator i = testset.find (cmp_val);
- BOOST_TEST (i->value_ == 2);
- BOOST_TEST ((++i)->value_ != 2);
- std::pair<iterator,iterator> range = testset.equal_range (cmp_val);
-
- BOOST_TEST (range.first->value_ == 2);
- BOOST_TEST (range.second->value_ == 3);
- BOOST_TEST (std::distance (range.first, range.second) == 1);
-
- cmp_val.value_ = 7;
- BOOST_TEST (testset.find (cmp_val) == testset.end());
-}
-
-}}} //namespace boost::intrusive::test
-
-#include <boost/intrusive/detail/config_end.hpp>

Deleted: sandbox/move/libs/intrusive/test/itestvalue.hpp
==============================================================================
--- sandbox/move/libs/intrusive/test/itestvalue.hpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,183 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Olaf Krzikalla 2004-2006.
-// (C) Copyright Ion Gaztanaga 2006-2009.
-//
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-#ifndef BOOST_INTRUSIVE_DETAIL_ITESTVALUE_HPP
-#define BOOST_INTRUSIVE_DETAIL_ITESTVALUE_HPP
-
-#include <iostream>
-#include <boost/intrusive/options.hpp>
-#include <boost/functional/hash.hpp>
-
-namespace boost{
-namespace intrusive{
-
-struct testvalue_filler
-{
- void *dummy_[3];
-};
-
-template<class Hooks, bool ConstantTimeSize>
-struct testvalue
- : testvalue_filler
- , Hooks::base_hook_type
- , Hooks::auto_base_hook_type
-{
- typename Hooks::member_hook_type node_;
- typename Hooks::auto_member_hook_type auto_node_;
- int value_;
-
- static const bool constant_time_size = ConstantTimeSize;
-
- testvalue()
- {}
-
- testvalue(int i)
- : value_(i)
- {}
-
- testvalue (const testvalue& src)
- : value_ (src.value_)
- {}
-
- // testvalue is used in std::vector and thus prev and next
- // have to be handled appropriately when copied:
- testvalue & operator= (const testvalue& src)
- {
- Hooks::base_hook_type::operator=(src);
- Hooks::auto_base_hook_type::operator=(src);
- this->node_ = src.node_;
- this->auto_node_ = src.auto_node_;
- value_ = src.value_;
- return *this;
- }
-
- void swap_nodes(testvalue &other)
- {
- Hooks::base_hook_type::swap_nodes(other);
- Hooks::auto_base_hook_type::swap_nodes(other);
- node_.swap_nodes(other.node_);
- auto_node_.swap_nodes(other.auto_node_);
- }
-
- bool is_linked() const
- {
- return Hooks::base_hook_type::is_linked() ||
- Hooks::auto_base_hook_type::is_linked() ||
- node_.is_linked() ||
- auto_node_.is_linked();
- }
-
- ~testvalue()
- {}
-
- bool operator< (const testvalue &other) const
- { return value_ < other.value_; }
-
- bool operator==(const testvalue &other) const
- { return value_ == other.value_; }
-
- bool operator!=(const testvalue &other) const
- { return value_ != other.value_; }
-
- friend bool operator< (int other1, const testvalue &other2)
- { return other1 < other2.value_; }
-
- friend bool operator< (const testvalue &other1, int other2)
- { return other1.value_ < other2; }
-
- friend bool operator== (int other1, const testvalue &other2)
- { return other1 == other2.value_; }
-
- friend bool operator== (const testvalue &other1, int other2)
- { return other1.value_ == other2; }
-
- friend bool operator!= (int other1, const testvalue &other2)
- { return other1 != other2.value_; }
-
- friend bool operator!= (const testvalue &other1, int other2)
- { return other1.value_ != other2; }
-};
-
-template<class Hooks, bool ConstantTimeSize>
-std::size_t hash_value(const testvalue<Hooks, ConstantTimeSize> &t)
-{
- boost::hash<int> hasher;
- return hasher(t.value_);
-}
-
-template<class Hooks, bool ConstantTimeSize>
-bool priority_order( const testvalue<Hooks, ConstantTimeSize> &t1
- , const testvalue<Hooks, ConstantTimeSize> &t2)
-{
- std::size_t hash1 = hash_value(t1);
- boost::hash_combine(hash1, &t1);
- std::size_t hash2 = hash_value(t2);
- boost::hash_combine(hash2, &t2);
- return hash1 < hash2;
-}
-
-template<class Hooks, bool constant_time_size>
-std::ostream& operator<<
- (std::ostream& s, const testvalue<Hooks, constant_time_size>& t)
-{ return s << t.value_; }
-
-struct even_odd
-{
- template<class Hooks, bool constant_time_size>
- bool operator()
- (const testvalue<Hooks, constant_time_size>& v1
- ,const testvalue<Hooks, constant_time_size>& v2) const
- {
- if ((v1.value_ & 1) == (v2.value_ & 1))
- return v1.value_ < v2.value_;
- else
- return v2.value_ & 1;
- }
-};
-
-struct is_even
-{
- template<class Hooks, bool constant_time_size>
- bool operator()
- (const testvalue<Hooks, constant_time_size>& v1) const
- { return (v1.value_ & 1) == 0; }
-};
-/*
-struct int_testvalue_comp
-{
- template<class Hooks, bool constant_time_size>
- bool operator()
- (const testvalue<Hooks, constant_time_size>& v1, const int &i) const
- { return v1.value_ < i; }
- template<class Hooks, bool constant_time_size>
- bool operator()
- (const int &i, const testvalue<Hooks, constant_time_size>& v1) const
- { return i < v1.value_; }
-};
-
-struct int_testvalue_pcomp
-{
- template<class Hooks, bool constant_time_size>
- bool operator()
- (const testvalue<Hooks, constant_time_size>& v1, const int &i) const
- { return v1.value_ < i; }
- template<class Hooks, bool constant_time_size>
- bool operator()
- (const int &i, const testvalue<Hooks, constant_time_size>& v1) const
- { return i < v1.value_; }
-};
-*/
-
-} //namespace boost{
-} //namespace intrusive{
-
-#endif

Deleted: sandbox/move/libs/intrusive/test/list_test.cpp
==============================================================================
--- sandbox/move/libs/intrusive/test/list_test.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,503 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Olaf Krzikalla 2004-2006.
-// (C) Copyright Ion Gaztanaga 2006-2009.
-//
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-
-#include <boost/intrusive/detail/config_begin.hpp>
-#include <boost/intrusive/list.hpp>
-
-#include <boost/intrusive/detail/pointer_to_other.hpp>
-#include "itestvalue.hpp"
-#include "smart_ptr.hpp"
-#include "common_functors.hpp"
-#include <vector>
-#include <boost/detail/lightweight_test.hpp>
-#include "test_macros.hpp"
-#include "test_container.hpp"
-
-using namespace boost::intrusive;
-
-class my_tag;
-
-template<class VoidPointer>
-struct hooks
-{
- typedef list_base_hook<void_pointer<VoidPointer> > base_hook_type;
- typedef list_base_hook< link_mode<auto_unlink>
- , void_pointer<VoidPointer>, tag<my_tag> > auto_base_hook_type;
- typedef list_member_hook<void_pointer<VoidPointer>, tag<my_tag> > member_hook_type;
- typedef list_member_hook< link_mode<auto_unlink>
- , void_pointer<VoidPointer> > auto_member_hook_type;
-};
-
-template<class ValueTraits>
-struct test_list
-{
- typedef typename ValueTraits::value_type value_type;
- static void test_all(std::vector<value_type>& values);
- static void test_front_back(std::vector<value_type>& values);
- static void test_sort(std::vector<value_type>& values);
- static void test_merge(std::vector<value_type>& values);
- static void test_remove_unique(std::vector<value_type>& values);
- static void test_insert(std::vector<value_type>& values);
- static void test_shift(std::vector<value_type>& values);
- static void test_swap(std::vector<value_type>& values);
- static void test_clone(std::vector<value_type>& values);
- static void test_container_from_end(std::vector<value_type>& values);
-};
-
-template<class ValueTraits>
-void test_list<ValueTraits>::test_all(std::vector<typename ValueTraits::value_type>& values)
-{
- typedef typename ValueTraits::value_type value_type;
- typedef list
- < value_type
- , value_traits<ValueTraits>
- , size_type<std::size_t>
- , constant_time_size<value_type::constant_time_size>
- > list_type;
- {
- list_type list(values.begin(), values.end());
- test::test_container(list);
- list.clear();
- list.insert(list.end(), values.begin(), values.end());
- test::test_sequence_container(list, values);
- }
-
- test_front_back(values);
- test_sort(values);
- test_merge(values);
- test_remove_unique(values);
- test_insert(values);
- test_shift(values);
- test_swap(values);
- test_clone(values);
- test_container_from_end(values);
-}
-
-//test: push_front, pop_front, push_back, pop_back, front, back, size, empty:
-template<class ValueTraits>
-void test_list<ValueTraits>
- ::test_front_back(std::vector<typename ValueTraits::value_type>& values)
-{
- typedef typename ValueTraits::value_type value_type;
- typedef list
- < value_type
- , value_traits<ValueTraits>
- , size_type<std::size_t>
- , constant_time_size<value_type::constant_time_size>
- > list_type;
- list_type testlist;
- BOOST_TEST (testlist.empty());
-
- testlist.push_back (values[0]);
- BOOST_TEST (testlist.size() == 1);
- BOOST_TEST (&testlist.front() == &values[0]);
- BOOST_TEST (&testlist.back() == &values[0]);
-
- testlist.push_front (values[1]);
- BOOST_TEST (testlist.size() == 2);
- BOOST_TEST (&testlist.front() == &values[1]);
- BOOST_TEST (&testlist.back() == &values[0]);
-
- testlist.pop_back();
- BOOST_TEST (testlist.size() == 1);
- const list_type &const_testlist = testlist;
- BOOST_TEST (&const_testlist.front() == &values[1]);
- BOOST_TEST (&const_testlist.back() == &values[1]);
-
- testlist.pop_front();
- BOOST_TEST (testlist.empty());
-}
-
-
-//test: constructor, iterator, reverse_iterator, sort, reverse:
-template<class ValueTraits>
-void test_list<ValueTraits>
- ::test_sort(std::vector<typename ValueTraits::value_type>& values)
-{
- typedef typename ValueTraits::value_type value_type;
- typedef list
- < value_type
- , value_traits<ValueTraits>
- , size_type<std::size_t>
- , constant_time_size<value_type::constant_time_size>
- > list_type;
- list_type testlist(values.begin(), values.end());
-
- { int init_values [] = { 1, 2, 3, 4, 5 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testlist.begin() ); }
-
- testlist.sort (even_odd());
- { int init_values [] = { 5, 3, 1, 4, 2 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testlist.rbegin() ); }
-
- testlist.reverse();
- { int init_values [] = { 5, 3, 1, 4, 2 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testlist.begin() ); }
-}
-
-//test: merge due to error in merge implementation:
-template<class ValueTraits>
-void test_list<ValueTraits>
- ::test_remove_unique (std::vector<typename ValueTraits::value_type>& values)
-{
- typedef typename ValueTraits::value_type value_type;
- typedef list
- < value_type
- , value_traits<ValueTraits>
- , size_type<std::size_t>
- , constant_time_size<value_type::constant_time_size>
- > list_type;
- {
- list_type list(values.begin(), values.end());
- list.remove_if(is_even());
- int init_values [] = { 1, 3, 5 };
- TEST_INTRUSIVE_SEQUENCE( init_values, list.begin() );
- }
- {
- std::vector<typename ValueTraits::value_type> values2(values);
- list_type list(values.begin(), values.end());
- list.insert(list.end(), values2.begin(), values2.end());
- list.sort();
- int init_values [] = { 1, 1, 2, 2, 3, 3, 4, 4, 5, 5 };
- TEST_INTRUSIVE_SEQUENCE( init_values, list.begin() );
- list.unique();
- int init_values2 [] = { 1, 2, 3, 4, 5 };
- TEST_INTRUSIVE_SEQUENCE( init_values2, list.begin() );
- }
-}
-
-//test: merge due to error in merge implementation:
-template<class ValueTraits>
-void test_list<ValueTraits>
- ::test_merge (std::vector<typename ValueTraits::value_type>& values)
-{
- typedef typename ValueTraits::value_type value_type;
- typedef list
- < value_type
- , value_traits<ValueTraits>
- , size_type<std::size_t>
- , constant_time_size<value_type::constant_time_size>
- > list_type;
- list_type testlist1, testlist2;
- testlist1.push_front (values[0]);
- testlist2.push_front (values[4]);
- testlist2.push_front (values[3]);
- testlist2.push_front (values[2]);
- testlist1.merge (testlist2);
-
- int init_values [] = { 1, 3, 4, 5 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testlist1.begin() );
-}
-
-//test: assign, insert, const_iterator, const_reverse_iterator, erase, s_iterator_to:
-template<class ValueTraits>
-void test_list<ValueTraits>
- ::test_insert(std::vector<typename ValueTraits::value_type>& values)
-{
- typedef typename ValueTraits::value_type value_type;
- typedef list
- < value_type
- , value_traits<ValueTraits>
- , size_type<std::size_t>
- , constant_time_size<value_type::constant_time_size>
- > list_type;
- list_type testlist;
- testlist.assign (&values[0] + 2, &values[0] + 5);
-
- const list_type& const_testlist = testlist;
- { int init_values [] = { 3, 4, 5 };
- TEST_INTRUSIVE_SEQUENCE( init_values, const_testlist.begin() ); }
-
- typename list_type::iterator i = ++testlist.begin();
- BOOST_TEST (i->value_ == 4);
-
- {
- typename list_type::const_iterator ci = typename list_type::iterator();
- //typename list_type::iterator i = typename list_type::const_iterator();
- }
-
- testlist.insert (i, values[0]);
- { int init_values [] = { 5, 4, 1, 3 };
- TEST_INTRUSIVE_SEQUENCE( init_values, const_testlist.rbegin() ); }
-
- i = testlist.iterator_to (values[4]);
- BOOST_TEST (&*i == &values[4]);
-
- i = list_type::s_iterator_to (values[4]);
- BOOST_TEST (&*i == &values[4]);
-
- i = testlist.erase (i);
- BOOST_TEST (i == testlist.end());
-
- { int init_values [] = { 3, 1, 4 };
- TEST_INTRUSIVE_SEQUENCE( init_values, const_testlist.begin() ); }
-}
-
-
-template<class ValueTraits>
-void test_list<ValueTraits>
- ::test_shift(std::vector<typename ValueTraits::value_type>& values)
-{
- typedef typename ValueTraits::value_type value_type;
- typedef list
- < value_type
- , value_traits<ValueTraits>
- , size_type<std::size_t>
- , constant_time_size<value_type::constant_time_size>
- > list_type;
- list_type testlist;
- const int num_values = (int)values.size();
- std::vector<int> expected_values(num_values);
-
- for(int s = 1; s <= num_values; ++s){
- expected_values.resize(s);
- //Shift forward all possible positions 3 times
- for(int i = 0; i < s*3; ++i){
- testlist.insert(testlist.begin(), &values[0], &values[0] + s);
- testlist.shift_forward(i);
- for(int j = 0; j < s; ++j){
- expected_values[(j + s - i%s) % s] = (j + 1);
- }
- TEST_INTRUSIVE_SEQUENCE_EXPECTED(expected_values, testlist.begin());
- testlist.clear();
- }
-
- //Shift backwards all possible positions
- for(int i = 0; i < s*3; ++i){
- testlist.insert(testlist.begin(), &values[0], &values[0] + s);
- testlist.shift_backwards(i);
- for(int j = 0; j < s; ++j){
- expected_values[(j + i) % s] = (j + 1);
- }
- TEST_INTRUSIVE_SEQUENCE_EXPECTED(expected_values, testlist.begin());
- testlist.clear();
- }
- }
-}
-
-//test: insert (seq-version), swap, splice, erase (seq-version):
-template<class ValueTraits>
-void test_list<ValueTraits>
- ::test_swap(std::vector<typename ValueTraits::value_type>& values)
-{
- typedef typename ValueTraits::value_type value_type;
- typedef list
- < value_type
- , value_traits<ValueTraits>
- , size_type<std::size_t>
- , constant_time_size<value_type::constant_time_size>
- > list_type;
- {
- list_type testlist1 (&values[0], &values[0] + 2);
- list_type testlist2;
- testlist2.insert (testlist2.end(), &values[0] + 2, &values[0] + 5);
- testlist1.swap (testlist2);
-
- { int init_values [] = { 3, 4, 5 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testlist1.begin() ); }
- { int init_values [] = { 1, 2 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testlist2.begin() ); }
-
- testlist2.splice (++testlist2.begin(), testlist1);
- { int init_values [] = { 1, 3, 4, 5, 2 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testlist2.begin() ); }
-
- BOOST_TEST (testlist1.empty());
-
- testlist1.splice (testlist1.end(), testlist2, ++(++testlist2.begin()));
- { int init_values [] = { 4 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testlist1.begin() ); }
-
- { int init_values [] = { 1, 3, 5, 2 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testlist2.begin() ); }
-
- testlist1.splice (testlist1.end(), testlist2,
- testlist2.begin(), ----testlist2.end());
- { int init_values [] = { 4, 1, 3 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testlist1.begin() ); }
- { int init_values [] = { 5, 2 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testlist2.begin() ); }
-
- testlist1.erase (testlist1.iterator_to(values[0]), testlist1.end());
- BOOST_TEST (testlist1.size() == 1);
- BOOST_TEST (&testlist1.front() == &values[3]);
- }
- {
- list_type testlist1 (&values[0], &values[0] + 2);
- list_type testlist2 (&values[0] + 3, &values[0] + 5);
-
- values[0].swap_nodes(values[2]);
- { int init_values [] = { 3, 2 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testlist1.begin() ); }
-
- values[2].swap_nodes(values[4]);
- { int init_values [] = { 5, 2 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testlist1.begin() ); }
- { int init_values [] = { 4, 3 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testlist2.begin() ); }
- }
- {
- list_type testlist1 (&values[0], &values[1]);
-
- { int init_values [] = { 1 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testlist1.begin() ); }
-
- values[1].swap_nodes(values[2]);
-
- { int init_values [] = { 1 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testlist1.begin() ); }
-
- values[0].swap_nodes(values[2]);
-
- { int init_values [] = { 3 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testlist1.begin() ); }
-
- values[0].swap_nodes(values[2]);
-
- { int init_values [] = { 1 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testlist1.begin() ); }
- }
-
-}
-
-template<class ValueTraits>
-void test_list<ValueTraits>
- ::test_container_from_end(std::vector<typename ValueTraits::value_type>& values)
-{
- typedef typename ValueTraits::value_type value_type;
- typedef list
- < value_type
- , value_traits<ValueTraits>
- , size_type<std::size_t>
- , constant_time_size<value_type::constant_time_size>
- > list_type;
- list_type testlist1 (&values[0], &values[0] + values.size());
- BOOST_TEST (testlist1 == list_type::container_from_end_iterator(testlist1.end()));
- BOOST_TEST (testlist1 == list_type::container_from_end_iterator(testlist1.cend()));
-}
-
-
-template<class ValueTraits>
-void test_list<ValueTraits>
- ::test_clone(std::vector<typename ValueTraits::value_type>& values)
-{
- typedef typename ValueTraits::value_type value_type;
- typedef list
- < value_type
- , value_traits<ValueTraits>
- , size_type<std::size_t>
- , constant_time_size<value_type::constant_time_size>
- > list_type;
- list_type testlist1 (&values[0], &values[0] + values.size());
- list_type testlist2;
-
- testlist2.clone_from(testlist1, test::new_cloner<value_type>(), test::delete_disposer<value_type>());
- BOOST_TEST (testlist2 == testlist1);
- testlist2.clear_and_dispose(test::delete_disposer<value_type>());
- BOOST_TEST (testlist2.empty());
-}
-
-template<class VoidPointer, bool constant_time_size>
-class test_main_template
-{
- public:
- int operator()()
- {
- typedef testvalue<hooks<VoidPointer>, constant_time_size> value_type;
- std::vector<value_type> data (5);
- for (int i = 0; i < 5; ++i)
- data[i].value_ = i + 1;
-
- test_list < typename detail::get_base_value_traits
- < value_type
- , typename hooks<VoidPointer>::base_hook_type
- >::type
- >::test_all(data);
- test_list < typename detail::get_member_value_traits
- < value_type
- , member_hook< value_type
- , typename hooks<VoidPointer>::member_hook_type
- , &value_type::node_
- >
- >::type
- >::test_all(data);
- return 0;
- }
-};
-
-template<class VoidPointer>
-class test_main_template<VoidPointer, false>
-{
- public:
- int operator()()
- {
- typedef testvalue<hooks<VoidPointer>, false> value_type;
- std::vector<value_type> data (5);
- for (int i = 0; i < 5; ++i)
- data[i].value_ = i + 1;
-
- test_list < typename detail::get_base_value_traits
- < value_type
- , typename hooks<VoidPointer>::base_hook_type
- >::type
- >::test_all(data);
-
- test_list < typename detail::get_member_value_traits
- < value_type
- , member_hook< value_type
- , typename hooks<VoidPointer>::member_hook_type
- , &value_type::node_
- >
- >::type
- >::test_all(data);
-
-// test_list<stateful_value_traits
-// < value_type
-// , list_node_traits<VoidPointer>
-// , safe_link>
-// >::test_all(data);
- test_list < typename detail::get_base_value_traits
- < value_type
- , typename hooks<VoidPointer>::auto_base_hook_type
- >::type
- >::test_all(data);
-
- test_list < typename detail::get_member_value_traits
- < value_type
- , member_hook< value_type
- , typename hooks<VoidPointer>::auto_member_hook_type
- , &value_type::auto_node_
- >
- >::type
- >::test_all(data);
-
-// test_list<stateful_value_traits
-// < value_type
-// , list_node_traits<VoidPointer>
-// , auto_unlink>
-// >::test_all(data);
-
- return 0;
- }
-};
-
-int main( int, char* [] )
-{
- test_main_template<void*, false>()();
- test_main_template<smart_ptr<void>, false>()();
- test_main_template<void*, true>()();
- test_main_template<smart_ptr<void>, true>()();
-
- return boost::report_errors();
-}
-#include <boost/intrusive/detail/config_end.hpp>

Deleted: sandbox/move/libs/intrusive/test/make_functions_test.cpp
==============================================================================
--- sandbox/move/libs/intrusive/test/make_functions_test.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,231 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2007-2009
-//
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-#include <boost/intrusive/list.hpp>
-#include <boost/intrusive/slist.hpp>
-#include <boost/intrusive/set.hpp>
-#include <boost/intrusive/unordered_set.hpp>
-#include <boost/intrusive/avl_set.hpp>
-#include <boost/intrusive/sg_set.hpp>
-#include <boost/intrusive/splay_set.hpp>
-#include <boost/intrusive/treap_set.hpp>
-#include <boost/intrusive/detail/mpl.hpp>
-#include "smart_ptr.hpp"
-#include <vector>
-
-using namespace boost::intrusive;
-
-struct my_tag;
-
-typedef make_bs_set_base_hook
- < void_pointer<smart_ptr<void> >, link_mode<normal_link>
- , tag<my_tag> >::type TreapHook;
-
-class MyClass
-: public make_list_base_hook
- < void_pointer<smart_ptr<void> >, link_mode<normal_link> >::type
-, public make_slist_base_hook
- < void_pointer<smart_ptr<void> >, link_mode<normal_link> >::type
-, public make_set_base_hook
- < void_pointer<smart_ptr<void> >, link_mode<normal_link> >::type
-, public make_unordered_set_base_hook
- < void_pointer<smart_ptr<void> >, link_mode<normal_link> >::type
-, public make_avl_set_base_hook
- < void_pointer<smart_ptr<void> >, link_mode<normal_link> >::type
-, public make_splay_set_base_hook
- < void_pointer<smart_ptr<void> >, link_mode<normal_link> >::type
-, public make_bs_set_base_hook
- < void_pointer<smart_ptr<void> >, link_mode<normal_link> >::type
-, public TreapHook
-{
- int int_;
-
- public:
- MyClass(int i)
- : int_(i)
- {}
-
- friend bool operator<(const MyClass &l, const MyClass &r)
- { return l.int_ < r.int_; }
-
- friend bool operator==(const MyClass &l, const MyClass &r)
- { return l.int_ == r.int_; }
-
- friend std::size_t hash_value(const MyClass &v)
- { return boost::hash_value(v.int_); }
-
- friend bool priority_order(const MyClass &l, const MyClass &r)
- { return l.int_ < r.int_; }
-};
-
-//Define a list that will store MyClass using the public base hook
-typedef make_list<MyClass>::type List;
-typedef make_slist<MyClass>::type Slist;
-typedef make_set<MyClass>::type Set;
-typedef make_unordered_set<MyClass>::type USet;
-
-typedef make_avl_set<MyClass>::type AvlSet;
-typedef make_splay_set<MyClass>::type SplaySet;
-typedef make_sg_set<MyClass>::type SgSet;
-typedef make_treap_set<MyClass
- , base_hook<TreapHook> >::type TreapSet;
-
-int main()
-{
- typedef std::vector<MyClass>::iterator VectIt;
- typedef std::vector<MyClass>::reverse_iterator VectRit;
-
- //Create several MyClass objects, each one with a different value
- std::vector<MyClass> values;
- for(int i = 0; i < 100; ++i) values.push_back(MyClass(i));
-
- USet::bucket_type buckets[100];
-
- List my_list;
- Slist my_slist;
- Set my_set;
- USet my_uset(USet::bucket_traits(buckets, 100));
-
- AvlSet my_avlset;
- SplaySet my_splayset;
- SgSet my_sgset;
- TreapSet my_treapset;
-
- //Now insert them in containers
- for(VectIt it(values.begin()), itend(values.end()); it != itend; ++it){
- my_list.push_front(*it);
- my_slist.push_front(*it);
- my_set.insert(*it);
- my_uset.insert(*it);
- my_avlset.insert(*it);
- my_splayset.insert(*it);
- my_sgset.insert(*it);
- my_treapset.insert(*it);
- }
-
- //Now test lists
- {
- List::const_iterator list_it(my_list.cbegin());
- Slist::const_iterator slist_it(my_slist.cbegin());
- Set::const_reverse_iterator set_rit(my_set.crbegin());
-
- AvlSet::const_reverse_iterator avlset_rit(my_avlset.crbegin());
- SplaySet::const_reverse_iterator splayset_rit(my_splayset.crbegin());
- SgSet::const_reverse_iterator sgset_rit(my_sgset.crbegin());
- TreapSet::const_reverse_iterator treapset_rit(my_treapset.crbegin());
-
- VectRit vect_it(values.rbegin()), vect_itend(values.rend());
-
- //Test the objects inserted in the base hook list
- for( ; vect_it != vect_itend
- ; ++vect_it, ++list_it, ++slist_it, ++set_rit
- , ++avlset_rit, ++splayset_rit, ++sgset_rit, ++treapset_rit
- ){
- if(&*list_it != &*vect_it) return 1;
- if(&*slist_it != &*vect_it) return 1;
- if(&*set_rit != &*vect_it) return 1;
- if(my_uset.find(*set_rit) == my_uset.cend()) return 1;
- if(&*avlset_rit != &*vect_it) return 1;
- if(&*splayset_rit != &*vect_it) return 1;
- if(&*sgset_rit != &*vect_it) return 1;
- if(&*treapset_rit != &*vect_it) return 1;
- }
- }
-
- //Check defined types and implicitly defined types are equal
- if(detail::is_same<make_list_base_hook<void_pointer<void*>, link_mode<safe_link> >::type
- ,make_list_base_hook<>::type
- >::value == false){
- return 1;
- }
-
- if(detail::is_same<make_slist_base_hook<void_pointer<void*>, link_mode<safe_link> >::type
- ,make_slist_base_hook<>::type
- >::value == false){
- return 1;
- }
-
- if(detail::is_same<make_set_base_hook<void_pointer<void*>, link_mode<safe_link> >::type
- ,make_set_base_hook<>::type
- >::value == false){
- return 1;
- }
-
- if(detail::is_same<make_unordered_set_base_hook<void_pointer<void*>, link_mode<safe_link> >::type
- ,make_unordered_set_base_hook<>::type
- >::value == false){
- return 1;
- }
-
- if(detail::is_same<make_avl_set_base_hook<void_pointer<void*>, link_mode<safe_link> >::type
- ,make_avl_set_base_hook<>::type
- >::value == false){
- return 1;
- }
-
- if(detail::is_same<make_bs_set_base_hook<void_pointer<void*>, link_mode<safe_link> >::type
- ,make_bs_set_base_hook<>::type
- >::value == false){
- return 1;
- }
-
- if(detail::is_same<make_splay_set_base_hook<void_pointer<void*>, link_mode<safe_link> >::type
- ,make_splay_set_base_hook<>::type
- >::value == false){
- return 1;
- }
-
- //Check defined types and implicitly defined types are unequal
- if(detail::is_same<make_list_base_hook<void_pointer<void*>, link_mode<normal_link> >::type
- ,make_list_base_hook<>::type
- >::value == true){
- return 1;
- }
-
- if(detail::is_same<make_slist_base_hook<void_pointer<void*>, link_mode<normal_link> >::type
- ,make_slist_base_hook<>::type
- >::value == true){
- return 1;
- }
-
- if(detail::is_same<make_set_base_hook<void_pointer<void*>, link_mode<normal_link> >::type
- ,make_set_base_hook<>::type
- >::value == true){
- return 1;
- }
-
- if(detail::is_same<make_unordered_set_base_hook<void_pointer<void*>, link_mode<normal_link> >::type
- ,make_unordered_set_base_hook<>::type
- >::value == true){
- return 1;
- }
-
- if(detail::is_same<make_avl_set_base_hook<void_pointer<void*>, link_mode<normal_link> >::type
- ,make_avl_set_base_hook<>::type
- >::value == true){
- return 1;
- }
-
- if(detail::is_same<make_splay_set_base_hook<void_pointer<void*>, link_mode<normal_link> >::type
- ,make_splay_set_base_hook<>::type
- >::value == true){
- return 1;
- }
-
- if(detail::is_same<make_bs_set_base_hook<void_pointer<void*>, link_mode<normal_link> >::type
- ,make_bs_set_base_hook<>::type
- >::value == true){
- return 1;
- }
-
-
- return 0;
-}

Deleted: sandbox/move/libs/intrusive/test/multiset_test.cpp
==============================================================================
--- sandbox/move/libs/intrusive/test/multiset_test.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,157 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Olaf Krzikalla 2004-2006.
-// (C) Copyright Ion Gaztanaga 2006-2009.
-//
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-#include <boost/intrusive/detail/config_begin.hpp>
-#include <boost/intrusive/set.hpp>
-#include "itestvalue.hpp"
-#include "smart_ptr.hpp"
-#include "generic_multiset_test.hpp"
-
-namespace boost { namespace intrusive { namespace test {
-
-#if !defined (BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template<class T, class O1, class O2, class O3, class O4>
-#else
-template<class T, class ...Options>
-#endif
-struct has_insert_before<boost::intrusive::multiset<T,
- #if !defined (BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
- O1, O2, O3, O4
- #else
- Options...
- #endif
-> >
-{
- static const bool value = true;
-};
-
-}}}
-
-using namespace boost::intrusive;
-
-struct my_tag;
-
-template<class VoidPointer>
-struct hooks
-{
- typedef set_base_hook
- <void_pointer<VoidPointer> > base_hook_type;
- typedef set_base_hook
- <link_mode<auto_unlink>
- , void_pointer<VoidPointer>
- , tag<my_tag>
- , optimize_size<true> > auto_base_hook_type;
- typedef set_member_hook<void_pointer
- <VoidPointer>, optimize_size<true> > member_hook_type;
- typedef set_member_hook
- <link_mode<auto_unlink>, void_pointer<VoidPointer> > auto_member_hook_type;
-};
-
-template< class ValueType
- , class Option1 = boost::intrusive::none
- , class Option2 = boost::intrusive::none
- , class Option3 = boost::intrusive::none
- >
-struct GetContainer
-{
- typedef boost::intrusive::multiset
- < ValueType
- , Option1
- , Option2
- , Option3
- > type;
-};
-
-template<class VoidPointer, bool constant_time_size>
-class test_main_template
-{
- public:
- int operator()()
- {
- using namespace boost::intrusive;
- typedef testvalue<hooks<VoidPointer> , constant_time_size> value_type;
-
- test::test_generic_multiset < typename detail::get_base_value_traits
- < value_type
- , typename hooks<VoidPointer>::base_hook_type
- >::type
- , GetContainer
- >::test_all();
- test::test_generic_multiset < typename detail::get_member_value_traits
- < value_type
- , member_hook< value_type
- , typename hooks<VoidPointer>::member_hook_type
- , &value_type::node_
- >
- >::type
- , GetContainer
- >::test_all();
- return 0;
- }
-};
-
-template<class VoidPointer>
-class test_main_template<VoidPointer, false>
-{
- public:
- int operator()()
- {
- using namespace boost::intrusive;
- typedef testvalue<hooks<VoidPointer> , false> value_type;
-
- test::test_generic_multiset < typename detail::get_base_value_traits
- < value_type
- , typename hooks<VoidPointer>::base_hook_type
- >::type
- , GetContainer
- >::test_all();
-
- test::test_generic_multiset < typename detail::get_member_value_traits
- < value_type
- , member_hook< value_type
- , typename hooks<VoidPointer>::member_hook_type
- , &value_type::node_
- >
- >::type
- , GetContainer
- >::test_all();
-
- test::test_generic_multiset < typename detail::get_base_value_traits
- < value_type
- , typename hooks<VoidPointer>::auto_base_hook_type
- >::type
- , GetContainer
- >::test_all();
-
- test::test_generic_multiset < typename detail::get_member_value_traits
- < value_type
- , member_hook< value_type
- , typename hooks<VoidPointer>::auto_member_hook_type
- , &value_type::auto_node_
- >
- >::type
- , GetContainer
- >::test_all();
- return 0;
- }
-};
-
-int main( int, char* [] )
-{
- test_main_template<void*, false>()();
- test_main_template<boost::intrusive::smart_ptr<void>, false>()();
- test_main_template<void*, true>()();
- test_main_template<boost::intrusive::smart_ptr<void>, true>()();
- return boost::report_errors();
-}
-
-#include <boost/intrusive/detail/config_end.hpp>

Deleted: sandbox/move/libs/intrusive/test/set_test.cpp
==============================================================================
--- sandbox/move/libs/intrusive/test/set_test.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,160 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Olaf Krzikalla 2004-2006.
-// (C) Copyright Ion Gaztanaga 2006-2009.
-//
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-#include <boost/intrusive/detail/config_begin.hpp>
-
-#include <boost/intrusive/set.hpp>
-#include "itestvalue.hpp"
-#include "smart_ptr.hpp"
-#include "generic_set_test.hpp"
-
-namespace boost { namespace intrusive { namespace test {
-
-#if !defined (BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template<class T, class O1, class O2, class O3, class O4>
-#else
-template<class T, class ...Options>
-#endif
-struct has_insert_before<boost::intrusive::set<T,
- #if !defined (BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
- O1, O2, O3, O4
- #else
- Options...
- #endif
-> >
-{
- static const bool value = true;
-};
-
-}}}
-
-struct my_tag;
-
-using namespace boost::intrusive;
-
-template<class VoidPointer>
-struct hooks
-{
- typedef set_base_hook
- <void_pointer<VoidPointer> > base_hook_type;
- typedef set_base_hook
- <link_mode<auto_unlink>
- , void_pointer<VoidPointer>
- , tag<my_tag>
- , optimize_size<true> > auto_base_hook_type;
- typedef set_member_hook<void_pointer
- <VoidPointer>, optimize_size<true> > member_hook_type;
- typedef set_member_hook
- <link_mode<auto_unlink>, void_pointer<VoidPointer> > auto_member_hook_type;
-};
-
-template< class ValueType
- , class Option1 = boost::intrusive::none
- , class Option2 = boost::intrusive::none
- , class Option3 = boost::intrusive::none
- >
-struct GetContainer
-{
- typedef boost::intrusive::set
- < ValueType
- , Option1
- , Option2
- , Option3
- > type;
-};
-
-template<class VoidPointer, bool constant_time_size>
-class test_main_template
-{
- public:
- int operator()()
- {
- using namespace boost::intrusive;
- typedef testvalue<hooks<VoidPointer> , constant_time_size> value_type;
-
- test::test_generic_set < typename detail::get_base_value_traits
- < value_type
- , typename hooks<VoidPointer>::base_hook_type
- >::type
- , GetContainer
- >::test_all();
- test::test_generic_set < typename detail::get_member_value_traits
- < value_type
- , member_hook< value_type
- , typename hooks<VoidPointer>::member_hook_type
- , &value_type::node_
- >
- >::type
- , GetContainer
- >::test_all();
- return 0;
- }
-};
-
-template<class VoidPointer>
-class test_main_template<VoidPointer, false>
-{
- public:
- int operator()()
- {
- using namespace boost::intrusive;
- typedef testvalue<hooks<VoidPointer> , false> value_type;
-
- test::test_generic_set < typename detail::get_base_value_traits
- < value_type
- , typename hooks<VoidPointer>::base_hook_type
- >::type
- , GetContainer
- >::test_all();
-
- test::test_generic_set < typename detail::get_member_value_traits
- < value_type
- , member_hook< value_type
- , typename hooks<VoidPointer>::member_hook_type
- , &value_type::node_
- >
- >::type
- , GetContainer
- >::test_all();
-
- test::test_generic_set < typename detail::get_base_value_traits
- < value_type
- , typename hooks<VoidPointer>::auto_base_hook_type
- >::type
- , GetContainer
- >::test_all();
-
- test::test_generic_set < typename detail::get_member_value_traits
- < value_type
- , member_hook< value_type
- , typename hooks<VoidPointer>::auto_member_hook_type
- , &value_type::auto_node_
- >
- >::type
- , GetContainer
- >::test_all();
-
- return 0;
- }
-};
-
-
-int main( int, char* [] )
-{
- test_main_template<void*, false>()();
- test_main_template<boost::intrusive::smart_ptr<void>, false>()();
- test_main_template<void*, true>()();
- test_main_template<boost::intrusive::smart_ptr<void>, true>()();
- return boost::report_errors();
-}
-
-#include <boost/intrusive/detail/config_end.hpp>

Deleted: sandbox/move/libs/intrusive/test/sg_multiset_test.cpp
==============================================================================
--- sandbox/move/libs/intrusive/test/sg_multiset_test.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,151 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Olaf Krzikalla 2004-2006.
-// (C) Copyright Ion Gaztanaga 2006-2009.
-//
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-#include <boost/intrusive/detail/config_begin.hpp>
-#include <boost/intrusive/sg_set.hpp>
-#include "itestvalue.hpp"
-#include "smart_ptr.hpp"
-#include "generic_multiset_test.hpp"
-
-namespace boost { namespace intrusive { namespace test {
-
-#if !defined (BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template<class T, class O1, class O2, class O3, class O4>
-#else
-template<class T, class ...Options>
-#endif
-struct has_rebalance<boost::intrusive::sg_multiset<T,
- #if !defined (BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
- O1, O2, O3, O4
- #else
- Options...
- #endif
-> >
-{
- static const bool value = true;
-};
-
-
-#if !defined (BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template<class T, class O1, class O2, class O3, class O4>
-#else
-template<class T, class ...Options>
-#endif
-struct has_insert_before<boost::intrusive::sg_multiset<T,
- #if !defined (BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
- O1, O2, O3, O4
- #else
- Options...
- #endif
-> >
-{
- static const bool value = true;
-};
-
-}}}
-
-using namespace boost::intrusive;
-
-struct my_tag;
-
-template<class VoidPointer>
-struct hooks
-{
- typedef bs_set_base_hook<void_pointer<VoidPointer> > base_hook_type;
- typedef bs_set_member_hook<void_pointer<VoidPointer> > member_hook_type;
- typedef member_hook_type auto_member_hook_type;
- struct auto_base_hook_type
- : bs_set_base_hook<void_pointer<VoidPointer>, tag<my_tag> >
- {};
-};
-
-
-template< class ValueType
- , class Option1 = boost::intrusive::none
- , class Option2 = boost::intrusive::none
- , class Option3 = boost::intrusive::none
- >
-struct GetContainer
-{
- typedef boost::intrusive::sg_multiset
- < ValueType
- , Option1
- , Option2
- , Option3
- > type;
-};
-
-template< class ValueType
- , class Option1 = boost::intrusive::none
- , class Option2 = boost::intrusive::none
- , class Option3 = boost::intrusive::none
- >
-struct GetContainerFixedAlpha
-{
- typedef boost::intrusive::sg_multiset
- < ValueType
- , Option1
- , Option2
- , Option3
- , boost::intrusive::floating_point<false>
- > type;
-};
-
-template<class VoidPointer>
-class test_main_template
-{
- public:
- int operator()()
- {
- using namespace boost::intrusive;
- typedef testvalue<hooks<VoidPointer> , true> value_type;
-
- test::test_generic_multiset < typename detail::get_base_value_traits
- < value_type
- , typename hooks<VoidPointer>::base_hook_type
- >::type
- , GetContainer
- >::test_all();
- test::test_generic_multiset < typename detail::get_member_value_traits
- < value_type
- , member_hook< value_type
- , typename hooks<VoidPointer>::member_hook_type
- , &value_type::node_
- >
- >::type
- , GetContainer
- >::test_all();
- test::test_generic_multiset < typename detail::get_base_value_traits
- < value_type
- , typename hooks<VoidPointer>::base_hook_type
- >::type
- , GetContainerFixedAlpha
- >::test_all();
- test::test_generic_multiset < typename detail::get_member_value_traits
- < value_type
- , member_hook< value_type
- , typename hooks<VoidPointer>::member_hook_type
- , &value_type::node_
- >
- >::type
- , GetContainerFixedAlpha
- >::test_all();
- return 0;
- }
-};
-
-int main( int, char* [] )
-{
- test_main_template<void*>()();
- test_main_template<boost::intrusive::smart_ptr<void> >()();
- return boost::report_errors();
-}

Deleted: sandbox/move/libs/intrusive/test/sg_set_test.cpp
==============================================================================
--- sandbox/move/libs/intrusive/test/sg_set_test.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,151 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2007.
-//
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-#include <boost/intrusive/detail/config_begin.hpp>
-#include <boost/intrusive/sg_set.hpp>
-#include "itestvalue.hpp"
-#include "smart_ptr.hpp"
-#include "generic_set_test.hpp"
-
-namespace boost { namespace intrusive { namespace test {
-
-#if !defined (BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template<class T, class O1, class O2, class O3, class O4>
-#else
-template<class T, class ...Options>
-#endif
-struct has_rebalance<boost::intrusive::sg_set<T,
- #if !defined (BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
- O1, O2, O3, O4
- #else
- Options...
- #endif
-> >
-{
- static const bool value = true;
-};
-
-#if !defined (BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template<class T, class O1, class O2, class O3, class O4>
-#else
-template<class T, class ...Options>
-#endif
-struct has_insert_before<boost::intrusive::sg_set<T,
- #if !defined (BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
- O1, O2, O3, O4
- #else
- Options...
- #endif
-> >
-{
- static const bool value = true;
-};
-
-}}}
-
-
-using namespace boost::intrusive;
-
-struct my_tag;
-
-template<class VoidPointer>
-struct hooks
-{
- typedef bs_set_base_hook<void_pointer<VoidPointer> > base_hook_type;
- typedef bs_set_member_hook<void_pointer<VoidPointer> > member_hook_type;
- typedef member_hook_type auto_member_hook_type;
- struct auto_base_hook_type
- : bs_set_base_hook<void_pointer<VoidPointer>, tag<my_tag> >
- {};
-};
-
-template< class ValueType
- , class Option1 = boost::intrusive::none
- , class Option2 = boost::intrusive::none
- , class Option3 = boost::intrusive::none
- >
-struct GetContainer
-{
- typedef boost::intrusive::sg_set
- < ValueType
- , Option1
- , Option2
- , Option3
- > type;
-};
-
-template< class ValueType
- , class Option1 = boost::intrusive::none
- , class Option2 = boost::intrusive::none
- , class Option3 = boost::intrusive::none
- >
-struct GetContainerFixedAlpha
-{
- typedef boost::intrusive::sg_set
- < ValueType
- , Option1
- , Option2
- , Option3
- , boost::intrusive::floating_point<false>
- > type;
-};
-
-template<class VoidPointer>
-class test_main_template
-{
- public:
- int operator()()
- {
- using namespace boost::intrusive;
- typedef testvalue<hooks<VoidPointer> , true> value_type;
-
- test::test_generic_set < typename detail::get_base_value_traits
- < value_type
- , typename hooks<VoidPointer>::base_hook_type
- >::type
- , GetContainer
- >::test_all();
- test::test_generic_set < typename detail::get_member_value_traits
- < value_type
- , member_hook< value_type
- , typename hooks<VoidPointer>::member_hook_type
- , &value_type::node_
- >
- >::type
- , GetContainer
- >::test_all();
-
- test::test_generic_set < typename detail::get_base_value_traits
- < value_type
- , typename hooks<VoidPointer>::base_hook_type
- >::type
- , GetContainerFixedAlpha
- >::test_all();
- test::test_generic_set < typename detail::get_member_value_traits
- < value_type
- , member_hook< value_type
- , typename hooks<VoidPointer>::member_hook_type
- , &value_type::node_
- >
- >::type
- , GetContainerFixedAlpha
- >::test_all();
- return 0;
- }
-};
-
-int main( int, char* [] )
-{
- test_main_template<void*>()();
- test_main_template<boost::intrusive::smart_ptr<void> >()();
- return boost::report_errors();
-}
-#include <boost/intrusive/detail/config_end.hpp>

Deleted: sandbox/move/libs/intrusive/test/slist_test.cpp
==============================================================================
--- sandbox/move/libs/intrusive/test/slist_test.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,732 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Olaf Krzikalla 2004-2006.
-// (C) Copyright Ion Gaztanaga 2006-2009.
-//
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-
-#include <boost/intrusive/detail/config_begin.hpp>
-#include <boost/intrusive/slist.hpp>
-#include <boost/intrusive/detail/pointer_to_other.hpp>
-#include "itestvalue.hpp"
-#include "smart_ptr.hpp"
-#include "common_functors.hpp"
-#include <vector>
-#include <boost/detail/lightweight_test.hpp>
-#include "test_macros.hpp"
-#include "test_container.hpp"
-
-using namespace boost::intrusive;
-
-struct my_tag;
-
-template<class VoidPointer>
-struct hooks
-{
- typedef slist_base_hook<void_pointer<VoidPointer> > base_hook_type;
- typedef slist_base_hook< link_mode<auto_unlink>
- , void_pointer<VoidPointer>, tag<my_tag> > auto_base_hook_type;
- typedef slist_member_hook<void_pointer<VoidPointer>, tag<my_tag> > member_hook_type;
- typedef slist_member_hook< link_mode<auto_unlink>
- , void_pointer<VoidPointer> > auto_member_hook_type;
-};
-
-template<class ValueTraits, bool Linear, bool CacheLast>
-struct test_slist
-{
- typedef typename ValueTraits::value_type value_type;
- static void test_all(std::vector<value_type>& values);
- static void test_front(std::vector<value_type>& values);
- static void test_back(std::vector<value_type>& values, detail::bool_<true>);
- static void test_back(std::vector<value_type>& values, detail::bool_<false>);
- static void test_sort(std::vector<value_type>& values);
- static void test_merge(std::vector<value_type>& values);
- static void test_remove_unique(std::vector<value_type>& values);
- static void test_insert(std::vector<value_type>& values);
- static void test_shift(std::vector<value_type>& values);
- static void test_swap(std::vector<value_type>& values);
- static void test_slow_insert(std::vector<value_type>& values);
- static void test_clone(std::vector<value_type>& values);
- static void test_container_from_end(std::vector<value_type> &, detail::bool_<true>){}
- static void test_container_from_end(std::vector<value_type> &values, detail::bool_<false>);
-};
-
-template<class ValueTraits, bool Linear, bool CacheLast>
-void test_slist<ValueTraits, Linear, CacheLast>
- ::test_all (std::vector<typename ValueTraits::value_type>& values)
-{
- typedef typename ValueTraits::value_type value_type;
- typedef slist
- < value_type
- , value_traits<ValueTraits>
- , size_type<std::size_t>
- , constant_time_size<value_type::constant_time_size>
- , linear<Linear>
- , cache_last<CacheLast>
- > list_type;
- {
- list_type list(values.begin(), values.end());
- test::test_container(list);
- list.clear();
- list.insert(list.end(), values.begin(), values.end());
- test::test_sequence_container(list, values);
- }
- test_front(values);
- test_back(values, detail::bool_<CacheLast>());
- test_sort(values);
- test_merge (values);
- test_remove_unique(values);
- test_insert(values);
- test_shift(values);
- test_slow_insert (values);
- test_swap(values);
- test_clone(values);
- test_container_from_end(values, detail::bool_<Linear>());
-}
-
-//test: push_front, pop_front, front, size, empty:
-template<class ValueTraits, bool Linear, bool CacheLast>
-void test_slist<ValueTraits, Linear, CacheLast>
- ::test_front(std::vector<typename ValueTraits::value_type>& values)
-{
- typedef typename ValueTraits::value_type value_type;
- typedef slist
- < value_type
- , value_traits<ValueTraits>
- , size_type<std::size_t>
- , constant_time_size<value_type::constant_time_size>
- , linear<Linear>
- , cache_last<CacheLast>
- > list_type;
- list_type testlist;
- BOOST_TEST (testlist.empty());
-
- testlist.push_front (values[0]);
- BOOST_TEST (testlist.size() == 1);
- BOOST_TEST (&testlist.front() == &values[0]);
-
- testlist.push_front (values[1]);
- BOOST_TEST (testlist.size() == 2);
- BOOST_TEST (&testlist.front() == &values[1]);
-
- testlist.pop_front();
- BOOST_TEST (testlist.size() == 1);
- BOOST_TEST (&testlist.front() == &values[0]);
-
- testlist.pop_front();
- BOOST_TEST (testlist.empty());
-}
-
-//test: push_front, pop_front, front, size, empty:
-template<class ValueTraits, bool Linear, bool CacheLast>
-void test_slist<ValueTraits, Linear, CacheLast>
- ::test_back(std::vector<typename ValueTraits::value_type>& values, detail::bool_<true>)
-{
- typedef typename ValueTraits::value_type value_type;
- typedef slist
- < value_type
- , value_traits<ValueTraits>
- , size_type<std::size_t>
- , constant_time_size<value_type::constant_time_size>
- , linear<Linear>
- , cache_last<CacheLast>
- > list_type;
- list_type testlist;
- BOOST_TEST (testlist.empty());
-
- testlist.push_back (values[0]);
- BOOST_TEST (testlist.size() == 1);
- BOOST_TEST (&testlist.front() == &values[0]);
- BOOST_TEST (&testlist.back() == &values[0]);
- testlist.push_back(values[1]);
- BOOST_TEST(*testlist.previous(testlist.end()) == values[1]);
- BOOST_TEST (&testlist.front() == &values[0]);
- BOOST_TEST (&testlist.back() == &values[1]);
-}
-
-//test: push_front, pop_front, front, size, empty:
-template<class ValueTraits, bool Linear, bool CacheLast>
-void test_slist<ValueTraits, Linear, CacheLast>
- ::test_back(std::vector<typename ValueTraits::value_type>&, detail::bool_<false>)
-{}
-
-
-//test: merge due to error in merge implementation:
-template<class ValueTraits, bool Linear, bool CacheLast>
-void test_slist<ValueTraits, Linear, CacheLast>
- ::test_merge (std::vector<typename ValueTraits::value_type>& values)
-{
- typedef typename ValueTraits::value_type value_type;
- typedef slist
- < value_type
- , value_traits<ValueTraits>
- , size_type<std::size_t>
- , constant_time_size<value_type::constant_time_size>
- , linear<Linear>
- , cache_last<CacheLast>
- > list_type;
- list_type testlist1, testlist2;
- testlist1.push_front (values[0]);
- testlist2.push_front (values[4]);
- testlist2.push_front (values[3]);
- testlist2.push_front (values[2]);
- testlist1.merge (testlist2);
-
- int init_values [] = { 1, 3, 4, 5 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testlist1.begin() );
-}
-
-//test: merge due to error in merge implementation:
-template<class ValueTraits, bool Linear, bool CacheLast>
-void test_slist<ValueTraits, Linear, CacheLast>
- ::test_remove_unique (std::vector<typename ValueTraits::value_type>& values)
-{
- typedef typename ValueTraits::value_type value_type;
- typedef slist
- < value_type
- , value_traits<ValueTraits>
- , size_type<std::size_t>
- , constant_time_size<value_type::constant_time_size>
- , linear<Linear>
- , cache_last<CacheLast>
- > list_type;
- {
- list_type list(values.begin(), values.end());
- list.remove_if(is_even());
- int init_values [] = { 1, 3, 5 };
- TEST_INTRUSIVE_SEQUENCE( init_values, list.begin() );
- }
- {
- std::vector<typename ValueTraits::value_type> values2(values);
- list_type list(values.begin(), values.end());
- list.insert_after(list.before_begin(), values2.begin(), values2.end());
- list.sort();
- int init_values [] = { 1, 1, 2, 2, 3, 3, 4, 4, 5, 5 };
- TEST_INTRUSIVE_SEQUENCE( init_values, list.begin() );
- list.unique();
- int init_values2 [] = { 1, 2, 3, 4, 5 };
- TEST_INTRUSIVE_SEQUENCE( init_values2, list.begin() );
- }
-}
-
-//test: constructor, iterator, sort, reverse:
-template<class ValueTraits, bool Linear, bool CacheLast>
-void test_slist<ValueTraits, Linear, CacheLast>
- ::test_sort(std::vector<typename ValueTraits::value_type>& values)
-{
- typedef typename ValueTraits::value_type value_type;
- typedef slist
- < value_type
- , value_traits<ValueTraits>
- , size_type<std::size_t>
- , constant_time_size<value_type::constant_time_size>
- , linear<Linear>
- , cache_last<CacheLast>
- > list_type;
- list_type testlist (values.begin(), values.end());
-
- { int init_values [] = { 1, 2, 3, 4, 5 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testlist.begin() ); }
-
- testlist.sort (even_odd());
- { int init_values [] = { 2, 4, 1, 3, 5 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testlist.begin() ); }
-
- testlist.reverse();
- { int init_values [] = { 5, 3, 1, 4, 2 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testlist.begin() ); }
-}
-
-//test: assign, insert_after, const_iterator, erase_after, s_iterator_to, previous:
-template<class ValueTraits, bool Linear, bool CacheLast>
-void test_slist<ValueTraits, Linear, CacheLast>
- ::test_insert(std::vector<typename ValueTraits::value_type>& values)
-{
- typedef typename ValueTraits::value_type value_type;
- typedef slist
- < value_type
- , value_traits<ValueTraits>
- , size_type<std::size_t>
- , constant_time_size<value_type::constant_time_size>
- , linear<Linear>
- , cache_last<CacheLast>
- > list_type;
- list_type testlist;
- testlist.assign (&values[0] + 2, &values[0] + 5);
-
- const list_type& const_testlist = testlist;
- { int init_values [] = { 3, 4, 5 };
- TEST_INTRUSIVE_SEQUENCE( init_values, const_testlist.begin() ); }
-
- typename list_type::iterator i = ++testlist.begin();
- BOOST_TEST (i->value_ == 4);
-
- testlist.insert_after (i, values[0]);
- { int init_values [] = { 3, 4, 1, 5 };
- TEST_INTRUSIVE_SEQUENCE( init_values, const_testlist.begin() ); }
-
- i = testlist.iterator_to (values[4]);
- BOOST_TEST (&*i == &values[4]);
- i = list_type::s_iterator_to (values[4]);
- BOOST_TEST (&*i == &values[4]);
- i = testlist.previous (i);
- BOOST_TEST (&*i == &values[0]);
-
- testlist.erase_after (i);
- BOOST_TEST (&*i == &values[0]);
- { int init_values [] = { 3, 4, 1 };
- TEST_INTRUSIVE_SEQUENCE( init_values, const_testlist.begin() ); }
-}
-
-//test: insert, const_iterator, erase, siterator_to:
-template<class ValueTraits, bool Linear, bool CacheLast>
-void test_slist<ValueTraits, Linear, CacheLast>
- ::test_slow_insert (std::vector<typename ValueTraits::value_type>& values)
-{
- typedef typename ValueTraits::value_type value_type;
- typedef slist
- < value_type
- , value_traits<ValueTraits>
- , size_type<std::size_t>
- , constant_time_size<value_type::constant_time_size>
- , linear<Linear>
- , cache_last<CacheLast>
- > list_type;
- list_type testlist;
- testlist.push_front (values[4]);
- testlist.insert (testlist.begin(), &values[0] + 2, &values[0] + 4);
-
- const list_type& const_testlist = testlist;
- { int init_values [] = { 3, 4, 5 };
- TEST_INTRUSIVE_SEQUENCE( init_values, const_testlist.begin() ); }
-
- typename list_type::iterator i = ++testlist.begin();
- BOOST_TEST (i->value_ == 4);
-
- testlist.insert (i, values[0]);
- { int init_values [] = { 3, 1, 4, 5 };
- TEST_INTRUSIVE_SEQUENCE( init_values, const_testlist.begin() ); }
-
- i = testlist.iterator_to (values[4]);
- BOOST_TEST (&*i == &values[4]);
-
- i = list_type::s_iterator_to (values[4]);
- BOOST_TEST (&*i == &values[4]);
-
- i = testlist.erase (i);
- BOOST_TEST (i == testlist.end());
-
- { int init_values [] = { 3, 1, 4 };
- TEST_INTRUSIVE_SEQUENCE( init_values, const_testlist.begin() ); }
-
- testlist.erase (++testlist.begin(), testlist.end());
- BOOST_TEST (testlist.size() == 1);
- BOOST_TEST (testlist.front().value_ == 3);
-}
-
-template<class ValueTraits, bool Linear, bool CacheLast>
-void test_slist<ValueTraits, Linear, CacheLast>
- ::test_shift(std::vector<typename ValueTraits::value_type>& values)
-{
- typedef typename ValueTraits::value_type value_type;
- typedef slist
- < value_type
- , value_traits<ValueTraits>
- , size_type<std::size_t>
- , constant_time_size<value_type::constant_time_size>
- , linear<Linear>
- , cache_last<CacheLast>
- > list_type;
- list_type testlist;
-
- const int num_values = (int)values.size();
- std::vector<int> expected_values(num_values);
-
- //Shift forward all possible positions 3 times
- for(int s = 1; s <= num_values; ++s){
- expected_values.resize(s);
- for(int i = 0; i < s*3; ++i){
- testlist.insert_after(testlist.before_begin(), &values[0], &values[0] + s);
- testlist.shift_forward(i);
- for(int j = 0; j < s; ++j){
- expected_values[(j + s - i%s) % s] = (j + 1);
- }
-
- TEST_INTRUSIVE_SEQUENCE_EXPECTED(expected_values, testlist.begin())
- testlist.clear();
- }
-
- //Shift backwards all possible positions
- for(int i = 0; i < s*3; ++i){
- testlist.insert_after(testlist.before_begin(), &values[0], &values[0] + s);
- testlist.shift_backwards(i);
- for(int j = 0; j < s; ++j){
- expected_values[(j + i) % s] = (j + 1);
- }
-
- TEST_INTRUSIVE_SEQUENCE_EXPECTED(expected_values, testlist.begin())
- testlist.clear();
- }
- }
-}
-
-//test: insert_after (seq-version), swap, splice_after:
-template<class ValueTraits, bool Linear, bool CacheLast>
-void test_slist<ValueTraits, Linear, CacheLast>
- ::test_swap(std::vector<typename ValueTraits::value_type>& values)
-{
- typedef typename ValueTraits::value_type value_type;
- typedef slist
- < value_type
- , value_traits<ValueTraits>
- , size_type<std::size_t>
- , constant_time_size<value_type::constant_time_size>
- , linear<Linear>
- , cache_last<CacheLast>
- > list_type;
- {
- list_type testlist1 (&values[0], &values[0] + 2);
- list_type testlist2;
- testlist2.insert_after (testlist2.before_begin(), &values[0] + 2, &values[0] + 5);
- testlist1.swap(testlist2);
- { int init_values [] = { 3, 4, 5 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testlist1.begin() ); }
- { int init_values [] = { 1, 2 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testlist2.begin() ); }
- testlist2.splice_after (testlist2.begin(), testlist1);
- { int init_values [] = { 1, 3, 4, 5, 2 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testlist2.begin() ); }
- BOOST_TEST (testlist1.empty());
-
- testlist1.splice_after (testlist1.before_begin(), testlist2, ++testlist2.begin());
- { int init_values [] = { 4 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testlist1.begin() ); }
- { int init_values [] = { 1, 3, 5, 2 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testlist2.begin() ); }
-
- testlist1.splice_after (testlist1.begin(), testlist2,
- testlist2.before_begin(), ++++testlist2.begin());
- { int init_values [] = { 4, 1, 3, 5 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testlist1.begin() ); }
- { int init_values [] = { 2 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testlist2.begin() ); }
- }
- { //Now test swap when testlist2 is empty
- list_type testlist1 (&values[0], &values[0] + 2);
- list_type testlist2;
- testlist1.swap(testlist2);
- BOOST_TEST (testlist1.empty());
- { int init_values [] = { 1, 2 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testlist2.begin() ); }
- }
- { //Now test swap when testlist1 is empty
- list_type testlist2 (&values[0], &values[0] + 2);
- list_type testlist1;
- testlist1.swap(testlist2);
- BOOST_TEST (testlist2.empty());
- { int init_values [] = { 1, 2 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testlist1.begin() ); }
- }
- { //Now test when both are empty
- list_type testlist1, testlist2;
- testlist2.swap(testlist1);
- BOOST_TEST (testlist1.empty() && testlist2.empty());
- }
-
- if(!list_type::linear)
- {
- list_type testlist1 (&values[0], &values[0] + 2);
- list_type testlist2 (&values[0] + 3, &values[0] + 5);
-
- values[0].swap_nodes(values[2]);
- { int init_values [] = { 3, 2 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testlist1.begin() ); }
-
- values[2].swap_nodes(values[4]);
- { int init_values [] = { 5, 2 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testlist1.begin() ); }
- { int init_values [] = { 4, 3 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testlist2.begin() ); }
- }
- if(!list_type::linear)
- {
- list_type testlist1 (&values[0], &values[1]);
-
- { int init_values [] = { 1 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testlist1.begin() ); }
-
- values[1].swap_nodes(values[2]);
-
- { int init_values [] = { 1 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testlist1.begin() ); }
-
- values[0].swap_nodes(values[2]);
-
- { int init_values [] = { 3 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testlist1.begin() ); }
-
- values[0].swap_nodes(values[2]);
-
- { int init_values [] = { 1 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testlist1.begin() ); }
- }
-}
-
-template<class ValueTraits, bool Linear, bool CacheLast>
-void test_slist<ValueTraits, Linear, CacheLast>
- ::test_clone(std::vector<typename ValueTraits::value_type>& values)
-{
- typedef typename ValueTraits::value_type value_type;
- typedef slist
- < value_type
- , value_traits<ValueTraits>
- , size_type<std::size_t>
- , constant_time_size<value_type::constant_time_size>
- , linear<Linear>
- , cache_last<CacheLast>
- > list_type;
-
- list_type testlist1 (&values[0], &values[0] + values.size());
- list_type testlist2;
-
- testlist2.clone_from(testlist1, test::new_cloner<value_type>(), test::delete_disposer<value_type>());
- BOOST_TEST (testlist2 == testlist1);
- testlist2.clear_and_dispose(test::delete_disposer<value_type>());
- BOOST_TEST (testlist2.empty());
-}
-
-template<class ValueTraits, bool Linear, bool CacheLast>
-void test_slist<ValueTraits, Linear, CacheLast>
- ::test_container_from_end(std::vector<typename ValueTraits::value_type>& values
- ,detail::bool_<false>)
-{
- typedef typename ValueTraits::value_type value_type;
- typedef slist
- < value_type
- , value_traits<ValueTraits>
- , size_type<std::size_t>
- , constant_time_size<value_type::constant_time_size>
- , linear<Linear>
- , cache_last<CacheLast>
- > list_type;
- list_type testlist1 (&values[0], &values[0] + values.size());
- BOOST_TEST (testlist1 == list_type::container_from_end_iterator(testlist1.end()));
- BOOST_TEST (testlist1 == list_type::container_from_end_iterator(testlist1.cend()));
-}
-
-template<class VoidPointer, bool constant_time_size>
-class test_main_template
-{
- public:
- int operator()()
- {
- typedef testvalue<hooks<VoidPointer> , constant_time_size> value_type;
- std::vector<value_type> data (5);
- for (int i = 0; i < 5; ++i)
- data[i].value_ = i + 1;
-
- test_slist < typename detail::get_base_value_traits
- < value_type
- , typename hooks<VoidPointer>::base_hook_type
- >::type
- , false
- , false
- >::test_all(data);
- test_slist < typename detail::get_member_value_traits
- < value_type
- , member_hook< value_type
- , typename hooks<VoidPointer>::member_hook_type
- , &value_type::node_
- >
- >::type
- , false
- , false
- >::test_all(data);
-
- //Now linear slists
- test_slist < typename detail::get_base_value_traits
- < value_type
- , typename hooks<VoidPointer>::base_hook_type
- >::type
- , true
- , false
- >::test_all(data);
-
- test_slist < typename detail::get_member_value_traits
- < value_type
- , member_hook< value_type
- , typename hooks<VoidPointer>::member_hook_type
- , &value_type::node_
- >
- >::type
- , true
- , false
- >::test_all(data);
-
- //Now the same but caching the last node
- test_slist < typename detail::get_base_value_traits
- < value_type
- , typename hooks<VoidPointer>::base_hook_type
- >::type
- , false
- , true
- >::test_all(data);
- test_slist < typename detail::get_member_value_traits
- < value_type
- , member_hook< value_type
- , typename hooks<VoidPointer>::member_hook_type
- , &value_type::node_
- >
- >::type
- , false
- , true
- >::test_all(data);
-
- //Now linear slists
- test_slist < typename detail::get_base_value_traits
- < value_type
- , typename hooks<VoidPointer>::base_hook_type
- >::type
- , true
- , true
- >::test_all(data);
-
- test_slist < typename detail::get_member_value_traits
- < value_type
- , member_hook< value_type
- , typename hooks<VoidPointer>::member_hook_type
- , &value_type::node_
- >
- >::type
- , true
- , true
- >::test_all(data);
- return 0;
- }
-};
-
-template<class VoidPointer>
-class test_main_template<VoidPointer, false>
-{
- public:
- int operator()()
- {
- typedef testvalue<hooks<VoidPointer> , false> value_type;
- std::vector<value_type> data (5);
- for (int i = 0; i < 5; ++i)
- data[i].value_ = i + 1;
-
- test_slist < typename detail::get_base_value_traits
- < value_type
- , typename hooks<VoidPointer>::base_hook_type
- >::type
- , false
- , false
- >::test_all(data);
-
- test_slist < typename detail::get_member_value_traits
- < value_type
- , member_hook< value_type
- , typename hooks<VoidPointer>::member_hook_type
- , &value_type::node_
- >
- >::type
- , false
- , false
- >::test_all(data);
-
- test_slist < typename detail::get_base_value_traits
- < value_type
- , typename hooks<VoidPointer>::auto_base_hook_type
- >::type
- , false
- , false
- >::test_all(data);
-
- test_slist < typename detail::get_member_value_traits
- < value_type
- , member_hook< value_type
- , typename hooks<VoidPointer>::auto_member_hook_type
- , &value_type::auto_node_
- >
- >::type
- , false
- , false
- >::test_all(data);
-
- test_slist < typename detail::get_base_value_traits
- < value_type
- , typename hooks<VoidPointer>::base_hook_type
- >::type
- , true
- , false
- >::test_all(data);
-
- test_slist < typename detail::get_member_value_traits
- < value_type
- , member_hook< value_type
- , typename hooks<VoidPointer>::member_hook_type
- , &value_type::node_
- >
- >::type
- , true
- , false
- >::test_all(data);
-
- //Now cache last
- test_slist < typename detail::get_base_value_traits
- < value_type
- , typename hooks<VoidPointer>::base_hook_type
- >::type
- , false
- , true
- >::test_all(data);
-
- test_slist < typename detail::get_member_value_traits
- < value_type
- , member_hook< value_type
- , typename hooks<VoidPointer>::member_hook_type
- , &value_type::node_
- >
- >::type
- , false
- , true
- >::test_all(data);
-
- test_slist < typename detail::get_base_value_traits
- < value_type
- , typename hooks<VoidPointer>::base_hook_type
- >::type
- , true
- , true
- >::test_all(data);
-
- test_slist < typename detail::get_member_value_traits
- < value_type
- , member_hook< value_type
- , typename hooks<VoidPointer>::member_hook_type
- , &value_type::node_
- >
- >::type
- , true
- , true
- >::test_all(data);
- return 0;
- }
-};
-
-int main(int, char* [])
-{
- test_main_template<void*, false>()();
- test_main_template<smart_ptr<void>, false>()();
- test_main_template<void*, true>()();
- test_main_template<smart_ptr<void>, true>()();
- return boost::report_errors();
-}
-#include <boost/intrusive/detail/config_end.hpp>

Deleted: sandbox/move/libs/intrusive/test/smart_ptr.hpp
==============================================================================
--- sandbox/move/libs/intrusive/test/smart_ptr.hpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,388 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2006. Distributed under the Boost
-// Software License, Version 1.0. (See accompanying file
-// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/intrusive for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTRUSIVE_SMART_PTR_HPP
-#define BOOST_INTRUSIVE_SMART_PTR_HPP
-
-#include <boost/iterator.hpp>
-#include <boost/intrusive/pointer_plus_bits.hpp>
-
-#if (defined _MSC_VER) && (_MSC_VER >= 1200)
-# pragma once
-#endif
-
-namespace boost{
-namespace intrusive{
-
-namespace detail {
-
-struct static_cast_tag {};
-struct const_cast_tag {};
-struct dynamic_cast_tag {};
-struct reinterpret_cast_tag {};
-
-} //namespace detail {
-
-//Empty class
-struct empty_type{};
-
-template<class T>
-struct random_it
-: public boost::iterator<std::random_access_iterator_tag,
- T, std::ptrdiff_t, T*, T&>
-{
- typedef const T* const_pointer;
- typedef const T& const_reference;
-};
-
-template<> struct random_it<void>
-{
- typedef const void * const_pointer;
- typedef empty_type& reference;
- typedef const empty_type& const_reference;
- typedef empty_type difference_type;
- typedef empty_type iterator_category;
-};
-
-template<> struct random_it<const void>
-{
- typedef const void * const_pointer;
- typedef const empty_type & reference;
- typedef const empty_type & const_reference;
- typedef empty_type difference_type;
- typedef empty_type iterator_category;
-};
-
-template<> struct random_it<volatile void>
-{
- typedef const volatile void * const_pointer;
- typedef empty_type& reference;
- typedef const empty_type& const_reference;
- typedef empty_type difference_type;
- typedef empty_type iterator_category;
-};
-
-template<> struct random_it<const volatile void>
-{
- typedef const volatile void * const_pointer;
- typedef const empty_type & reference;
- typedef const empty_type & const_reference;
- typedef empty_type difference_type;
- typedef empty_type iterator_category;
-};
-
-} //namespace intrusive {
-} //namespace boost {
-
-
-namespace boost {
-namespace intrusive {
-
-template <class PointedType>
-class smart_ptr
-{
- typedef random_it<PointedType> random_it_t;
- typedef smart_ptr<PointedType> self_t;
- typedef typename random_it_t::const_pointer const_pointer_t;
- typedef typename random_it_t::const_reference const_reference_t;
-
- void unspecified_bool_type_func() const {}
- typedef void (self_t::*unspecified_bool_type)() const;
-
- public:
- typedef PointedType * pointer;
- typedef typename random_it_t::reference reference;
- typedef PointedType value_type;
- typedef typename random_it_t::difference_type difference_type;
- typedef typename random_it_t::iterator_category iterator_category;
-
- PointedType *m_ptr;
-
- public: //Public Functions
-
- //!Constructor from raw pointer (allows "0" pointer conversion). Never throws.
- explicit smart_ptr(pointer ptr = 0)
- : m_ptr(ptr)
- {}
-
- //!Constructor from other pointer. Never throws.
- template <class T>
- smart_ptr(T *ptr)
- : m_ptr(ptr)
- {}
-
- //!Constructor from other smart_ptr
- smart_ptr(const smart_ptr& ptr)
- : m_ptr(ptr.m_ptr)
- {}
-
- //!Constructor from other smart_ptr. If pointers of pointee types are
- //!convertible, offset_ptrs will be convertibles. Never throws.
- template<class T2>
- smart_ptr(const smart_ptr<T2> &ptr)
- : m_ptr(ptr.m_ptr)
- {}
-
- //!Emulates static_cast operator. Never throws.
- template<class Y>
- smart_ptr(const smart_ptr<Y> & r, detail::static_cast_tag)
- : m_ptr(static_cast<PointedType*>(r.get()))
- {}
-
- //!Emulates const_cast operator. Never throws.
- template<class Y>
- smart_ptr(const smart_ptr<Y> & r, detail::const_cast_tag)
- : m_ptr(const_cast<PointedType*>(r.get()))
- {}
-
- //!Emulates dynamic_cast operator. Never throws.
- template<class Y>
- smart_ptr(const smart_ptr<Y> & r, detail::dynamic_cast_tag)
- : m_ptr(dynamic_cast<PointedType*>(r.get()))
- {}
-
- //!Emulates reinterpret_cast operator. Never throws.
- template<class Y>
- smart_ptr(const smart_ptr<Y> & r, detail::reinterpret_cast_tag)
- : m_ptr(reinterpret_cast<PointedType*>(r.get()))
- {}
-
- //!Obtains raw pointer from offset. Never throws.
- pointer get() const
- { return m_ptr; }
-
- //!Pointer-like -> operator. It can return 0 pointer. Never throws.
- pointer operator->() const
- { return this->get(); }
-
- //!Dereferencing operator, if it is a null smart_ptr behavior
- //! is undefined. Never throws.
- reference operator* () const
- { return *(this->get()); }
-
- //!Indexing operator. Never throws.
- reference operator[](std::ptrdiff_t idx) const
- { return this->get()[idx]; }
-
- //!Assignment from pointer (saves extra conversion). Never throws.
- smart_ptr& operator= (pointer from)
- { m_ptr = from; return *this; }
-
- //!Assignment from other smart_ptr. Never throws.
- smart_ptr& operator= (const smart_ptr & pt)
- { m_ptr = pt.m_ptr; return *this; }
-
- //!Assignment from related smart_ptr. If pointers of pointee types
- //! are assignable, offset_ptrs will be assignable. Never throws.
- template <class T2>
- smart_ptr& operator= (const smart_ptr<T2> & pt)
- { m_ptr = pt.m_ptr; return *this; }
-
- //!smart_ptr + std::ptrdiff_t. Never throws.
- smart_ptr operator+ (std::ptrdiff_t offset) const
- { return smart_ptr(this->get()+offset); }
-
- //!smart_ptr - std::ptrdiff_t. Never throws.
- smart_ptr operator- (std::ptrdiff_t offset) const
- { return smart_ptr(this->get()-offset); }
-
- //!smart_ptr += std::ptrdiff_t. Never throws.
- smart_ptr &operator+= (std::ptrdiff_t offset)
- { m_ptr += offset; return *this; }
-
- //!smart_ptr -= std::ptrdiff_t. Never throws.
- smart_ptr &operator-= (std::ptrdiff_t offset)
- { m_ptr -= offset; return *this; }
-
- //!++smart_ptr. Never throws.
- smart_ptr& operator++ (void)
- { ++m_ptr; return *this; }
-
- //!smart_ptr++. Never throws.
- smart_ptr operator++ (int)
- { smart_ptr temp(*this); ++*this; return temp; }
-
- //!--smart_ptr. Never throws.
- smart_ptr& operator-- (void)
- { --m_ptr; return *this; }
-
- //!smart_ptr--. Never throws.
- smart_ptr operator-- (int)
- { smart_ptr temp(*this); --*this; return temp; }
-
- //!safe bool conversion operator. Never throws.
- operator unspecified_bool_type() const
- { return this->get()? &self_t::unspecified_bool_type_func : 0; }
-
- //!Not operator. Not needed in theory, but improves portability.
- //!Never throws.
- bool operator! () const
- { return this->get() == 0; }
-/*
- friend void swap (smart_ptr &pt, smart_ptr &pt2)
- {
- value_type *ptr = pt.get();
- pt = pt2;
- pt2 = ptr;
- }
-*/
-};
-
-//!smart_ptr<T1> == smart_ptr<T2>. Never throws.
-template<class T1, class T2>
-inline bool operator== (const smart_ptr<T1> &pt1,
- const smart_ptr<T2> &pt2)
-{ return pt1.get() == pt2.get(); }
-
-//!smart_ptr<T1> != smart_ptr<T2>. Never throws.
-template<class T1, class T2>
-inline bool operator!= (const smart_ptr<T1> &pt1,
- const smart_ptr<T2> &pt2)
-{ return pt1.get() != pt2.get(); }
-
-//!smart_ptr<T1> < smart_ptr<T2>. Never throws.
-template<class T1, class T2>
-inline bool operator< (const smart_ptr<T1> &pt1,
- const smart_ptr<T2> &pt2)
-{ return pt1.get() < pt2.get(); }
-
-//!smart_ptr<T1> <= smart_ptr<T2>. Never throws.
-template<class T1, class T2>
-inline bool operator<= (const smart_ptr<T1> &pt1,
- const smart_ptr<T2> &pt2)
-{ return pt1.get() <= pt2.get(); }
-
-//!smart_ptr<T1> > smart_ptr<T2>. Never throws.
-template<class T1, class T2>
-inline bool operator> (const smart_ptr<T1> &pt1,
- const smart_ptr<T2> &pt2)
-{ return pt1.get() > pt2.get(); }
-
-//!smart_ptr<T1> >= smart_ptr<T2>. Never throws.
-template<class T1, class T2>
-inline bool operator>= (const smart_ptr<T1> &pt1,
- const smart_ptr<T2> &pt2)
-{ return pt1.get() >= pt2.get(); }
-
-//!operator<<
-template<class E, class T, class Y>
-inline std::basic_ostream<E, T> & operator<<
- (std::basic_ostream<E, T> & os, smart_ptr<Y> const & p)
-{ return os << p.get(); }
-
-//!operator>>
-template<class E, class T, class Y>
-inline std::basic_istream<E, T> & operator>>
- (std::basic_istream<E, T> & os, smart_ptr<Y> & p)
-{ Y * tmp; return os >> tmp; p = tmp; }
-
-//!std::ptrdiff_t + smart_ptr
-template<class T>
-inline smart_ptr<T> operator+(std::ptrdiff_t diff, const smart_ptr<T>& right)
-{ return right + diff; }
-
-//!smart_ptr - smart_ptr
-template<class T, class T2>
-inline std::ptrdiff_t operator- (const smart_ptr<T> &pt, const smart_ptr<T2> &pt2)
-{ return pt.get()- pt2.get(); }
-
-//!swap specialization
-template<class T>
-inline void swap (smart_ptr<T> &pt,
- smart_ptr<T> &pt2)
-{
- typename smart_ptr<T>::value_type *ptr = pt.get();
- pt = pt2;
- pt2 = ptr;
-}
-
-//!detail::boost_intrusive_get_pointer() enables boost::mem_fn to recognize smart_ptr.
-//!Never throws.
-template<class T>
-inline T* boost_intrusive_get_pointer(const smart_ptr<T> & p)
-{ return p.get(); }
-
-//!Simulation of static_cast between pointers. Never throws.
-template<class T, class U>
-inline smart_ptr<T>
- static_pointer_cast(smart_ptr const & r)
-{
- return smart_ptr<T>(r, detail::static_cast_tag());
-}
-
-//!Simulation of const_cast between pointers. Never throws.
-template<class T, class U>
-inline smart_ptr<T>const_pointer_cast(smart_ptr const & r)
-{
- return smart_ptr<T>(r, detail::const_cast_tag());
-}
-
-//!Simulation of dynamic_cast between pointers. Never throws.
-template<class T, class U>
-inline smart_ptr<T>
- dynamic_pointer_cast(smart_ptr const & r)
-{
- return smart_ptr<T>
- (r, detail::dynamic_cast_tag());
-}
-
-//!Simulation of reinterpret_cast between pointers. Never throws.
-template<class T, class U>
-inline smart_ptr<T>
- reinterpret_pointer_cast(smart_ptr const & r)
-{
- return smart_ptr<T>(r, detail::reinterpret_cast_tag());
-}
-
-} //namespace intrusive {
-} //namespace boost {
-
-namespace boost{
-
-//This is to support embedding a bit in the pointer
-//for intrusive containers, saving space
-namespace intrusive {
-
-template<std::size_t Alignment>
-struct max_pointer_plus_bits<smart_ptr<void>, Alignment>
-{
- static const std::size_t value = max_pointer_plus_bits<void*, Alignment>::value;
-};
-
-template<class T, std::size_t NumBits>
-struct pointer_plus_bits<smart_ptr<T>, NumBits>
-{
- typedef smart_ptr<T> pointer;
-
- static pointer get_pointer(const pointer &n)
- { return pointer_plus_bits<T*, NumBits>::get_pointer(n.get()); }
-
- static void set_pointer(pointer &n, pointer p)
- {
- T *raw_n = n.get();
- pointer_plus_bits<T*, NumBits>::set_pointer(raw_n, p.get());
- n = raw_n;
- }
-
- static std::size_t get_bits(const pointer &n)
- { return pointer_plus_bits<T*, NumBits>::get_bits(n.get()); }
-
- static void set_bits(pointer &n, std::size_t c)
- {
- T *raw_n = n.get();
- pointer_plus_bits<T*, NumBits>::set_bits(raw_n, c);
- n = raw_n;
- }
-};
-
-} //namespace intrusive
-} //namespace boost{
-
-#endif //#ifndef BOOST_INTRUSIVE_SMART_PTR_HPP

Deleted: sandbox/move/libs/intrusive/test/splay_multiset_test.cpp
==============================================================================
--- sandbox/move/libs/intrusive/test/splay_multiset_test.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,187 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Olaf Krzikalla 2004-2006.
-// (C) Copyright Ion Gaztanaga 2006-2009.
-//
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-#include <boost/intrusive/detail/config_begin.hpp>
-#include <boost/intrusive/splay_set.hpp>
-#include <boost/intrusive/detail/pointer_to_other.hpp>
-#include "itestvalue.hpp"
-#include "smart_ptr.hpp"
-#include "generic_multiset_test.hpp"
-
-namespace boost { namespace intrusive { namespace test {
-
-#if !defined (BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template<class T, class O1, class O2, class O3, class O4>
-#else
-template<class T, class ...Options>
-#endif
-struct has_const_overloads<boost::intrusive::splay_multiset<
-#if !defined (BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-T, O1, O2, O3, O4
-#else
-T, Options...
-#endif
->
->
-{
- static const bool value = false;
-};
-
-#if !defined (BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template<class T, class O1, class O2, class O3, class O4>
-#else
-template<class T, class ...Options>
-#endif
-struct has_splay<boost::intrusive::splay_multiset<T,
- #if !defined (BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
- O1, O2, O3, O4
- #else
- Options...
- #endif
-> >
-{
- static const bool value = true;
-};
-
-#if !defined (BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template<class T, class O1, class O2, class O3, class O4>
-#else
-template<class T, class ...Options>
-#endif
-struct has_rebalance<boost::intrusive::splay_multiset<T,
- #if !defined (BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
- O1, O2, O3, O4
- #else
- Options...
- #endif
-> >
-{
- static const bool value = true;
-};
-
-}}}
-
-using namespace boost::intrusive;
-
-struct my_tag;
-
-template<class VoidPointer>
-struct hooks
-{
- typedef splay_set_base_hook<void_pointer<VoidPointer> > base_hook_type;
- typedef splay_set_base_hook
- < link_mode<auto_unlink>
- , void_pointer<VoidPointer>
- , tag<my_tag> > auto_base_hook_type;
- typedef splay_set_member_hook<void_pointer<VoidPointer> > member_hook_type;
- typedef splay_set_member_hook
- < link_mode<auto_unlink>
- , void_pointer<VoidPointer> > auto_member_hook_type;
-};
-
-template< class ValueType
- , class Option1 = boost::intrusive::none
- , class Option2 = boost::intrusive::none
- , class Option3 = boost::intrusive::none
- >
-struct GetContainer
-{
- typedef boost::intrusive::splay_multiset
- < ValueType
- , Option1
- , Option2
- , Option3
- > type;
-};
-
-template<class VoidPointer, bool constant_time_size>
-class test_main_template
-{
- public:
- int operator()()
- {
- using namespace boost::intrusive;
- typedef testvalue<hooks<VoidPointer> , constant_time_size> value_type;
-
- test::test_generic_multiset < typename detail::get_base_value_traits
- < value_type
- , typename hooks<VoidPointer>::base_hook_type
- >::type
- , GetContainer
- >::test_all();
- test::test_generic_multiset < typename detail::get_member_value_traits
- < value_type
- , member_hook< value_type
- , typename hooks<VoidPointer>::member_hook_type
- , &value_type::node_
- >
- >::type
- , GetContainer
- >::test_all();
- return 0;
- }
-};
-
-template<class VoidPointer>
-class test_main_template<VoidPointer, false>
-{
- public:
- int operator()()
- {
- using namespace boost::intrusive;
- typedef testvalue<hooks<VoidPointer> , false> value_type;
-
- test::test_generic_multiset < typename detail::get_base_value_traits
- < value_type
- , typename hooks<VoidPointer>::base_hook_type
- >::type
- , GetContainer
- >::test_all();
-
- test::test_generic_multiset < typename detail::get_member_value_traits
- < value_type
- , member_hook< value_type
- , typename hooks<VoidPointer>::member_hook_type
- , &value_type::node_
- >
- >::type
- , GetContainer
- >::test_all();
-
- test::test_generic_multiset < typename detail::get_base_value_traits
- < value_type
- , typename hooks<VoidPointer>::auto_base_hook_type
- >::type
- , GetContainer
- >::test_all();
-
- test::test_generic_multiset < typename detail::get_member_value_traits
- < value_type
- , member_hook< value_type
- , typename hooks<VoidPointer>::auto_member_hook_type
- , &value_type::auto_node_
- >
- >::type
- , GetContainer
- >::test_all();
- return 0;
- }
-};
-
-int main( int, char* [] )
-{
- test_main_template<void*, false>()();
- test_main_template<boost::intrusive::smart_ptr<void>, false>()();
- test_main_template<void*, true>()();
- test_main_template<boost::intrusive::smart_ptr<void>, true>()();
- return boost::report_errors();
-}

Deleted: sandbox/move/libs/intrusive/test/splay_set_test.cpp
==============================================================================
--- sandbox/move/libs/intrusive/test/splay_set_test.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,186 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2007.
-//
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-#include <boost/intrusive/detail/config_begin.hpp>
-#include <boost/intrusive/splay_set.hpp>
-#include "itestvalue.hpp"
-#include "smart_ptr.hpp"
-#include "generic_set_test.hpp"
-
-namespace boost { namespace intrusive { namespace test {
-
-#if !defined (BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template<class T, class O1, class O2, class O3, class O4>
-#else
-template<class T, class ...Options>
-#endif
-struct has_const_overloads<boost::intrusive::splay_set<T,
- #if !defined (BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
- O1, O2, O3, O4
- #else
- Options...
- #endif
-> >
-{
- static const bool value = false;
-};
-
-#if !defined (BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template<class T, class O1, class O2, class O3, class O4>
-#else
-template<class T, class ...Options>
-#endif
-struct has_splay<boost::intrusive::splay_set<T,
- #if !defined (BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
- O1, O2, O3, O4
- #else
- Options...
- #endif
-> >
-{
- static const bool value = true;
-};
-
-#if !defined (BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template<class T, class O1, class O2, class O3, class O4>
-#else
-template<class T, class ...Options>
-#endif
-struct has_rebalance<boost::intrusive::splay_set<T,
- #if !defined (BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
- O1, O2, O3, O4
- #else
- Options...
- #endif
-> >
-{
- static const bool value = true;
-};
-
-}}}
-
-using namespace boost::intrusive;
-
-struct my_tag;
-
-template<class VoidPointer>
-struct hooks
-{
- typedef splay_set_base_hook<void_pointer<VoidPointer> > base_hook_type;
- typedef splay_set_base_hook
- < link_mode<auto_unlink>
- , void_pointer<VoidPointer>
- , tag<my_tag> > auto_base_hook_type;
- typedef splay_set_member_hook<void_pointer<VoidPointer> > member_hook_type;
- typedef splay_set_member_hook
- < link_mode<auto_unlink>
- , void_pointer<VoidPointer> > auto_member_hook_type;
-};
-
-template< class ValueType
- , class Option1 = boost::intrusive::none
- , class Option2 = boost::intrusive::none
- , class Option3 = boost::intrusive::none
- >
-struct GetContainer
-{
- typedef boost::intrusive::splay_set
- < ValueType
- , Option1
- , Option2
- , Option3
- > type;
-};
-
-template<class VoidPointer, bool constant_time_size>
-class test_main_template
-{
- public:
- int operator()()
- {
- using namespace boost::intrusive;
- typedef testvalue<hooks<VoidPointer> , constant_time_size> value_type;
-
- test::test_generic_set < typename detail::get_base_value_traits
- < value_type
- , typename hooks<VoidPointer>::base_hook_type
- >::type
- , GetContainer
- >::test_all();
- test::test_generic_set < typename detail::get_member_value_traits
- < value_type
- , member_hook< value_type
- , typename hooks<VoidPointer>::member_hook_type
- , &value_type::node_
- >
- >::type
- , GetContainer
- >::test_all();
- return 0;
- }
-};
-
-template<class VoidPointer>
-class test_main_template<VoidPointer, false>
-{
- public:
- int operator()()
- {
- using namespace boost::intrusive;
- typedef testvalue<hooks<VoidPointer> , false> value_type;
-
- test::test_generic_set < typename detail::get_base_value_traits
- < value_type
- , typename hooks<VoidPointer>::base_hook_type
- >::type
- , GetContainer
- >::test_all();
-
- test::test_generic_set < typename detail::get_member_value_traits
- < value_type
- , member_hook< value_type
- , typename hooks<VoidPointer>::member_hook_type
- , &value_type::node_
- >
- >::type
- , GetContainer
- >::test_all();
-
- test::test_generic_set < typename detail::get_base_value_traits
- < value_type
- , typename hooks<VoidPointer>::auto_base_hook_type
- >::type
- , GetContainer
- >::test_all();
-
- test::test_generic_set < typename detail::get_member_value_traits
- < value_type
- , member_hook< value_type
- , typename hooks<VoidPointer>::auto_member_hook_type
- , &value_type::auto_node_
- >
- >::type
- , GetContainer
- >::test_all();
-
- return 0;
- }
-};
-
-int main( int, char* [] )
-{
- test_main_template<void*, false>()();
- test_main_template<boost::intrusive::smart_ptr<void>, false>()();
- test_main_template<void*, true>()();
- test_main_template<boost::intrusive::smart_ptr<void>, true>()();
- return boost::report_errors();
-}
-#include <boost/intrusive/detail/config_end.hpp>

Deleted: sandbox/move/libs/intrusive/test/stateful_value_traits_test.cpp
==============================================================================
--- sandbox/move/libs/intrusive/test/stateful_value_traits_test.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,147 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2007-2009
-//
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-#include <boost/intrusive/list.hpp>
-#include <boost/intrusive/slist.hpp>
-#include <boost/intrusive/set.hpp>
-#include <boost/intrusive/unordered_set.hpp>
-#include <boost/functional/hash.hpp>
-#include <boost/pointer_to_other.hpp>
-#include <vector>
-
-using namespace boost::intrusive;
-
-class MyClass
-{
- public:
- int int_;
-
- MyClass(int i = 0)
- : int_(i)
- {}
-
- friend bool operator<(const MyClass &l, const MyClass &r)
- { return l.int_ < r.int_; }
-
- friend bool operator==(const MyClass &l, const MyClass &r)
- { return l.int_ == r.int_; }
-
- friend std::size_t hash_value(const MyClass &v)
- { return boost::hash_value(v.int_); }
-};
-
-template<class T, class NodeTraits>
-struct stateful_value_traits
-{
- typedef NodeTraits node_traits;
- typedef typename node_traits::node node;
- typedef typename node_traits::node_ptr node_ptr;
- typedef typename node_traits::const_node_ptr const_node_ptr;
- typedef T value_type;
- typedef typename boost::pointer_to_other
- <node_ptr, T>::type pointer;
- typedef typename boost::pointer_to_other
- <node_ptr, const T>::type const_pointer;
- static const link_mode_type link_mode = normal_link;
-
- stateful_value_traits(pointer values, node_ptr node_array)
- : values_(values), node_array_(node_array)
- {}
-
- node_ptr to_node_ptr (value_type &value)
- { return node_array_ + (&value - values_); }
-
- const_node_ptr to_node_ptr (const value_type &value) const
- { return node_array_ + (&value - values_); }
-
- pointer to_value_ptr(node_ptr n)
- { return values_ + (n - node_array_); }
-
- const_pointer to_value_ptr(const_node_ptr n) const
- { return values_ + (n - node_array_); }
-
- pointer values_;
- node_ptr node_array_;
-};
-
-//Define a list that will store MyClass using the external hook
-typedef stateful_value_traits< MyClass, list_node_traits<void*> > list_traits;
-typedef list<MyClass, value_traits<list_traits> > List;
-
-//Define a slist that will store MyClass using the external hook
-typedef stateful_value_traits< MyClass, slist_node_traits<void*> > slist_traits;
-typedef slist<MyClass, value_traits<slist_traits> > Slist;
-
-//Define a set that will store MyClass using the external hook
-typedef stateful_value_traits< MyClass, rbtree_node_traits<void*> > rbtree_traits;
-typedef set<MyClass, value_traits<rbtree_traits> > Set;
-
-//uset uses the same traits as slist
-typedef unordered_set<MyClass, value_traits<slist_traits> > Uset;
-
-
-typedef list_traits::node list_node_t;
-typedef slist_traits::node slist_node_t;
-typedef rbtree_traits::node rbtree_node_t;
-
-const int NumElements = 100;
-
-MyClass values [NumElements];
-list_node_t list_hook_array [NumElements];
-slist_node_t slist_hook_array [NumElements];
-rbtree_node_t rbtree_hook_array [NumElements];
-slist_node_t uset_hook_array [NumElements];
-
-int main()
-{
- //Create several MyClass objects, each one with a different value
- for(int i = 0; i < NumElements; ++i)
- values[i].int_ = i;
-
- Uset::bucket_type buckets[NumElements];
-
- List my_list (list_traits (values, list_hook_array));
- Slist my_slist(slist_traits(values, slist_hook_array));
- Set my_set (std::less<MyClass>(), rbtree_traits(values, rbtree_hook_array));
- Uset my_uset ( Uset::bucket_traits(buckets, NumElements)
- , boost::hash<MyClass>()
- , std::equal_to<MyClass>()
- , slist_traits(values, uset_hook_array)
- );
-
- //Now insert them in containers
- for(MyClass * it(&values[0]), *itend(&values[NumElements])
- ; it != itend
- ; ++it){
- my_list.push_front(*it);
- my_slist.push_front(*it);
- my_set.insert(*it);
- my_uset.insert(*it);
- }
-
- //Now test lists
- {
- List::const_iterator list_it (my_list.cbegin());
- Slist::const_iterator slist_it(my_slist.cbegin());
- Set::const_reverse_iterator set_rit(my_set.crbegin());
- MyClass *it_val(&values[NumElements-1]), *it_rbeg_val(&values[0]-1);
-
- //Test the objects inserted in the base hook list
- for(; it_val != it_rbeg_val; --it_val, ++list_it, ++slist_it, ++set_rit){
- if(&*list_it != &*it_val) return 1;
- if(&*slist_it != &*it_val) return 1;
- if(&*set_rit != &*it_val) return 1;
- if(my_uset.find(*it_val) == my_uset.cend()) return 1;
- }
- }
-
- return 0;
-}

Deleted: sandbox/move/libs/intrusive/test/test_container.hpp
==============================================================================
--- sandbox/move/libs/intrusive/test/test_container.hpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,397 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2007-2009
-//
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTRUSIVE_TEST_CONTAINER_HPP
-#define BOOST_INTRUSIVE_TEST_CONTAINER_HPP
-
-#include <boost/detail/lightweight_test.hpp>
-#include <boost/intrusive/detail/mpl.hpp>
-
-namespace boost {
-namespace intrusive {
-namespace test {
-
-template<class T>
-struct is_unordered
-{
- static const bool value = false;
-};
-
-template<class T>
-struct has_const_overloads
-{
- static const bool value = true;
-};
-
-template< class Container >
-void test_container( Container & c )
-{
- typedef typename Container::value_type value_type;
- typedef typename Container::iterator iterator;
- typedef typename Container::const_iterator const_iterator;
- typedef typename Container::reference reference;
- typedef typename Container::const_reference const_reference;
- typedef typename Container::pointer pointer;
- typedef typename Container::const_pointer const_pointer;
- typedef typename Container::difference_type difference_type;
- typedef typename Container::size_type size_type;
- typedef typename Container::difference_type difference_type;
- typedef typename Container::size_type size_type;
- typedef typename Container::value_traits value_traits;
-
- const size_type num_elem = c.size();
- BOOST_TEST( c.empty() == (num_elem == 0) );
- {
- iterator it(c.begin()), itend(c.end());
- size_type i;
- for(i = 0; i < num_elem; ++i){
- ++it;
- }
- BOOST_TEST( it == c.end() );
- BOOST_TEST( c.size() == i );
- }
-
- //Check iterator conversion
- BOOST_TEST( const_iterator(c.begin()) == c.cbegin() );
- {
- const_iterator it(c.cbegin()), itend(c.cend());
- size_type i;
- for(i = 0; i < num_elem; ++i){
- ++it;
- }
- BOOST_TEST( it == c.cend() );
- BOOST_TEST( c.size() == i );
- }
-}
-
-
-template< class Container, class Data >
-void test_sequence_container(Container & c, Data & d)
-{
- assert( d.size() > 2 );
-
- c.clear();
-
- BOOST_TEST( c.size() == 0 );
- BOOST_TEST( c.empty() );
-
-
- {
- typename Data::iterator i = d.begin();
- c.insert( c.begin(), *i );
- c.insert( c.end(), *(++i) );
- }
-
- BOOST_TEST( c.size() == 2 );
- BOOST_TEST( !c.empty() );
-
- typename Container::iterator i;
- i = c.erase( c.begin() );
-
- BOOST_TEST( c.size() == 1 );
-
- {
- typename Data::iterator i = d.begin();
- ++++i;
- c.insert( c.begin(), *(i) );
- }
-
- i = c.erase( c.begin(), c.end() );
- BOOST_TEST( i == c.end() );
-
- BOOST_TEST( c.empty() );
-
- c.insert( c.begin(), *d.begin() );
-
- BOOST_TEST( c.size() == 1 );
-
- BOOST_TEST( c.begin() != c.end() );
-
- i = c.erase_and_dispose( c.begin(), detail::null_disposer() );
- BOOST_TEST( i == c.begin() );
-
- c.assign(d.begin(), d.end());
-
- BOOST_TEST( c.size() == d.size() );
-
- c.clear();
-
- BOOST_TEST( c.size() == 0 );
- BOOST_TEST( c.empty() );
-}
-
-template< class Container, class Data >
-void test_common_unordered_and_associative_container(Container & c, Data & d, boost::intrusive::detail::true_ unordered)
-{
- (void)unordered;
- typedef typename Container::size_type size_type;
-
- assert( d.size() > 2 );
-
- c.clear();
- c.insert(d.begin(), d.end());
-
- for( typename Data::const_iterator di = d.begin(), de = d.end();
- di != de; ++di )
- {
- BOOST_TEST( c.find(*di) != c.end() );
- }
-
- typename Data::const_iterator db = d.begin();
- typename Data::const_iterator da = db++;
-
- size_type old_size = c.size();
-
- c.erase(*da, c.hash_function(), c.key_eq());
- BOOST_TEST( c.size() == old_size-1 );
- //This should not eras anyone
- size_type second_erase = c.erase_and_dispose
- ( *da, c.hash_function(), c.key_eq(), detail::null_disposer() );
- BOOST_TEST( second_erase == 0 );
-
- BOOST_TEST( c.count(*da, c.hash_function(), c.key_eq()) == 0 );
- BOOST_TEST( c.count(*db, c.hash_function(), c.key_eq()) != 0 );
-
- BOOST_TEST( c.find(*da, c.hash_function(), c.key_eq()) == c.end() );
- BOOST_TEST( c.find(*db, c.hash_function(), c.key_eq()) != c.end() );
-
- BOOST_TEST( c.equal_range(*db, c.hash_function(), c.key_eq()).first != c.end() );
-
- c.clear();
-
- BOOST_TEST( c.equal_range(*da, c.hash_function(), c.key_eq()).first == c.end() );
-}
-
-template< class Container, class Data >
-void test_common_unordered_and_associative_container(Container & c, Data & d, boost::intrusive::detail::false_ unordered)
-{
- (void)unordered;
- typedef typename Container::size_type size_type;
-
- assert( d.size() > 2 );
-
- c.clear();
- c.insert(d.begin(), d.end());
-
- for( typename Data::const_iterator di = d.begin(), de = d.end();
- di != de; ++di )
- {
- BOOST_TEST( c.find(*di, c.key_comp()) != c.end() );
- }
-
- typename Data::const_iterator db = d.begin();
- typename Data::const_iterator da = db++;
-
- size_type old_size = c.size();
-
- c.erase(*da, c.key_comp());
- BOOST_TEST( c.size() == old_size-1 );
- //This should not eras anyone
- size_type second_erase = c.erase_and_dispose( *da, c.key_comp(), detail::null_disposer() );
- BOOST_TEST( second_erase == 0 );
-
- BOOST_TEST( c.count(*da, c.key_comp()) == 0 );
- BOOST_TEST( c.count(*db, c.key_comp()) != 0 );
- BOOST_TEST( c.find(*da, c.key_comp()) == c.end() );
- BOOST_TEST( c.find(*db, c.key_comp()) != c.end() );
- BOOST_TEST( c.equal_range(*db, c.key_comp()).first != c.end() );
- c.clear();
- BOOST_TEST( c.equal_range(*da, c.key_comp()).first == c.end() );
-}
-
-
-template< class Container, class Data >
-void test_common_unordered_and_associative_container(Container & c, Data & d)
-{
- {
- typedef typename Container::size_type size_type;
-
- assert( d.size() > 2 );
-
- c.clear();
- c.insert(d.begin(), d.end());
-
- for( typename Data::const_iterator di = d.begin(), de = d.end();
- di != de; ++di )
- {
- BOOST_TEST( c.find(*di) != c.end() );
- }
-
- typename Data::const_iterator db = d.begin();
- typename Data::const_iterator da = db++;
-
- size_type old_size = c.size();
-
- c.erase(*da);
- BOOST_TEST( c.size() == old_size-1 );
- //This should not eras anyone
- size_type second_erase = c.erase_and_dispose( *da, detail::null_disposer() );
- BOOST_TEST( second_erase == 0 );
-
- BOOST_TEST( c.count(*da) == 0 );
- BOOST_TEST( c.count(*db) != 0 );
-
- BOOST_TEST( c.find(*da) == c.end() );
- BOOST_TEST( c.find(*db) != c.end() );
-
- BOOST_TEST( c.equal_range(*db).first != c.end() );
-
- c.clear();
-
- BOOST_TEST( c.equal_range(*da).first == c.end() );
- }
- typedef detail::bool_<is_unordered<Container>::value> enabler;
- test_common_unordered_and_associative_container(c, d, enabler());
-}
-
-template< class Container, class Data >
-void test_associative_container_invariants(Container & c, Data & d, boost::intrusive::detail::true_type)
-{
- typedef typename Container::const_iterator const_iterator;
- for( typename Data::const_iterator di = d.begin(), de = d.end();
- di != de; ++di)
- {
- const_iterator ci = c.find(*di);
- BOOST_TEST( ci != c.end() );
- BOOST_TEST( ! c.value_comp()(*ci, *di) );
- const_iterator cil = c.lower_bound(*di);
- const_iterator ciu = c.upper_bound(*di);
- std::pair<const_iterator, const_iterator> er = c.equal_range(*di);
- BOOST_TEST( cil == er.first );
- BOOST_TEST( ciu == er.second );
- if(ciu != c.end()){
- BOOST_TEST( c.value_comp()(*cil, *ciu) );
- }
- if(c.count(*di) > 1){
- const_iterator ci_next = cil; ++ci_next;
- for( ; ci_next != ciu; ++cil, ++ci_next){
- BOOST_TEST( !c.value_comp()(*ci_next, *cil) );
- }
- }
- }
-}
-
-template< class Container, class Data >
-void test_associative_container_invariants(Container &, Data &, boost::intrusive::detail::false_type)
-{}
-
-template< class Container, class Data >
-void test_associative_container_invariants(Container & c, Data & d)
-{
- using namespace boost::intrusive;
- typedef typename detail::remove_const<Container>::type Type;
- typedef detail::bool_<has_const_overloads<Type>::value> enabler;
- test_associative_container_invariants(c, d, enabler());
-}
-
-template< class Container, class Data >
-void test_associative_container(Container & c, Data & d)
-{
- typedef typename Container::const_iterator const_iterator;
- assert( d.size() > 2 );
-
- c.clear();
- c.insert(d.begin(),d.end());
-
- test_associative_container_invariants(c, d);
-
- const Container & cr = c;
-
- test_associative_container_invariants(cr, d);
-}
-
-template< class Container, class Data >
-void test_unordered_associative_container_invariants(Container & c, Data & d, boost::intrusive::detail::true_type)
-{
- typedef typename Container::size_type size_type;
- typedef typename Container::const_iterator const_iterator;
-
- for( typename Data::const_iterator di = d.begin(), de = d.end() ;
- di != de ; ++di ){
- const_iterator i = c.find(*di);
- size_type nb = c.bucket(*i);
- size_type bucket_elem = std::distance(c.begin(nb), c.end(nb));
- BOOST_TEST( bucket_elem == c.bucket_size(nb) );
- BOOST_TEST( &*c.local_iterator_to(*c.find(*di)) == &*i );
- std::pair<const_iterator, const_iterator> er = c.equal_range(*di);
- size_type cnt = std::distance(er.first, er.second);
- BOOST_TEST( cnt == c.count(*di));
- if(cnt > 1)
- for(const_iterator n = er.first, i = n++, e = er.second; n != e; ++i, ++n){
- BOOST_TEST( c.key_eq()(*i, *n) );
- BOOST_TEST( c.hash_function()(*i) == c.hash_function()(*n) );
- }
- }
-
- size_type blen = c.bucket_count();
- size_type total_objects = 0;
- for(size_type i = 0; i < blen; ++i){
- total_objects += c.bucket_size(i);
- }
- BOOST_TEST( total_objects == c.size() );
-}
-
-template< class Container, class Data >
-void test_unordered_associative_container_invariants(Container &, Data &, boost::intrusive::detail::false_type)
-{}
-
-template< class Container, class Data >
-void test_unordered_associative_container_invariants(Container & c, Data & d)
-{
- using namespace boost::intrusive;
- typedef typename detail::remove_const<Container>::type Type;
- typedef detail::bool_<has_const_overloads<Type>::value> enabler;
- test_unordered_associative_container_invariants(c, d, enabler());
-}
-
-template< class Container, class Data >
-void test_unordered_associative_container(Container & c, Data & d)
-{
- c.clear();
- c.insert( d.begin(), d.end() );
-
- test_unordered_associative_container_invariants(c, d);
-
- const Container & cr = c;
-
- test_unordered_associative_container_invariants(cr, d);
-}
-
-template< class Container, class Data >
-void test_unique_container(Container & c, Data & d)
-{
- typedef typename Container::value_type value_type;
- c.clear();
- c.insert(d.begin(),d.end());
- typename Container::size_type old_size = c.size();
- value_type v(*d.begin());
- c.insert(v);
- BOOST_TEST( c.size() == old_size );
- c.clear();
-}
-
-template< class Container, class Data >
-void test_non_unique_container(Container & c, Data & d)
-{
- typedef typename Container::value_type value_type;
- c.clear();
- c.insert(d.begin(),d.end());
- typename Container::size_type old_size = c.size();
- value_type v(*d.begin());
- c.insert(v);
- BOOST_TEST( c.size() == (old_size+1) );
- c.clear();
-}
-
-}}}
-
-#endif //#ifndef BOOST_INTRUSIVE_TEST_CONTAINER_HPP

Deleted: sandbox/move/libs/intrusive/test/test_macros.hpp
==============================================================================
--- sandbox/move/libs/intrusive/test/test_macros.hpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,26 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2006-2009
-//
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTRUSIVE_TEST_TEST_MACROS_HPP
-#define BOOST_INTRUSIVE_TEST_TEST_MACROS_HPP
-
-#define TEST_INTRUSIVE_SEQUENCE( INTVALUES, ITERATOR )\
-{ \
- BOOST_TEST (std::equal(&INTVALUES[0], &INTVALUES[0] + sizeof(INTVALUES)/sizeof(INTVALUES[0]), ITERATOR) ); \
-}
-
-#define TEST_INTRUSIVE_SEQUENCE_EXPECTED( EXPECTEDVECTOR, ITERATOR )\
-{ \
- BOOST_TEST (std::equal(EXPECTEDVECTOR.begin(), EXPECTEDVECTOR.end(), ITERATOR) ); \
-}
-
-#endif

Deleted: sandbox/move/libs/intrusive/test/treap_multiset_test.cpp
==============================================================================
--- sandbox/move/libs/intrusive/test/treap_multiset_test.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,155 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Olaf Krzikalla 2004-2006.
-// (C) Copyright Ion Gaztanaga 2006-2009.
-//
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-
-#include <boost/intrusive/detail/config_begin.hpp>
-#include <boost/intrusive/treap_set.hpp>
-#include "itestvalue.hpp"
-#include "smart_ptr.hpp"
-#include "generic_multiset_test.hpp"
-
-namespace boost { namespace intrusive { namespace test {
-
-#if !defined (BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template<class T, class O1, class O2, class O3, class O4>
-#else
-template<class T, class ...Options>
-#endif
-struct has_insert_before<boost::intrusive::treap_multiset<T,
- #if !defined (BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
- O1, O2, O3, O4
- #else
- Options...
- #endif
-> >
-{
- static const bool value = true;
-};
-
-}}}
-
-using namespace boost::intrusive;
-
-struct my_tag;
-
-template<class VoidPointer>
-struct hooks
-{
- typedef bs_set_base_hook<void_pointer<VoidPointer> > base_hook_type;
- typedef bs_set_base_hook
- < void_pointer<VoidPointer>
- , tag<my_tag> > auto_base_hook_type;
- typedef bs_set_member_hook
- < void_pointer<VoidPointer> > member_hook_type;
- typedef bs_set_member_hook
- < void_pointer<VoidPointer> > auto_member_hook_type;
-};
-
-template< class ValueType
- , class Option1 = boost::intrusive::none
- , class Option2 = boost::intrusive::none
- , class Option3 = boost::intrusive::none
- >
-struct GetContainer
-{
- typedef boost::intrusive::treap_multiset
- < ValueType
- , Option1
- , Option2
- , Option3
- > type;
-};
-
-template<class VoidPointer, bool constant_time_size>
-class test_main_template
-{
- public:
- int operator()()
- {
- using namespace boost::intrusive;
- typedef testvalue<hooks<VoidPointer> , constant_time_size> value_type;
-
- test::test_generic_multiset < typename detail::get_base_value_traits
- < value_type
- , typename hooks<VoidPointer>::base_hook_type
- >::type
- , GetContainer
- >::test_all();
- test::test_generic_multiset < typename detail::get_member_value_traits
- < value_type
- , member_hook< value_type
- , typename hooks<VoidPointer>::member_hook_type
- , &value_type::node_
- >
- >::type
- , GetContainer
- >::test_all();
- return 0;
- }
-};
-
-template<class VoidPointer>
-class test_main_template<VoidPointer, false>
-{
- public:
- int operator()()
- {
- using namespace boost::intrusive;
- typedef testvalue<hooks<VoidPointer> , false> value_type;
-
- test::test_generic_multiset < typename detail::get_base_value_traits
- < value_type
- , typename hooks<VoidPointer>::base_hook_type
- >::type
- , GetContainer
- >::test_all();
-
- test::test_generic_multiset < typename detail::get_member_value_traits
- < value_type
- , member_hook< value_type
- , typename hooks<VoidPointer>::member_hook_type
- , &value_type::node_
- >
- >::type
- , GetContainer
- >::test_all();
-
- test::test_generic_multiset < typename detail::get_base_value_traits
- < value_type
- , typename hooks<VoidPointer>::auto_base_hook_type
- >::type
- , GetContainer
- >::test_all();
-
- test::test_generic_multiset < typename detail::get_member_value_traits
- < value_type
- , member_hook< value_type
- , typename hooks<VoidPointer>::auto_member_hook_type
- , &value_type::auto_node_
- >
- >::type
- , GetContainer
- >::test_all();
- return 0;
- }
-};
-
-int main( int, char* [] )
-{
- test_main_template<void*, false>()();
- test_main_template<boost::intrusive::smart_ptr<void>, false>()();
- test_main_template<void*, true>()();
- test_main_template<boost::intrusive::smart_ptr<void>, true>()();
- return boost::report_errors();
-}
-
-#include <boost/intrusive/detail/config_end.hpp>

Deleted: sandbox/move/libs/intrusive/test/treap_set_test.cpp
==============================================================================
--- sandbox/move/libs/intrusive/test/treap_set_test.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,171 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2006-2009.
-//
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-#include <boost/intrusive/detail/config_begin.hpp>
-#include <boost/intrusive/treap_set.hpp>
-#include "itestvalue.hpp"
-#include "smart_ptr.hpp"
-#include "generic_set_test.hpp"
-
-namespace boost { namespace intrusive { namespace test {
-
-#if !defined (BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template<class T, class O1, class O2, class O3, class O4>
-#else
-template<class T, class ...Options>
-#endif
-struct has_insert_before<boost::intrusive::treap_set<T,
- #if !defined (BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
- O1, O2, O3, O4
- #else
- Options...
- #endif
-> >
-{
- static const bool value = true;
-};
-
-#if !defined (BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template<class T, class O1, class O2, class O3, class O4>
-#else
-template<class T, class ...Options>
-#endif
-struct is_treap<boost::intrusive::treap_set<T,
- #if !defined (BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
- O1, O2, O3, O4
- #else
- Options...
- #endif
-> >
-{
- static const bool value = true;
-};
-
-}}}
-
-
-using namespace boost::intrusive;
-
-struct my_tag;
-
-template<class VoidPointer>
-struct hooks
-{
- typedef bs_set_base_hook<void_pointer<VoidPointer> > base_hook_type;
- typedef bs_set_base_hook
- < void_pointer<VoidPointer>
- , tag<my_tag> > auto_base_hook_type;
- typedef bs_set_member_hook
- < void_pointer<VoidPointer> > member_hook_type;
- typedef bs_set_member_hook
- < void_pointer<VoidPointer> > auto_member_hook_type;
-};
-
-template< class ValueType
- , class Option1 = boost::intrusive::none
- , class Option2 = boost::intrusive::none
- , class Option3 = boost::intrusive::none
- >
-struct GetContainer
-{
- typedef boost::intrusive::treap_set
- < ValueType
- , Option1
- , Option2
- , Option3
- > type;
-};
-
-template<class VoidPointer, bool constant_time_size>
-class test_main_template
-{
- public:
- int operator()()
- {
- using namespace boost::intrusive;
- typedef testvalue<hooks<VoidPointer> , constant_time_size> value_type;
-
- test::test_generic_set < typename detail::get_base_value_traits
- < value_type
- , typename hooks<VoidPointer>::base_hook_type
- >::type
- , GetContainer
- >::test_all();
- test::test_generic_set < typename detail::get_member_value_traits
- < value_type
- , member_hook< value_type
- , typename hooks<VoidPointer>::member_hook_type
- , &value_type::node_
- >
- >::type
- , GetContainer
- >::test_all();
- return 0;
- }
-};
-
-template<class VoidPointer>
-class test_main_template<VoidPointer, false>
-{
- public:
- int operator()()
- {
- using namespace boost::intrusive;
- typedef testvalue<hooks<VoidPointer> , false> value_type;
-
- test::test_generic_set < typename detail::get_base_value_traits
- < value_type
- , typename hooks<VoidPointer>::base_hook_type
- >::type
- , GetContainer
- >::test_all();
-
- test::test_generic_set < typename detail::get_member_value_traits
- < value_type
- , member_hook< value_type
- , typename hooks<VoidPointer>::member_hook_type
- , &value_type::node_
- >
- >::type
- , GetContainer
- >::test_all();
-
- test::test_generic_set < typename detail::get_base_value_traits
- < value_type
- , typename hooks<VoidPointer>::auto_base_hook_type
- >::type
- , GetContainer
- >::test_all();
-
- test::test_generic_set < typename detail::get_member_value_traits
- < value_type
- , member_hook< value_type
- , typename hooks<VoidPointer>::auto_member_hook_type
- , &value_type::auto_node_
- >
- >::type
- , GetContainer
- >::test_all();
-
- return 0;
- }
-};
-
-int main( int, char* [] )
-{
- test_main_template<void*, false>()();
- test_main_template<boost::intrusive::smart_ptr<void>, false>()();
- test_main_template<void*, true>()();
- test_main_template<boost::intrusive::smart_ptr<void>, true>()();
- return boost::report_errors();
-}
-
-#include <boost/intrusive/detail/config_end.hpp>

Deleted: sandbox/move/libs/intrusive/test/unordered_multiset_test.cpp
==============================================================================
--- sandbox/move/libs/intrusive/test/unordered_multiset_test.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,816 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Olaf Krzikalla 2004-2006.
-// (C) Copyright Ion Gaztanaga 2006-2009.
-//
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-#include <boost/intrusive/detail/config_begin.hpp>
-#include <boost/intrusive/unordered_set.hpp>
-#include <boost/intrusive/detail/pointer_to_other.hpp>
-#include "itestvalue.hpp"
-#include "smart_ptr.hpp"
-#include "common_functors.hpp"
-#include <vector>
-#include <algorithm> //std::sort std::find
-#include <set>
-#include <boost/detail/lightweight_test.hpp>
-#include "test_macros.hpp"
-#include "test_container.hpp"
-
-namespace boost { namespace intrusive { namespace test {
-
-#if !defined (BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template<class T, class O1, class O2, class O3, class O4, class O5, class O6>
-#else
-template<class T, class ...Options>
-#endif
-struct is_unordered<boost::intrusive::unordered_multiset<T,
- #if !defined (BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
- O1, O2, O3, O4, O5, O6
- #else
- Options...
- #endif
-> >
-{
- static const bool value = true;
-};
-
-}}}
-
-using namespace boost::intrusive;
-
-struct my_tag;
-
-template<class VoidPointer>
-struct hooks
-{
- typedef unordered_set_base_hook<void_pointer<VoidPointer> > base_hook_type;
- typedef unordered_set_base_hook
- < link_mode<auto_unlink>
- , void_pointer<VoidPointer>
- , tag<my_tag>
- , store_hash<true>
- > auto_base_hook_type;
-
- typedef unordered_set_member_hook
- < void_pointer<VoidPointer>
- , optimize_multikey<true>
- > member_hook_type;
- typedef unordered_set_member_hook
- < link_mode<auto_unlink>, void_pointer<VoidPointer>
- , store_hash<true>
- , optimize_multikey<true>
- > auto_member_hook_type;
-};
-
-static const std::size_t BucketSize = 8;
-
-template<class ValueTraits, bool CacheBegin, bool CompareHash, bool Incremental>
-struct test_unordered_multiset
-{
- typedef typename ValueTraits::value_type value_type;
- static void test_all (std::vector<value_type>& values);
- static void test_sort(std::vector<value_type>& values);
- static void test_insert(std::vector<value_type>& values);
- static void test_swap(std::vector<value_type>& values);
- static void test_rehash(std::vector<value_type>& values, detail::true_);
- static void test_rehash(std::vector<value_type>& values, detail::false_);
- static void test_find(std::vector<value_type>& values);
- static void test_impl();
- static void test_clone(std::vector<value_type>& values);
-};
-
-template<class ValueTraits, bool CacheBegin, bool CompareHash, bool Incremental>
-void test_unordered_multiset<ValueTraits, CacheBegin, CompareHash, Incremental>::
- test_all (std::vector<typename ValueTraits::value_type>& values)
-{
- typedef typename ValueTraits::value_type value_type;
- typedef unordered_multiset
- < value_type
- , value_traits<ValueTraits>
- , constant_time_size<value_type::constant_time_size>
- , cache_begin<CacheBegin>
- , compare_hash<CompareHash>
- , incremental<Incremental>
- > unordered_multiset_type;
- {
- typedef typename unordered_multiset_type::bucket_traits bucket_traits;
- typename unordered_multiset_type::bucket_type buckets [BucketSize];
- unordered_multiset_type testset(bucket_traits(buckets, BucketSize));
- testset.insert(values.begin(), values.end());
- test::test_container(testset);
- testset.clear();
- testset.insert(values.begin(), values.end());
- test::test_common_unordered_and_associative_container(testset, values);
- testset.clear();
- testset.insert(values.begin(), values.end());
- test::test_unordered_associative_container(testset, values);
- testset.clear();
- testset.insert(values.begin(), values.end());
- test::test_non_unique_container(testset, values);
- }
- test_sort(values);
- test_insert(values);
- test_swap(values);
- test_rehash(values, detail::bool_<Incremental>());
- test_find(values);
- test_impl();
- test_clone(values);
-}
-
-//test case due to an error in tree implementation:
-template<class ValueTraits, bool CacheBegin, bool CompareHash, bool Incremental>
-void test_unordered_multiset<ValueTraits, CacheBegin, CompareHash, Incremental>
- ::test_impl()
-{
- typedef typename ValueTraits::value_type value_type;
- typedef unordered_multiset
- <value_type
- , value_traits<ValueTraits>
- , constant_time_size<value_type::constant_time_size>
- , cache_begin<CacheBegin>
- , compare_hash<CompareHash>
- , incremental<Incremental>
- > unordered_multiset_type;
- typedef typename unordered_multiset_type::bucket_traits bucket_traits;
-
- std::vector<value_type> values (5);
- for (int i = 0; i < 5; ++i)
- values[i].value_ = i;
-
- typename unordered_multiset_type::bucket_type buckets [BucketSize];
- unordered_multiset_type testset(bucket_traits(buckets, BucketSize));
-
- for (int i = 0; i < 5; ++i)
- testset.insert (values[i]);
-
- testset.erase (testset.iterator_to (values[0]));
- testset.erase (testset.iterator_to (values[1]));
- testset.insert (values[1]);
-
- testset.erase (testset.iterator_to (values[2]));
- testset.erase (testset.iterator_to (values[3]));
-}
-
-//test: constructor, iterator, clear, reverse_iterator, front, back, size:
-template<class ValueTraits, bool CacheBegin, bool CompareHash, bool Incremental>
-void test_unordered_multiset<ValueTraits, CacheBegin, CompareHash, Incremental>
- ::test_sort(std::vector<typename ValueTraits::value_type>& values)
-{
- typedef typename ValueTraits::value_type value_type;
- typedef unordered_multiset
- <value_type
- , value_traits<ValueTraits>
- , constant_time_size<value_type::constant_time_size>
- , cache_begin<CacheBegin>
- , compare_hash<CompareHash>
- , incremental<Incremental>
- > unordered_multiset_type;
- typedef typename unordered_multiset_type::bucket_traits bucket_traits;
-
- typename unordered_multiset_type::bucket_type buckets [BucketSize];
- unordered_multiset_type testset1(values.begin(), values.end(), bucket_traits(buckets, BucketSize));
-
- if(Incremental){
- { int init_values [] = { 4, 5, 1, 2, 2, 3 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testset1.begin() ); }
- }
- else{
- { int init_values [] = { 1, 2, 2, 3, 4, 5 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testset1.begin() ); }
- }
- testset1.clear();
- BOOST_TEST (testset1.empty());
-}
-
-//test: insert, const_iterator, const_reverse_iterator, erase, iterator_to:
-template<class ValueTraits, bool CacheBegin, bool CompareHash, bool Incremental>
-void test_unordered_multiset<ValueTraits, CacheBegin, CompareHash, Incremental>
- ::test_insert(std::vector<typename ValueTraits::value_type>& values)
-{
- typedef typename ValueTraits::value_type value_type;
- typedef unordered_multiset
- <value_type
- , value_traits<ValueTraits>
- , constant_time_size<value_type::constant_time_size>
- , cache_begin<CacheBegin>
- , compare_hash<CompareHash>
- , incremental<Incremental>
- > unordered_multiset_type;
- typedef typename unordered_multiset_type::bucket_traits bucket_traits;
- typedef typename unordered_multiset_type::iterator iterator;
- typename unordered_multiset_type::bucket_type buckets [BucketSize];
- unordered_multiset_type testset(bucket_traits(buckets, BucketSize));
-
- testset.insert(&values[0] + 2, &values[0] + 5);
-
- const unordered_multiset_type& const_testset = testset;
-
- if(Incremental){
- {
- { int init_values [] = { 4, 5, 1 };
- TEST_INTRUSIVE_SEQUENCE( init_values, const_testset.begin() ); }
-
- typename unordered_multiset_type::iterator i = testset.begin();
- BOOST_TEST (i->value_ == 4);
-
- i = testset.insert (values[0]);
- BOOST_TEST (&*i == &values[0]);
-
- i = testset.iterator_to (values[2]);
- BOOST_TEST (&*i == &values[2]);
- testset.erase(i);
-
- { int init_values [] = { 5, 1, 3 };
- TEST_INTRUSIVE_SEQUENCE( init_values, const_testset.begin() ); }
- testset.clear();
- testset.insert(&values[0], &values[0] + values.size());
-
- { int init_values [] = { 4, 5, 1, 2, 2, 3 };
- TEST_INTRUSIVE_SEQUENCE( init_values, const_testset.begin() ); }
-
- BOOST_TEST (testset.erase(1) == 1);
- BOOST_TEST (testset.erase(2) == 2);
- BOOST_TEST (testset.erase(3) == 1);
- BOOST_TEST (testset.erase(4) == 1);
- BOOST_TEST (testset.erase(5) == 1);
- BOOST_TEST (testset.empty() == true);
-
- //Now with a single bucket
- typename unordered_multiset_type::bucket_type single_bucket[1];
- unordered_multiset_type testset2(bucket_traits(single_bucket, 1));
- testset2.insert(&values[0], &values[0] + values.size());
- BOOST_TEST (testset2.erase(5) == 1);
- BOOST_TEST (testset2.erase(2) == 2);
- BOOST_TEST (testset2.erase(1) == 1);
- BOOST_TEST (testset2.erase(4) == 1);
- BOOST_TEST (testset2.erase(3) == 1);
- BOOST_TEST (testset2.empty() == true);
- }
- }
- else{
- {
- { int init_values [] = { 1, 4, 5 };
- TEST_INTRUSIVE_SEQUENCE( init_values, const_testset.begin() ); }
-
- typename unordered_multiset_type::iterator i = testset.begin();
- BOOST_TEST (i->value_ == 1);
-
- i = testset.insert (values[0]);
- BOOST_TEST (&*i == &values[0]);
-
- i = testset.iterator_to (values[2]);
- BOOST_TEST (&*i == &values[2]);
- testset.erase(i);
-
- { int init_values [] = { 1, 3, 5 };
- TEST_INTRUSIVE_SEQUENCE( init_values, const_testset.begin() ); }
- testset.clear();
- testset.insert(&values[0], &values[0] + values.size());
-
- { int init_values [] = { 1, 2, 2, 3, 4, 5 };
- TEST_INTRUSIVE_SEQUENCE( init_values, const_testset.begin() ); }
-
- BOOST_TEST (testset.erase(1) == 1);
- BOOST_TEST (testset.erase(2) == 2);
- BOOST_TEST (testset.erase(3) == 1);
- BOOST_TEST (testset.erase(4) == 1);
- BOOST_TEST (testset.erase(5) == 1);
- BOOST_TEST (testset.empty() == true);
-
- //Now with a single bucket
- typename unordered_multiset_type::bucket_type single_bucket[1];
- unordered_multiset_type testset2(bucket_traits(single_bucket, 1));
- testset2.insert(&values[0], &values[0] + values.size());
- BOOST_TEST (testset2.erase(5) == 1);
- BOOST_TEST (testset2.erase(2) == 2);
- BOOST_TEST (testset2.erase(1) == 1);
- BOOST_TEST (testset2.erase(4) == 1);
- BOOST_TEST (testset2.erase(3) == 1);
- BOOST_TEST (testset2.empty() == true);
- }
- }
- {
- //Now erase just one per loop
- const int random_init[] = { 3, 2, 4, 1, 5, 2, 2 };
- const unsigned int random_size = sizeof(random_init)/sizeof(random_init[0]);
- typename unordered_multiset_type::bucket_type single_bucket[1];
- for(unsigned int i = 0, max = random_size; i != max; ++i){
- std::vector<typename ValueTraits::value_type> data (random_size);
- for (unsigned int j = 0; j < random_size; ++j)
- data[j].value_ = random_init[j];
- unordered_multiset_type testset_new(bucket_traits(single_bucket, 1));
- testset_new.insert(&data[0], &data[0]+max);
- testset_new.erase(testset_new.iterator_to(data[i]));
- BOOST_TEST (testset_new.size() == (max -1));
- }
- }
- {
- typename unordered_multiset_type::bucket_type buckets [BucketSize];
- const unsigned int NumBucketSize = BucketSize;
- const unsigned int LoadFactor = 3;
- const unsigned int NumIterations = NumBucketSize*LoadFactor;
- std::vector<value_type> random_init(NumIterations);//Preserve memory
- std::vector<value_type> set_tester;
- set_tester.reserve(NumIterations);
-
- //Initialize values
- for (unsigned int i = 0; i < NumIterations; ++i){
- random_init[i].value_ = i*2;//(i/LoadFactor)*LoadFactor;
- }
-
- for(unsigned int initial_pos = 0; initial_pos != (NumIterations+1); ++initial_pos){
- for(unsigned int final_pos = initial_pos; final_pos != (NumIterations+1); ++final_pos){
-
- //Create intrusive container inserting values
- unordered_multiset_type testset
- ( &random_init[0]
- , &random_init[0] + random_init.size()
- , bucket_traits(buckets, NumBucketSize));
-
- BOOST_TEST (testset.size() == random_init.size());
-
- //Obtain the iterator range to erase
- iterator it_beg_pos = testset.begin();
- for(unsigned int it_beg_pos_num = 0; it_beg_pos_num != initial_pos; ++it_beg_pos_num){
- ++it_beg_pos;
- }
- iterator it_end_pos(it_beg_pos);
- for(unsigned int it_end_pos_num = 0; it_end_pos_num != (final_pos - initial_pos); ++it_end_pos_num){
- ++it_end_pos;
- }
-
- //Erase the same values in both the intrusive and original vector
- std::size_t erased_cnt = std::distance(it_beg_pos, it_end_pos);
-
- //Erase values from the intrusive container
- testset.erase(it_beg_pos, it_end_pos);
-
- BOOST_TEST (testset.size() == (random_init.size()-(final_pos - initial_pos)));
-
- //Now test...
- BOOST_TEST ((random_init.size() - erased_cnt) == testset.size());
-
- //Create an ordered copy of the intrusive container
- set_tester.insert(set_tester.end(), testset.begin(), testset.end());
- std::sort(set_tester.begin(), set_tester.end());
- {
- typename std::vector<value_type>::iterator it = set_tester.begin(), itend = set_tester.end();
- typename std::vector<value_type>::iterator random_init_it(random_init.begin());
- for( ; it != itend; ++it){
- while(!random_init_it->is_linked())
- ++random_init_it;
- BOOST_TEST(*it == *random_init_it);
- ++random_init_it;
- }
- }
- set_tester.clear();
- }
- }
- }
-}
-
-//test: insert (seq-version), swap, erase (seq-version), size:
-template<class ValueTraits, bool CacheBegin, bool CompareHash, bool Incremental>
-void test_unordered_multiset<ValueTraits, CacheBegin, CompareHash, Incremental>::
- test_swap(std::vector<typename ValueTraits::value_type>& values)
-{
- typedef typename ValueTraits::value_type value_type;
- typedef unordered_multiset
- <value_type
- , value_traits<ValueTraits>
- , constant_time_size<value_type::constant_time_size>
- , cache_begin<CacheBegin>
- , compare_hash<CompareHash>
- , incremental<Incremental>
- > unordered_multiset_type;
- typedef typename unordered_multiset_type::bucket_traits bucket_traits;
- typename unordered_multiset_type::bucket_type buckets [BucketSize];
-
- typename unordered_multiset_type::bucket_type buckets2 [BucketSize];
- unordered_multiset_type testset1(&values[0], &values[0] + 2, bucket_traits(buckets, BucketSize));
- unordered_multiset_type testset2(bucket_traits(buckets2, BucketSize));
-
- testset2.insert (&values[0] + 2, &values[0] + 6);
- testset1.swap (testset2);
-
- if(Incremental){
- { int init_values [] = { 4, 5, 1, 2 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testset1.begin() ); }
-
- { int init_values [] = { 2, 3 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testset2.begin() ); }
- testset1.erase (testset1.iterator_to(values[4]), testset1.end());
- BOOST_TEST (testset1.size() == 1);
- // BOOST_TEST (&testset1.front() == &values[3]);
- BOOST_TEST (&*testset1.begin() == &values[2]);
- }
- else{
- { int init_values [] = { 1, 2, 4, 5 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testset1.begin() ); }
-
- { int init_values [] = { 2, 3 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testset2.begin() ); }
- testset1.erase (testset1.iterator_to(values[5]), testset1.end());
- BOOST_TEST (testset1.size() == 1);
- // BOOST_TEST (&testset1.front() == &values[3]);
- BOOST_TEST (&*testset1.begin() == &values[3]);
- }
-}
-
-
-
-//test: rehash:
-
-template<class ValueTraits, bool CacheBegin, bool CompareHash, bool Incremental>
-void test_unordered_multiset<ValueTraits, CacheBegin, CompareHash, Incremental>
- ::test_rehash(std::vector<typename ValueTraits::value_type>& values, detail::true_)
-{
- typedef typename ValueTraits::value_type value_type;
- typedef unordered_multiset
- <value_type
- , value_traits<ValueTraits>
- , constant_time_size<value_type::constant_time_size>
- , cache_begin<CacheBegin>
- , compare_hash<CompareHash>
- , incremental<Incremental>
- > unordered_multiset_type;
- typedef typename unordered_multiset_type::bucket_traits bucket_traits;
- //Build a uset
- typename unordered_multiset_type::bucket_type buckets1 [BucketSize];
- typename unordered_multiset_type::bucket_type buckets2 [BucketSize*2];
- unordered_multiset_type testset1(&values[0], &values[0] + values.size(), bucket_traits(buckets1, BucketSize));
- //Test current state
- BOOST_TEST(testset1.split_count() == BucketSize/2);
- { int init_values [] = { 4, 5, 1, 2, 2, 3 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testset1.begin() ); }
- //Incremental rehash step
- BOOST_TEST (testset1.incremental_rehash() == true);
- BOOST_TEST(testset1.split_count() == (BucketSize/2+1));
- { int init_values [] = { 5, 1, 2, 2, 3, 4 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testset1.begin() ); }
- //Rest of incremental rehashes should lead to the same sequence
- for(std::size_t split_bucket = testset1.split_count(); split_bucket != BucketSize; ++split_bucket){
- BOOST_TEST (testset1.incremental_rehash() == true);
- BOOST_TEST(testset1.split_count() == (split_bucket+1));
- { int init_values [] = { 1, 2, 2, 3, 4, 5 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testset1.begin() ); }
- }
- //This incremental rehash should fail because we've reached the end of the bucket array
- BOOST_TEST (testset1.incremental_rehash() == false);
- BOOST_TEST(testset1.split_count() == BucketSize);
- { int init_values [] = { 1, 2, 2, 3, 4, 5 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testset1.begin() ); }
-
- //
- //Try incremental hashing specifying a new bucket traits pointing to the same array
- //
- //This incremental rehash should fail because the new size is not twice the original
- BOOST_TEST(testset1.incremental_rehash(bucket_traits(buckets1, BucketSize)) == false);
- BOOST_TEST(testset1.split_count() == BucketSize);
- { int init_values [] = { 1, 2, 2, 3, 4, 5 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testset1.begin() ); }
-
- //This incremental rehash should success because the new size is twice the original
- //and split_count is the same as the old bucket count
- BOOST_TEST(testset1.incremental_rehash(bucket_traits(buckets1, BucketSize*2)) == true);
- BOOST_TEST(testset1.split_count() == BucketSize);
- { int init_values [] = { 1, 2, 2, 3, 4, 5 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testset1.begin() ); }
-
- //This incremental rehash should also success because the new size is half the original
- //and split_count is the same as the new bucket count
- BOOST_TEST(testset1.incremental_rehash(bucket_traits(buckets1, BucketSize)) == true);
- BOOST_TEST(testset1.split_count() == BucketSize);
- { int init_values [] = { 1, 2, 2, 3, 4, 5 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testset1.begin() ); }
-
- //
- //Try incremental hashing specifying a new bucket traits pointing to the same array
- //
- //This incremental rehash should fail because the new size is not twice the original
- BOOST_TEST(testset1.incremental_rehash(bucket_traits(buckets2, BucketSize)) == false);
- BOOST_TEST(testset1.split_count() == BucketSize);
- { int init_values [] = { 1, 2, 2, 3, 4, 5 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testset1.begin() ); }
-
- //This incremental rehash should success because the new size is twice the original
- //and split_count is the same as the old bucket count
- BOOST_TEST(testset1.incremental_rehash(bucket_traits(buckets2, BucketSize*2)) == true);
- BOOST_TEST(testset1.split_count() == BucketSize);
- { int init_values [] = { 1, 2, 2, 3, 4, 5 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testset1.begin() ); }
-
- //This incremental rehash should also success because the new size is half the original
- //and split_count is the same as the new bucket count
- BOOST_TEST(testset1.incremental_rehash(bucket_traits(buckets1, BucketSize)) == true);
- BOOST_TEST(testset1.split_count() == BucketSize);
- { int init_values [] = { 1, 2, 2, 3, 4, 5 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testset1.begin() ); }
-
- //Full shrink rehash
- testset1.rehash(bucket_traits(buckets1, 4));
- BOOST_TEST (testset1.size() == values.size());
- BOOST_TEST (testset1.incremental_rehash() == false);
- { int init_values [] = { 4, 5, 1, 2, 2, 3 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testset1.begin() ); }
- //Full shrink rehash again
- testset1.rehash(bucket_traits(buckets1, 2));
- BOOST_TEST (testset1.size() == values.size());
- BOOST_TEST (testset1.incremental_rehash() == false);
- { int init_values [] = { 2, 2, 4, 3, 5, 1 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testset1.begin() ); }
- //Full growing rehash
- testset1.rehash(bucket_traits(buckets1, BucketSize));
- BOOST_TEST (testset1.size() == values.size());
- BOOST_TEST (testset1.incremental_rehash() == false);
- { int init_values [] = { 1, 2, 2, 3, 4, 5 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testset1.begin() ); }
- //Incremental rehash shrinking
- //First incremental rehashes should lead to the same sequence
- for(std::size_t split_bucket = testset1.split_count(); split_bucket > 6; --split_bucket){
- BOOST_TEST (testset1.incremental_rehash(false) == true);
- BOOST_TEST(testset1.split_count() == (split_bucket-1));
- { int init_values [] = { 1, 2, 2, 3, 4, 5 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testset1.begin() ); }
- }
- //Incremental rehash step
- BOOST_TEST (testset1.incremental_rehash(false) == true);
- BOOST_TEST(testset1.split_count() == (BucketSize/2+1));
- { int init_values [] = { 5, 1, 2, 2, 3, 4 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testset1.begin() ); }
- //Incremental rehash step 2
- BOOST_TEST (testset1.incremental_rehash(false) == true);
- BOOST_TEST(testset1.split_count() == (BucketSize/2));
- { int init_values [] = { 4, 5, 1, 2, 2, 3 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testset1.begin() ); }
- //This incremental rehash should fail because we've reached the half of the bucket array
- BOOST_TEST(testset1.incremental_rehash(false) == false);
- BOOST_TEST(testset1.split_count() == BucketSize/2);
- { int init_values [] = { 4, 5, 1, 2, 2, 3 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testset1.begin() ); }
-}
-template<class ValueTraits, bool CacheBegin, bool CompareHash, bool Incremental>
-void test_unordered_multiset<ValueTraits, CacheBegin, CompareHash, Incremental>
- ::test_rehash(std::vector<typename ValueTraits::value_type>& values, detail::false_)
-{
- typedef typename ValueTraits::value_type value_type;
- typedef unordered_multiset
- <value_type
- , value_traits<ValueTraits>
- , constant_time_size<value_type::constant_time_size>
- , cache_begin<CacheBegin>
- , compare_hash<CompareHash>
- , incremental<Incremental>
- > unordered_multiset_type;
- typedef typename unordered_multiset_type::bucket_traits bucket_traits;
-
- typename unordered_multiset_type::bucket_type buckets1 [BucketSize];
- typename unordered_multiset_type::bucket_type buckets2 [2];
- typename unordered_multiset_type::bucket_type buckets3 [BucketSize*2];
-
- unordered_multiset_type testset1(&values[0], &values[0] + 6, bucket_traits(buckets1, BucketSize));
- BOOST_TEST (testset1.size() == values.size());
- { int init_values [] = { 1, 2, 2, 3, 4, 5 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testset1.begin() ); }
-
- testset1.rehash(bucket_traits(buckets2, 2));
- BOOST_TEST (testset1.size() == values.size());
- { int init_values [] = { 4, 2, 2, 5, 3, 1 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testset1.begin() ); }
-
- testset1.rehash(bucket_traits(buckets3, BucketSize*2));
- BOOST_TEST (testset1.size() == values.size());
- { int init_values [] = { 1, 2, 2, 3, 4, 5 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testset1.begin() ); }
-
- //Now rehash reducing the buckets
- testset1.rehash(bucket_traits(buckets3, 2));
- BOOST_TEST (testset1.size() == values.size());
- { int init_values [] = { 4, 2, 2, 5, 3, 1 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testset1.begin() ); }
-
- //Now rehash increasing the buckets
- testset1.rehash(bucket_traits(buckets3, BucketSize*2));
- BOOST_TEST (testset1.size() == values.size());
- { int init_values [] = { 1, 2, 2, 3, 4, 5 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testset1.begin() ); }
-}
-
-//test: find, equal_range (lower_bound, upper_bound):
-template<class ValueTraits, bool CacheBegin, bool CompareHash, bool Incremental>
-void test_unordered_multiset<ValueTraits, CacheBegin, CompareHash, Incremental>::
- test_find(std::vector<typename ValueTraits::value_type>& values)
-{
- typedef typename ValueTraits::value_type value_type;
- typedef unordered_multiset
- <value_type
- , value_traits<ValueTraits>
- , constant_time_size<value_type::constant_time_size>
- , cache_begin<CacheBegin>
- , compare_hash<CompareHash>
- , incremental<Incremental>
- > unordered_multiset_type;
- typedef typename unordered_multiset_type::bucket_traits bucket_traits;
-
- typename unordered_multiset_type::bucket_type buckets[BucketSize];
- unordered_multiset_type testset(values.begin(), values.end(), bucket_traits(buckets, BucketSize));
-
- typedef typename unordered_multiset_type::iterator iterator;
-
- value_type cmp_val;
- cmp_val.value_ = 2;
- iterator i = testset.find (cmp_val);
- BOOST_TEST (i->value_ == 2);
- BOOST_TEST ((++i)->value_ == 2);
- std::pair<iterator,iterator> range = testset.equal_range (cmp_val);
-
- BOOST_TEST (range.first->value_ == 2);
- BOOST_TEST (range.second->value_ == 3);
- BOOST_TEST (std::distance (range.first, range.second) == 2);
-
- cmp_val.value_ = 7;
- BOOST_TEST (testset.find (cmp_val) == testset.end());
-}
-
-
-template<class ValueTraits, bool CacheBegin, bool CompareHash, bool Incremental>
-void test_unordered_multiset<ValueTraits, CacheBegin, CompareHash, Incremental>
- ::test_clone(std::vector<typename ValueTraits::value_type>& values)
-{
- typedef typename ValueTraits::value_type value_type;
- typedef unordered_multiset
- <value_type
- , value_traits<ValueTraits>
- , constant_time_size<value_type::constant_time_size>
- , cache_begin<CacheBegin>
- , compare_hash<CompareHash>
- , incremental<Incremental>
- > unordered_multiset_type;
- typedef typename unordered_multiset_type::bucket_traits bucket_traits;
- {
- //Test with equal bucket arrays
- typename unordered_multiset_type::bucket_type buckets1 [BucketSize];
- typename unordered_multiset_type::bucket_type buckets2 [BucketSize];
- unordered_multiset_type testset1 (values.begin(), values.end(), bucket_traits(buckets1, BucketSize));
- unordered_multiset_type testset2 (bucket_traits(buckets2, BucketSize));
-
- testset2.clone_from(testset1, test::new_cloner<value_type>(), test::delete_disposer<value_type>());
- //Ordering is not guarantee in the cloning so insert data in a set and test
- std::multiset<typename ValueTraits::value_type>
- src(testset1.begin(), testset1.end());
- std::multiset<typename ValueTraits::value_type>
- dst(testset2.begin(), testset2.end());
- BOOST_TEST (src.size() == dst.size() && std::equal(src.begin(), src.end(), dst.begin()));
- testset2.clear_and_dispose(test::delete_disposer<value_type>());
- BOOST_TEST (testset2.empty());
- }
- {
- //Test with bigger source bucket arrays
- typename unordered_multiset_type::bucket_type buckets1 [BucketSize*2];
- typename unordered_multiset_type::bucket_type buckets2 [BucketSize];
- unordered_multiset_type testset1 (values.begin(), values.end(), bucket_traits(buckets1, BucketSize*2));
- unordered_multiset_type testset2 (bucket_traits(buckets2, BucketSize));
-
- testset2.clone_from(testset1, test::new_cloner<value_type>(), test::delete_disposer<value_type>());
- //Ordering is not guarantee in the cloning so insert data in a set and test
- std::multiset<typename ValueTraits::value_type>
- src(testset1.begin(), testset1.end());
- std::multiset<typename ValueTraits::value_type>
- dst(testset2.begin(), testset2.end());
- BOOST_TEST (src.size() == dst.size() && std::equal(src.begin(), src.end(), dst.begin()));
- testset2.clear_and_dispose(test::delete_disposer<value_type>());
- BOOST_TEST (testset2.empty());
- }
- {
- //Test with smaller source bucket arrays
- typename unordered_multiset_type::bucket_type buckets1 [BucketSize];
- typename unordered_multiset_type::bucket_type buckets2 [BucketSize*2];
- unordered_multiset_type testset1 (values.begin(), values.end(), bucket_traits(buckets1, BucketSize));
- unordered_multiset_type testset2 (bucket_traits(buckets2, BucketSize*2));
-
- testset2.clone_from(testset1, test::new_cloner<value_type>(), test::delete_disposer<value_type>());
- //Ordering is not guaranteed in the cloning so insert data in a set and test
- std::multiset<typename ValueTraits::value_type>
- src(testset1.begin(), testset1.end());
- std::multiset<typename ValueTraits::value_type>
- dst(testset2.begin(), testset2.end());
- BOOST_TEST (src.size() == dst.size() && std::equal(src.begin(), src.end(), dst.begin()));
- testset2.clear_and_dispose(test::delete_disposer<value_type>());
- BOOST_TEST (testset2.empty());
- }
-}
-
-template<class VoidPointer, bool constant_time_size, bool Incremental>
-class test_main_template
-{
- public:
- int operator()()
- {
- typedef testvalue<hooks<VoidPointer> , constant_time_size> value_type;
- static const int random_init[6] = { 3, 2, 4, 1, 5, 2 };
- std::vector<testvalue<hooks<VoidPointer> , constant_time_size> > data (6);
- for (int i = 0; i < 6; ++i)
- data[i].value_ = random_init[i];
-
- test_unordered_multiset < typename detail::get_base_value_traits
- < value_type
- , typename hooks<VoidPointer>::base_hook_type
- >::type
- , true
- , false
- , Incremental
- >::test_all(data);
-
- test_unordered_multiset < typename detail::get_member_value_traits
- < value_type
- , member_hook< value_type
- , typename hooks<VoidPointer>::member_hook_type
- , &value_type::node_
- >
- >::type
- , false
- , false
- , Incremental
- >::test_all(data);
- return 0;
- }
-};
-
-template<class VoidPointer, bool Incremental>
-class test_main_template<VoidPointer, false, Incremental>
-{
- public:
- int operator()()
- {
- typedef testvalue<hooks<VoidPointer> , false> value_type;
- static const int random_init[6] = { 3, 2, 4, 1, 5, 2 };
- std::vector<testvalue<hooks<VoidPointer> , false> > data (6);
- for (int i = 0; i < 6; ++i)
- data[i].value_ = random_init[i];
-
- test_unordered_multiset < typename detail::get_base_value_traits
- < value_type
- , typename hooks<VoidPointer>::base_hook_type
- >::type
- , false
- , false
- , Incremental
- >::test_all(data);
-
- test_unordered_multiset < typename detail::get_member_value_traits
- < value_type
- , member_hook< value_type
- , typename hooks<VoidPointer>::member_hook_type
- , &value_type::node_
- >
- >::type
- , true
- , false
- , Incremental
- >::test_all(data);
-
- test_unordered_multiset < typename detail::get_base_value_traits
- < value_type
- , typename hooks<VoidPointer>::auto_base_hook_type
- >::type
- , false
- , false
- , Incremental
- >::test_all(data);
-
- test_unordered_multiset < typename detail::get_member_value_traits
- < value_type
- , member_hook< value_type
- , typename hooks<VoidPointer>::auto_member_hook_type
- , &value_type::auto_node_
- >
- >::type
- , false
- , true
- , Incremental
- >::test_all(data);
- return 0;
- }
-};
-
-int main( int, char* [] )
-{
- test_main_template<void*, false, true>()();
- test_main_template<smart_ptr<void>, false, true>()();
- test_main_template<void*, true, true>()();
- test_main_template<smart_ptr<void>, true, true>()();
- test_main_template<void*, false, false>()();
- test_main_template<smart_ptr<void>, false, false>()();
- test_main_template<void*, true, true>()();
- test_main_template<smart_ptr<void>, true, false>()();
- return boost::report_errors();
-}
-
-#include <boost/intrusive/detail/config_end.hpp>

Deleted: sandbox/move/libs/intrusive/test/unordered_set_test.cpp
==============================================================================
--- sandbox/move/libs/intrusive/test/unordered_set_test.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,678 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Olaf Krzikalla 2004-2006.
-// (C) Copyright Ion Gaztanaga 2006-2009.
-//
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-#include <boost/intrusive/detail/config_begin.hpp>
-#include <boost/intrusive/unordered_set.hpp>
-#include <boost/intrusive/detail/pointer_to_other.hpp>
-#include "itestvalue.hpp"
-#include "smart_ptr.hpp"
-#include "common_functors.hpp"
-#include <vector>
-#include <set>
-#include <boost/detail/lightweight_test.hpp>
-#include "test_macros.hpp"
-#include "test_container.hpp"
-
-namespace boost { namespace intrusive { namespace test {
-
-#if !defined (BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template<class T, class O1, class O2, class O3, class O4, class O5, class O6>
-#else
-template<class T, class ...Options>
-#endif
-struct is_unordered<boost::intrusive::unordered_set<T,
- #if !defined (BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
- O1, O2, O3, O4, O5, O6
- #else
- Options...
- #endif
-> >
-{
- static const bool value = true;
-};
-
-}}}
-
-using namespace boost::intrusive;
-
-struct my_tag;
-
-template<class VoidPointer>
-struct hooks
-{
- typedef unordered_set_base_hook<void_pointer<VoidPointer> > base_hook_type;
- typedef unordered_set_base_hook
- < link_mode<auto_unlink>
- , void_pointer<VoidPointer>
- , tag<my_tag>
- , store_hash<true>
- > auto_base_hook_type;
-
- typedef unordered_set_member_hook
- < void_pointer<VoidPointer>
- , optimize_multikey<true>
- > member_hook_type;
- typedef unordered_set_member_hook
- < link_mode<auto_unlink>, void_pointer<VoidPointer>
- , store_hash<true>
- , optimize_multikey<true>
- > auto_member_hook_type;
-};
-
-static const std::size_t BucketSize = 8;
-
-template<class ValueTraits, bool CacheBegin, bool CompareHash, bool Incremental>
-struct test_unordered_set
-{
- typedef typename ValueTraits::value_type value_type;
- static void test_all(std::vector<value_type>& values);
- static void test_sort(std::vector<value_type>& values);
- static void test_insert(std::vector<value_type>& values);
- static void test_swap(std::vector<value_type>& values);
- static void test_rehash(std::vector<value_type>& values, detail::true_);
- static void test_rehash(std::vector<value_type>& values, detail::false_);
- static void test_find(std::vector<value_type>& values);
- static void test_impl();
- static void test_clone(std::vector<value_type>& values);
-};
-
-template<class ValueTraits, bool CacheBegin, bool CompareHash, bool Incremental>
-void test_unordered_set<ValueTraits, CacheBegin, CompareHash, Incremental>::
- test_all(std::vector<typename ValueTraits::value_type>& values)
-{
- typedef typename ValueTraits::value_type value_type;
- typedef unordered_set
- <value_type
- , value_traits<ValueTraits>
- , constant_time_size<value_type::constant_time_size>
- , cache_begin<CacheBegin>
- , compare_hash<CompareHash>
- , incremental<Incremental>
- > unordered_set_type;
- typedef typename unordered_set_type::bucket_traits bucket_traits;
- {
- typename unordered_set_type::bucket_type buckets [BucketSize];
- unordered_set_type testset(bucket_traits(buckets, BucketSize));
- testset.insert(values.begin(), values.end());
- test::test_container(testset);
- testset.clear();
- testset.insert(values.begin(), values.end());
- test::test_common_unordered_and_associative_container(testset, values);
- testset.clear();
- testset.insert(values.begin(), values.end());
- test::test_unordered_associative_container(testset, values);
- testset.clear();
- testset.insert(values.begin(), values.end());
- test::test_unique_container(testset, values);
- }
- test_sort(values);
- test_insert(values);
- test_swap(values);
- test_rehash(values, detail::bool_<Incremental>());
- test_find(values);
- test_impl();
- test_clone(values);
-}
-
-//test case due to an error in tree implementation:
-template<class ValueTraits, bool CacheBegin, bool CompareHash, bool Incremental>
-void test_unordered_set<ValueTraits, CacheBegin, CompareHash, Incremental>::test_impl()
-{
- typedef typename ValueTraits::value_type value_type;
- typedef unordered_set
- <value_type
- , value_traits<ValueTraits>
- , constant_time_size<value_type::constant_time_size>
- , cache_begin<CacheBegin>
- , compare_hash<CompareHash>
- , incremental<Incremental>
- > unordered_set_type;
- typedef typename unordered_set_type::bucket_traits bucket_traits;
-
- std::vector<value_type> values (5);
- for (int i = 0; i < 5; ++i)
- values[i].value_ = i;
-
- typename unordered_set_type::bucket_type buckets [BucketSize];
- unordered_set_type testset(bucket_traits(buckets, BucketSize));
- for (int i = 0; i < 5; ++i)
- testset.insert (values[i]);
-
- testset.erase (testset.iterator_to (values[0]));
- testset.erase (testset.iterator_to (values[1]));
- testset.insert (values[1]);
- testset.erase (testset.iterator_to (values[2]));
- testset.erase (testset.iterator_to (values[3]));
-}
-
-//test: constructor, iterator, clear, reverse_iterator, front, back, size:
-template<class ValueTraits, bool CacheBegin, bool CompareHash, bool Incremental>
-void test_unordered_set<ValueTraits, CacheBegin, CompareHash, Incremental>::
- test_sort(std::vector<typename ValueTraits::value_type>& values)
-{
- typedef typename ValueTraits::value_type value_type;
- typedef unordered_set
- <value_type
- , value_traits<ValueTraits>
- , constant_time_size<value_type::constant_time_size>
- , cache_begin<CacheBegin>
- , compare_hash<CompareHash>
- , incremental<Incremental>
- > unordered_set_type;
- typedef typename unordered_set_type::bucket_traits bucket_traits;
-
- typename unordered_set_type::bucket_type buckets [BucketSize];
- unordered_set_type testset1(values.begin(), values.end(), bucket_traits(buckets, BucketSize));
- BOOST_TEST (5 == std::distance(testset1.begin(), testset1.end()));
-
- if(Incremental){
- { int init_values [] = { 4, 5, 1, 2, 3 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testset1.begin() ); }
- }
- else{
- { int init_values [] = { 1, 2, 3, 4, 5 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testset1.begin() ); }
- }
-
- testset1.clear();
- BOOST_TEST (testset1.empty());
-}
-
-//test: insert, const_iterator, const_reverse_iterator, erase, iterator_to:
-template<class ValueTraits, bool CacheBegin, bool CompareHash, bool Incremental>
-void test_unordered_set<ValueTraits, CacheBegin, CompareHash, Incremental>::
- test_insert(std::vector<typename ValueTraits::value_type>& values)
-{
- typedef typename ValueTraits::value_type value_type;
- typedef unordered_set
- <value_type
- , value_traits<ValueTraits>
- , constant_time_size<value_type::constant_time_size>
- , cache_begin<CacheBegin>
- , compare_hash<CompareHash>
- , incremental<Incremental>
- > unordered_set_type;
- typedef typename unordered_set_type::bucket_traits bucket_traits;
-
- typename unordered_set_type::bucket_type buckets [BucketSize];
- unordered_set_type testset(bucket_traits(buckets, BucketSize));
- testset.insert(&values[0] + 2, &values[0] + 5);
-
- const unordered_set_type& const_testset = testset;
- if(Incremental)
- {
- { int init_values [] = { 4, 5, 1 };
- TEST_INTRUSIVE_SEQUENCE( init_values, const_testset.begin() ); }
- typename unordered_set_type::iterator i = testset.begin();
- BOOST_TEST (i->value_ == 4);
-
- i = testset.insert(values[0]).first;
- BOOST_TEST (&*i == &values[0]);
-
- i = testset.iterator_to (values[2]);
- BOOST_TEST (&*i == &values[2]);
-
- testset.erase (i);
-
- { int init_values [] = { 5, 1, 3 };
- TEST_INTRUSIVE_SEQUENCE( init_values, const_testset.begin() ); }
- }
- else{
- { int init_values [] = { 1, 4, 5 };
- TEST_INTRUSIVE_SEQUENCE( init_values, const_testset.begin() ); }
- typename unordered_set_type::iterator i = testset.begin();
- BOOST_TEST (i->value_ == 1);
-
- i = testset.insert(values[0]).first;
- BOOST_TEST (&*i == &values[0]);
-
- i = testset.iterator_to (values[2]);
- BOOST_TEST (&*i == &values[2]);
-
- testset.erase (i);
-
- { int init_values [] = { 1, 3, 5 };
- TEST_INTRUSIVE_SEQUENCE( init_values, const_testset.begin() ); }
- }
-}
-
-//test: insert (seq-version), swap, erase (seq-version), size:
-template<class ValueTraits, bool CacheBegin, bool CompareHash, bool Incremental>
-void test_unordered_set<ValueTraits, CacheBegin, CompareHash, Incremental>::
- test_swap(std::vector<typename ValueTraits::value_type>& values)
-{
- typedef typename ValueTraits::value_type value_type;
- typedef unordered_set
- <value_type
- , value_traits<ValueTraits>
- , constant_time_size<value_type::constant_time_size>
- , cache_begin<CacheBegin>
- , compare_hash<CompareHash>
- , incremental<Incremental>
- > unordered_set_type;
- typedef typename unordered_set_type::bucket_traits bucket_traits;
-
- typename unordered_set_type::bucket_type buckets1 [BucketSize];
- typename unordered_set_type::bucket_type buckets2 [BucketSize];
- unordered_set_type testset1(&values[0], &values[0] + 2, bucket_traits(buckets1, BucketSize));
- unordered_set_type testset2(bucket_traits(buckets2, BucketSize));
-
- testset2.insert (&values[0] + 2, &values[0] + 6);
- testset1.swap (testset2);
-
- if(Incremental){
- { int init_values [] = { 4, 5, 1, 2 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testset1.begin() ); }
- { int init_values [] = { 2, 3 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testset2.begin() ); }
- testset1.erase (testset1.iterator_to(values[4]), testset1.end());
- BOOST_TEST (testset1.size() == 1);
- BOOST_TEST (&*testset1.begin() == &values[2]);
- }
- else{
- { int init_values [] = { 1, 2, 4, 5 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testset1.begin() ); }
- { int init_values [] = { 2, 3 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testset2.begin() ); }
- testset1.erase (testset1.iterator_to(values[5]), testset1.end());
- BOOST_TEST (testset1.size() == 1);
- BOOST_TEST (&*testset1.begin() == &values[3]);
- }
-}
-
-//test: rehash:
-template<class ValueTraits, bool CacheBegin, bool CompareHash, bool Incremental>
-void test_unordered_set<ValueTraits, CacheBegin, CompareHash, Incremental>::
- test_rehash(std::vector<typename ValueTraits::value_type>& values, detail::true_)
-{
- typedef typename ValueTraits::value_type value_type;
- typedef unordered_set
- <value_type
- , value_traits<ValueTraits>
- , constant_time_size<value_type::constant_time_size>
- , cache_begin<CacheBegin>
- , compare_hash<CompareHash>
- , incremental<Incremental>
- > unordered_set_type;
- typedef typename unordered_set_type::bucket_traits bucket_traits;
- //Build a uset
- typename unordered_set_type::bucket_type buckets1 [BucketSize];
- typename unordered_set_type::bucket_type buckets2 [BucketSize*2];
- unordered_set_type testset1(&values[0], &values[0] + 6, bucket_traits(buckets1, BucketSize));
- //Test current state
- BOOST_TEST(testset1.split_count() == BucketSize/2);
- { int init_values [] = { 4, 5, 1, 2, 3 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testset1.begin() ); }
- //Incremental rehash step
- BOOST_TEST (testset1.incremental_rehash() == true);
- BOOST_TEST(testset1.split_count() == (BucketSize/2+1));
- { int init_values [] = { 5, 1, 2, 3, 4 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testset1.begin() ); }
- //Rest of incremental rehashes should lead to the same sequence
- for(std::size_t split_bucket = testset1.split_count(); split_bucket != BucketSize; ++split_bucket){
- BOOST_TEST (testset1.incremental_rehash() == true);
- BOOST_TEST(testset1.split_count() == (split_bucket+1));
- { int init_values [] = { 1, 2, 3, 4, 5 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testset1.begin() ); }
- }
- //This incremental rehash should fail because we've reached the end of the bucket array
- BOOST_TEST(testset1.incremental_rehash() == false);
- BOOST_TEST(testset1.split_count() == BucketSize);
- { int init_values [] = { 1, 2, 3, 4, 5 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testset1.begin() ); }
-
- //
- //Try incremental hashing specifying a new bucket traits pointing to the same array
- //
- //This incremental rehash should fail because the new size is not twice the original
- BOOST_TEST(testset1.incremental_rehash(bucket_traits(buckets1, BucketSize)) == false);
- BOOST_TEST(testset1.split_count() == BucketSize);
- { int init_values [] = { 1, 2, 3, 4, 5 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testset1.begin() ); }
-
- //This incremental rehash should success because the new size is twice the original
- //and split_count is the same as the old bucket count
- BOOST_TEST(testset1.incremental_rehash(bucket_traits(buckets1, BucketSize*2)) == true);
- BOOST_TEST(testset1.split_count() == BucketSize);
- { int init_values [] = { 1, 2, 3, 4, 5 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testset1.begin() ); }
-
- //This incremental rehash should also success because the new size is half the original
- //and split_count is the same as the new bucket count
- BOOST_TEST(testset1.incremental_rehash(bucket_traits(buckets1, BucketSize)) == true);
- BOOST_TEST(testset1.split_count() == BucketSize);
- { int init_values [] = { 1, 2, 3, 4, 5 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testset1.begin() ); }
-
- //
- //Try incremental hashing specifying a new bucket traits pointing to the same array
- //
- //This incremental rehash should fail because the new size is not twice the original
- BOOST_TEST(testset1.incremental_rehash(bucket_traits(buckets2, BucketSize)) == false);
- BOOST_TEST(testset1.split_count() == BucketSize);
- { int init_values [] = { 1, 2, 3, 4, 5 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testset1.begin() ); }
-
- //This incremental rehash should success because the new size is twice the original
- //and split_count is the same as the old bucket count
- BOOST_TEST(testset1.incremental_rehash(bucket_traits(buckets2, BucketSize*2)) == true);
- BOOST_TEST(testset1.split_count() == BucketSize);
- { int init_values [] = { 1, 2, 3, 4, 5 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testset1.begin() ); }
-
- //This incremental rehash should also success because the new size is half the original
- //and split_count is the same as the new bucket count
- BOOST_TEST(testset1.incremental_rehash(bucket_traits(buckets1, BucketSize)) == true);
- BOOST_TEST(testset1.split_count() == BucketSize);
- { int init_values [] = { 1, 2, 3, 4, 5 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testset1.begin() ); }
-
- //Full shrink rehash
- testset1.rehash(bucket_traits(buckets1, 4));
- BOOST_TEST (testset1.size() == values.size()-1);
- BOOST_TEST (testset1.incremental_rehash() == false);
- { int init_values [] = { 4, 5, 1, 2, 3 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testset1.begin() ); }
- //Full shrink rehash again
- testset1.rehash(bucket_traits(buckets1, 2));
- BOOST_TEST (testset1.size() == values.size()-1);
- BOOST_TEST (testset1.incremental_rehash() == false);
- { int init_values [] = { 2, 4, 3, 5, 1 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testset1.begin() ); }
- //Full growing rehash
- testset1.rehash(bucket_traits(buckets1, BucketSize));
- BOOST_TEST (testset1.size() == values.size()-1);
- BOOST_TEST (testset1.incremental_rehash() == false);
- { int init_values [] = { 1, 2, 3, 4, 5 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testset1.begin() ); }
- //Incremental rehash shrinking
- //First incremental rehashes should lead to the same sequence
- for(std::size_t split_bucket = testset1.split_count(); split_bucket > 6; --split_bucket){
- BOOST_TEST (testset1.incremental_rehash(false) == true);
- BOOST_TEST(testset1.split_count() == (split_bucket-1));
- { int init_values [] = { 1, 2, 3, 4, 5 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testset1.begin() ); }
- }
- //Incremental rehash step
- BOOST_TEST (testset1.incremental_rehash(false) == true);
- BOOST_TEST(testset1.split_count() == (BucketSize/2+1));
- { int init_values [] = { 5, 1, 2, 3, 4 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testset1.begin() ); }
- //Incremental rehash step 2
- BOOST_TEST (testset1.incremental_rehash(false) == true);
- BOOST_TEST(testset1.split_count() == (BucketSize/2));
- { int init_values [] = { 4, 5, 1, 2, 3 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testset1.begin() ); }
- //This incremental rehash should fail because we've reached the half of the bucket array
- BOOST_TEST(testset1.incremental_rehash(false) == false);
- BOOST_TEST(testset1.split_count() == BucketSize/2);
- { int init_values [] = { 4, 5, 1, 2, 3 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testset1.begin() ); }
-}
-
-//test: rehash:
-template<class ValueTraits, bool CacheBegin, bool CompareHash, bool Incremental>
-void test_unordered_set<ValueTraits, CacheBegin, CompareHash, Incremental>::
- test_rehash(std::vector<typename ValueTraits::value_type>& values, detail::false_)
-{
- typedef typename ValueTraits::value_type value_type;
- typedef unordered_set
- <value_type
- , value_traits<ValueTraits>
- , constant_time_size<value_type::constant_time_size>
- , cache_begin<CacheBegin>
- , compare_hash<CompareHash>
- , incremental<Incremental>
- > unordered_set_type;
- typedef typename unordered_set_type::bucket_traits bucket_traits;
-
- typename unordered_set_type::bucket_type buckets1 [BucketSize];
- typename unordered_set_type::bucket_type buckets2 [2];
- typename unordered_set_type::bucket_type buckets3 [BucketSize*2];
-
- unordered_set_type testset1(&values[0], &values[0] + 6, bucket_traits(buckets1, BucketSize));
- BOOST_TEST (testset1.size() == values.size()-1);
- { int init_values [] = { 1, 2, 3, 4, 5 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testset1.begin() ); }
-
- testset1.rehash(bucket_traits(buckets2, 2));
- BOOST_TEST (testset1.size() == values.size()-1);
- { int init_values [] = { 4, 2, 5, 3, 1 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testset1.begin() ); }
-
- testset1.rehash(bucket_traits(buckets3, BucketSize*2));
- BOOST_TEST (testset1.size() == values.size()-1);
- { int init_values [] = { 1, 2, 3, 4, 5 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testset1.begin() ); }
-
- //Now rehash reducing the buckets
- testset1.rehash(bucket_traits(buckets3, 2));
- BOOST_TEST (testset1.size() == values.size()-1);
- { int init_values [] = { 4, 2, 5, 3, 1 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testset1.begin() ); }
-
- //Now rehash increasing the buckets
- testset1.rehash(bucket_traits(buckets3, BucketSize*2));
- BOOST_TEST (testset1.size() == values.size()-1);
- { int init_values [] = { 1, 2, 3, 4, 5 };
- TEST_INTRUSIVE_SEQUENCE( init_values, testset1.begin() ); }
-}
-
-
-//test: find, equal_range (lower_bound, upper_bound):
-template<class ValueTraits, bool CacheBegin, bool CompareHash, bool Incremental>
-void test_unordered_set<ValueTraits, CacheBegin, CompareHash, Incremental>::
- test_find(std::vector<typename ValueTraits::value_type>& values)
-{
- typedef typename ValueTraits::value_type value_type;
- typedef unordered_set
- <value_type
- , value_traits<ValueTraits>
- , constant_time_size<value_type::constant_time_size>
- , cache_begin<CacheBegin>
- , compare_hash<CompareHash>
- , incremental<Incremental>
- > unordered_set_type;
- typedef typename unordered_set_type::bucket_traits bucket_traits;
-
- typename unordered_set_type::bucket_type buckets [BucketSize];
- unordered_set_type testset (values.begin(), values.end(), bucket_traits(buckets, BucketSize));
- typedef typename unordered_set_type::iterator iterator;
-
- value_type cmp_val;
- cmp_val.value_ = 2;
- iterator i = testset.find (cmp_val);
- BOOST_TEST (i->value_ == 2);
- BOOST_TEST ((++i)->value_ != 2);
- std::pair<iterator,iterator> range = testset.equal_range (cmp_val);
-
- BOOST_TEST (range.first->value_ == 2);
- BOOST_TEST (range.second->value_ == 3);
- BOOST_TEST (std::distance (range.first, range.second) == 1);
-
- cmp_val.value_ = 7;
- BOOST_TEST (testset.find (cmp_val) == testset.end());
-}
-
-template<class ValueTraits, bool CacheBegin, bool CompareHash, bool Incremental>
-void test_unordered_set<ValueTraits, CacheBegin, CompareHash, Incremental>
- ::test_clone(std::vector<typename ValueTraits::value_type>& values)
-{
- typedef typename ValueTraits::value_type value_type;
- typedef unordered_set
- <value_type
- , value_traits<ValueTraits>
- , constant_time_size<value_type::constant_time_size>
- , cache_begin<CacheBegin>
- , compare_hash<CompareHash>
- , incremental<Incremental>
- > unordered_set_type;
- typedef typename unordered_set_type::bucket_traits bucket_traits;
- {
- //Test with equal bucket arrays
- typename unordered_set_type::bucket_type buckets1 [BucketSize];
- typename unordered_set_type::bucket_type buckets2 [BucketSize];
- unordered_set_type testset1 (values.begin(), values.end(), bucket_traits(buckets1, BucketSize));
- unordered_set_type testset2 (bucket_traits(buckets2, BucketSize));
-
- testset2.clone_from(testset1, test::new_cloner<value_type>(), test::delete_disposer<value_type>());
- //Ordering is not guarantee in the cloning so insert data in a set and test
- std::set<typename ValueTraits::value_type>
- src(testset1.begin(), testset1.end());
- std::set<typename ValueTraits::value_type>
- dst(testset2.begin(), testset2.end());
- BOOST_TEST (src.size() == dst.size() && std::equal(src.begin(), src.end(), dst.begin()));
- testset2.clear_and_dispose(test::delete_disposer<value_type>());
- BOOST_TEST (testset2.empty());
- }
- {
- //Test with bigger source bucket arrays
- typename unordered_set_type::bucket_type buckets1 [BucketSize*2];
- typename unordered_set_type::bucket_type buckets2 [BucketSize];
- unordered_set_type testset1 (values.begin(), values.end(), bucket_traits(buckets1, BucketSize*2));
- unordered_set_type testset2 (bucket_traits(buckets2, BucketSize));
-
- testset2.clone_from(testset1, test::new_cloner<value_type>(), test::delete_disposer<value_type>());
- //Ordering is not guaranteed in the cloning so insert data in a set and test
- std::set<typename ValueTraits::value_type>
- src(testset1.begin(), testset1.end());
- std::set<typename ValueTraits::value_type>
- dst(testset2.begin(), testset2.end());
- BOOST_TEST (src.size() == dst.size() && std::equal(src.begin(), src.end(), dst.begin()));
- testset2.clear_and_dispose(test::delete_disposer<value_type>());
- BOOST_TEST (testset2.empty());
- }
- {
- //Test with smaller source bucket arrays
- typename unordered_set_type::bucket_type buckets1 [BucketSize];
- typename unordered_set_type::bucket_type buckets2 [BucketSize*2];
- unordered_set_type testset1 (values.begin(), values.end(), bucket_traits(buckets1, BucketSize));
- unordered_set_type testset2 (bucket_traits(buckets2, BucketSize*2));
-
- testset2.clone_from(testset1, test::new_cloner<value_type>(), test::delete_disposer<value_type>());
- //Ordering is not guarantee in the cloning so insert data in a set and test
- std::set<typename ValueTraits::value_type>
- src(testset1.begin(), testset1.end());
- std::set<typename ValueTraits::value_type>
- dst(testset2.begin(), testset2.end());
- BOOST_TEST (src.size() == dst.size() && std::equal(src.begin(), src.end(), dst.begin()));
- testset2.clear_and_dispose(test::delete_disposer<value_type>());
- BOOST_TEST (testset2.empty());
- }
-}
-
-template<class VoidPointer, bool constant_time_size, bool incremental>
-class test_main_template
-{
- public:
- int operator()()
- {
- typedef testvalue<hooks<VoidPointer> , constant_time_size> value_type;
- static const int random_init[6] = { 3, 2, 4, 1, 5, 2 };
- std::vector<testvalue<hooks<VoidPointer> , constant_time_size> > data (6);
- for (int i = 0; i < 6; ++i)
- data[i].value_ = random_init[i];
-
- test_unordered_set < typename detail::get_base_value_traits
- < value_type
- , typename hooks<VoidPointer>::base_hook_type
- >::type
- , true
- , false
- , incremental
- >::test_all(data);
- test_unordered_set < typename detail::get_member_value_traits
- < value_type
- , member_hook< value_type
- , typename hooks<VoidPointer>::member_hook_type
- , &value_type::node_
- >
- >::type
- , false
- , false
- , incremental
- >::test_all(data);
-
- return 0;
- }
-};
-
-template<class VoidPointer, bool incremental>
-class test_main_template<VoidPointer, false, incremental>
-{
- public:
- int operator()()
- {
- typedef testvalue<hooks<VoidPointer> , false> value_type;
- static const int random_init[6] = { 3, 2, 4, 1, 5, 2 };
- std::vector<testvalue<hooks<VoidPointer> , false> > data (6);
- for (int i = 0; i < 6; ++i)
- data[i].value_ = random_init[i];
-
- test_unordered_set < typename detail::get_base_value_traits
- < value_type
- , typename hooks<VoidPointer>::base_hook_type
- >::type
- , true
- , false
- , incremental
- >::test_all(data);
-
- test_unordered_set < typename detail::get_member_value_traits
- < value_type
- , member_hook< value_type
- , typename hooks<VoidPointer>::member_hook_type
- , &value_type::node_
- >
- >::type
- , false
- , false
- , incremental
- >::test_all(data);
-
- test_unordered_set < typename detail::get_base_value_traits
- < value_type
- , typename hooks<VoidPointer>::auto_base_hook_type
- >::type
- , false
- , true
- , incremental
- >::test_all(data);
-
- test_unordered_set < typename detail::get_member_value_traits
- < value_type
- , member_hook< value_type
- , typename hooks<VoidPointer>::auto_member_hook_type
- , &value_type::auto_node_
- >
- >::type
- , false
- , true
- , incremental
- >::test_all(data);
- return 0;
- }
-};
-
-int main( int, char* [] )
-{
- test_main_template<void*, false, true>()();
- test_main_template<smart_ptr<void>, false, true>()();
- test_main_template<void*, true, true>()();
- test_main_template<smart_ptr<void>, true, true>()();
- test_main_template<void*, false, false>()();
- test_main_template<smart_ptr<void>, false, false>()();
- test_main_template<void*, true, true>()();
- test_main_template<smart_ptr<void>, true, false>()();
- return boost::report_errors();
-}
-#include <boost/intrusive/detail/config_end.hpp>

Deleted: sandbox/move/libs/intrusive/test/virtual_base_test.cpp
==============================================================================
--- sandbox/move/libs/intrusive/test/virtual_base_test.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,85 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2007-2009
-//
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-#include <boost/intrusive/list.hpp>
-#include <boost/intrusive/slist.hpp>
-#include <boost/intrusive/set.hpp>
-#include <boost/intrusive/unordered_set.hpp>
-#include <vector>
-
-using namespace boost::intrusive;
-
-struct VirtualBase
-{
- virtual ~VirtualBase(){}
-};
-
-struct VirtualBase2
-{
- virtual ~VirtualBase2(){}
-};
-
-struct VirtualBase3
-{
-};
-
-class NonVirtualBase
- : public virtual VirtualBase
- , public virtual VirtualBase2
-{
- public:
- int dummy[10];
-};
-
-class MyClass
- : public NonVirtualBase
- , public virtual VirtualBase3
-{
- int int_;
- public:
- list_member_hook<> list_hook_;
- MyClass(int i = 0)
- : int_(i)
- {}
-};
-
-//Define a list that will store MyClass using the public base hook
-typedef member_hook< MyClass, list_member_hook<>, &MyClass::list_hook_ > MemberHook;
-typedef list<MyClass, MemberHook> List;
-
-int main()
-{
- typedef std::vector<MyClass>::iterator VectIt;
- typedef std::vector<MyClass>::reverse_iterator VectRit;
-
- //Create several MyClass objects, each one with a different value
- std::vector<MyClass> values;
- for(int i = 0; i < 100; ++i) values.push_back(MyClass(i));
-
- List my_list;
-
- //Now insert them in the reverse order
- //in the base hook intrusive list
- for(VectIt it(values.begin()), itend(values.end()); it != itend; ++it)
- my_list.push_front(*it);
-
- //Now test lists
- {
- List::const_iterator list_it(my_list.cbegin());
- VectRit vect_it(values.rbegin()), vect_itend(values.rend());
-
- //Test the objects inserted in the base hook list
- for(; vect_it != vect_itend; ++vect_it, ++list_it)
- if(&*list_it != &*vect_it) return 1;
- }
-
- return 0;
-}

Deleted: sandbox/move/libs/move/doc/Jamfile.v2
==============================================================================
--- sandbox/move/libs/move/doc/Jamfile.v2 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,38 +0,0 @@
-# Boost.Move library documentation Jamfile
-#
-# Copyright Ion Gaztanaga 2009.
-# Distributed under the Boost Software License, Version 1.0.
-# (See accompanying file LICENSE_1_0.txt or copy at
-# http://www.boost.org/LICENSE_1_0.txt)
-#
-# See http://www.boost.org/libs/move for documentation.
-
-
-import doxygen ;
-import quickbook ;
-
-doxygen autodoc
- :
- [ glob ../../../boost/move/*.hpp ]
- :
- <doxygen:param>HIDE_UNDOC_MEMBERS=YES
- <doxygen:param>HIDE_UNDOC_MEMBERS=YES
- <doxygen:param>HIDE_UNDOC_CLASSES=YES
- <doxygen:param>EXTRACT_PRIVATE=NO
- <doxygen:param>ENABLE_PREPROCESSING=YES
- <doxygen:param>MACRO_EXPANSION=YES
- <doxygen:param>"PREDEFINED=\"BOOST_MOVE_DOXYGEN_INVOKED\""
- ;
-
-xml move : move.qbk ;
-
-boostbook standalone
- :
- move
- :
- <xsl:param>boost.root=../../../..
- <xsl:param>boost.libraries=../../../../libs/libraries.htm
- <xsl:param>generate.section.toc.level=3
- <xsl:param>chunk.first.sections=1
- <dependency>autodoc
- ;

Deleted: sandbox/move/libs/move/doc/html/BOOST_COPYABLE_AND_MOVABLE.html
==============================================================================
--- sandbox/move/libs/move/doc/html/BOOST_COPYABLE_AND_MOVABLE.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,53 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title>Macro BOOST_COPYABLE_AND_MOVABLE</title>
-<link rel="stylesheet" href="boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
-<link rel="start" href="index.html" title="Chapter 1. Boost.Move">
-<link rel="up" href="move/reference.html#header.boost.move.move_hpp" title="Header <boost/move/move.hpp>">
-<link rel="prev" href="BOOST_MOVABLE_BUT_NOT_COPYABLE.html" title="Macro BOOST_MOVABLE_BUT_NOT_COPYABLE">
-<link rel="next" href="BOOST_RV_REF.html" title="Macro BOOST_RV_REF">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="BOOST_MOVABLE_BUT_NOT_COPYABLE.html"><img src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="move/reference.html#header.boost.move.move_hpp"><img src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="index.html"><img src="../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="BOOST_RV_REF.html"><img src="../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="refentry" lang="en">
-<a name="BOOST_COPYABLE_AND_MOVABLE"></a><div class="titlepage"></div>
-<div class="refnamediv">
-<h2>Macro BOOST_COPYABLE_AND_MOVABLE</h2>
-BOOST_COPYABLE_AND_MOVABLE — 
-</div>
-<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2>
-<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/move/move.hpp>
-
-BOOST_COPYABLE_AND_MOVABLE(TYPE)</pre></div>
-<div class="refsect1" lang="en">
-<a name="id586436"></a><h2>Description</h2>
-This macro marks a type as copyable and movable. The user will need to write a move constructor/assignment and a copy assignment as explained in the documentation to fully write a copyable and movable class. 
-</div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2008 -2010 Ion Gaztanaga
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- 
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="BOOST_MOVABLE_BUT_NOT_COPYABLE.html"><img src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="move/reference.html#header.boost.move.move_hpp"><img src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="index.html"><img src="../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="BOOST_RV_REF.html"><img src="../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: sandbox/move/libs/move/doc/html/BOOST_COPY_ASSIGN_REF.html
==============================================================================
--- sandbox/move/libs/move/doc/html/BOOST_COPY_ASSIGN_REF.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,53 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title>Macro BOOST_COPY_ASSIGN_REF</title>
-<link rel="stylesheet" href="boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
-<link rel="start" href="index.html" title="Chapter 1. Boost.Move">
-<link rel="up" href="move/reference.html#header.boost.move.move_hpp" title="Header <boost/move/move.hpp>">
-<link rel="prev" href="BOOST_RV_REF.html" title="Macro BOOST_RV_REF">
-<link rel="next" href="BOOST_FWD_REF.html" title="Macro BOOST_FWD_REF">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="BOOST_RV_REF.html"><img src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="move/reference.html#header.boost.move.move_hpp"><img src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="index.html"><img src="../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="BOOST_FWD_REF.html"><img src="../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="refentry" lang="en">
-<a name="BOOST_COPY_ASSIGN_REF"></a><div class="titlepage"></div>
-<div class="refnamediv">
-<h2>Macro BOOST_COPY_ASSIGN_REF</h2>
-BOOST_COPY_ASSIGN_REF — 
-</div>
-<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2>
-<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/move/move.hpp>
-
-BOOST_COPY_ASSIGN_REF(TYPE)</pre></div>
-<div class="refsect1" lang="en">
-<a name="id586499"></a><h2>Description</h2>
-This macro is used to achieve portable syntax in copy assignment for classes marked as BOOST_COPYABLE_AND_MOVABLE. 
-</div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2008 -2010 Ion Gaztanaga
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- 
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="BOOST_RV_REF.html"><img src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="move/reference.html#header.boost.move.move_hpp"><img src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="index.html"><img src="../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="BOOST_FWD_REF.html"><img src="../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: sandbox/move/libs/move/doc/html/BOOST_FWD_REF.html
==============================================================================
--- sandbox/move/libs/move/doc/html/BOOST_FWD_REF.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,52 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title>Macro BOOST_FWD_REF</title>
-<link rel="stylesheet" href="boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
-<link rel="start" href="index.html" title="Chapter 1. Boost.Move">
-<link rel="up" href="move/reference.html#header.boost.move.move_hpp" title="Header <boost/move/move.hpp>">
-<link rel="prev" href="BOOST_COPY_ASSIGN_REF.html" title="Macro BOOST_COPY_ASSIGN_REF">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="BOOST_COPY_ASSIGN_REF.html"><img src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="move/reference.html#header.boost.move.move_hpp"><img src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="index.html"><img src="../../../../doc/html/images/home.png" alt="Home"></a>
-</div>
-<div class="refentry" lang="en">
-<a name="BOOST_FWD_REF"></a><div class="titlepage"></div>
-<div class="refnamediv">
-<h2>Macro BOOST_FWD_REF</h2>
-BOOST_FWD_REF — 
-</div>
-<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2>
-<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/move/move.hpp>
-
-BOOST_FWD_REF(TYPE)</pre></div>
-<div class="refsect1" lang="en">
-<a name="id586530"></a><h2>Description</h2>
-This macro is used to implement portable perfect forwarding as explained in the documentation. 
-</div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2008 -2010 Ion Gaztanaga
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- 
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="BOOST_COPY_ASSIGN_REF.html"><img src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="move/reference.html#header.boost.move.move_hpp"><img src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="index.html"><img src="../../../../doc/html/images/home.png" alt="Home"></a>
-</div>
-</body>
-</html>

Deleted: sandbox/move/libs/move/doc/html/BOOST_MOVABLE_BUT_NOT_COPYABLE.html
==============================================================================
--- sandbox/move/libs/move/doc/html/BOOST_MOVABLE_BUT_NOT_COPYABLE.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,53 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title>Macro BOOST_MOVABLE_BUT_NOT_COPYABLE</title>
-<link rel="stylesheet" href="boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
-<link rel="start" href="index.html" title="Chapter 1. Boost.Move">
-<link rel="up" href="move/reference.html#header.boost.move.move_hpp" title="Header <boost/move/move.hpp>">
-<link rel="prev" href="BOOST_MOVE_OPTIMIZED_EMULATION.html" title="Macro BOOST_MOVE_OPTIMIZED_EMULATION">
-<link rel="next" href="BOOST_COPYABLE_AND_MOVABLE.html" title="Macro BOOST_COPYABLE_AND_MOVABLE">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="BOOST_MOVE_OPTIMIZED_EMULATION.html"><img src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="move/reference.html#header.boost.move.move_hpp"><img src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="index.html"><img src="../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="BOOST_COPYABLE_AND_MOVABLE.html"><img src="../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="refentry" lang="en">
-<a name="BOOST_MOVABLE_BUT_NOT_COPYABLE"></a><div class="titlepage"></div>
-<div class="refnamediv">
-<h2>Macro BOOST_MOVABLE_BUT_NOT_COPYABLE</h2>
-BOOST_MOVABLE_BUT_NOT_COPYABLE — 
-</div>
-<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2>
-<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/move/move.hpp>
-
-BOOST_MOVABLE_BUT_NOT_COPYABLE(TYPE)</pre></div>
-<div class="refsect1" lang="en">
-<a name="id586405"></a><h2>Description</h2>
-This macro marks a type as movable but not copyable, disabling copy construction and assignment. The user will need to write a move constructor/assignment as explained in the documentation to fully write a movable but not copyable class. 
-</div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2008 -2010 Ion Gaztanaga
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- 
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="BOOST_MOVE_OPTIMIZED_EMULATION.html"><img src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="move/reference.html#header.boost.move.move_hpp"><img src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="index.html"><img src="../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="BOOST_COPYABLE_AND_MOVABLE.html"><img src="../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: sandbox/move/libs/move/doc/html/BOOST_MOVE_OPTIMIZED_EMULATION.html
==============================================================================
--- sandbox/move/libs/move/doc/html/BOOST_MOVE_OPTIMIZED_EMULATION.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,64 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title>Macro BOOST_MOVE_OPTIMIZED_EMULATION</title>
-<link rel="stylesheet" href="boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
-<link rel="start" href="index.html" title="Chapter 1. Boost.Move">
-<link rel="up" href="move/reference.html#header.boost.move.move_hpp" title="Header <boost/move/move.hpp>">
-<link rel="prev" href="boost/uninitialized_copy_or_move.html" title="Function template uninitialized_copy_or_move">
-<link rel="next" href="BOOST_MOVABLE_BUT_NOT_COPYABLE.html" title="Macro BOOST_MOVABLE_BUT_NOT_COPYABLE">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="boost/uninitialized_copy_or_move.html"><img src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="move/reference.html#header.boost.move.move_hpp"><img src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="index.html"><img src="../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="BOOST_MOVABLE_BUT_NOT_COPYABLE.html"><img src="../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="refentry" lang="en">
-<a name="BOOST_MOVE_OPTIMIZED_EMULATION"></a><div class="titlepage"></div>
-<div class="refnamediv">
-<h2>Macro BOOST_MOVE_OPTIMIZED_EMULATION</h2>
-BOOST_MOVE_OPTIMIZED_EMULATION — 
-</div>
-<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2>
-<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/move/move.hpp>
-
-BOOST_MOVE_OPTIMIZED_EMULATION</pre></div>
-<div class="refsect1" lang="en">
-<a name="id586360"></a><h2>Description</h2>
-Defining or undefining this macro will change Boost.Move behaviour for copyable and movable classes when assigning from non-const rvalues: 
-<pre class="programlisting"> copyable_and_movable produce(){ return copyable_and_movable(); }
-</pre>
- If the macro is NOT defined: 
-<pre class="programlisting"> copyable_and_movable cm;
- cm = copyable_and_movable(); //object is COPIED (missed optimization)
-</pre>
- If the macro IS defined: 
-<pre class="programlisting"> copyable_and_movable cm;
- cm = copyable_and_movable(); //object is MOVED
-</pre>
- However, the second option has also some downsides. See documentation for more details. 
-</div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2008 -2010 Ion Gaztanaga
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- 
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="boost/uninitialized_copy_or_move.html"><img src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="move/reference.html#header.boost.move.move_hpp"><img src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="index.html"><img src="../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="BOOST_MOVABLE_BUT_NOT_COPYABLE.html"><img src="../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: sandbox/move/libs/move/doc/html/BOOST_RV_REF.html
==============================================================================
--- sandbox/move/libs/move/doc/html/BOOST_RV_REF.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,53 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title>Macro BOOST_RV_REF</title>
-<link rel="stylesheet" href="boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
-<link rel="start" href="index.html" title="Chapter 1. Boost.Move">
-<link rel="up" href="move/reference.html#header.boost.move.move_hpp" title="Header <boost/move/move.hpp>">
-<link rel="prev" href="BOOST_COPYABLE_AND_MOVABLE.html" title="Macro BOOST_COPYABLE_AND_MOVABLE">
-<link rel="next" href="BOOST_COPY_ASSIGN_REF.html" title="Macro BOOST_COPY_ASSIGN_REF">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="BOOST_COPYABLE_AND_MOVABLE.html"><img src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="move/reference.html#header.boost.move.move_hpp"><img src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="index.html"><img src="../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="BOOST_COPY_ASSIGN_REF.html"><img src="../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="refentry" lang="en">
-<a name="BOOST_RV_REF"></a><div class="titlepage"></div>
-<div class="refnamediv">
-<h2>Macro BOOST_RV_REF</h2>
-BOOST_RV_REF — 
-</div>
-<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2>
-<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/move/move.hpp>
-
-BOOST_RV_REF(TYPE)</pre></div>
-<div class="refsect1" lang="en">
-<a name="id586468"></a><h2>Description</h2>
-This macro is used to achieve portable syntax in move constructors and assignments for classes marked as BOOST_COPYABLE_AND_MOVABLE or BOOST_MOVABLE_BUT_NOT_COPYABLE 
-</div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2008 -2010 Ion Gaztanaga
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- 
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="BOOST_COPYABLE_AND_MOVABLE.html"><img src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="move/reference.html#header.boost.move.move_hpp"><img src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="index.html"><img src="../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="BOOST_COPY_ASSIGN_REF.html"><img src="../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: sandbox/move/libs/move/doc/html/boost/back_move_insert_iterator.html
==============================================================================
--- sandbox/move/libs/move/doc/html/boost/back_move_insert_iterator.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,86 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title>Class template back_move_insert_iterator</title>
-<link rel="stylesheet" href="../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
-<link rel="start" href="../index.html" title="Chapter 1. Boost.Move">
-<link rel="up" href="../move/reference.html#header.boost.move.move_hpp" title="Header <boost/move/move.hpp>">
-<link rel="prev" href="move_iterator.html" title="Class template move_iterator">
-<link rel="next" href="front_move_insert_iterator.html" title="Class template front_move_insert_iterator">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="move_iterator.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../move/reference.html#header.boost.move.move_hpp"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="front_move_insert_iterator.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="refentry" lang="en">
-<a name="boost.back_move_insert_iterator"></a><div class="titlepage"></div>
-<div class="refnamediv">
-<h2>Class template back_move_insert_iterator</h2>
-boost::back_move_insert_iterator — 
-</div>
-<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2>
-<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/move/move.hpp>
-
-template<typename C>
-class back_move_insert_iterator {
-public:
- // types
- typedef C <a name="boost.back_move_insert_iterator.container_type"></a>container_type;
-
- // construct/copy/destruct
- back_move_insert_iterator(C &);
- back_move_insert_iterator& operator=(typename C::reference);
-
- // public member functions
- back_move_insert_iterator & operator*() ;
- back_move_insert_iterator & operator++() ;
- back_move_insert_iterator & operator++(int) ;
-};</pre></div>
-<div class="refsect1" lang="en">
-<a name="id585042"></a><h2>Description</h2>
-A move insert iterator that move constructs elements at the back of a container 
-<div class="refsect2" lang="en">
-<a name="id585048"></a><h3>
-<a name="boost.back_move_insert_iteratorconstruct-copy-destruct"></a><code class="computeroutput">back_move_insert_iterator</code>
- public
- construct/copy/destruct</h3>
-<div class="orderedlist"><ol type="1">
-<li><pre class="literallayout"><a name="id338905-bb"></a>back_move_insert_iterator(C & x);</pre></li>
-<li><pre class="literallayout">back_move_insert_iterator& <a name="id338911-bb"></a>operator=(typename C::reference x);</pre></li>
-</ol></div>
-</div>
-<div class="refsect2" lang="en">
-<a name="id585091"></a><h3>
-<a name="id338873-bb"></a><code class="computeroutput">back_move_insert_iterator</code> public member functions</h3>
-<div class="orderedlist"><ol type="1">
-<li><pre class="literallayout">back_move_insert_iterator & <a name="id338875-bb"></a>operator*() ;</pre></li>
-<li><pre class="literallayout">back_move_insert_iterator & <a name="id338884-bb"></a>operator++() ;</pre></li>
-<li><pre class="literallayout">back_move_insert_iterator & <a name="id338892-bb"></a>operator++(int) ;</pre></li>
-</ol></div>
-</div>
-</div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2008 -2010 Ion Gaztanaga
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- 
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="move_iterator.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../move/reference.html#header.boost.move.move_hpp"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="front_move_insert_iterator.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: sandbox/move/libs/move/doc/html/boost/back_move_inserter.html
==============================================================================
--- sandbox/move/libs/move/doc/html/boost/back_move_inserter.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,54 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title>Function template back_move_inserter</title>
-<link rel="stylesheet" href="../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
-<link rel="start" href="../index.html" title="Chapter 1. Boost.Move">
-<link rel="up" href="../move/reference.html#header.boost.move.move_hpp" title="Header <boost/move/move.hpp>">
-<link rel="prev" href="make_move_iterator.html" title="Function template make_move_iterator">
-<link rel="next" href="front_move_inserter.html" title="Function template front_move_inserter">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="make_move_iterator.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../move/reference.html#header.boost.move.move_hpp"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="front_move_inserter.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="refentry" lang="en">
-<a name="boost.back_move_inserter"></a><div class="titlepage"></div>
-<div class="refnamediv">
-<h2>Function template back_move_inserter</h2>
-boost::back_move_inserter — 
-</div>
-<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2>
-<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/move/move.hpp>
-
-
-template<typename C> back_move_insert_iterator< C > back_move_inserter(C & x);</pre></div>
-<div class="refsect1" lang="en">
-<a name="id585946"></a><h2>Description</h2>
-Returns: back_move_insert_iterator<C>(x). 
-</div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2008 -2010 Ion Gaztanaga
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- 
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="make_move_iterator.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../move/reference.html#header.boost.move.move_hpp"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="front_move_inserter.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: sandbox/move/libs/move/doc/html/boost/forward.html
==============================================================================
--- sandbox/move/libs/move/doc/html/boost/forward.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,57 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title>Function template forward</title>
-<link rel="stylesheet" href="../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
-<link rel="start" href="../index.html" title="Chapter 1. Boost.Move">
-<link rel="up" href="../move/reference.html#header.boost.move.move_hpp" title="Header <boost/move/move.hpp>">
-<link rel="prev" href="move_id339048.html" title="Function template move">
-<link rel="next" href="make_move_iterator.html" title="Function template make_move_iterator">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="move_id339048.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../move/reference.html#header.boost.move.move_hpp"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="make_move_iterator.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="refentry" lang="en">
-<a name="boost.forward"></a><div class="titlepage"></div>
-<div class="refnamediv">
-<h2>Function template forward</h2>
-boost::forward — 
-</div>
-<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2>
-<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/move/move.hpp>
-
-
-template<typename T> output_reference forward(input_reference);</pre></div>
-<div class="refsect1" lang="en">
-<a name="id585834"></a><h2>Description</h2>
-This function provides limited form of forwarding that is usually enough for in-place construction and avoids the exponential overloading necessary for perfect forwarding in C++03.
-For compilers with rvalue references this function provides perfect forwarding.
-Otherwise: If input_reference binds to const boost::rv<T> & then it output_reference is boost::rev<T> &
-Else, input_reference is equal to output_reference is equal to input_reference. 
-</div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2008 -2010 Ion Gaztanaga
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- 
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="move_id339048.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../move/reference.html#header.boost.move.move_hpp"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="make_move_iterator.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: sandbox/move/libs/move/doc/html/boost/front_move_insert_iterator.html
==============================================================================
--- sandbox/move/libs/move/doc/html/boost/front_move_insert_iterator.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,86 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title>Class template front_move_insert_iterator</title>
-<link rel="stylesheet" href="../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
-<link rel="start" href="../index.html" title="Chapter 1. Boost.Move">
-<link rel="up" href="../move/reference.html#header.boost.move.move_hpp" title="Header <boost/move/move.hpp>">
-<link rel="prev" href="back_move_insert_iterator.html" title="Class template back_move_insert_iterator">
-<link rel="next" href="move_insert_iterator.html" title="Class template move_insert_iterator">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="back_move_insert_iterator.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../move/reference.html#header.boost.move.move_hpp"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="move_insert_iterator.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="refentry" lang="en">
-<a name="boost.front_move_insert_iterator"></a><div class="titlepage"></div>
-<div class="refnamediv">
-<h2>Class template front_move_insert_iterator</h2>
-boost::front_move_insert_iterator — 
-</div>
-<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2>
-<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/move/move.hpp>
-
-template<typename C>
-class front_move_insert_iterator {
-public:
- // types
- typedef C <a name="boost.front_move_insert_iterator.container_type"></a>container_type;
-
- // construct/copy/destruct
- front_move_insert_iterator(C &);
- front_move_insert_iterator& operator=(typename C::reference);
-
- // public member functions
- front_move_insert_iterator & operator*() ;
- front_move_insert_iterator & operator++() ;
- front_move_insert_iterator & operator++(int) ;
-};</pre></div>
-<div class="refsect1" lang="en">
-<a name="id585314"></a><h2>Description</h2>
-A move insert iterator that move constructs elements int the front of a container 
-<div class="refsect2" lang="en">
-<a name="id585320"></a><h3>
-<a name="boost.front_move_insert_iteratorconstruct-copy-destruct"></a><code class="computeroutput">front_move_insert_iterator</code>
- public
- construct/copy/destruct</h3>
-<div class="orderedlist"><ol type="1">
-<li><pre class="literallayout"><a name="id338966-bb"></a>front_move_insert_iterator(C & x);</pre></li>
-<li><pre class="literallayout">front_move_insert_iterator& <a name="id338972-bb"></a>operator=(typename C::reference x);</pre></li>
-</ol></div>
-</div>
-<div class="refsect2" lang="en">
-<a name="id585364"></a><h3>
-<a name="id338934-bb"></a><code class="computeroutput">front_move_insert_iterator</code> public member functions</h3>
-<div class="orderedlist"><ol type="1">
-<li><pre class="literallayout">front_move_insert_iterator & <a name="id338936-bb"></a>operator*() ;</pre></li>
-<li><pre class="literallayout">front_move_insert_iterator & <a name="id338945-bb"></a>operator++() ;</pre></li>
-<li><pre class="literallayout">front_move_insert_iterator & <a name="id338953-bb"></a>operator++(int) ;</pre></li>
-</ol></div>
-</div>
-</div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2008 -2010 Ion Gaztanaga
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- 
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="back_move_insert_iterator.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../move/reference.html#header.boost.move.move_hpp"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="move_insert_iterator.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: sandbox/move/libs/move/doc/html/boost/front_move_inserter.html
==============================================================================
--- sandbox/move/libs/move/doc/html/boost/front_move_inserter.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,55 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title>Function template front_move_inserter</title>
-<link rel="stylesheet" href="../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
-<link rel="start" href="../index.html" title="Chapter 1. Boost.Move">
-<link rel="up" href="../move/reference.html#header.boost.move.move_hpp" title="Header <boost/move/move.hpp>">
-<link rel="prev" href="back_move_inserter.html" title="Function template back_move_inserter">
-<link rel="next" href="move_inserter.html" title="Function template move_inserter">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="back_move_inserter.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../move/reference.html#header.boost.move.move_hpp"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="move_inserter.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="refentry" lang="en">
-<a name="boost.front_move_inserter"></a><div class="titlepage"></div>
-<div class="refnamediv">
-<h2>Function template front_move_inserter</h2>
-boost::front_move_inserter — 
-</div>
-<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2>
-<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/move/move.hpp>
-
-
-template<typename C>
- front_move_insert_iterator< C > front_move_inserter(C & x);</pre></div>
-<div class="refsect1" lang="en">
-<a name="id585998"></a><h2>Description</h2>
-Returns: front_move_insert_iterator<C>(x). 
-</div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2008 -2010 Ion Gaztanaga
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- 
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="back_move_inserter.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../move/reference.html#header.boost.move.move_hpp"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="move_inserter.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: sandbox/move/libs/move/doc/html/boost/has_nothrow_move.html
==============================================================================
--- sandbox/move/libs/move/doc/html/boost/has_nothrow_move.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,55 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title>Struct template has_nothrow_move</title>
-<link rel="stylesheet" href="../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
-<link rel="start" href="../index.html" title="Chapter 1. Boost.Move">
-<link rel="up" href="../move/reference.html#header.boost.move.move_hpp" title="Header <boost/move/move.hpp>">
-<link rel="prev" href="is_movable.html" title="Struct template is_movable">
-<link rel="next" href="move_iterator.html" title="Class template move_iterator">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="is_movable.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../move/reference.html#header.boost.move.move_hpp"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="move_iterator.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="refentry" lang="en">
-<a name="boost.has_nothrow_move"></a><div class="titlepage"></div>
-<div class="refnamediv">
-<h2>Struct template has_nothrow_move</h2>
-boost::has_nothrow_move — 
-</div>
-<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2>
-<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/move/move.hpp>
-
-template<typename T>
-struct has_nothrow_move {
-};</pre></div>
-<div class="refsect1" lang="en">
-<a name="id583910"></a><h2>Description</h2>
-By default this traits returns false. Classes with non-thworing move construction and assignment should specialize this trait to obtain some performance improvements. 
-</div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2008 -2010 Ion Gaztanaga
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- 
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="is_movable.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../move/reference.html#header.boost.move.move_hpp"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="move_iterator.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: sandbox/move/libs/move/doc/html/boost/has_trivial_destructor__id336849.html
==============================================================================
--- sandbox/move/libs/move/doc/html/boost/has_trivial_destructor__id336849.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,56 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title>Struct template has_trivial_destructor_after_move</title>
-<link rel="stylesheet" href="../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
-<link rel="start" href="../index.html" title="Chapter 1. Boost.Move">
-<link rel="up" href="../move/reference.html#header.boost.move.move_hpp" title="Header <boost/move/move.hpp>">
-<link rel="prev" href="move_insert_iterator.html" title="Class template move_insert_iterator">
-<link rel="next" href="move_id336863.html" title="Function template move">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="move_insert_iterator.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../move/reference.html#header.boost.move.move_hpp"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="move_id336863.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="refentry" lang="en">
-<a name="boost.has_trivial_destructor__id336849"></a><div class="titlepage"></div>
-<div class="refnamediv">
-<h2>Struct template has_trivial_destructor_after_move</h2>
-boost::has_trivial_destructor_after_move — 
-</div>
-<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2>
-<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/move/move.hpp>
-
-template<typename T>
-struct has_trivial_destructor_after_move {
-};</pre></div>
-<div class="refsect1" lang="en">
-<a name="id563898"></a><h2>Description</h2>
-If this trait yields to true (has_trivial_destructor_after_move <T>value == true) means that if T is used as argument of a move construction/assignment, there is no need to call T's destructor. This optimization tipically is used to improve containers' performance.
-By default this trait is true if the type has trivial destructor, every class should specialize this trait if it wants to improve performance when inserted in containers. 
-</div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2008 -2010 Ion Gaztanaga
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- 
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="move_insert_iterator.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../move/reference.html#header.boost.move.move_hpp"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="move_id336863.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: sandbox/move/libs/move/doc/html/boost/has_trivial_destructor__id339034.html
==============================================================================
--- sandbox/move/libs/move/doc/html/boost/has_trivial_destructor__id339034.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,56 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title>Struct template has_trivial_destructor_after_move</title>
-<link rel="stylesheet" href="../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
-<link rel="start" href="../index.html" title="Chapter 1. Boost.Move">
-<link rel="up" href="../move/reference.html#header.boost.move.move_hpp" title="Header <boost/move/move.hpp>">
-<link rel="prev" href="move_insert_iterator.html" title="Class template move_insert_iterator">
-<link rel="next" href="move_id339048.html" title="Function template move">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="move_insert_iterator.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../move/reference.html#header.boost.move.move_hpp"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="move_id339048.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="refentry" lang="en">
-<a name="boost.has_trivial_destructor__id339034"></a><div class="titlepage"></div>
-<div class="refnamediv">
-<h2>Struct template has_trivial_destructor_after_move</h2>
-boost::has_trivial_destructor_after_move — 
-</div>
-<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2>
-<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/move/move.hpp>
-
-template<typename T>
-struct has_trivial_destructor_after_move {
-};</pre></div>
-<div class="refsect1" lang="en">
-<a name="id585743"></a><h2>Description</h2>
-If this trait yields to true (has_trivial_destructor_after_move <T>value == true) means that if T is used as argument of a move construction/assignment, there is no need to call T's destructor. This optimization tipically is used to improve containers' performance.
-By default this trait is true if the type has trivial destructor, every class should specialize this trait if it wants to improve performance when inserted in containers. 
-</div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2008 -2010 Ion Gaztanaga
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- 
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="move_insert_iterator.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../move/reference.html#header.boost.move.move_hpp"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="move_id339048.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: sandbox/move/libs/move/doc/html/boost/is_movable.html
==============================================================================
--- sandbox/move/libs/move/doc/html/boost/is_movable.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,56 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title>Struct template is_movable</title>
-<link rel="stylesheet" href="../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
-<link rel="start" href="../index.html" title="Chapter 1. Boost.Move">
-<link rel="up" href="../move/reference.html#header.boost.move.move_hpp" title="Header <boost/move/move.hpp>">
-<link rel="prev" href="../move/reference.html" title="Reference">
-<link rel="next" href="has_nothrow_move.html" title="Struct template has_nothrow_move">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../move/reference.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../move/reference.html#header.boost.move.move_hpp"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="has_nothrow_move.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="refentry" lang="en">
-<a name="boost.is_movable"></a><div class="titlepage"></div>
-<div class="refnamediv">
-<h2>Struct template is_movable</h2>
-boost::is_movable — 
-</div>
-<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2>
-<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/move/move.hpp>
-
-template<typename T>
-struct is_movable {
-};</pre></div>
-<div class="refsect1" lang="en">
-<a name="id583858"></a><h2>Description</h2>
-For compilers with rvalue references, this traits class returns true if BOOST_ENABLE_MOVE_EMULATION is activated.
-For other compilers returns true if T is convertible to boost::rv<T>& 
-</div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2008 -2010 Ion Gaztanaga
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- 
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../move/reference.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../move/reference.html#header.boost.move.move_hpp"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="has_nothrow_move.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: sandbox/move/libs/move/doc/html/boost/make_move_iterator.html
==============================================================================
--- sandbox/move/libs/move/doc/html/boost/make_move_iterator.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,54 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title>Function template make_move_iterator</title>
-<link rel="stylesheet" href="../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
-<link rel="start" href="../index.html" title="Chapter 1. Boost.Move">
-<link rel="up" href="../move/reference.html#header.boost.move.move_hpp" title="Header <boost/move/move.hpp>">
-<link rel="prev" href="forward.html" title="Function template forward">
-<link rel="next" href="back_move_inserter.html" title="Function template back_move_inserter">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="forward.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../move/reference.html#header.boost.move.move_hpp"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="back_move_inserter.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="refentry" lang="en">
-<a name="boost.make_move_iterator"></a><div class="titlepage"></div>
-<div class="refnamediv">
-<h2>Function template make_move_iterator</h2>
-boost::make_move_iterator — 
-</div>
-<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2>
-<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/move/move.hpp>
-
-
-template<typename It> move_iterator< It > make_move_iterator(const It & it);</pre></div>
-<div class="refsect1" lang="en">
-<a name="id585894"></a><h2>Description</h2>
-Returns: move_iterator<It>(i). 
-</div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2008 -2010 Ion Gaztanaga
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- 
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="forward.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../move/reference.html#header.boost.move.move_hpp"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="back_move_inserter.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: sandbox/move/libs/move/doc/html/boost/move_backward.html
==============================================================================
--- sandbox/move/libs/move/doc/html/boost/move_backward.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,57 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title>Function template move_backward</title>
-<link rel="stylesheet" href="../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
-<link rel="start" href="../index.html" title="Chapter 1. Boost.Move">
-<link rel="up" href="../move/reference.html#header.boost.move.move_hpp" title="Header <boost/move/move.hpp>">
-<link rel="prev" href="move_id339197.html" title="Function template move">
-<link rel="next" href="uninitialized_move.html" title="Function template uninitialized_move">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="move_id339197.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../move/reference.html#header.boost.move.move_hpp"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="uninitialized_move.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="refentry" lang="en">
-<a name="boost.move_backward"></a><div class="titlepage"></div>
-<div class="refnamediv">
-<h2>Function template move_backward</h2>
-boost::move_backward — 
-</div>
-<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2>
-<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/move/move.hpp>
-
-
-template<typename I, typename O> O move_backward(I f, I l, O result);</pre></div>
-<div class="refsect1" lang="en">
-<a name="id586176"></a><h2>Description</h2>
-Effects: Moves elements in the range [first,last) into the range [result - (last-first),result) starting from last - 1 and proceeding to first. For each positive integer n <= (last - first), performs *(result - n) = boost::move(*(last - n)).
-Requires: result shall not be in the range [first,last).
-Returns: result - (last - first).
-Complexity: Exactly last - first assignments. 
-</div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2008 -2010 Ion Gaztanaga
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- 
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="move_id339197.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../move/reference.html#header.boost.move.move_hpp"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="uninitialized_move.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: sandbox/move/libs/move/doc/html/boost/move_id336863.html
==============================================================================
--- sandbox/move/libs/move/doc/html/boost/move_id336863.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,54 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title>Function template move</title>
-<link rel="stylesheet" href="../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
-<link rel="start" href="../index.html" title="Chapter 1. Boost.Move">
-<link rel="up" href="../move/reference.html#header.boost.move.move_hpp" title="Header <boost/move/move.hpp>">
-<link rel="prev" href="has_trivial_destructor__id336849.html" title="Struct template has_trivial_destructor_after_move">
-<link rel="next" href="forward.html" title="Function template forward">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="has_trivial_destructor__id336849.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../move/reference.html#header.boost.move.move_hpp"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="forward.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="refentry" lang="en">
-<a name="boost.move_id336863"></a><div class="titlepage"></div>
-<div class="refnamediv">
-<h2>Function template move</h2>
-boost::move — 
-</div>
-<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2>
-<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/move/move.hpp>
-
-
-template<typename T> rvalue_reference move(input_reference);</pre></div>
-<div class="refsect1" lang="en">
-<a name="id563944"></a><h2>Description</h2>
-This function provides a way to convert a reference into a rvalue reference in compilers with rvalue references. For other compilers converts T & into boost::rv<T> & so that move emulation is activated. 
-</div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2008 -2010 Ion Gaztanaga
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- 
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="has_trivial_destructor__id336849.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../move/reference.html#header.boost.move.move_hpp"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="forward.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: sandbox/move/libs/move/doc/html/boost/move_id337012.html
==============================================================================
--- sandbox/move/libs/move/doc/html/boost/move_id337012.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,57 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title>Function template move</title>
-<link rel="stylesheet" href="../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
-<link rel="start" href="../index.html" title="Chapter 1. Boost.Move">
-<link rel="up" href="../move/reference.html#header.boost.move.move_hpp" title="Header <boost/move/move.hpp>">
-<link rel="prev" href="move_inserter.html" title="Function template move_inserter">
-<link rel="next" href="move_backward.html" title="Function template move_backward">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="move_inserter.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../move/reference.html#header.boost.move.move_hpp"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="move_backward.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="refentry" lang="en">
-<a name="boost.move_id337012"></a><div class="titlepage"></div>
-<div class="refnamediv">
-<h2>Function template move</h2>
-boost::move — 
-</div>
-<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2>
-<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/move/move.hpp>
-
-
-template<typename I, typename O> O move(I f, I l, O result);</pre></div>
-<div class="refsect1" lang="en">
-<a name="id564260"></a><h2>Description</h2>
-Effects: Moves elements in the range [first,last) into the range [result,result + (last - first)) starting from first and proceeding to last. For each non-negative integer n < (last-first), performs *(result + n) = boost::move (*(first + n)).
-Effects: result + (last - first).
-Requires: result shall not be in the range [first,last).
-Complexity: Exactly last - first move assignments. 
-</div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2008 -2010 Ion Gaztanaga
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- 
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="move_inserter.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../move/reference.html#header.boost.move.move_hpp"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="move_backward.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: sandbox/move/libs/move/doc/html/boost/move_id339048.html
==============================================================================
--- sandbox/move/libs/move/doc/html/boost/move_id339048.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,54 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title>Function template move</title>
-<link rel="stylesheet" href="../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
-<link rel="start" href="../index.html" title="Chapter 1. Boost.Move">
-<link rel="up" href="../move/reference.html#header.boost.move.move_hpp" title="Header <boost/move/move.hpp>">
-<link rel="prev" href="has_trivial_destructor__id339034.html" title="Struct template has_trivial_destructor_after_move">
-<link rel="next" href="forward.html" title="Function template forward">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="has_trivial_destructor__id339034.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../move/reference.html#header.boost.move.move_hpp"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="forward.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="refentry" lang="en">
-<a name="boost.move_id339048"></a><div class="titlepage"></div>
-<div class="refnamediv">
-<h2>Function template move</h2>
-boost::move — 
-</div>
-<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2>
-<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/move/move.hpp>
-
-
-template<typename T> rvalue_reference move(input_reference);</pre></div>
-<div class="refsect1" lang="en">
-<a name="id585790"></a><h2>Description</h2>
-This function provides a way to convert a reference into a rvalue reference in compilers with rvalue references. For other compilers converts T & into boost::rv<T> & so that move emulation is activated. 
-</div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2008 -2010 Ion Gaztanaga
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- 
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="has_trivial_destructor__id339034.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../move/reference.html#header.boost.move.move_hpp"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="forward.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: sandbox/move/libs/move/doc/html/boost/move_id339197.html
==============================================================================
--- sandbox/move/libs/move/doc/html/boost/move_id339197.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,57 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title>Function template move</title>
-<link rel="stylesheet" href="../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
-<link rel="start" href="../index.html" title="Chapter 1. Boost.Move">
-<link rel="up" href="../move/reference.html#header.boost.move.move_hpp" title="Header <boost/move/move.hpp>">
-<link rel="prev" href="move_inserter.html" title="Function template move_inserter">
-<link rel="next" href="move_backward.html" title="Function template move_backward">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="move_inserter.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../move/reference.html#header.boost.move.move_hpp"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="move_backward.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="refentry" lang="en">
-<a name="boost.move_id339197"></a><div class="titlepage"></div>
-<div class="refnamediv">
-<h2>Function template move</h2>
-boost::move — 
-</div>
-<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2>
-<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/move/move.hpp>
-
-
-template<typename I, typename O> O move(I f, I l, O result);</pre></div>
-<div class="refsect1" lang="en">
-<a name="id586105"></a><h2>Description</h2>
-Effects: Moves elements in the range [first,last) into the range [result,result + (last - first)) starting from first and proceeding to last. For each non-negative integer n < (last-first), performs *(result + n) = boost::move (*(first + n)).
-Effects: result + (last - first).
-Requires: result shall not be in the range [first,last).
-Complexity: Exactly last - first move assignments. 
-</div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2008 -2010 Ion Gaztanaga
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- 
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="move_inserter.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../move/reference.html#header.boost.move.move_hpp"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="move_backward.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: sandbox/move/libs/move/doc/html/boost/move_insert_iterator.html
==============================================================================
--- sandbox/move/libs/move/doc/html/boost/move_insert_iterator.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,85 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title>Class template move_insert_iterator</title>
-<link rel="stylesheet" href="../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
-<link rel="start" href="../index.html" title="Chapter 1. Boost.Move">
-<link rel="up" href="../move/reference.html#header.boost.move.move_hpp" title="Header <boost/move/move.hpp>">
-<link rel="prev" href="front_move_insert_iterator.html" title="Class template front_move_insert_iterator">
-<link rel="next" href="has_trivial_destructor__id339034.html" title="Struct template has_trivial_destructor_after_move">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="front_move_insert_iterator.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../move/reference.html#header.boost.move.move_hpp"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="has_trivial_destructor__id339034.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="refentry" lang="en">
-<a name="boost.move_insert_iterator"></a><div class="titlepage"></div>
-<div class="refnamediv">
-<h2>Class template move_insert_iterator</h2>
-boost::move_insert_iterator — 
-</div>
-<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2>
-<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/move/move.hpp>
-
-template<typename C>
-class move_insert_iterator {
-public:
- // types
- typedef C <a name="boost.move_insert_iterator.container_type"></a>container_type;
-
- // construct/copy/destruct
- move_insert_iterator(C &, typename C::iterator);
- move_insert_iterator& operator=(typename C::reference);
-
- // public member functions
- move_insert_iterator & operator*() ;
- move_insert_iterator & operator++() ;
- move_insert_iterator & operator++(int) ;
-};</pre></div>
-<div class="refsect1" lang="en">
-<a name="id585581"></a><h2>Description</h2>
-<div class="refsect2" lang="en">
-<a name="id585584"></a><h3>
-<a name="boost.move_insert_iteratorconstruct-copy-destruct"></a><code class="computeroutput">move_insert_iterator</code>
- public
- construct/copy/destruct</h3>
-<div class="orderedlist"><ol type="1">
-<li><pre class="literallayout"><a name="id339017-bb"></a>move_insert_iterator(C & x, typename C::iterator pos);</pre></li>
-<li><pre class="literallayout">move_insert_iterator& <a name="id339028-bb"></a>operator=(typename C::reference x);</pre></li>
-</ol></div>
-</div>
-<div class="refsect2" lang="en">
-<a name="id585631"></a><h3>
-<a name="id338992-bb"></a><code class="computeroutput">move_insert_iterator</code> public member functions</h3>
-<div class="orderedlist"><ol type="1">
-<li><pre class="literallayout">move_insert_iterator & <a name="id338994-bb"></a>operator*() ;</pre></li>
-<li><pre class="literallayout">move_insert_iterator & <a name="id339000-bb"></a>operator++() ;</pre></li>
-<li><pre class="literallayout">move_insert_iterator & <a name="id339006-bb"></a>operator++(int) ;</pre></li>
-</ol></div>
-</div>
-</div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2008 -2010 Ion Gaztanaga
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- 
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="front_move_insert_iterator.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../move/reference.html#header.boost.move.move_hpp"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="has_trivial_destructor__id339034.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: sandbox/move/libs/move/doc/html/boost/move_inserter.html
==============================================================================
--- sandbox/move/libs/move/doc/html/boost/move_inserter.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,55 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title>Function template move_inserter</title>
-<link rel="stylesheet" href="../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
-<link rel="start" href="../index.html" title="Chapter 1. Boost.Move">
-<link rel="up" href="../move/reference.html#header.boost.move.move_hpp" title="Header <boost/move/move.hpp>">
-<link rel="prev" href="front_move_inserter.html" title="Function template front_move_inserter">
-<link rel="next" href="move_id339197.html" title="Function template move">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="front_move_inserter.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../move/reference.html#header.boost.move.move_hpp"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="move_id339197.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="refentry" lang="en">
-<a name="boost.move_inserter"></a><div class="titlepage"></div>
-<div class="refnamediv">
-<h2>Function template move_inserter</h2>
-boost::move_inserter — 
-</div>
-<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2>
-<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/move/move.hpp>
-
-
-template<typename C>
- move_insert_iterator< C > move_inserter(C & x, typename C::iterator it);</pre></div>
-<div class="refsect1" lang="en">
-<a name="id586052"></a><h2>Description</h2>
-Returns: move_insert_iterator<C>(x, it). 
-</div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2008 -2010 Ion Gaztanaga
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- 
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="front_move_inserter.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../move/reference.html#header.boost.move.move_hpp"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="move_id339197.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: sandbox/move/libs/move/doc/html/boost/move_iterator.html
==============================================================================
--- sandbox/move/libs/move/doc/html/boost/move_iterator.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,111 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title>Class template move_iterator</title>
-<link rel="stylesheet" href="../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
-<link rel="start" href="../index.html" title="Chapter 1. Boost.Move">
-<link rel="up" href="../move/reference.html#header.boost.move.move_hpp" title="Header <boost/move/move.hpp>">
-<link rel="prev" href="has_nothrow_move.html" title="Struct template has_nothrow_move">
-<link rel="next" href="back_move_insert_iterator.html" title="Class template back_move_insert_iterator">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="has_nothrow_move.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../move/reference.html#header.boost.move.move_hpp"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="back_move_insert_iterator.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="refentry" lang="en">
-<a name="boost.move_iterator"></a><div class="titlepage"></div>
-<div class="refnamediv">
-<h2>Class template move_iterator</h2>
-boost::move_iterator — 
-</div>
-<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2>
-<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/move/move.hpp>
-
-template<typename It>
-class move_iterator {
-public:
- // types
- typedef It <a name="boost.move_iterator.iterator_type"></a>iterator_type;
- typedef std::iterator_traits< iterator_type >::value_type <a name="boost.move_iterator.value_type"></a>value_type;
- typedef value_type && <a name="boost.move_iterator.reference"></a>reference;
- typedef It <a name="boost.move_iterator.pointer"></a>pointer;
- typedef std::iterator_traits< iterator_type >::difference_type <a name="boost.move_iterator.difference_type"></a>difference_type;
- typedef std::iterator_traits< iterator_type >::iterator_category <a name="boost.move_iterator.iterator_category"></a>iterator_category;
-
- // construct/copy/destruct
- move_iterator();
- move_iterator(It);
- template<typename U> move_iterator(const move_iterator &);
-
- // public member functions
- iterator_type base() const;
- reference operator*() const;
- pointer operator->() const;
- move_iterator & operator++() ;
- move_iterator< iterator_type > operator++(int) ;
- move_iterator & operator--() ;
- move_iterator< iterator_type > operator--(int) ;
- move_iterator< iterator_type > operator+(difference_type) const;
- move_iterator & operator+=(difference_type) ;
- move_iterator< iterator_type > operator-(difference_type) const;
- move_iterator & operator-=(difference_type) ;
- reference operator[](difference_type) const;
-};</pre></div>
-<div class="refsect1" lang="en">
-<a name="id584552"></a><h2>Description</h2>
-Class template move_iterator is an iterator adaptor with the same behavior as the underlying iterator except that its dereference operator implicitly converts the value returned by the underlying iterator's dereference operator to an rvalue reference. Some generic algorithms can be called with move iterators to replace copying with moving. 
-<div class="refsect2" lang="en">
-<a name="id584558"></a><h3>
-<a name="boost.move_iteratorconstruct-copy-destruct"></a><code class="computeroutput">move_iterator</code>
- public
- construct/copy/destruct</h3>
-<div class="orderedlist"><ol type="1">
-<li><pre class="literallayout"><a name="id338833-bb"></a>move_iterator();</pre></li>
-<li><pre class="literallayout"><a name="id338834-bb"></a>move_iterator(It i);</pre></li>
-<li><pre class="literallayout">template<typename U> <a name="id338840-bb"></a>move_iterator(const move_iterator & u);</pre></li>
-</ol></div>
-</div>
-<div class="refsect2" lang="en">
-<a name="id584620"></a><h3>
-<a name="id338705-bb"></a><code class="computeroutput">move_iterator</code> public member functions</h3>
-<div class="orderedlist"><ol type="1">
-<li><pre class="literallayout">iterator_type <a name="id338708-bb"></a>base() const;</pre></li>
-<li><pre class="literallayout">reference <a name="id338714-bb"></a>operator*() const;</pre></li>
-<li><pre class="literallayout">pointer <a name="id338720-bb"></a>operator->() const;</pre></li>
-<li><pre class="literallayout">move_iterator & <a name="id338726-bb"></a>operator++() ;</pre></li>
-<li><pre class="literallayout">move_iterator< iterator_type > <a name="id338734-bb"></a>operator++(int) ;</pre></li>
-<li><pre class="literallayout">move_iterator & <a name="id338748-bb"></a>operator--() ;</pre></li>
-<li><pre class="literallayout">move_iterator< iterator_type > <a name="id338756-bb"></a>operator--(int) ;</pre></li>
-<li><pre class="literallayout">move_iterator< iterator_type > <a name="id338770-bb"></a>operator+(difference_type n) const;</pre></li>
-<li><pre class="literallayout">move_iterator & <a name="id338783-bb"></a>operator+=(difference_type n) ;</pre></li>
-<li><pre class="literallayout">move_iterator< iterator_type > <a name="id338796-bb"></a>operator-(difference_type n) const;</pre></li>
-<li><pre class="literallayout">move_iterator & <a name="id338809-bb"></a>operator-=(difference_type n) ;</pre></li>
-<li><pre class="literallayout">reference <a name="id338822-bb"></a>operator[](difference_type n) const;</pre></li>
-</ol></div>
-</div>
-</div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2008 -2010 Ion Gaztanaga
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- 
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="has_nothrow_move.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../move/reference.html#header.boost.move.move_hpp"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="back_move_insert_iterator.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: sandbox/move/libs/move/doc/html/boost/uninitialized_copy_or_move.html
==============================================================================
--- sandbox/move/libs/move/doc/html/boost/uninitialized_copy_or_move.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,60 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title>Function template uninitialized_copy_or_move</title>
-<link rel="stylesheet" href="../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
-<link rel="start" href="../index.html" title="Chapter 1. Boost.Move">
-<link rel="up" href="../move/reference.html#header.boost.move.move_hpp" title="Header <boost/move/move.hpp>">
-<link rel="prev" href="uninitialized_move.html" title="Function template uninitialized_move">
-<link rel="next" href="../BOOST_MOVE_OPTIMIZED_EMULATION.html" title="Macro BOOST_MOVE_OPTIMIZED_EMULATION">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="uninitialized_move.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../move/reference.html#header.boost.move.move_hpp"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../BOOST_MOVE_OPTIMIZED_EMULATION.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="refentry" lang="en">
-<a name="boost.uninitialized_copy_or_move"></a><div class="titlepage"></div>
-<div class="refnamediv">
-<h2>Function template uninitialized_copy_or_move</h2>
-boost::uninitialized_copy_or_move — 
-</div>
-<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2>
-<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/move/move.hpp>
-
-
-template<typename I, typename F> F uninitialized_copy_or_move(I f, I l, F r);</pre></div>
-<div class="refsect1" lang="en">
-<a name="id586309"></a><h2>Description</h2>
-Effects: 
-<pre class="programlisting"> for (; first != last; ++result, ++first)
- new (static_cast<void*>(&*result))
- typename iterator_traits<ForwardIterator>::value_type(*first);
-</pre>
-Returns: result
-Note: This function is provided because std::uninitialized_copy from some STL implementations is not compatible with move_iterator 
-</div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2008 -2010 Ion Gaztanaga
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- 
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="uninitialized_move.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../move/reference.html#header.boost.move.move_hpp"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../BOOST_MOVE_OPTIMIZED_EMULATION.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: sandbox/move/libs/move/doc/html/boost/uninitialized_move.html
==============================================================================
--- sandbox/move/libs/move/doc/html/boost/uninitialized_move.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,59 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title>Function template uninitialized_move</title>
-<link rel="stylesheet" href="../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
-<link rel="start" href="../index.html" title="Chapter 1. Boost.Move">
-<link rel="up" href="../move/reference.html#header.boost.move.move_hpp" title="Header <boost/move/move.hpp>">
-<link rel="prev" href="move_backward.html" title="Function template move_backward">
-<link rel="next" href="uninitialized_copy_or_move.html" title="Function template uninitialized_copy_or_move">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="move_backward.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../move/reference.html#header.boost.move.move_hpp"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="uninitialized_copy_or_move.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="refentry" lang="en">
-<a name="boost.uninitialized_move"></a><div class="titlepage"></div>
-<div class="refnamediv">
-<h2>Function template uninitialized_move</h2>
-boost::uninitialized_move — 
-</div>
-<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2>
-<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <boost/move/move.hpp>
-
-
-template<typename I, typename F> F uninitialized_move(I f, I l, F r);</pre></div>
-<div class="refsect1" lang="en">
-<a name="id586247"></a><h2>Description</h2>
-Effects: 
-<pre class="programlisting"> for (; first != last; ++result, ++first)
- new (static_cast<void*>(&*result))
- typename iterator_traits<ForwardIterator>::value_type(boost::move(*first));
-</pre>
-Returns: result 
-</div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2008 -2010 Ion Gaztanaga
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- 
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="move_backward.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../move/reference.html#header.boost.move.move_hpp"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="uninitialized_copy_or_move.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: sandbox/move/libs/move/doc/html/boostbook.css
==============================================================================
--- sandbox/move/libs/move/doc/html/boostbook.css 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,538 +0,0 @@
-/*=============================================================================
- Copyright (c) 2004 Joel de Guzman
- http://spirit.sourceforge.net/
-
- Use, modification and distribution is subject to the Boost Software
- License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
- http://www.boost.org/LICENSE_1_0.txt)
-=============================================================================*/
-
-/*=============================================================================
- Body defaults
-=============================================================================*/
-
- body
- {
- margin: 1em;
- font-family: sans-serif;
- }
-
-/*=============================================================================
- Paragraphs
-=============================================================================*/
-
- p
- {
- text-align: left;
- font-size: 10pt;
- line-height: 1.15;
- }
-
-/*=============================================================================
- Program listings
-=============================================================================*/
-
- /* Code on paragraphs */
- p tt.computeroutput
- {
- font-size: 10pt;
- }
-
- pre.synopsis
- {
- font-size: 10pt;
- margin: 1pc 4% 0pc 4%;
- padding: 0.5pc 0.5pc 0.5pc 0.5pc;
- }
-
- .programlisting,
- .screen
- {
- font-size: 10pt;
- display: block;
- margin: 1pc 4% 0pc 4%;
- padding: 0.5pc 0.5pc 0.5pc 0.5pc;
- }
-
-/*=============================================================================
- Headings
-=============================================================================*/
-
- h1, h2, h3, h4, h5, h6
- {
- text-align: left;
- margin: 1em 0em 0.5em 0em;
- font-weight: bold;
- }
-
- h1 { font: 140% }
- h2 { font: bold 140% }
- h3 { font: bold 130% }
- h4 { font: bold 120% }
- h5 { font: italic 110% }
- h6 { font: italic 100% }
-
- /* Top page titles */
- title,
- h1.title,
- h2.title
- h3.title,
- h4.title,
- h5.title,
- h6.title,
- .refentrytitle
- {
- font-weight: bold;
- margin-bottom: 1pc;
- }
-
- h1.title { font-size: 140% }
- h2.title { font-size: 140% }
- h3.title { font-size: 130% }
- h4.title { font-size: 120% }
- h5.title { font-size: 110% }
- h6.title { font-size: 100% }
-
- .section h1
- {
- margin: 0em 0em 0.5em 0em;
- font-size: 140%;
- }
-
- .section h2 { font-size: 140% }
- .section h3 { font-size: 130% }
- .section h4 { font-size: 120% }
- .section h5 { font-size: 110% }
- .section h6 { font-size: 100% }
-
- /* Code on titles */
- h1 tt.computeroutput { font-size: 140% }
- h2 tt.computeroutput { font-size: 140% }
- h3 tt.computeroutput { font-size: 130% }
- h4 tt.computeroutput { font-size: 120% }
- h5 tt.computeroutput { font-size: 110% }
- h6 tt.computeroutput { font-size: 100% }
-
-/*=============================================================================
- Author
-=============================================================================*/
-
- h3.author
- {
- font-size: 100%
- }
-
-/*=============================================================================
- Lists
-=============================================================================*/
-
- li
- {
- font-size: 10pt;
- line-height: 1.3;
- }
-
- /* Unordered lists */
- ul
- {
- text-align: left;
- }
-
- /* Ordered lists */
- ol
- {
- text-align: left;
- }
-
-/*=============================================================================
- Links
-=============================================================================*/
-
- a
- {
- text-decoration: none; /* no underline */
- }
-
- a:hover
- {
- text-decoration: underline;
- }
-
-/*=============================================================================
- Spirit style navigation
-=============================================================================*/
-
- .spirit-nav
- {
- text-align: right;
- }
-
- .spirit-nav a
- {
- color: white;
- padding-left: 0.5em;
- }
-
- .spirit-nav img
- {
- border-width: 0px;
- }
-
-/*=============================================================================
- Table of contents
-=============================================================================*/
-
- .toc
- {
- margin: 1pc 4% 0pc 4%;
- padding: 0.1pc 1pc 0.1pc 1pc;
- font-size: 10pt;
- line-height: 1.15;
- }
-
- .toc-main
- {
- width: 600;
- text-align: center;
- margin: 1pc 1pc 1pc 10%;
- padding: 2pc 1pc 3pc 1pc;
- line-height: 0.1;
- }
-
- .boost-toc
- {
- float: right;
- padding: 0.5pc;
- }
-
-/*=============================================================================
- Tables
-=============================================================================*/
-
- .table-title,
- div.table p.title
- {
- margin-left: 4%;
- padding-right: 0.5em;
- padding-left: 0.5em;
- }
-
- .informaltable table,
- .table table
- {
- width: 92%;
- margin-left: 4%;
- margin-right: 4%;
- }
-
- div.informaltable table,
- div.table table
- {
- padding: 4px;
- }
-
- /* Table Cells */
- div.informaltable table tr td,
- div.table table tr td
- {
- padding: 0.5em;
- text-align: left;
- }
-
- div.informaltable table tr th,
- div.table table tr th
- {
- padding: 0.5em 0.5em 0.5em 0.5em;
- border: 1pt solid white;
- font-size: 120%;
- }
-
-/*=============================================================================
- Blurbs
-=============================================================================*/
-
- div.note,
- div.tip,
- div.important,
- div.caution,
- div.warning,
- p.blurb
- {
- font-size: 10pt;
- line-height: 1.2;
- display: block;
- margin: 1pc 4% 0pc 4%;
- padding: 0.5pc 0.5pc 0.5pc 0.5pc;
- }
-
- p.blurb img
- {
- padding: 1pt;
- }
-
-/*=============================================================================
- Variable Lists
-=============================================================================*/
-
- span.term
- {
- font-weight: bold;
- font-size: 10pt;
- }
-
- div.variablelist table tbody tr td
- {
- text-align: left;
- vertical-align: top;
- padding: 0em 2em 0em 0em;
- font-size: 10pt;
- }
-
- div.variablelist table tbody tr td p
- {
- margin: 0em 0em 0.5em 0em;
- }
-
- /* Make the terms in definition lists bold */
- div.variablelist dl dt
- {
- font-weight: bold;
- font-size: 10pt;
- }
-
- div.variablelist dl dd
- {
- margin: 1em 0em 1em 2em;
- font-size: 10pt;
- }
-
-/*=============================================================================
- Misc
-=============================================================================*/
-
- /* Title of books and articles in bibliographies */
- span.title
- {
- font-style: italic;
- }
-
- span.underline
- {
- text-decoration: underline;
- }
-
- span.strikethrough
- {
- text-decoration: line-through;
- }
-
- /* Copyright, Legal Notice */
- div div.legalnotice p
- {
- font-size: 8pt;
- text-align: left
- }
-
-/*=============================================================================
- Colors
-=============================================================================*/
-
- @media screen
- {
- /* Links */
- a
- {
- color: #0C7445;
- }
-
- a:visited
- {
- color: #663974;
- }
-
- h1 a, h2 a, h3 a, h4 a, h5 a, h6 a,
- h1 a:hover, h2 a:hover, h3 a:hover, h4 a:hover, h5 a:hover, h6 a:hover,
- h1 a:visited, h2 a:visited, h3 a:visited, h4 a:visited, h5 a:visited, h6 a:visited
- {
- text-decoration: none; /* no underline */
- color: #000000;
- }
-
- /* Syntax Highlighting */
- .keyword { color: #0000AA; }
- .identifier { color: #000000; }
- .special { color: #707070; }
- .preprocessor { color: #402080; }
- .char { color: teal; }
- .comment { color: #800000; }
- .string { color: teal; }
- .number { color: teal; }
- .white_bkd { background-color: #E8FBE9; }
- .dk_grey_bkd { background-color: #A0DAAC; }
-
- /* Copyright, Legal Notice */
- .copyright
- {
- color: #666666;
- font-size: small;
- }
-
- div div.legalnotice p
- {
- color: #666666;
- }
-
- /* Program listing */
- pre.synopsis
- {
- border: 1px solid #DCDCDC;
- border-bottom: 3px solid #9D9D9D;
- border-right: 3px solid #9D9D9D;
- background-color: #FAFFFB;
- }
-
- .programlisting,
- .screen
- {
- border: 1px solid #DCDCDC;
- border-bottom: 3px solid #9D9D9D;
- border-right: 3px solid #9D9D9D;
- background-color: #FAFFFB;
- }
-
- /* Blurbs */
- div.note,
- div.tip,
- div.important,
- div.caution,
- div.warning,
- p.blurb
- {
- border: 1px solid #DCDCDC;
- border-bottom: 3px solid #9D9D9D;
- border-right: 3px solid #9D9D9D;
- background-color: #FAFFFB;
- }
-
- /* Table of contents */
- .toc
- {
- border: 1px solid #DCDCDC;
- border-bottom: 3px solid #9D9D9D;
- border-right: 3px solid #9D9D9D;
- background-color: #FAFFFB;
- }
-
- /* Table of contents */
- .toc-main
- {
- border: 1px solid #DCDCDC;
- border-bottom: 3px solid #9D9D9D;
- border-right: 3px solid #9D9D9D;
- background-color: #FAFFFB;
- }
-
-
- /* Tables */
- div.informaltable table tr td,
- div.table table tr td
- {
- border: 1px solid #DCDCDC;
- background-color: #FAFFFB;
- }
-
- div.informaltable table tr th,
- div.table table tr th
- {
- background-color: #E3F9E4;
- border: 1px solid #DCDCDC;
- }
-
- /* Misc */
- span.highlight
- {
- color: #00A000;
- }
- }
-
- @media print
- {
- /* Links */
- a
- {
- color: black;
- }
-
- a:visited
- {
- color: black;
- }
-
- .spirit-nav
- {
- display: none;
- }
-
- /* Program listing */
- pre.synopsis
- {
- border: 1px solid gray;
- background-color: #FAFFFB;
- }
-
- .programlisting,
- .screen
- {
- border: 1px solid gray;
- background-color: #FAFFFB;
- }
-
- /* Table of contents */
- .toc
- {
- border: 1px solid #DCDCDC;
- border-bottom: 3px solid #9D9D9D;
- border-right: 3px solid #9D9D9D;
- background-color: #FAFFFB;
- }
-
- /* Table of contents */
- .toc-main
- {
- border: 1px solid #DCDCDC;
- border-bottom: 3px solid #9D9D9D;
- border-right: 3px solid #9D9D9D;
- background-color: #FAFFFB;
- }
-
- .informaltable table,
- .table table
- {
- border: 1px solid #DCDCDC;
- border-bottom: 3px solid #9D9D9D;
- border-right: 3px solid #9D9D9D;
- border-collapse: collapse;
- background-color: #FAFFFB;
- }
-
- /* Tables */
- div.informaltable table tr td,
- div.table table tr td
- {
- border: 1px solid #DCDCDC;
- background-color: #FAFFFB;
- }
-
- div.informaltable table tr th,
- div.table table tr th
- {
- border: 1px solid #DCDCDC;
- background-color: #FAFFFB;
- }
-
- /* Misc */
- span.highlight
- {
- font-weight: bold;
- }
- }

Deleted: sandbox/move/libs/move/doc/html/images/blank.png
==============================================================================
Binary file. No diff available.

Deleted: sandbox/move/libs/move/doc/html/images/caution.png
==============================================================================
Binary file. No diff available.

Deleted: sandbox/move/libs/move/doc/html/images/draft.png
==============================================================================
Binary file. No diff available.

Deleted: sandbox/move/libs/move/doc/html/images/home.png
==============================================================================
Binary file. No diff available.

Deleted: sandbox/move/libs/move/doc/html/images/important.png
==============================================================================
Binary file. No diff available.

Deleted: sandbox/move/libs/move/doc/html/images/next.png
==============================================================================
Binary file. No diff available.

Deleted: sandbox/move/libs/move/doc/html/images/note.png
==============================================================================
Binary file. No diff available.

Deleted: sandbox/move/libs/move/doc/html/images/prev.png
==============================================================================
Binary file. No diff available.

Deleted: sandbox/move/libs/move/doc/html/images/tip.png
==============================================================================
Binary file. No diff available.

Deleted: sandbox/move/libs/move/doc/html/images/toc-blank.png
==============================================================================
Binary file. No diff available.

Deleted: sandbox/move/libs/move/doc/html/images/toc-minus.png
==============================================================================
Binary file. No diff available.

Deleted: sandbox/move/libs/move/doc/html/images/toc-plus.png
==============================================================================
Binary file. No diff available.

Deleted: sandbox/move/libs/move/doc/html/images/up.png
==============================================================================
Binary file. No diff available.

Deleted: sandbox/move/libs/move/doc/html/images/warning.png
==============================================================================
Binary file. No diff available.

Deleted: sandbox/move/libs/move/doc/html/index.html
==============================================================================
--- sandbox/move/libs/move/doc/html/index.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,140 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title>Chapter 1. Boost.Move</title>
-<link rel="stylesheet" href="boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
-<link rel="start" href="index.html" title="Chapter 1. Boost.Move">
-<link rel="next" href="move/introduction.html" title=" Introduction">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav"><a accesskey="n" href="move/introduction.html"><img src="../../../../doc/html/images/next.png" alt="Next"></a></div>
-<div class="chapter" lang="en">
-<div class="titlepage"><div>
-<div><h2 class="title">
-<a name="move"></a>Chapter 1. Boost.Move</h2></div>
-<div><div class="author"><h3 class="author">
-Ion Gaztanaga
-</h3></div></div>
-<div>Copyright © 2008 -2010 Ion Gaztanaga</div>
-<div><div class="legalnotice">
-<a name="id563521"></a>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- 
-</div></div>
-</div></div>
-<div class="toc">
-Table of Contents
-<dl>
-<dt> Introduction</dt>
-<dt><a href="move/implementing_movable_classes.html"> Implementing copyable
- and movable classes</a></dt>
-<dd><dl>
-<dt><a href="move/implementing_movable_classes.html#move.implementing_movable_classes.copyable_and_movable_cpp0x">
- Copyable and movable classes in C++0x</a></dt>
-<dt><a href="move/implementing_movable_classes.html#move.implementing_movable_classes.copyable_and_movable_cpp03">
- Copyable and movable classes in portable syntax for both C++03 and C++0x compilers</a></dt>
-</dl></dd>
-<dt> Composition or inheritance</dt>
-<dt> Movable but Non-Copyable Types</dt>
-<dt> Containers and move semantics</dt>
-<dt> Constructor Forwarding</dt>
-<dt> Move iterators</dt>
-<dt> Move inserters</dt>
-<dt> Move algorithms</dt>
-<dt> Emulation limitations</dt>
-<dd><dl>
-<dt><a href="move/emulation_limitations.html#move.emulation_limitations.emulation_limitations_base">
- Initializing base classes</a></dt>
-<dt><a href="move/emulation_limitations.html#move.emulation_limitations.template_parameters"> Template
- parameters for perfect forwarding</a></dt>
-<dt><a href="move/emulation_limitations.html#move.emulation_limitations.emulation_limitations_binding">
- Binding of rvalue references to lvalues</a></dt>
-<dt><a href="move/emulation_limitations.html#move.emulation_limitations.emulation_limitations_modes">
- Further limitations depending on the emulation mode</a></dt>
-</dl></dd>
-<dt> Two emulation modes</dt>
-<dd><dl>
-<dt> Optimized mode</dt>
-<dt><a href="move/two_emulation_modes.html#move.two_emulation_modes.non_optimized_mode"> Non-optimized
- mode</a></dt>
-</dl></dd>
-<dt> How the emulation works</dt>
-<dt> Thanks and credits</dt>
-<dt>Reference</dt>
-<dd><dl><dt>Header <boost/move/move.hpp></dt></dl></dd>
-</dl>
-</div>
-<div class="warning"><table border="0" summary="Warning">
-<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Warning]" src="../../../../doc/html/images/warning.png"></td>
-<th align="left">Warning</th>
-</tr>
-<tr><td colspan="2" align="left" valign="top">
- This library is NOT an official Boost library
- </td></tr>
-</table></div>
-<div class="note"><table border="0" summary="Note">
-<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../doc/html/images/note.png"></td>
-<th align="left">Note</th>
-</tr>
-<tr><td colspan="2" align="left" valign="top">
- For reviewers This library
- has two operating modes, depending on the macro <code class="computeroutput">BOOST_MOVE_OPTIMIZED_EMULATION</code>.
- In the review, one of these modes should be chosen as the desired move emulation
- node. See chapter Two emulation modes
- for more details about pros and cons of each operating mode
- </td></tr>
-</table></div>
-<div class="note"><table border="0" summary="Note">
-<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../doc/html/images/note.png"></td>
-<th align="left">Note</th>
-</tr>
-<tr><td colspan="2" align="left" valign="top">
- For reviewers If you
- want to know how the emulation works behind the scenes to propose improvements
- or corrections, please see chapter <a href="move/how_the_emulation_works.html" title=" How the emulation works">How
- the emulation works</a> for more details
- </td></tr>
-</table></div>
-<div class="important"><table border="0" summary="Important">
-<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Important]" src="../../../../doc/html/images/important.png"></td>
-<th align="left">Important</th>
-</tr>
-<tr><td colspan="2" align="left" valign="top">
- To be able to use containers of movable values you will need an special version
- of Boost.Container bundled with this library
- </td></tr>
-</table></div>
-<div class="note"><table border="0" summary="Note">
-<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../doc/html/images/note.png"></td>
-<th align="left">Note</th>
-</tr>
-<tr><td colspan="2" align="left" valign="top">
- Tested compilers: MSVC-7.1, 8.0, 9.0, GCC 4.3-MinGW in C++03 and C++0x modes,
- Intel 10.1
- </td></tr>
-</table></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left">Last revised: April 25, 2010 at 11:36:15 GMT</td>
-<td align="right"><div class="copyright-footer"></div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav"><a accesskey="n" href="move/introduction.html"><img src="../../../../doc/html/images/next.png" alt="Next"></a></div>
-</body>
-</html>

Deleted: sandbox/move/libs/move/doc/html/move/composition_inheritance.html
==============================================================================
--- sandbox/move/libs/move/doc/html/move/composition_inheritance.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,168 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title> Composition or inheritance</title>
-<link rel="stylesheet" href="../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
-<link rel="start" href="../index.html" title="Chapter 1. Boost.Move">
-<link rel="up" href="../index.html" title="Chapter 1. Boost.Move">
-<link rel="prev" href="implementing_movable_classes.html" title=" Implementing copyable
- and movable classes">
-<link rel="next" href="movable_only_classes.html" title=" Movable but Non-Copyable Types">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="implementing_movable_classes.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="movable_only_classes.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" lang="en">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="move.composition_inheritance"></a> Composition or inheritance
-</h2></div></div></div>
-
- For classes made up of other classes (via either composition or inheritance),
- the move constructor and move assignment can be easily coded using the <code class="computeroutput">boost::move</code>
- function:
- 
-
- 
-
-
-
-<pre class="programlisting">class Base
-{
- BOOST_COPYABLE_AND_MOVABLE(Base)
-
- public:
- Base(){}
-
- // Compiler-generated copy constructor...
-
- Base(BOOST_RV_REF(Base) x) {/**/} // Move ctor
-
- Base& operator=(BOOST_RV_REF(Base) x)
- {/**/ return *this;} // Move assign
-
- Base& operator=(BOOST_COPY_ASSIGN_REF(Base) x)
- {/**/ return *this;} // Copy assign
-
- virtual Base *clone() const
- { return new Base(*this); }
-};
-
-class Member
-{
- BOOST_COPYABLE_AND_MOVABLE(Member)
-
- public:
- Member(){}
-
- // Compiler-generated copy constructor...
-
- Member(BOOST_RV_REF(Member)) {/**/} // Move ctor
-
- Member &operator=(BOOST_RV_REF(Member)) // Move assign
- {/**/ return *this; }
-
- Member &operator=(BOOST_COPY_ASSIGN_REF(Member)) // Copy assign
- {/**/ return *this; }
-};
-
-class Derived : public Base
-{
- BOOST_COPYABLE_AND_MOVABLE(Derived)
- Member mem_;
-
- public:
- Derived(){}
-
- // Compiler-generated copy constructor...
-
- Derived(BOOST_RV_REF(Derived) x) // Move ctor
- : Base(boost::move(static_cast<Base&>(x))),
- mem_(boost::move(x.mem_)) { }
-
- Derived& operator=(BOOST_RV_REF(Derived) x) // Move assign
- {
- Base::operator=(boost::move(static_cast<Base&>(x)));
- mem_ = boost::move(x.mem_);
- return *this;
- }
-
- Derived& operator=(BOOST_COPY_ASSIGN_REF(Derived) x) // Copy assign
- {
- Base::operator=(static_cast<const Base&>(x));
- mem_ = x.mem_;
- return *this;
- }
- // ...
-};
-</pre>
-
- 
-
- 
-<div class="important"><table border="0" summary="Important">
-<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Important]" src="../../../../../doc/html/images/important.png"></td>
-<th align="left">Important</th>
-</tr>
-<tr><td colspan="2" align="left" valign="top">
- <code class="computeroutput">BOOST_COPY_ASSIGN_REF(classname)</code>
- macro is not needed if the 'Non-optimized'
- mode is selected, the usual <code class="computeroutput">const
- classname &</code>
- overaload would be fine. See <a href="two_emulation_modes.html" title=" Two emulation modes">Two
- emulation modes</a> for more details about pros/cons of this emulation
- mode.
- </td></tr>
-</table></div>
-
- Each subobject will now be treated individually, calling move to bind to the
- subobject's move constructors and move assignment operators. <code class="computeroutput">Member</code> has move operations coded (just like
- our earlier <code class="computeroutput">clone_ptr</code> example)
- which will completely avoid the tremendously more expensive copy operations:
- 
-
- 
-
-
-
-<pre class="programlisting">Derived d;
-Derived d2(boost::move(d));
-d2 = boost::move(d);
-</pre>
-
- 
-
- 
-
- Note above that the argument x is treated as a lvalue reference. That's why
- it is necessary to say <code class="computeroutput">move(x)</code>
- instead of just x when passing down to the base class. This is a key safety
- feature of move semantics designed to prevent accidently moving twice from
- some named variable. All moves from lvalues occur explicitly.
- 
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2008 -2010 Ion Gaztanaga
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- 
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="implementing_movable_classes.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="movable_only_classes.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: sandbox/move/libs/move/doc/html/move/construct_forwarding.html
==============================================================================
--- sandbox/move/libs/move/doc/html/move/construct_forwarding.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,178 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title> Constructor Forwarding</title>
-<link rel="stylesheet" href="../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
-<link rel="start" href="../index.html" title="Chapter 1. Boost.Move">
-<link rel="up" href="../index.html" title="Chapter 1. Boost.Move">
-<link rel="prev" href="move_and_containers.html" title=" Containers and move semantics">
-<link rel="next" href="move_iterator.html" title=" Move iterators">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="move_and_containers.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="move_iterator.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" lang="en">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="move.construct_forwarding"></a> Constructor Forwarding
-</h2></div></div></div>
-
- Consider writing a generic factory function that returns an object for a newly
- constructed generic type. Factory functions such as this are valuable for encapsulating
- and localizing the allocation of resources. Obviously, the factory function
- must accept exactly the same sets of arguments as the constructors of the type
- of objects constructed:
- 
-
- 
-<pre class="programlisting">template<class T> T* factory_new()
-{ return new T(); }
-
-template<class T> T* factory_new(a1)
-{ return new T(a1); }
-
-template<class T> T* factory_new(a1, a2)
-{ return new T(a1, a2); }
-</pre>
-
- Unfortunately, in C++03 the much bigger issue with this approach is that the
- N-argument case would require 2^N overloads, immediately discounting this as
- a general solution. Fortunately, most constructors take arguments by value,
- by const-reference or by rvalue reference. If these limitations are accepted,
- the forwarding emulation of a N-argument case requires just N overloads. This
- library makes this emulation easy with the help of <code class="computeroutput">BOOST_FWD_REF</code>
- and <code class="computeroutput">boost::forward</code>:
- 
-
- 
-
-
-
-<pre class="programlisting">#include <boost/move/move.hpp>
-#include <iostream>
-
-class copyable_only_tester
-{
- public:
- copyable_only_tester()
- { std::cout << "copyable_only_tester()" << std::endl; }
-
- copyable_only_tester(const copyable_only_tester&)
- { std::cout << "copyable_only_tester(const copyable_only_tester&)" << std::endl; }
-
- copyable_only_tester(int)
- { std::cout << "copyable_only_tester(int)" << std::endl; }
-
- copyable_only_tester(int, double)
- { std::cout << "copyable_only_tester(int, double)" << std::endl; }
-};
-
-class copyable_movable_tester
-{
- // move semantics
- BOOST_COPYABLE_AND_MOVABLE(copyable_movable_tester)
- public:
-
- copyable_movable_tester()
- { std::cout << "copyable_movable_tester()" << std::endl; }
-
- copyable_movable_tester(int)
- { std::cout << "copyable_movable_tester(int)" << std::endl; }
-
- copyable_movable_tester(BOOST_RV_REF(copyable_movable_tester))
- { std::cout << "copyable_movable_tester(BOOST_RV_REF(copyable_movable_tester))" << std::endl; }
-
- copyable_movable_tester(const copyable_movable_tester &)
- { std::cout << "copyable_movable_tester(const copyable_movable_tester &)" << std::endl; }
-
- copyable_movable_tester(BOOST_RV_REF(copyable_movable_tester), BOOST_RV_REF(copyable_movable_tester))
- { std::cout << "copyable_movable_tester(BOOST_RV_REF(copyable_movable_tester), BOOST_RV_REF(copyable_movable_tester))" << std::endl; }
-
- copyable_movable_tester &operator=(BOOST_RV_REF(copyable_movable_tester))
- { std::cout << "copyable_movable_tester & operator=(BOOST_RV_REF(copyable_movable_tester))" << std::endl;
- return *this; }
-
- copyable_movable_tester &operator=(BOOST_COPY_ASSIGN_REF(copyable_movable_tester))
- { std::cout << "copyable_movable_tester & operator=(BOOST_COPY_ASSIGN_REF(copyable_movable_tester))" << std::endl;
- return *this; }
-};
-
-//1 argument
-template<class MaybeMovable, class MaybeRv>
-void function_construct(BOOST_FWD_REF(MaybeRv) x)
-{ MaybeMovable m(boost::forward<MaybeRv>(x)); }
-
-//2 argument
-template<class MaybeMovable, class MaybeRv, class MaybeRv2>
-void function_construct(BOOST_FWD_REF(MaybeRv) x, BOOST_FWD_REF(MaybeRv2) x2)
-{ MaybeMovable m(boost::forward<MaybeRv>(x), boost::forward<MaybeRv2>(x2)); }
-
-int main()
-{
- copyable_movable_tester m;
- //move constructor
- function_construct<copyable_movable_tester>(boost::move(m));
- //copy constructor
- function_construct<copyable_movable_tester>(copyable_movable_tester());
- //two rvalue constructor
- function_construct<copyable_movable_tester>(boost::move(m), boost::move(m));
-
- copyable_only_tester nm;
- //copy constructor (copyable_only_tester has no move ctor.)
- function_construct<copyable_only_tester>(boost::move(nm));
- //copy constructor
- function_construct<copyable_only_tester>(nm);
- //int constructor
- function_construct<copyable_only_tester>(int(0));
- //int, double constructor
- function_construct<copyable_only_tester>(int(0), double(0.0));
-
- //Output is:
- //copyable_movable_tester()
- //copyable_movable_tester(BOOST_RV_REF(copyable_movable_tester))
- //copyable_movable_tester()
- //copyable_movable_tester(const copyable_movable_tester &)
- //copyable_movable_tester(BOOST_RV_REF(copyable_movable_tester), BOOST_RV_REF(copyable_movable_tester))
- //copyable_only_tester()
- //copyable_only_tester(const copyable_only_tester&)
- //copyable_only_tester(const copyable_only_tester&)
- //copyable_only_tester(int)
- //copyable_only_tester(int, double)
- return 0;
-}
-</pre>
-
- 
-
- 
-
- Constructor forwarding comes handful to implement placement insertion in containers
- with just N overloads if the implementor accepts the limitations of this type
- of forwarding for C++03 compilers. In compilers with rvalue references perfect
- forwarding is achieved.
- 
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2008 -2010 Ion Gaztanaga
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- 
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="move_and_containers.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="move_iterator.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: sandbox/move/libs/move/doc/html/move/emulation_limitations.html
==============================================================================
--- sandbox/move/libs/move/doc/html/move/emulation_limitations.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,167 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title> Emulation limitations</title>
-<link rel="stylesheet" href="../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
-<link rel="start" href="../index.html" title="Chapter 1. Boost.Move">
-<link rel="up" href="../index.html" title="Chapter 1. Boost.Move">
-<link rel="prev" href="move_algorithms.html" title=" Move algorithms">
-<link rel="next" href="two_emulation_modes.html" title=" Two emulation modes">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="move_algorithms.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="two_emulation_modes.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" lang="en">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="move.emulation_limitations"></a> Emulation limitations
-</h2></div></div></div>
-<div class="toc"><dl>
-<dt><a href="emulation_limitations.html#move.emulation_limitations.emulation_limitations_base">
- Initializing base classes</a></dt>
-<dt><a href="emulation_limitations.html#move.emulation_limitations.template_parameters"> Template
- parameters for perfect forwarding</a></dt>
-<dt><a href="emulation_limitations.html#move.emulation_limitations.emulation_limitations_binding">
- Binding of rvalue references to lvalues</a></dt>
-<dt><a href="emulation_limitations.html#move.emulation_limitations.emulation_limitations_modes">
- Further limitations depending on the emulation mode</a></dt>
-</dl></div>
-
- Like any emulation effort, the library has some limitations users should take
- in care to achieve portable and efficient code when using the library with
- C++03 conformant compilers:
- 
-<div class="section" lang="en">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="move.emulation_limitations.emulation_limitations_base"></a><a href="emulation_limitations.html#move.emulation_limitations.emulation_limitations_base" title="
- Initializing base classes">
- Initializing base classes</a>
-</h3></div></div></div>
-
- When initializing base classes in move constructors, users must cast the
- reference to a base class reference before moving it. Example:
- 
-
- 
-<pre class="programlisting">//Portable and efficient
-Derived(BOOST_RV_REF(Derived) x) // Move ctor
- : Base(boost::move(static_cast<Base&>(x))),
- mem_(boost::move(x.mem_)) { }
-</pre>
-
- If casting is not performed the emulation will not move construct the base
- class, because no conversion is available from <code class="computeroutput">BOOST_RV_REF(Derived)</code> to <code class="computeroutput">BOOST_RV_REF(Base)</code>.
- Without the cast we might obtain a compilation error (for non-copyable types)
- or a less-efficient move constructor (for copyable types):
- 
-
- 
-<pre class="programlisting">//If Derived is copyable, then Base is copy-constructed.
-//If not, a compilation error is issued
-Derived(BOOST_RV_REF(Derived) x) // Move ctor
- : Base(boost::move(x)),
- mem_(boost::move(x.mem_)) { }
-</pre>
-</div>
-<div class="section" lang="en">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="move.emulation_limitations.template_parameters"></a><a href="emulation_limitations.html#move.emulation_limitations.template_parameters" title=" Template
- parameters for perfect forwarding"> Template
- parameters for perfect forwarding</a>
-</h3></div></div></div>
-
- The emulation can't deal with C++0x reference collapsing rules that allow
- perfect forwarding:
- 
-
- 
-<pre class="programlisting">//C++0x
-template<class T>
-void forward_function(T &&t)
-{ inner_function(std::forward<T>(t); }
-
-//Wrong C++03 emulation
-template<class T>
-void forward_function(BOOST_RV_REF<T> t)
-{ inner_function(boost::forward<T>(t); }
-</pre>
-
- In C++03 emulation BOOST_RV_REF doesn't catch any const rlvalues. For more
- details on forwarding see <a href="construct_forwarding.html" title=" Constructor Forwarding">Constructor
- Forwarding</a> chapter.
- 
-</div>
-<div class="section" lang="en">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="move.emulation_limitations.emulation_limitations_binding"></a><a href="emulation_limitations.html#move.emulation_limitations.emulation_limitations_binding" title="
- Binding of rvalue references to lvalues">
- Binding of rvalue references to lvalues</a>
-</h3></div></div></div>
-
- The <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2004/n1690.html" target="_top">first
- rvalue reference</a> proposal allowed the binding of rvalue references
- to lvalues:
- 
-
- 
-<pre class="programlisting">func(Type &&t);
-//....
-
-Type t; //Allowed
-func(t)
-</pre>
-
- Later, as explained in <a href="http://www.open-std.org/JTC1/SC22/WG21/docs/papers/2008/n2812.html" target="_top">Fixing
- a Safety Problem with Rvalue References</a> this behaviour
- was considered dangerous and eliminated this binding so that rvalue references
- adhere to the principle of type-safe overloading: Every function
- must be type-safe in isolation, without regard to how it has been overloaded
- 
-
- Boost.Move can't emulate this type-safe
- overaloading principle for C++03 compilers:
- 
-
- 
-<pre class="programlisting">//Allowed by move emulation
-movable m;
-BOOST_RV_REF(movable) r = m;
-</pre>
-</div>
-<div class="section" lang="en">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="move.emulation_limitations.emulation_limitations_modes"></a><a href="emulation_limitations.html#move.emulation_limitations.emulation_limitations_modes" title="
- Further limitations depending on the emulation mode">
- Further limitations depending on the emulation mode</a>
-</h3></div></div></div>
-
- As explained in the section <a href="two_emulation_modes.html" title=" Two emulation modes">Two
- emulation modes</a> the library has some more limitations depending on
- the emulation mode selected by the user. See that chapter for more details.
- 
-</div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2008 -2010 Ion Gaztanaga
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- 
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="move_algorithms.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="two_emulation_modes.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: sandbox/move/libs/move/doc/html/move/how_the_emulation_works.html
==============================================================================
--- sandbox/move/libs/move/doc/html/move/how_the_emulation_works.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,188 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title> How the emulation works</title>
-<link rel="stylesheet" href="../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
-<link rel="start" href="../index.html" title="Chapter 1. Boost.Move">
-<link rel="up" href="../index.html" title="Chapter 1. Boost.Move">
-<link rel="prev" href="two_emulation_modes.html" title=" Two emulation modes">
-<link rel="next" href="thanks_to.html" title=" Thanks and credits">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="two_emulation_modes.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="thanks_to.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" lang="en">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="move.how_the_emulation_works"></a> How the emulation works
-</h2></div></div></div>
-
- For movable classes Boost.Move defines a class
- named <code class="computeroutput">::boost::rv</code>:
- 
-
- 
-<pre class="programlisting">template <class T>
-class rv : public T
-{
- rv();
- ~rv();
- rv(rv const&);
- void operator=(rv const&);
-};
-</pre>
-
- which is convertible to the movable base class (usual C++ derived to base conversion).
- When users mark their classes as <code class="computeroutput">BOOST_MOVABLE_BUT_NOT_COPYABLE</code>
- or <code class="computeroutput">BOOST_COPYABLE_AND_MOVABLE</code>,
- these macros define conversion operators to references to <code class="computeroutput">::boost::rv</code>:
- 
-
- 
-<pre class="programlisting">#define BOOST_MOVABLE_BUT_NOT_COPYABLE(TYPE)\
- public:\
- operator ::BOOST_MOVE_NAMESPACE::rv<TYPE>&() \
- { return *reinterpret_cast< ::BOOST_MOVE_NAMESPACE::rv<TYPE>* >(this); }\
- operator const ::BOOST_MOVE_NAMESPACE::rv<TYPE>&() const \
- { return *reinterpret_cast<const ::BOOST_MOVE_NAMESPACE::rv<TYPE>* >(this); }\
- private:\
- //More stuff...
-</pre>
-
- <code class="computeroutput">BOOST_MOVABLE_BUT_NOT_COPYABLE</code>
- also declares a private copy constructor and assignment. <code class="computeroutput">BOOST_COPYABLE_AND_MOVABLE</code>
- defines a non-const copy constructor <code class="computeroutput">TYPE
- &operator=(TYPE&)</code>
- that forwards to a const version:
- 
-<pre class="programlisting">#define BOOST_COPYABLE_AND_MOVABLE(TYPE)\
- public:\
- TYPE& operator=(TYPE &t)\
- { this->operator=(static_cast<const ::boost::rv<TYPE> &>(const_cast<const TYPE &>(t))); return *this;}\
- //More stuff...
-</pre>
-
- When users define the <code class="computeroutput">BOOST_RV_REF</code>
- overload of a copy constructor/assignment, it is expanded to a <code class="computeroutput">::boost::rv</code> reference overload:
- 
-
- 
-<pre class="programlisting">#define BOOST_RV_REF(TYPE) ::boost::rv< TYPE >& \
-</pre>
-
- When users define the <code class="computeroutput">BOOST_COPY_ASSIGN_REF</code>
- overload, it is expanded to a const <code class="computeroutput">::boost::rv</code>
- references overload (in the 'Optimized mode'):
- 
-
- 
-<pre class="programlisting">#define BOOST_COPY_ASSIGN_REF(TYPE) const ::boost::rv< TYPE >&
-</pre>
-
- Now when overload resolution is performed these are the bindings:
- 
-<div class="itemizedlist"><ul type="disc">
-<li>
- a) non-const rvalues (e.g.: temporaries), bind to <code class="computeroutput">::boost::rv< TYPE >&</code>
-</li>
-<li>
- b) const rvalue and lvalues, bind to <code class="computeroutput">const
- ::boost::rv<
- TYPE >&</code>
-</li>
-<li>
- c) non-const lvalues (e.g. non-const references) bind to <code class="computeroutput">TYPE&</code>
-</li>
-</ul></div>
-
- The library does not define the equivalent of <code class="computeroutput">BOOST_COPY_ASSIGN_REF</code>
- for copy construction (say, <code class="computeroutput">BOOST_COPY_CTOR_REF</code>)
- because nearly all modern compilers implement RVO and this is much more efficient
- than any move emulation. <code class="computeroutput">move</code>
- just casts <code class="computeroutput">TYPE &</code>
- into <code class="computeroutput">::boost::rv<TYPE> &</code>.
- 
-
- Here's an example that demostrates how different rlvalue objects bind to <code class="computeroutput">::boost::rv</code> references in the presence of three overloads
- and the conversion operators:
- 
-
- 
-
-
-
-<pre class="programlisting">#include <boost/move/move.hpp>
-#include <iostream>
-
-class sink_tester
-{
- public: //conversions provided by BOOST_COPYABLE_AND_MOVABLE
- operator ::boost::rv<sink_tester>&()
- { return *reinterpret_cast< ::boost::rv<sink_tester>* >(this); }
- operator const ::boost::rv<sink_tester>&() const
- { return *reinterpret_cast<const ::boost::rv<sink_tester>* >(this); }
-};
-
-//Functions returning different r/lvalue types
- sink_tester rvalue() { return sink_tester(); }
-const sink_tester const_rvalue() { return sink_tester(); }
- sink_tester & lvalue() { static sink_tester lv; return lv; }
-const sink_tester & const_lvalue() { static const sink_tester clv = sink_tester(); return clv; }
-
-//BOOST_RV_REF overload
-void sink(::boost::rv<sink_tester> &) { std::cout << "non-const rvalue catched" << std::endl; }
-//BOOST_COPY_ASSIGN_REF overload
-void sink(const ::boost::rv<sink_tester> &){ std::cout << "const (r-l)value catched" << std::endl; }
-//Overload provided by BOOST_COPYABLE_AND_MOVABLE
-void sink(sink_tester &) { std::cout << "non-const lvalue catched" << std::endl; }
-
-int main()
-{
- sink(const_rvalue()); //"const (r-l)value catched"
- sink(const_lvalue()); //"const (r-l)value catched"
- sink(lvalue()); //"non-const lvalue catched"
- sink(rvalue()); //"non-const rvalue catched"
- return 0;
-}
-</pre>
-
- 
-
- 
-<div class="important"><table border="0" summary="Important">
-<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Important]" src="../../../../../doc/html/images/important.png"></td>
-<th align="left">Important</th>
-</tr>
-<tr><td colspan="2" align="left" valign="top">
- For 'Non-optimized' emulation mode no <code class="computeroutput">const
- ::boost::rv<TYPE> &</code> overload is present since <code class="computeroutput">BOOST_COPY_ASSIGN_REF</code> expands to
- <code class="computeroutput">const TYPE
- &</code>.
- </td></tr>
-</table></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2008 -2010 Ion Gaztanaga
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- 
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="two_emulation_modes.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="thanks_to.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: sandbox/move/libs/move/doc/html/move/implementing_movable_classes.html
==============================================================================
--- sandbox/move/libs/move/doc/html/move/implementing_movable_classes.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,278 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title> Implementing copyable
- and movable classes</title>
-<link rel="stylesheet" href="../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
-<link rel="start" href="../index.html" title="Chapter 1. Boost.Move">
-<link rel="up" href="../index.html" title="Chapter 1. Boost.Move">
-<link rel="prev" href="introduction.html" title=" Introduction">
-<link rel="next" href="composition_inheritance.html" title=" Composition or inheritance">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="introduction.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="composition_inheritance.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" lang="en">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="move.implementing_movable_classes"></a><a href="implementing_movable_classes.html" title=" Implementing copyable
- and movable classes"> Implementing copyable
- and movable classes</a>
-</h2></div></div></div>
-<div class="toc"><dl>
-<dt><a href="implementing_movable_classes.html#move.implementing_movable_classes.copyable_and_movable_cpp0x">
- Copyable and movable classes in C++0x</a></dt>
-<dt><a href="implementing_movable_classes.html#move.implementing_movable_classes.copyable_and_movable_cpp03">
- Copyable and movable classes in portable syntax for both C++03 and C++0x compilers</a></dt>
-</dl></div>
-<div class="section" lang="en">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="move.implementing_movable_classes.copyable_and_movable_cpp0x"></a><a href="implementing_movable_classes.html#move.implementing_movable_classes.copyable_and_movable_cpp0x" title="
- Copyable and movable classes in C++0x">
- Copyable and movable classes in C++0x</a>
-</h3></div></div></div>
-
- Consider a simple handle class that owns a resource and also provides copy
- semantics (copy constructor and assignment). For example a <code class="computeroutput">clone_ptr</code> might own a pointer, and call
- <code class="computeroutput">clone()</code>
- on it for copying purposes:
- 
-
- 
-<pre class="programlisting">template <class T>
-class clone_ptr
-{
- private:
- T* ptr;
-
- public:
- // construction
- explicit clone_ptr(T* p = 0) : ptr(p) {}
-
- // destruction
- ~clone_ptr() { delete ptr; }
-
- // copy semantics
- clone_ptr(const clone_ptr& p)
- : ptr(p.ptr ? p.ptr->clone() : 0) {}
-
- clone_ptr& operator=(const clone_ptr& p)
- {
- if (this != &p)
- {
- T *p = p.ptr ? p.ptr->clone() : 0;
- delete ptr;
- ptr = p;
- }
- return *this;
- }
-
- // move semantics
- clone_ptr(clone_ptr&& p)
- : ptr(p.ptr) { p.ptr = 0; }
-
- clone_ptr& operator=(clone_ptr&& p)
- {
- std::swap(ptr, p.ptr);
- delete p.ptr;
- p.ptr = 0;
- return *this;
- }
-
- // Other operations...
-};
-</pre>
-
- <code class="computeroutput">clone_ptr</code> has expected copy
- constructor and assignment semantics, duplicating resources when copying.
- Note that copy constructing or assigning a <code class="computeroutput">clone_ptr</code>
- is a relatively expensive operation:
- 
-
- 
-
-
-
-<pre class="programlisting">clone_ptr<Base> p1(new Derived());
-// ...
-clone_ptr<Base> p2 = p1; // p2 and p1 each own their own pointer
-</pre>
-
- 
-
- 
-
- <code class="computeroutput">clone_ptr</code> is code that you
- might find in today's books on C++, except for the part marked as <code class="computeroutput">move semantics</code>.
- That part is implemented in terms of C++0x <code class="computeroutput">rvalue
- references</code>. You can find some good
- introduction and tutorials on rvalue references in these papers:
- 
-<div class="itemizedlist"><ul type="disc">
-<li><a href="http://www.artima.com/cppsource/rvalue.html" target="_top">A Brief
- Introduction to Rvalue References</a></li>
-<li><a href="http://blogs.msdn.com/vcblog/archive/2009/02/03/rvalue-references-c-0x-features-in-vc10-part-2.aspx" target="_top">Rvalue
- References: C++0x Features in VC10, Part 2</a></li>
-</ul></div>
-
- When the source of the copy is known to be an <code class="computeroutput">rvalue</code>
- (e.g.: a temporary object), one can avoid the potentially expensive <code class="computeroutput">clone()</code>
- operation by pilfering source's pointer (no one will notice!). The move constructor
- above does exactly that, leaving the rvalue in a default constructed state.
- The move assignment operator simply does the same freeing old resources.
- 
-
- Now when code tries to copy an rvalue <code class="computeroutput">clone_ptr</code>,
- or if that code explicitly gives permission to consider the source of the
- copy an rvalue (using <code class="computeroutput">boost::move</code>),
- the operation will execute much faster.
- 
-
- 
-
-
-
-<pre class="programlisting">clone_ptr<Base> p1(new Derived());
-// ...
-clone_ptr<Base> p2 = boost::move(p1); // p2 now owns the pointer instead of p1
-p2 = clone_ptr<Base>(new Derived()); // temporary is moved to p2
-}
-</pre>
-
- 
-
- 
-</div>
-<div class="section" lang="en">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="move.implementing_movable_classes.copyable_and_movable_cpp03"></a><a href="implementing_movable_classes.html#move.implementing_movable_classes.copyable_and_movable_cpp03" title="
- Copyable and movable classes in portable syntax for both C++03 and C++0x compilers">
- Copyable and movable classes in portable syntax for both C++03 and C++0x compilers</a>
-</h3></div></div></div>
-
- Many aspects of move semantics can be emulated for compilers not supporting
- <code class="computeroutput">rvalue references</code>
- and Boost.Move offers tools for that purpose.
- With Boost.Move we can write <code class="computeroutput">clone_ptr</code> so that it will work both in
- compilers with rvalue references and those who conform to C++03. You just
- need to follow these simple steps:
- 
-<div class="itemizedlist"><ul type="disc">
-<li>
- Put the following macro in the private
- section: <code class="computeroutput">BOOST_COPYABLE_AND_MOVABLE(classname)</code>
-</li>
-<li>
- Left copy constructor as is.
- </li>
-<li>
- Write a copy assignment taking the parameter as <code class="computeroutput">BOOST_COPY_ASSIGN_REF(classname)</code>
-</li>
-<li>
- Write a move constructor and a move assignment taking the parameter as
- <code class="computeroutput">BOOST_RV_REF(classname)</code>
-</li>
-</ul></div>
-
- Let's see how are applied to <code class="computeroutput">clone_ptr</code>:
- 
-
- 
-
-
-
-<pre class="programlisting">template <class T>
-class clone_ptr
-{
- private:
- // Mark this class copyable and movable
- BOOST_COPYABLE_AND_MOVABLE(clone_ptr)
- T* ptr;
-
- public:
- // Construction
- explicit clone_ptr(T* p = 0) : ptr(p) {}
-
- // Destruction
- ~clone_ptr() { delete ptr; }
-
- clone_ptr(const clone_ptr& p) // Copy constructor (as usual)
- : ptr(p.ptr ? p.ptr->clone() : 0) {}
-
- clone_ptr& operator=(BOOST_COPY_ASSIGN_REF(clone_ptr) p) // Copy assignment
- {
- if (this != &p){
- T *tmp_p = p.ptr ? p.ptr->clone() : 0;
- delete ptr;
- ptr = tmp_p;
- }
- return *this;
- }
-
- //Move semantics...
- clone_ptr(BOOST_RV_REF(clone_ptr) p) //Move constructor
- : ptr(p.ptr) { p.ptr = 0; }
-
- clone_ptr& operator=(BOOST_RV_REF(clone_ptr) p) //Move assignment
- {
- if (this != &p){
- delete ptr;
- ptr = p.ptr;
- p.ptr = 0;
- }
- return *this;
- }
-};
-</pre>
-
- 
-
- 
-<div class="important"><table border="0" summary="Important">
-<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Important]" src="../../../../../doc/html/images/important.png"></td>
-<th align="left">Important</th>
-</tr>
-<tr><td colspan="2" align="left" valign="top">
- <code class="computeroutput">BOOST_COPY_ASSIGN_REF(classname)</code>
- macro is not needed if the 'Non-optimized'
- mode is selected, the usual <code class="computeroutput">const
- classname &</code>
- overload would be fine. See <a href="two_emulation_modes.html" title=" Two emulation modes">Two
- emulation modes</a> for more details about pros/cons of this emulation
- mode.
- </td></tr>
-</table></div>
-</div>
-
- Question: What about types that don't own
- resources? (E.g. <code class="computeroutput">std::complex</code>?)
- 
-
- No work needs to be done in that case. The copy constructor is already optimal.
- 
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2008 -2010 Ion Gaztanaga
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- 
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="introduction.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="composition_inheritance.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: sandbox/move/libs/move/doc/html/move/introduction.html
==============================================================================
--- sandbox/move/libs/move/doc/html/move/introduction.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,111 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title> Introduction</title>
-<link rel="stylesheet" href="../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
-<link rel="start" href="../index.html" title="Chapter 1. Boost.Move">
-<link rel="up" href="../index.html" title="Chapter 1. Boost.Move">
-<link rel="prev" href="../index.html" title="Chapter 1. Boost.Move">
-<link rel="next" href="implementing_movable_classes.html" title=" Implementing copyable
- and movable classes">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../index.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="implementing_movable_classes.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" lang="en">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="move.introduction"></a> Introduction
-</h2></div></div></div>
-<div class="note"><table border="0" summary="Note">
-<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../doc/html/images/note.png"></td>
-<th align="left">Note</th>
-</tr>
-<tr><td colspan="2" align="left" valign="top">
-
- 
-
- The first 3 chapters are the adapted from the article <a href="http://www.artima.com/cppsource/rvalue.html" target="_top">A
- Brief Introduction to Rvalue References</a> by Howard E. Hinnant,
- Bjarne Stroustrup, and Bronek Kozicki
- 
-
- 
-</td></tr>
-</table></div>
-
- Copying can be expensive. For example, for vectors <code class="computeroutput">v2=v1</code> typically
- involves a function call, a memory allocation, and a loop. This is of course
- acceptable where we actually need two copies of a vector, but in many cases,
- we don't: We often copy a <code class="computeroutput">vector</code>
- from one place to another, just to proceed to overwrite the old copy. Consider:
- 
-
- 
-<pre class="programlisting">template <class T> swap(T& a, T& b)
-{
- T tmp(a); // now we have two copies of a
- a = b; // now we have two copies of b
- b = tmp; // now we have two copies of tmp (aka a)
-}
-</pre>
-
- But, we didn't want to have any copies of a or b, we just wanted to swap them.
- Let's try again:
- 
-
- 
-<pre class="programlisting">template <class T> swap(T& a, T& b)
-{
- T tmp(boost::move(a));
- a = boost::move(b);
- b = boost::move(tmp);
-}
-</pre>
-
- This <code class="computeroutput">move()</code>
- gives its target the value of its argument, but is not obliged to preserve
- the value of its source. So, for a <code class="computeroutput">vector</code>,
- <code class="computeroutput">move()</code>
- could reasonably be expected to leave its argument as a zero-capacity vector
- to avoid having to copy all the elements. In other words, move
- is a potentially destructive copy.
- 
-
- In this particular case, we could have optimized swap by a specialization.
- However, we can't specialize every function that copies a large object just
- before it deletes or overwrites it. That would be unmanageable.
- 
-
- In C++0x, move semantics are implemented with the introduction of rvalue references.
- They allow us to implement <code class="computeroutput">move()</code> without verbosity or runtime overhead. Boost.Move is a library that offers tools to implement
- those move semantics not only in compilers with <code class="computeroutput">rvalue
- references</code> but also in compilers
- conforming to C++03.
- 
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2008 -2010 Ion Gaztanaga
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- 
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../index.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="implementing_movable_classes.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: sandbox/move/libs/move/doc/html/move/movable_only_classes.html
==============================================================================
--- sandbox/move/libs/move/doc/html/move/movable_only_classes.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,138 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title> Movable but Non-Copyable Types</title>
-<link rel="stylesheet" href="../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
-<link rel="start" href="../index.html" title="Chapter 1. Boost.Move">
-<link rel="up" href="../index.html" title="Chapter 1. Boost.Move">
-<link rel="prev" href="composition_inheritance.html" title=" Composition or inheritance">
-<link rel="next" href="move_and_containers.html" title=" Containers and move semantics">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="composition_inheritance.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="move_and_containers.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" lang="en">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="move.movable_only_classes"></a> Movable but Non-Copyable Types
-</h2></div></div></div>
-
- Some types are not amenable to copy semantics but can still be made movable.
- For example:
- 
-<div class="itemizedlist"><ul type="disc">
-<li>
-<code class="computeroutput">unique_ptr</code> (non-shared, non-copyable
- ownership)
- </li>
-<li>
- A type representing a thread of execution
- </li>
-<li>
- A type representing a file descriptor
- </li>
-</ul></div>
-
- By making such types movable (though still non-copyable) their utility is tremendously
- increased. Movable but non-copyable types can be returned by value from factory
- functions:
- 
-
- 
-<pre class="programlisting">file_descriptor create_file(/* ... */);
-//...
-file_descriptor data_file;
-//...
-data_file = create_file(/* ... */); // No copies!
-</pre>
-
- In the above example, the underlying file handle is passed from object to object,
- as long as the source <code class="computeroutput">file_descriptor</code>
- is an rvalue. At all times, there is still only one underlying file handle,
- and only one <code class="computeroutput">file_descriptor</code>
- owns it at a time.
- 
-
- To write a movable but not copyable type in portable syntax, you need to follow
- these simple steps:
- 
-<div class="itemizedlist"><ul type="disc">
-<li>
- Put the following macro in the private section:
- <code class="computeroutput">BOOST_MOVABLE_BUT_NOT_COPYABLE(classname)</code>
-</li>
-<li>
- Write a move constructor and a move assignment taking the parameter as <code class="computeroutput">BOOST_RV_REF(classname)</code>
-</li>
-</ul></div>
-
- Here's the definition of <code class="computeroutput">file descriptor</code> using portable syntax:
- 
-
- 
-
-
-
-<pre class="programlisting">#include <boost/move/move.hpp>
-#include <stdexcept>
-
-class file_descriptor
-{
- int os_descr_;
-
- private:
- BOOST_MOVABLE_BUT_NOT_COPYABLE(file_descriptor)
-
- public:
- explicit file_descriptor(const char *filename = 0) //Constructor
- : os_descr_(filename ? operating_system_open_file(filename) : 0)
- { if(!os_descr_) throw std::runtime_error("file not found"); }
-
- ~file_descriptor() //Destructor
- { if(!os_descr_) operating_system_close_file(os_descr_); }
-
- file_descriptor(BOOST_RV_REF(file_descriptor) x) // Move ctor
- : os_descr_(x.os_descr_)
- { x.os_descr_ = 0; }
-
- file_descriptor& operator=(BOOST_RV_REF(file_descriptor) x) // Move assign
- {
- if(!os_descr_) operating_system_close_file(os_descr_);
- os_descr_ = x.os_descr_;
- x.os_descr_ = 0;
- return *this;
- }
-
- bool empty() const { return os_descr_ == 0; }
-};
-
-</pre>
-
- 
-
- 
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2008 -2010 Ion Gaztanaga
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- 
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="composition_inheritance.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="move_and_containers.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: sandbox/move/libs/move/doc/html/move/move_algorithms.html
==============================================================================
--- sandbox/move/libs/move/doc/html/move/move_algorithms.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,102 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title> Move algorithms</title>
-<link rel="stylesheet" href="../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
-<link rel="start" href="../index.html" title="Chapter 1. Boost.Move">
-<link rel="up" href="../index.html" title="Chapter 1. Boost.Move">
-<link rel="prev" href="move_inserters.html" title=" Move inserters">
-<link rel="next" href="emulation_limitations.html" title=" Emulation limitations">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="move_inserters.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="emulation_limitations.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" lang="en">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="move.move_algorithms"></a> Move algorithms
-</h2></div></div></div>
-
- The standard library offers several copy-based algorithms. Some of them, like
- <code class="computeroutput">std::copy</code> or <code class="computeroutput">std::uninitialized_copy</code>
- are basic building blocks for containers and other data structures. This library
- offers move-based functions for those purposes:
- 
-
- 
-<pre class="programlisting">template<typename I, typename O> O move(I, I, O);
-template<typename I, typename O> O move_backward(I, I, O);
-template<typename I, typename F> F uninitialized_move(I, I, F);
-template<typename I, typename F> F uninitialized_copy_or_move(I, I, F);
-</pre>
-
- The first 3 are move variations of their equivalent copy algorithms, but copy
- assignment and copy construction are replaced with move assignment and construction.
- The last one has the same behaviour as <code class="computeroutput">std::uninitialized_copy</code>
- but since several standand library implementations don't play very well with
- <code class="computeroutput">move_iterator</code>s, this version
- is a portable version for those willing to use move iterators.
- 
-
- 
-
-
-
-<pre class="programlisting">#include "movable.hpp"
-#include <cassert>
-#include <boost/aligned_storage.hpp>
-
-int main()
-{
- const std::size_t ArraySize = 10;
- movable movable_array[ArraySize];
- movable movable_array2[ArraySize];
- //move
- boost::move(&movable_array2[0], &movable_array2[ArraySize], &movable_array[0]);
- assert(movable_array2[0].moved());
- assert(!movable_array[0].moved());
-
- //move backward
- boost::move_backward(&movable_array[0], &movable_array[ArraySize], &movable_array2[ArraySize]);
- assert(movable_array[0].moved());
- assert(!movable_array2[0].moved());
-
- //uninitialized_move
- boost::aligned_storage< sizeof(movable)*ArraySize
- , boost::alignment_of<movable>::value>::type storage;
- movable *raw_movable = static_cast<movable*>(static_cast<void*>(&storage));
- boost::uninitialized_move(&movable_array2[0], &movable_array2[ArraySize], raw_movable);
- assert(movable_array2[0].moved());
- assert(!raw_movable[0].moved());
- return 0;
-}
-</pre>
-
- 
-
- 
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2008 -2010 Ion Gaztanaga
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- 
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="move_inserters.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="emulation_limitations.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: sandbox/move/libs/move/doc/html/move/move_and_containers.html
==============================================================================
--- sandbox/move/libs/move/doc/html/move/move_and_containers.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,89 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title> Containers and move semantics</title>
-<link rel="stylesheet" href="../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
-<link rel="start" href="../index.html" title="Chapter 1. Boost.Move">
-<link rel="up" href="../index.html" title="Chapter 1. Boost.Move">
-<link rel="prev" href="movable_only_classes.html" title=" Movable but Non-Copyable Types">
-<link rel="next" href="construct_forwarding.html" title=" Constructor Forwarding">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="movable_only_classes.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="construct_forwarding.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" lang="en">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="move.move_and_containers"></a> Containers and move semantics
-</h2></div></div></div>
-
- Movable but non-copyable types can be safely inserted into containers and movable
- and copyable types are more efficiently handled if those containers internally
- use move semantics instead of copy semantics. If the container needs to "change
- the location" of an element internally (e.g. vector reallocation) it will
- move the element instead of copying it. Boost.Container
- containers are move-aware so you can write the following:
- 
-
- 
-
-
-
-<pre class="programlisting">#include <boost/container/vector.hpp>
-#include <cassert>
-
-//Remember: 'file_descriptor' is NOT copyable, but it
-//can be returned from functions thanks to move semantics
-file_descriptor create_file_descriptor(const char *filename)
-{ return file_descriptor(filename); }
-
-int main()
-{
- //Open a file obtaining its descriptor, the temporary
- //returned from 'create_file_descriptor' is moved to 'fd'.
- file_descriptor fd = create_file_descriptor("filename");
- assert(!fd.empty());
-
- //Now move fd into a vector
- boost::container::vector<file_descriptor> v;
- v.push_back(boost::move(fd));
-
- //Check ownership has been transferred
- assert(fd.empty());
- assert(!v[0].empty());
-
- //Compilation error if uncommented since file_descriptor is not copyable
- //and vector copy construction requires value_type's copy constructor:
- //boost::container::vector<file_descriptor> v2(v);
- return 0;
-}
-</pre>
-
- 
-
- 
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2008 -2010 Ion Gaztanaga
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- 
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="movable_only_classes.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="construct_forwarding.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: sandbox/move/libs/move/doc/html/move/move_inserters.html
==============================================================================
--- sandbox/move/libs/move/doc/html/move/move_inserters.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,142 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title> Move inserters</title>
-<link rel="stylesheet" href="../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
-<link rel="start" href="../index.html" title="Chapter 1. Boost.Move">
-<link rel="up" href="../index.html" title="Chapter 1. Boost.Move">
-<link rel="prev" href="move_iterator.html" title=" Move iterators">
-<link rel="next" href="move_algorithms.html" title=" Move algorithms">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="move_iterator.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="move_algorithms.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" lang="en">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="move.move_inserters"></a> Move inserters
-</h2></div></div></div>
-
- Similar to standard insert iterators, it's possible to deal with move insertion
- in the same way as writing into an array. A special kind of iterator adaptors,
- called move insert iterators, are provided with this library. With regular
- iterator classes,
- 
-
- 
-<pre class="programlisting">while (first != last) *result++ = *first++;
-</pre>
-
- causes a range [first,last) to be copied into a range starting with result.
- The same code with result being an move insert iterator will move insert corresponding
- elements into the container. This device allows all of the copying algorithms
- in the library to work in the move insert mode instead of the regular overwrite
- mode. This library offers 3 move insert iterators and their helper functions:
- 
-
- 
-<pre class="programlisting">// Note: C models Container
-template <typename C>
-class back_move_insert_iterator;
-
-template <typename C>
-back_move_insert_iterator<C> back_move_inserter(C& x);
-
-template <typename C>
-class front_move_insert_iterator;
-
-template <typename C>
-front_move_insert_iterator<C> front_move_inserter(C& x);
-
-template <typename C>
-class move_insert_iterator;
-
-template <typename C>
-move_insert_iterator<C> move_inserter(C& x, typename C::iterator it);
-</pre>
-
- A move insert iterator is constructed from a container and possibly one of
- its iterators pointing to where insertion takes place if it is neither at the
- beginning nor at the end of the container. Insert iterators satisfy the requirements
- of output iterators. <code class="computeroutput">operator*</code> returns the move insert iterator itself. The
- assignment <code class="computeroutput">operator=(T& x)</code> is defined on insert iterators to allow writing
- into them, it inserts x right before where the insert iterator is pointing.
- In other words, an <code class="computeroutput">insert iterator</code> is like a cursor pointing into the
- container where the insertion takes place. <code class="computeroutput">back_move_iterator</code>
- move inserts elements at the end of a container, <code class="computeroutput">front_insert_iterator</code>
- move inserts elements at the beginning of a container, and <code class="computeroutput">move_insert_iterator</code>
- move inserts elements where the iterator points to in a container. <code class="computeroutput">back_move_inserter</code>, <code class="computeroutput">front_move_inserter</code>,
- and <code class="computeroutput">move_inserter</code> are three
- functions making the insert iterators out of a container. Here's an example
- of how to use them:
- 
-
- 
-
-
-
-<pre class="programlisting">#include <boost/container/list.hpp>
-#include "movable.hpp"
-#include <cassert>
-
-using namespace boost::container;
-
-typedef list<movable> list_t;
-typedef list_t::iterator l_iterator;
-
-template<class MoveInsertIterator>
-void test_move_inserter(list_t &l2, MoveInsertIterator mit)
-{
- //Create a list with 10 default constructed objects
- list<movable> l(10);
- assert(!l.begin()->moved());
- l2.clear();
-
- //Move construct
- for(l_iterator itbeg = l.begin(), itend = l.end(); itbeg != itend; ++itbeg){
- *mit = *itbeg;
- }
- //Check size and status
- assert(l2.size() == l.size());
- assert(l.begin()->moved());
- assert(!l2.begin()->moved());
-}
-
-int main()
-{
- list_t l2;
- test_move_inserter(l2, boost::back_move_inserter(l2));
- test_move_inserter(l2, boost::front_move_inserter(l2));
- test_move_inserter(l2, boost::move_inserter(l2, l2.end()));
- return 0;
-}
-</pre>
-
- 
-
- 
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2008 -2010 Ion Gaztanaga
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- 
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="move_iterator.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="move_algorithms.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: sandbox/move/libs/move/doc/html/move/move_iterator.html
==============================================================================
--- sandbox/move/libs/move/doc/html/move/move_iterator.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,146 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title> Move iterators</title>
-<link rel="stylesheet" href="../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
-<link rel="start" href="../index.html" title="Chapter 1. Boost.Move">
-<link rel="up" href="../index.html" title="Chapter 1. Boost.Move">
-<link rel="prev" href="construct_forwarding.html" title=" Constructor Forwarding">
-<link rel="next" href="move_inserters.html" title=" Move inserters">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="construct_forwarding.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="move_inserters.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" lang="en">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="move.move_iterator"></a> Move iterators
-</h2></div></div></div>
-
- 
-<pre class="programlisting">template<class Iterator>
-class move_iterator;
-
-template<class It>
-move_iterator<It> make_move_iterator(const It &it);
-</pre>
-
- <code class="computeroutput">move_iterator</code> is an iterator
- adaptor with the same behavior as the underlying iterator except that its dereference
- operator implicitly converts the value returned by the underlying iterator's
- dereference operator to an rvalue reference: <code class="computeroutput">boost::move(*underlying_iterator)</code>
- It is a read-once iterator, but can have up to random access traversal characteristics.
- 
-
- <code class="computeroutput">move_iterator</code> is very useful
- because some generic algorithms and container insertion functions can be called
- with move iterators to replace copying with moving. For example:
- 
-
- 
-
-
-
-<pre class="programlisting">//header file "movable.hpp"
-#include <boost/move/move.hpp>
-
-//A movable class
-class movable
-{
- BOOST_MOVABLE_BUT_NOT_COPYABLE(movable)
- int value_;
-
- public:
- movable() : value_(1){}
-
- //Move constructor and assignment
- movable(BOOST_RV_REF(movable) m)
- { value_ = m.value_; m.value_ = 0; }
-
- movable & operator=(BOOST_RV_REF(movable) m)
- { value_ = m.value_; m.value_ = 0; return *this; }
-
- bool moved() const //Observer
- { return value_ == 0; }
-};
-
-namespace boost{
-
-template<>
-struct has_nothrow_move<movable>
-{
- static const bool value = true;
-};
-
-} //namespace boost{
-</pre>
-
- 
-
- 
-
- <code class="computeroutput">movable</code> objects can be moved
- from one container to another using move iterators and insertion and assignment
- operations.w
- 
-
- 
-
-
-
-<pre class="programlisting">#include <boost/container/vector.hpp>
-#include "movable.hpp"
-#include <cassert>
-
-int main()
-{
- using namespace boost::container;
-
- //Create a vector with 10 default constructed objects
- vector<movable> v(10);
- assert(!v[0].moved());
-
- //Move construct all elements in v into v2
- vector<movable> v2( boost::make_move_iterator(v.begin())
- , boost::make_move_iterator(v.end()));
- assert(v[0].moved());
- assert(!v2[0].moved());
-
- //Now move assign all elements from in v2 back into v
- v.assign( boost::make_move_iterator(v2.begin())
- , boost::make_move_iterator(v2.end()));
- assert(v2[0].moved());
- assert(!v[0].moved());
-
- return 0;
-}
-</pre>
-
- 
-
- 
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2008 -2010 Ion Gaztanaga
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- 
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="construct_forwarding.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="move_inserters.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: sandbox/move/libs/move/doc/html/move/reference.html
==============================================================================
--- sandbox/move/libs/move/doc/html/move/reference.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,78 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title>Reference</title>
-<link rel="stylesheet" href="../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
-<link rel="start" href="../index.html" title="Chapter 1. Boost.Move">
-<link rel="up" href="../index.html" title="Chapter 1. Boost.Move">
-<link rel="prev" href="thanks_to.html" title=" Thanks and credits">
-<link rel="next" href="../boost/is_movable.html" title="Struct template is_movable">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="thanks_to.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../boost/is_movable.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" lang="en">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="move.reference"></a>Reference</h2></div></div></div>
-<div class="toc"><dl><dt>Header <boost/move/move.hpp></dt></dl></div>
-<div class="section" lang="en">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="header.boost.move.move_hpp"></a>Header <boost/move/move.hpp></h3></div></div></div>
-<pre class="synopsis">
-
-BOOST_MOVE_OPTIMIZED_EMULATION
-BOOST_MOVABLE_BUT_NOT_COPYABLE(TYPE)
-BOOST_COPYABLE_AND_MOVABLE(TYPE)
-BOOST_RV_REF(TYPE)
-BOOST_COPY_ASSIGN_REF(TYPE)
-BOOST_FWD_REF(TYPE)</pre>
-<pre class="synopsis">namespace boost {
- template<typename T> struct is_movable;
- template<typename T> struct has_nothrow_move;
-
- template<typename It> class move_iterator;
- template<typename C> class back_move_insert_iterator;
- template<typename C> class front_move_insert_iterator;
- template<typename C> class move_insert_iterator;
-
- template<typename T> struct has_trivial_destructor_after_move;
- template<typename T> rvalue_reference move(input_reference);
- template<typename T> output_reference forward(input_reference);
- template<typename It> move_iterator< It > make_move_iterator(const It &);
- template<typename C> back_move_insert_iterator< C > back_move_inserter(C &);
- template<typename C>
- front_move_insert_iterator< C > front_move_inserter(C &);
- template<typename C>
- move_insert_iterator< C > move_inserter(C &, typename C::iterator);
- template<typename I, typename O> O move(I, I, O);
- template<typename I, typename O> O move_backward(I, I, O);
- template<typename I, typename F> F uninitialized_move(I, I, F);
- template<typename I, typename F> F uninitialized_copy_or_move(I, I, F);
-}</pre>
-</div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2008 -2010 Ion Gaztanaga
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- 
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="thanks_to.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../boost/is_movable.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: sandbox/move/libs/move/doc/html/move/thanks_to.html
==============================================================================
--- sandbox/move/libs/move/doc/html/move/thanks_to.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,54 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title> Thanks and credits</title>
-<link rel="stylesheet" href="../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
-<link rel="start" href="../index.html" title="Chapter 1. Boost.Move">
-<link rel="up" href="../index.html" title="Chapter 1. Boost.Move">
-<link rel="prev" href="how_the_emulation_works.html" title=" How the emulation works">
-<link rel="next" href="reference.html" title="Reference">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="how_the_emulation_works.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="reference.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" lang="en">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="move.thanks_to"></a> Thanks and credits
-</h2></div></div></div>
-
- Thanks to all that developed ideas for move emulation: the first emulation
- was based on Howard Hinnant emulation code for <code class="computeroutput">unique_ptr</code>,
- David Abrahams suggested the use of <code class="computeroutput">class
- rv</code> class, and Klaus Triendl discovered
- how to bind const rlvalues using <code class="computeroutput">class
- rv</code>.
- 
-
- Many thanks to all boosters that have tested and improved the library.
- 
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2008 -2010 Ion Gaztanaga
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- 
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="how_the_emulation_works.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="reference.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: sandbox/move/libs/move/doc/html/move/two_emulation_modes.html
==============================================================================
--- sandbox/move/libs/move/doc/html/move/two_emulation_modes.html 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,166 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title> Two emulation modes</title>
-<link rel="stylesheet" href="../boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.67.0">
-<link rel="start" href="../index.html" title="Chapter 1. Boost.Move">
-<link rel="up" href="../index.html" title="Chapter 1. Boost.Move">
-<link rel="prev" href="emulation_limitations.html" title=" Emulation limitations">
-<link rel="next" href="how_the_emulation_works.html" title=" How the emulation works">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="emulation_limitations.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="how_the_emulation_works.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" lang="en">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="move.two_emulation_modes"></a> Two emulation modes
-</h2></div></div></div>
-<div class="toc"><dl>
-<dt> Optimized mode</dt>
-<dt><a href="two_emulation_modes.html#move.two_emulation_modes.non_optimized_mode"> Non-optimized
- mode</a></dt>
-</dl></div>
-
- This review version of the library has two emulation modes that can be selected
- using the macro <code class="computeroutput">BOOST_MOVE_OPTIMIZED_EMULATION</code>
- in the header <code class="computeroutput">move.hpp</code>.
- This selection has no effect on compilers supporting rvalue-references but
- it changes the behaviour of the move emulation used in C++03 compilers. During
- the review a mode and its limitations should be chosen because no perfect emulation
- has been found to date:
- 
-<div class="section" lang="en">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="move.two_emulation_modes.optimized_mode"></a> Optimized mode
-</h3></div></div></div>
-
- If <code class="computeroutput">BOOST_MOVE_OPTIMIZED_EMULATION</code>
- is defined in <code class="computeroutput">move.hpp</code>
- the library correctly move assigns non-const rvalues of copyable and movable
- types:
- 
-
- 
-<pre class="programlisting">class copyable_and_movable
-{/**/};
-
-copyable_and_movable produce(){ return copyable_and_movable(); }
-
-int main(){
- copyable_and_movable cm;
- copyable_and_movable cm;
- cm = copyable_and_movable(); //temporary object is MOVED, not COPIED
- return 0;
-}
-</pre>
-
- The downside is that in this emulation mode, the macro <code class="computeroutput">BOOST_COPYABLE_AND_MOVABLE</code>
- needs to define a copy constructor for <code class="computeroutput">copyable_and_movable</code>
- taking a non-const parameter:
- 
-
- 
-<pre class="programlisting">//Generated by BOOST_COPYABLE_AND_MOVABLE
-copyable_and_movable &operator=(copyable_and_movable&){/**/}
-</pre>
-
- Since the non-const overload of the copy constructor is generated, compiler-generated
- assignment operators for classes containing <code class="computeroutput">copyable_and_movable</code>
- will get the non-const copy constructor overload, which will surely surprise
- users:
- 
-
- 
-<pre class="programlisting">class holder
-{
- copyable_and_movable c;
-};
-
-void func(const holder& h)
-{
- holder copy_h(h); //<--- ERROR: can't convert 'const holder&' to 'holder&'
- //Compiler-generated copy constructor is non-const:
- // holder& operator(holder &)
- //!!!
-}
-</pre>
-
- This limitation forces the user to define a const version of the copy constructor,
- in all classes holding copyable and movable classes which might be suboptimal
- in some templated code or annoying in several cases.
- 
-</div>
-<div class="section" lang="en">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="move.two_emulation_modes.non_optimized_mode"></a><a href="two_emulation_modes.html#move.two_emulation_modes.non_optimized_mode" title=" Non-optimized
- mode"> Non-optimized
- mode</a>
-</h3></div></div></div>
-
- If <code class="computeroutput">BOOST_MOVE_OPTIMIZED_EMULATION</code>
- is undefined in <code class="computeroutput">move.hpp</code>
- the non-optimized mode is activated and it avoids the copy-assignment issue
- for <code class="computeroutput">holder</code>, and users don't
- even need to define the <code class="computeroutput">BOOST_COPY_ASSIGN_REF</code>
- overload for their classes. Users can use the usual copy-assignment or the
- compiler-generated one:
- 
-
- 
-<pre class="programlisting">copyable_and_movable
-{
- //...
- copyable_and_movable& operator= (const copyable_and_movable&);
-};
-</pre>
-
- But this emulation mode does not optimize the non-const rvalue move assignment
- example:
- 
-
- 
-<pre class="programlisting">int main(){
- copyable_and_movable cm;
- cm = copyable_and_movable(); //temporary object is COPIED
- return 0;
-}
-</pre>
-
- There is a workaround for this missing optimization with an explicit <code class="computeroutput">forward</code> call:
- 
-
- 
-<pre class="programlisting">int main(){
- copyable_and_movable cm;
- //Temporary object is MOVED
- cm = ::boost::forward<copyable_and_movable>(copyable_and_movable());
- return 0;
-}
-</pre>
-</div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2008 -2010 Ion Gaztanaga
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- 
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="emulation_limitations.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="how_the_emulation_works.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: sandbox/move/libs/move/doc/html/reference.css
==============================================================================
--- sandbox/move/libs/move/doc/html/reference.css 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,13 +0,0 @@
-/*=============================================================================
- Copyright (c) 2004 Joel de Guzman
- http://spirit.sourceforge.net/
-
- Use, modification and distribution is subject to the Boost Software
- License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
- http://www.boost.org/LICENSE_1_0.txt)
-=============================================================================*/
-PRE.synopsis {
- background-color: #e0ffff;
- border: thin solid blue;
- padding: 1em
-}

Deleted: sandbox/move/libs/move/doc/move.qbk
==============================================================================
--- sandbox/move/libs/move/doc/move.qbk 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,860 +0,0 @@
-[/
- / Copyright (c) 2008-2010 Ion Gaztanaga
- /
- / Distributed under the Boost Software License, Version 1.0. (See accompanying
- / file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- /]
-[library Boost.Move
- [quickbook 1.5]
- [authors [Gaztanaga, Ion]]
- [copyright 2008-2010 Ion Gaztanaga]
- [id move]
- [dirname move]
- [purpose Move semantics]
- [license
- Distributed under the Boost Software License, Version 1.0.
- (See accompanying file LICENSE_1_0.txt or copy at
- [@http://www.boost.org/LICENSE_1_0.txt])
- ]
-]
-
-[warning This library is NOT an official Boost library]
-
-[note [*['For reviewers]] This library has two operating modes, depending on the macro
- [macroref BOOST_MOVE_OPTIMIZED_EMULATION BOOST_MOVE_OPTIMIZED_EMULATION]. In the review, one of these
- modes should be chosen as the desired move emulation node.
- See chapter [link move.two_emulation_modes Two emulation modes] for more details about
- pros and cons of each operating mode]
-
-[note [*['For reviewers]] If you want to know how the emulation works behind the scenes
- to propose improvements or corrections, please see chapter
- [link move.how_the_emulation_works How the emulation works] for more details]
-
-[important To be able to use containers of movable values you will need an special version
- of [*Boost.Container] bundled with this library]
-
-[note Tested compilers: MSVC-7.1, 8.0, 9.0, GCC 4.3-MinGW in C++03 and C++0x modes, Intel 10.1]
-
-[section:introduction Introduction]
-
-[note
-
- The first 3 chapters are the adapted from the article
- [@http://www.artima.com/cppsource/rvalue.html ['A Brief Introduction to Rvalue References]]
- by Howard E. Hinnant, Bjarne Stroustrup, and Bronek Kozicki
-
-]
-
-Copying can be expensive. For example, for vectors `v2=v1` typically involves a function call,
-a memory allocation, and a loop. This is of course acceptable where we actually need two copies of
-a vector, but in many cases, we don't: We often copy a `vector` from one place to another, just to
-proceed to overwrite the old copy. Consider:
-
-[c++]
-
- template <class T> swap(T& a, T& b)
- {
- T tmp(a); // now we have two copies of a
- a = b; // now we have two copies of b
- b = tmp; // now we have two copies of tmp (aka a)
- }
-
-But, we didn't want to have any copies of a or b, we just wanted to swap them. Let's try again:
-
-[c++]
-
- template <class T> swap(T& a, T& b)
- {
- T tmp(boost::move(a));
- a = boost::move(b);
- b = boost::move(tmp);
- }
-
-This `move()` gives its target the value of its argument, but is not obliged to preserve the value
-of its source. So, for a `vector`, `move()` could reasonably be expected to leave its argument as
-a zero-capacity vector to avoid having to copy all the elements. In other words, [*move is a potentially
-destructive copy].
-
-In this particular case, we could have optimized swap by a specialization. However, we can't
-specialize every function that copies a large object just before it deletes or overwrites it. That
-would be unmanageable.
-
-In C++0x, move semantics are implemented with the introduction of rvalue references. They allow us to
-implement `move()` without verbosity or runtime overhead. [*Boost.Move] is a library that offers tools
-to implement those move semantics not only in compilers with `rvalue references` but also in compilers
-conforming to C++03.
-
-[endsect]
-
-[section:implementing_movable_classes Implementing copyable and movable classes]
-
-[import ../example/doc_clone_ptr.cpp]
-
-[section:copyable_and_movable_cpp0x Copyable and movable classes in C++0x]
-
-Consider a simple handle class that owns a resource and also provides copy semantics
-(copy constructor and assignment). For example a `clone_ptr` might own a pointer, and call
-`clone()` on it for copying purposes:
-
-[c++]
-
- template <class T>
- class clone_ptr
- {
- private:
- T* ptr;
-
- public:
- // construction
- explicit clone_ptr(T* p = 0) : ptr(p) {}
-
- // destruction
- ~clone_ptr() { delete ptr; }
-
- // copy semantics
- clone_ptr(const clone_ptr& p)
- : ptr(p.ptr ? p.ptr->clone() : 0) {}
-
- clone_ptr& operator=(const clone_ptr& p)
- {
- if (this != &p)
- {
- T *p = p.ptr ? p.ptr->clone() : 0;
- delete ptr;
- ptr = p;
- }
- return *this;
- }
-
- // move semantics
- clone_ptr(clone_ptr&& p)
- : ptr(p.ptr) { p.ptr = 0; }
-
- clone_ptr& operator=(clone_ptr&& p)
- {
- std::swap(ptr, p.ptr);
- delete p.ptr;
- p.ptr = 0;
- return *this;
- }
-
- // Other operations...
- };
-
-`clone_ptr` has expected copy constructor and assignment semantics, duplicating resources when copying.
-Note that copy constructing or assigning a `clone_ptr` is a relatively expensive operation:
-
-[copy_clone_ptr]
-
-`clone_ptr` is code that you might find in today's books on C++, except for the part marked as
-`move semantics`. That part is implemented in terms of C++0x `rvalue references`. You can find
-some good introduction and tutorials on rvalue references in these papers:
-
-* [@http://www.artima.com/cppsource/rvalue.html ['A Brief Introduction to Rvalue References]]
-* [@http://blogs.msdn.com/vcblog/archive/2009/02/03/rvalue-references-c-0x-features-in-vc10-part-2.aspx ['Rvalue References: C++0x Features in VC10, Part 2]]
-
-When the source of the copy is known to be an `rvalue` (e.g.: a temporary object), one can avoid the
-potentially expensive `clone()` operation by pilfering source's pointer (no one will notice!). The move
-constructor above does exactly that, leaving the rvalue in a default constructed state. The move assignment
-operator simply does the same freeing old resources.
-
-Now when code tries to copy an rvalue `clone_ptr`, or if that code explicitly gives permission to
-consider the source of the copy an rvalue (using `boost::move`), the operation will execute much faster.
-
-[move_clone_ptr]
-
-[endsect]
-
-[section:copyable_and_movable_cpp03 Copyable and movable classes in portable syntax for both C++03 and C++0x compilers]
-
-Many aspects of move semantics can be emulated for compilers not supporting `rvalue references`
-and [*Boost.Move] offers tools for that purpose. With [*Boost.Move] we can write `clone_ptr`
-so that it will work both in compilers with rvalue references and those who conform to C++03.
-You just need to follow these simple steps:
-
-* Put the following macro in the [*private] section:
- [macroref BOOST_COPYABLE_AND_MOVABLE BOOST_COPYABLE_AND_MOVABLE(classname)]
-* Left copy constructor as is.
-* Write a copy assignment taking the parameter as
- [macroref BOOST_COPY_ASSIGN_REF BOOST_COPY_ASSIGN_REF(classname)]
-* Write a move constructor and a move assignment taking the parameter as
- [macroref BOOST_RV_REF BOOST_RV_REF(classname)]
-
-Let's see how are applied to `clone_ptr`:
-
-[clone_ptr_def]
-
-[important [macroref BOOST_COPY_ASSIGN_REF BOOST_COPY_ASSIGN_REF(classname)] macro is *not* needed
- if the *'Non-optimized' mode* is selected, the usual `const classname &`
- overload would be fine. See [link move.two_emulation_modes Two emulation modes]
- for more details about pros/cons of this emulation mode.
-]
-
-[endsect]
-
-[*Question]: What about types that don't own resources? (E.g. `std::complex`?)
-
-No work needs to be done in that case. The copy constructor is already optimal.
-
-[endsect]
-
-[section:composition_inheritance Composition or inheritance]
-
-For classes made up of other classes (via either composition or inheritance), the move constructor
-and move assignment can be easily coded using the `boost::move` function:
-
-[clone_ptr_base_derived]
-
-[important [macroref BOOST_COPY_ASSIGN_REF BOOST_COPY_ASSIGN_REF(classname)] macro is *not* needed
- if the *'Non-optimized' mode* is selected, the usual `const classname &`
- overaload would be fine. See [link move.two_emulation_modes Two emulation modes]
- for more details about pros/cons of this emulation mode.
-]
-
-Each subobject will now be treated individually, calling move to bind to the subobject's move
-constructors and move assignment operators. `Member` has move operations coded (just like
-our earlier `clone_ptr` example) which will completely avoid the tremendously more expensive
-copy operations:
-
-[clone_ptr_move_derived]
-
-Note above that the argument x is treated as a lvalue reference. That's why it is necessary to
-say `move(x)` instead of just x when passing down to the base class. This is a key safety feature of move
-semantics designed to prevent accidently moving twice from some named variable. All moves from
-lvalues occur explicitly.
-
-[endsect]
-
-[section:movable_only_classes Movable but Non-Copyable Types]
-
-Some types are not amenable to copy semantics but can still be made movable. For example:
-
-* `unique_ptr` (non-shared, non-copyable ownership)
-* A type representing a thread of execution
-* A type representing a file descriptor
-
-By making such types movable (though still non-copyable) their utility is tremendously
-increased. Movable but non-copyable types can be returned by value from factory functions:
-
-[c++]
-
- file_descriptor create_file(/* ... */);
- //...
- file_descriptor data_file;
- //...
- data_file = create_file(/* ... */); // No copies!
-
-In the above example, the underlying file handle is passed from object to object, as long
-as the source `file_descriptor` is an rvalue. At all times, there is still only one underlying file
-handle, and only one `file_descriptor` owns it at a time.
-
-To write a movable but not copyable type in portable syntax, you need to follow these simple steps:
-
-* Put the following macro in the [*private] section:
- [macroref BOOST_MOVABLE_BUT_NOT_COPYABLE BOOST_MOVABLE_BUT_NOT_COPYABLE(classname)]
-* Write a move constructor and a move assignment taking the parameter as
- [macroref BOOST_RV_REF BOOST_RV_REF(classname)]
-
-Here's the definition of `file descriptor` using portable syntax:
-
-[import ../example/doc_file_descriptor.cpp]
-[file_descriptor_def]
-
-[/
- /Many standard algorithms benefit from moving elements of the sequence as opposed to
- /copying them. This not only provides better performance (like the improved `swap`
- /implementation described above), but also allows these algorithms to operate on movable
- /but non-copyable types. For example the following code sorts a `vector<unique_ptr<T>>`
- /based on comparing the pointed-to types:
- /
- /[c++]
- /
- / struct indirect_less
- / {
- / template <class T>
- / bool operator()(const T& x, const T& y)
- / {return *x < *y;}
- / };
- / ...
- / std::vector<std::unique_ptr<A>> v;
- / ...
- / std::sort(v.begin(), v.end(), indirect_less());
- /
- /
- /As sort moves the unique_ptr's around, it will use swap (which no longer requires Copyability)
- /or move construction / move assignment. Thus during the entire algorithm, the invariant that
- /each item is owned and referenced by one and only one smart pointer is maintained. If the
- /algorithm were to attempt a copy (say by programming mistake) a compile time error would result.
- /]
-
-[endsect]
-
-[section:move_and_containers Containers and move semantics]
-
-Movable but non-copyable types can be safely inserted into containers and
-movable and copyable types are more efficiently handled if those containers
-internally use move semantics instead of copy semantics.
-If the container needs to "change the location" of an element
-internally (e.g. vector reallocation) it will move the element instead of copying it.
-[*Boost.Container] containers are move-aware so you can write the following:
-
-[file_descriptor_example]
-
-[endsect]
-
-[section:construct_forwarding Constructor Forwarding]
-
-Consider writing a generic factory function that returns an object for a newly
-constructed generic type. Factory functions such as this are valuable for encapsulating
-and localizing the allocation of resources. Obviously, the factory function must accept
-exactly the same sets of arguments as the constructors of the type of objects constructed:
-
-[c++]
-
- template<class T> T* factory_new()
- { return new T(); }
-
- template<class T> T* factory_new(a1)
- { return new T(a1); }
-
- template<class T> T* factory_new(a1, a2)
- { return new T(a1, a2); }
-
-Unfortunately, in C++03 the much bigger issue with this approach is that the N-argument case
-would require 2^N overloads, immediately discounting this as a general solution. Fortunately,
-most constructors take arguments by value, by const-reference or by rvalue reference. If these
-limitations are accepted, the forwarding emulation of a N-argument case requires just N overloads.
-This library makes this emulation easy with the help of `BOOST_FWD_REF` and
-`boost::forward`:
-
-[import ../example/doc_construct_forward.cpp]
-[construct_forward_example]
-
-Constructor forwarding comes handful to implement placement insertion in containers with
-just N overloads if the implementor accepts the limitations of this type of forwarding for
-C++03 compilers. In compilers with rvalue references perfect forwarding is achieved.
-
-[endsect]
-
-[/[section:perfect_forwarding Perfect Forwarding]
- /
- /Consider writing a generic factory function that returns a std::shared_ptr for a newly
- /constructed generic type. Factory functions such as this are valuable for encapsulating
- /and localizing the allocation of resources. Obviously, the factory function must accept
- /exactly the same sets of arguments as the constructors of the type of objects constructed.
- /Today this might be coded as:
- /
- /[c++]
- /
- / template <class T>
- / std::shared_ptr<T>
- / factory() // no argument version
- / {
- / return std::shared_ptr<T>(new T);
- / }
- /
- / template <class T, class A1>
- / std::shared_ptr<T>
- / factory(const A1& a1) // one argument version
- / {
- / return std::shared_ptr<T>(new T(a1));
- / }
- /
- / // all the other versions
- /
- /
- /In the interest of brevity, we will focus on just the one-parameter version. For example:
- /
- / [c++]
- /
- / std::shared_ptr<A> p = factory<A>(5);
- /
- /
- / [*Question]: What if T's constructor takes a parameter by non-const reference?
- /
- / In that case, we get a compile-time error as the const-qualifed argument of the factory
- / function will not bind to the non-const parameter of T's constructor.
- /
- / To solve that problem, we could use non-const parameters in our factory functions:
- /
- / [c++]
- /
- / template <class T, class A1>
- / std::shared_ptr<T>
- / factory(A1& a1)
- / {
- / return std::shared_ptr<T>(new T(a1));
- / }
- /
- /
- / This is much better. If a const-qualified type is passed to the factory, the const will
- / be deduced into the template parameter (A1 for example) and then properly forwarded to
- / T's constructor. Similarly, if a non-const argument is given to factory, it will be
- / correctly forwarded to T's constructor as a non-const. Indeed, this is precisely how
- /forwarding applications are coded today (e.g. `std::bind`).
- /
- /However, consider:
- /
- /[c++]
- /
- / std::shared_ptr<A> p = factory<A>(5); // error
- / A* q = new A(5); // ok
- /
- /
- /This example worked with our first version of factory, but now it's broken: The "5"
- /causesthe factory template argument to be deduced as int& and subsequently will not
- /bind to the rvalue "5". Neither solution so far is right. Each breaks reasonable and
- /common code.
- /
- /[*Question]: What about overloading on every combination of AI& and const AI&?
- /
- /This would allow use to handle all examples, but at a cost of an exponential explosion:
- /For our two-parameter case, this would require 4 overloads. For a three-parameter factory
- /we would need 8 additional overloads. For a four-parameter factory we would need 16, and
- /so on. This is not a scalable solution.
- /
- /Rvalue references offer a simple, scalable solution to this problem:
- /
- /[c++]
- /
- / template <class T, class A1>
- / std::shared_ptr<T>
- / factory(A1&& a1)
- / {
- / return std::shared_ptr<T>(new T(std::forward<A1>(a1)));
- / }
- /
- / Now rvalue arguments can bind to the factory parameters. If the argument is const, that
- / fact gets deduced into the factory template parameter type.
- /
- / [*Question]: What is that forward function in our solution?
- /
- / Like move, forward is a simple standard library function used to express our intent
- / directly and explicitly, rather than through potentially cryptic uses of references.
- / We want to forward the argument a1, so we simply say so.
- /
- / Here, forward preserves the lvalue/rvalue-ness of the argument that was passed to factory.
- / If an rvalue is passed to factory, then an rvalue will be passed to T's constructor with
- / the help of the forward function. Similarly, if an lvalue is passed to factory, it is
- / forwarded to T's constructor as an lvalue.
- /
- / The definition of forward looks like this:
- /
- / [c++]
- /
- / template <class T>
- / struct identity
- / {
- / typedef T type;
- / };
- /
- / template <class T>
- / T&& forward(typename identity<T>::type&& a)
- / {
- / return a;
- / }
- /
- /[endsect]
- /
- /]
-
-[section:move_iterator Move iterators]
-
-[c++]
-
- template<class Iterator>
- class move_iterator;
-
- template<class It>
- move_iterator<It> make_move_iterator(const It &it);
-
-[classref boost::move_iterator move_iterator] is an iterator adaptor with the
-same behavior as the underlying iterator
-except that its dereference operator implicitly converts the value returned by the
-underlying iterator's dereference operator to an rvalue reference: `boost::move(*underlying_iterator)`
-It is a read-once iterator, but can have up to random access traversal characteristics.
-
-`move_iterator` is very useful because some generic algorithms and container insertion functions
-can be called with move iterators to replace copying with moving. For example:
-
-[import ../example/movable.hpp]
-[movable_definition]
-
-`movable` objects can be moved from one container to another using move iterators and insertion
-and assignment operations.w
-
-[import ../example/doc_move_iterator.cpp]
-[move_iterator_example]
-
-[endsect]
-
-[section:move_inserters Move inserters]
-
-Similar to standard insert iterators, it's possible to deal with move insertion in the same way
-as writing into an array. A special kind of iterator adaptors, called move insert iterators, are
-provided with this library. With regular iterator classes,
-
-[c++]
-
- while (first != last) *result++ = *first++;
-
-causes a range [first,last) to be copied into a range starting with result. The same code with
-result being an move insert iterator will move insert corresponding elements into the container.
-This device allows all of the copying algorithms in the library to work in the move insert mode
-instead of the regular overwrite mode. This library offers 3 move insert iterators and their
-helper functions:
-
-[c++]
-
- // Note: C models Container
- template <typename C>
- class back_move_insert_iterator;
-
- template <typename C>
- back_move_insert_iterator<C> back_move_inserter(C& x);
-
- template <typename C>
- class front_move_insert_iterator;
-
- template <typename C>
- front_move_insert_iterator<C> front_move_inserter(C& x);
-
- template <typename C>
- class move_insert_iterator;
-
- template <typename C>
- move_insert_iterator<C> move_inserter(C& x, typename C::iterator it);
-
-
-A move insert iterator is constructed from a container and possibly one of its iterators pointing
-to where insertion takes place if it is neither at the beginning nor at the end of the container.
-Insert iterators satisfy the requirements of output iterators. `operator*` returns the move insert
-iterator itself. The assignment `operator=(T& x)` is defined on insert iterators to allow writing
-into them, it inserts x right before where the insert iterator is pointing. In other words, an
-`insert iterator` is like a cursor pointing into the container where the insertion takes place.
-`back_move_iterator` move inserts elements at the end of a container, `front_insert_iterator`
-move inserts elements at the beginning of a container, and `move_insert_iterator` move inserts
-elements where the iterator points to in a container. `back_move_inserter`, `front_move_inserter`,
-and `move_inserter` are three functions making the insert iterators out of a container. Here's
-an example of how to use them:
-
-[import ../example/doc_move_inserter.cpp]
-[move_inserter_example]
-
-[endsect]
-
-[section:move_algorithms Move algorithms]
-
-The standard library offers several copy-based algorithms. Some of them, like `std::copy` or
-`std::uninitialized_copy` are basic building blocks for containers and other data structures.
-This library offers move-based functions for those purposes:
-
-[c++]
-
- template<typename I, typename O> O move(I, I, O);
- template<typename I, typename O> O move_backward(I, I, O);
- template<typename I, typename F> F uninitialized_move(I, I, F);
- template<typename I, typename F> F uninitialized_copy_or_move(I, I, F);
-
-
-The first 3 are move variations of their equivalent copy algorithms, but copy assignment and
-copy construction are replaced with move assignment and construction. The last one has the
-same behaviour as `std::uninitialized_copy` but since several standand library implementations
-don't play very well with `move_iterator`s, this version is a portable version for those
-willing to use move iterators.
-
-[import ../example/doc_move_algorithms.cpp]
-[move_algorithms_example]
-
-[endsect]
-
-[section:emulation_limitations Emulation limitations]
-
-Like any emulation effort, the library has some limitations users should take in
-care to achieve portable and efficient code when using the library with C++03 conformant compilers:
-
-[section:emulation_limitations_base Initializing base classes]
-
-When initializing base classes in move constructors, users must
-cast the reference to a base class reference before moving it. Example:
-
-[c++]
-
- //Portable and efficient
- Derived(BOOST_RV_REF(Derived) x) // Move ctor
- : Base(boost::move(static_cast<Base&>(x))),
- mem_(boost::move(x.mem_)) { }
-
-
-If casting is not performed the emulation will not move construct
-the base class, because no conversion is available from `BOOST_RV_REF(Derived)`
-to `BOOST_RV_REF(Base)`. Without the cast we might obtain a compilation
-error (for non-copyable types) or a less-efficient move constructor (for copyable types):
-
-[c++]
-
- //If Derived is copyable, then Base is copy-constructed.
- //If not, a compilation error is issued
- Derived(BOOST_RV_REF(Derived) x) // Move ctor
- : Base(boost::move(x)),
- mem_(boost::move(x.mem_)) { }
-
-[endsect]
-
-[section:template_parameters Template parameters for perfect forwarding]
-
-The emulation can't deal with C++0x reference collapsing rules that allow perfect forwarding:
-
-[c++]
-
- //C++0x
- template<class T>
- void forward_function(T &&t)
- { inner_function(std::forward<T>(t); }
-
- //Wrong C++03 emulation
- template<class T>
- void forward_function(BOOST_RV_REF<T> t)
- { inner_function(boost::forward<T>(t); }
-
-In C++03 emulation BOOST_RV_REF doesn't catch any const rlvalues. For more details on
-forwarding see [link move.construct_forwarding Constructor Forwarding] chapter.
-
-[endsect]
-
-[section:emulation_limitations_binding Binding of rvalue references to lvalues]
-
-The
-[@http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2004/n1690.html first rvalue reference]
-proposal allowed the binding of rvalue references to lvalues:
-
-[c++]
-
- func(Type &&t);
- //....
-
- Type t; //Allowed
- func(t)
-
-
-Later, as explained in
-[@http://www.open-std.org/JTC1/SC22/WG21/docs/papers/2008/n2812.html ['Fixing a Safety Problem with Rvalue References]]
-this behaviour was considered dangerous and eliminated this binding so that rvalue references adhere to the
-principle of type-safe overloading: ['Every function must be type-safe in isolation, without regard to how it has been overloaded]
-
-[*Boost.Move] can't emulate this type-safe overaloading principle for C++03 compilers:
-
-[c++]
-
- //Allowed by move emulation
- movable m;
- BOOST_RV_REF(movable) r = m;
-
-[endsect]
-
-[section:emulation_limitations_modes Further limitations depending on the emulation mode]
-
-As explained in the section [link move.two_emulation_modes Two emulation modes]
-the library has some more limitations depending on the emulation mode selected by the user.
-See that chapter for more details.
-
-[endsect]
-
-[endsect]
-
-[section:two_emulation_modes Two emulation modes]
-
-This review version of the library has two emulation modes that can be selected using
-the macro [macroref BOOST_MOVE_OPTIMIZED_EMULATION BOOST_MOVE_OPTIMIZED_EMULATION] in
-the header [headerref boost/move/move.hpp move.hpp]. This selection has no
-effect on compilers supporting rvalue-references but it changes the behaviour of the
-move emulation used in C++03 compilers. During the review a mode and its limitations should be chosen
-because no perfect emulation has been found to date:
-
-[section:optimized_mode Optimized mode]
-
-If [macroref BOOST_MOVE_OPTIMIZED_EMULATION BOOST_MOVE_OPTIMIZED_EMULATION] is defined
-in [headerref boost/move/move.hpp move.hpp]
-the library correctly move assigns non-const rvalues of copyable and movable types:
-
-[c++]
-
- class copyable_and_movable
- {/**/};
-
- copyable_and_movable produce(){ return copyable_and_movable(); }
-
- int main(){
- copyable_and_movable cm;
- copyable_and_movable cm;
- cm = copyable_and_movable(); //temporary object is MOVED, not COPIED
- return 0;
- }
-
-The downside is that in this emulation mode, the macro
-[macroref BOOST_COPYABLE_AND_MOVABLE BOOST_COPYABLE_AND_MOVABLE] needs to
-define a copy constructor for `copyable_and_movable` taking a non-const parameter:
-
-[c++]
-
- //Generated by BOOST_COPYABLE_AND_MOVABLE
- copyable_and_movable &operator=(copyable_and_movable&){/**/}
-
-Since the non-const overload of the copy constructor is generated, compiler-generated
-assignment operators for classes containing `copyable_and_movable`
-will get the non-const copy constructor overload, which will surely surprise users:
-
-[c++]
-
- class holder
- {
- copyable_and_movable c;
- };
-
- void func(const holder& h)
- {
- holder copy_h(h); //<--- ERROR: can't convert 'const holder&' to 'holder&'
- //Compiler-generated copy constructor is non-const:
- // holder& operator(holder &)
- //!!!
- }
-
-This limitation forces the user to define a const version of the copy constructor,
-in all classes holding copyable and movable classes which might be suboptimal in some
-templated code or annoying in several cases.
-
-[endsect]
-
-
-[section:non_optimized_mode Non-optimized mode]
-
-If [macroref BOOST_MOVE_OPTIMIZED_EMULATION BOOST_MOVE_OPTIMIZED_EMULATION] is undefined
-in [headerref boost/move/move.hpp move.hpp] the non-optimized mode is activated
-and it avoids the copy-assignment issue for `holder`, and users don't even
-need to define the [macroref BOOST_COPY_ASSIGN_REF BOOST_COPY_ASSIGN_REF] overload for their
-classes. Users can use the usual copy-assignment or the compiler-generated one:
-
-[c++]
-
- copyable_and_movable
- {
- //...
- copyable_and_movable& operator= (const copyable_and_movable&);
- };
-
-But this emulation mode does not optimize the non-const rvalue move assignment example:
-
-[c++]
-
- int main(){
- copyable_and_movable cm;
- cm = copyable_and_movable(); //temporary object is COPIED
- return 0;
- }
-
-There is a workaround for this missing optimization with an explicit
-[funcref boost::forward forward] call:
-
-[c++]
-
- int main(){
- copyable_and_movable cm;
- //Temporary object is MOVED
- cm = ::boost::forward<copyable_and_movable>(copyable_and_movable());
- return 0;
- }
-
-[endsect]
-
-[endsect]
-
-[section:how_the_emulation_works How the emulation works]
-
-For movable classes [*Boost.Move] defines a class named `::boost::rv`:
-
-[c++]
-
- template <class T>
- class rv : public T
- {
- rv();
- ~rv();
- rv(rv const&);
- void operator=(rv const&);
- };
-
-which is convertible to the movable base class (usual C++ derived to base conversion). When users mark
-their classes as [macroref BOOST_MOVABLE_BUT_NOT_COPYABLE BOOST_MOVABLE_BUT_NOT_COPYABLE] or
-[macroref BOOST_COPYABLE_AND_MOVABLE BOOST_COPYABLE_AND_MOVABLE], these macros define conversion
-operators to references to `::boost::rv`:
-
-[c++]
-
- #define BOOST_MOVABLE_BUT_NOT_COPYABLE(TYPE)\
- public:\
- operator ::BOOST_MOVE_NAMESPACE::rv<TYPE>&() \
- { return *reinterpret_cast< ::BOOST_MOVE_NAMESPACE::rv<TYPE>* >(this); }\
- operator const ::BOOST_MOVE_NAMESPACE::rv<TYPE>&() const \
- { return *reinterpret_cast<const ::BOOST_MOVE_NAMESPACE::rv<TYPE>* >(this); }\
- private:\
- //More stuff...
-
-[macroref BOOST_MOVABLE_BUT_NOT_COPYABLE BOOST_MOVABLE_BUT_NOT_COPYABLE] also declares a
-private copy constructor and assignment. [macroref BOOST_COPYABLE_AND_MOVABLE BOOST_COPYABLE_AND_MOVABLE]
-defines a non-const copy constructor `TYPE &operator=(TYPE&)` that forwards to a const version:
-
- #define BOOST_COPYABLE_AND_MOVABLE(TYPE)\
- public:\
- TYPE& operator=(TYPE &t)\
- { this->operator=(static_cast<const ::boost::rv<TYPE> &>(const_cast<const TYPE &>(t))); return *this;}\
- //More stuff...
-
-When users define the [macroref BOOST_RV_REF BOOST_RV_REF] overload of a copy constructor/assignment, it is
-expanded to a `::boost::rv` reference overload:
-
-[c++]
-
- #define BOOST_RV_REF(TYPE) ::boost::rv< TYPE >& \
-
-When users define the [macroref BOOST_COPY_ASSIGN_REF BOOST_COPY_ASSIGN_REF] overload,
-it is expanded to a const `::boost::rv` references overload (in the 'Optimized mode'):
-
-[c++]
-
- #define BOOST_COPY_ASSIGN_REF(TYPE) const ::boost::rv< TYPE >&
-
-Now when overload resolution is performed these are the bindings:
-
-* a) non-const rvalues (e.g.: temporaries), bind to `::boost::rv< TYPE >&`
-* b) const rvalue and lvalues, bind to `const ::boost::rv< TYPE >&`
-* c) non-const lvalues (e.g. non-const references) bind to `TYPE&`
-
-The library does not define the equivalent of
-[macroref BOOST_COPY_ASSIGN_REF BOOST_COPY_ASSIGN_REF] for copy construction (say, `BOOST_COPY_CTOR_REF`)
-because nearly all modern compilers implement RVO and this is much more efficient than any move emulation.
-[funcref boost::move move] just casts `TYPE &` into `::boost::rv<TYPE> &`.
-
-Here's an example that demostrates how different rlvalue objects bind to `::boost::rv` references in the
-presence of three overloads and the conversion operators:
-
-[import ../example/doc_how_works.cpp]
-[how_works_example]
-
-[important For 'Non-optimized' emulation mode no `const ::boost::rv<TYPE> &` overload is present
-since [macroref BOOST_COPY_ASSIGN_REF] expands to `const TYPE &`.
-]
-
-[endsect]
-
-
-[section:thanks_to Thanks and credits]
-
-Thanks to all that developed ideas for move emulation: the first emulation was based on Howard Hinnant
-emulation code for `unique_ptr`, David Abrahams suggested the use of `class rv` class,
-and Klaus Triendl discovered how to bind const rlvalues using `class rv`.
-
-Many thanks to all boosters that have tested and improved the library.
-
-[endsect]
-
-[xinclude autodoc.xml]

Deleted: sandbox/move/libs/move/example/Jamfile.v2
==============================================================================
--- sandbox/move/libs/move/example/Jamfile.v2 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,28 +0,0 @@
-##############################################################################
-##
-## (C) Copyright Ion Gaztanaga 2008-2009 Distributed under the Boost
-## Software License, Version 1.0. (See accompanying file
-## LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-##
-##
-##############################################################################
-rule test_all
-{
- local all_rules = ;
-
- for local fileb in [ glob *.cpp ]
- {
- all_rules += [ run $(fileb)
- : # additional args
- : # test-files
- : # requirements
- ] ;
- }
-
- return $(all_rules) ;
-}
-
-test-suite move_example : [ test_all r ]
-: <link>static
-;
-

Deleted: sandbox/move/libs/move/example/copymovable.hpp
==============================================================================
--- sandbox/move/libs/move/example/copymovable.hpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,46 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2009.
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/move for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-#ifndef BOOST_MOVE_TEST_COPYMOVABLE_HPP
-#define BOOST_MOVE_TEST_COPYMOVABLE_HPP
-
-//[movable_definition
-//header file "copy_movable.hpp"
-#include <boost/move/move.hpp>
-
-//A copy_movable class
-class copy_movable
-{
- BOOST_COPYABLE_AND_MOVABLE(copy_movable)
- int value_;
-
- public:
- copy_movable() : value_(1){}
-
- //Move constructor and assignment
- copy_movable(BOOST_RV_REF(copy_movable) m)
- { value_ = m.value_; m.value_ = 0; }
-
- copy_movable(const copy_movable &m)
- { value_ = m.value_; }
-
- copy_movable & operator=(BOOST_RV_REF(copy_movable) m)
- { value_ = m.value_; m.value_ = 0; return *this; }
-
- copy_movable & operator=(BOOST_COPY_ASSIGN_REF(copy_movable) m)
- { value_ = m.value_; return *this; }
-
- bool moved() const //Observer
- { return value_ == 0; }
-};
-
-//]
-
-#endif //BOOST_MOVE_TEST_COPYMOVABLE_HPP

Deleted: sandbox/move/libs/move/example/doc_clone_ptr.cpp
==============================================================================
--- sandbox/move/libs/move/example/doc_clone_ptr.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,152 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2009.
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/move for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-#include <boost/move/move.hpp>
-
-//[clone_ptr_base_derived
-class Base
-{
- BOOST_COPYABLE_AND_MOVABLE(Base)
-
- public:
- Base(){}
-
- // Compiler-generated copy constructor...
-
- Base(BOOST_RV_REF(Base) x) {/**/} // Move ctor
-
- Base& operator=(BOOST_RV_REF(Base) x)
- {/**/ return *this;} // Move assign
-
- Base& operator=(BOOST_COPY_ASSIGN_REF(Base) x)
- {/**/ return *this;} // Copy assign
-
- virtual Base *clone() const
- { return new Base(*this); }
-};
-
-class Member
-{
- BOOST_COPYABLE_AND_MOVABLE(Member)
-
- public:
- Member(){}
-
- // Compiler-generated copy constructor...
-
- Member(BOOST_RV_REF(Member)) {/**/} // Move ctor
-
- Member &operator=(BOOST_RV_REF(Member)) // Move assign
- {/**/ return *this; }
-
- Member &operator=(BOOST_COPY_ASSIGN_REF(Member)) // Copy assign
- {/**/ return *this; }
-};
-
-class Derived : public Base
-{
- BOOST_COPYABLE_AND_MOVABLE(Derived)
- Member mem_;
-
- public:
- Derived(){}
-
- // Compiler-generated copy constructor...
-
- Derived(BOOST_RV_REF(Derived) x) // Move ctor
- : Base(boost::move(static_cast<Base&>(x))),
- mem_(boost::move(x.mem_)) { }
-
- Derived& operator=(BOOST_RV_REF(Derived) x) // Move assign
- {
- Base::operator=(boost::move(static_cast<Base&>(x)));
- mem_ = boost::move(x.mem_);
- return *this;
- }
-
- Derived& operator=(BOOST_COPY_ASSIGN_REF(Derived) x) // Copy assign
- {
- Base::operator=(static_cast<const Base&>(x));
- mem_ = x.mem_;
- return *this;
- }
- // ...
-};
-//]
-
-//[clone_ptr_def
-template <class T>
-class clone_ptr
-{
- private:
- // Mark this class copyable and movable
- BOOST_COPYABLE_AND_MOVABLE(clone_ptr)
- T* ptr;
-
- public:
- // Construction
- explicit clone_ptr(T* p = 0) : ptr(p) {}
-
- // Destruction
- ~clone_ptr() { delete ptr; }
-
- clone_ptr(const clone_ptr& p) // Copy constructor (as usual)
- : ptr(p.ptr ? p.ptr->clone() : 0) {}
-
- clone_ptr& operator=(BOOST_COPY_ASSIGN_REF(clone_ptr) p) // Copy assignment
- {
- if (this != &p){
- T *tmp_p = p.ptr ? p.ptr->clone() : 0;
- delete ptr;
- ptr = tmp_p;
- }
- return *this;
- }
-
- //Move semantics...
- clone_ptr(BOOST_RV_REF(clone_ptr) p) //Move constructor
- : ptr(p.ptr) { p.ptr = 0; }
-
- clone_ptr& operator=(BOOST_RV_REF(clone_ptr) p) //Move assignment
- {
- if (this != &p){
- delete ptr;
- ptr = p.ptr;
- p.ptr = 0;
- }
- return *this;
- }
-};
-//]
-
-int main()
-{
- {
- //[copy_clone_ptr
- clone_ptr<Base> p1(new Derived());
- // ...
- clone_ptr<Base> p2 = p1; // p2 and p1 each own their own pointer
- //]
- }
- {
- //[move_clone_ptr
- clone_ptr<Base> p1(new Derived());
- // ...
- clone_ptr<Base> p2 = boost::move(p1); // p2 now owns the pointer instead of p1
- p2 = clone_ptr<Base>(new Derived()); // temporary is moved to p2
- }
- //]
- //[clone_ptr_move_derived
- Derived d;
- Derived d2(boost::move(d));
- d2 = boost::move(d);
- //]
- return 0;
-}

Deleted: sandbox/move/libs/move/example/doc_construct_forward.cpp
==============================================================================
--- sandbox/move/libs/move/example/doc_construct_forward.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,105 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright David Abrahams, Vicente Botet, Ion Gaztanaga 2009.
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/move for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-//[construct_forward_example
-#include <boost/move/move.hpp>
-#include <iostream>
-
-class copyable_only_tester
-{
- public:
- copyable_only_tester()
- { std::cout << "copyable_only_tester()" << std::endl; }
-
- copyable_only_tester(const copyable_only_tester&)
- { std::cout << "copyable_only_tester(const copyable_only_tester&)" << std::endl; }
-
- copyable_only_tester(int)
- { std::cout << "copyable_only_tester(int)" << std::endl; }
-
- copyable_only_tester(int, double)
- { std::cout << "copyable_only_tester(int, double)" << std::endl; }
-};
-
-class copyable_movable_tester
-{
- // move semantics
- BOOST_COPYABLE_AND_MOVABLE(copyable_movable_tester)
- public:
-
- copyable_movable_tester()
- { std::cout << "copyable_movable_tester()" << std::endl; }
-
- copyable_movable_tester(int)
- { std::cout << "copyable_movable_tester(int)" << std::endl; }
-
- copyable_movable_tester(BOOST_RV_REF(copyable_movable_tester))
- { std::cout << "copyable_movable_tester(BOOST_RV_REF(copyable_movable_tester))" << std::endl; }
-
- copyable_movable_tester(const copyable_movable_tester &)
- { std::cout << "copyable_movable_tester(const copyable_movable_tester &)" << std::endl; }
-
- copyable_movable_tester(BOOST_RV_REF(copyable_movable_tester), BOOST_RV_REF(copyable_movable_tester))
- { std::cout << "copyable_movable_tester(BOOST_RV_REF(copyable_movable_tester), BOOST_RV_REF(copyable_movable_tester))" << std::endl; }
-
- copyable_movable_tester &operator=(BOOST_RV_REF(copyable_movable_tester))
- { std::cout << "copyable_movable_tester & operator=(BOOST_RV_REF(copyable_movable_tester))" << std::endl;
- return *this; }
-
- copyable_movable_tester &operator=(BOOST_COPY_ASSIGN_REF(copyable_movable_tester))
- { std::cout << "copyable_movable_tester & operator=(BOOST_COPY_ASSIGN_REF(copyable_movable_tester))" << std::endl;
- return *this; }
-};
-
-//1 argument
-template<class MaybeMovable, class MaybeRv>
-void function_construct(BOOST_FWD_REF(MaybeRv) x)
-{ MaybeMovable m(boost::forward<MaybeRv>(x)); }
-
-//2 argument
-template<class MaybeMovable, class MaybeRv, class MaybeRv2>
-void function_construct(BOOST_FWD_REF(MaybeRv) x, BOOST_FWD_REF(MaybeRv2) x2)
-{ MaybeMovable m(boost::forward<MaybeRv>(x), boost::forward<MaybeRv2>(x2)); }
-
-int main()
-{
- copyable_movable_tester m;
- //move constructor
- function_construct<copyable_movable_tester>(boost::move(m));
- //copy constructor
- function_construct<copyable_movable_tester>(copyable_movable_tester());
- //two rvalue constructor
- function_construct<copyable_movable_tester>(boost::move(m), boost::move(m));
-
- copyable_only_tester nm;
- //copy constructor (copyable_only_tester has no move ctor.)
- function_construct<copyable_only_tester>(boost::move(nm));
- //copy constructor
- function_construct<copyable_only_tester>(nm);
- //int constructor
- function_construct<copyable_only_tester>(int(0));
- //int, double constructor
- function_construct<copyable_only_tester>(int(0), double(0.0));
-
- //Output is:
- //copyable_movable_tester()
- //copyable_movable_tester(BOOST_RV_REF(copyable_movable_tester))
- //copyable_movable_tester()
- //copyable_movable_tester(const copyable_movable_tester &)
- //copyable_movable_tester(BOOST_RV_REF(copyable_movable_tester), BOOST_RV_REF(copyable_movable_tester))
- //copyable_only_tester()
- //copyable_only_tester(const copyable_only_tester&)
- //copyable_only_tester(const copyable_only_tester&)
- //copyable_only_tester(int)
- //copyable_only_tester(int, double)
- return 0;
-}
-//]

Deleted: sandbox/move/libs/move/example/doc_file_descriptor.cpp
==============================================================================
--- sandbox/move/libs/move/example/doc_file_descriptor.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,87 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2008-2009.
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/move for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-//[file_descriptor_def
-
-#include <boost/move/move.hpp>
-#include <stdexcept>
-
-class file_descriptor
-{
- //<-
- int operating_system_open_file(const char *)
- {
- return 1;
- }
-
- void operating_system_close_file(int)
- {}
- //->
- int os_descr_;
-
- private:
- BOOST_MOVABLE_BUT_NOT_COPYABLE(file_descriptor)
-
- public:
- explicit file_descriptor(const char *filename = 0) //Constructor
- : os_descr_(filename ? operating_system_open_file(filename) : 0)
- { if(!os_descr_) throw std::runtime_error("file not found"); }
-
- ~file_descriptor() //Destructor
- { if(!os_descr_) operating_system_close_file(os_descr_); }
-
- file_descriptor(BOOST_RV_REF(file_descriptor) x) // Move ctor
- : os_descr_(x.os_descr_)
- { x.os_descr_ = 0; }
-
- file_descriptor& operator=(BOOST_RV_REF(file_descriptor) x) // Move assign
- {
- if(!os_descr_) operating_system_close_file(os_descr_);
- os_descr_ = x.os_descr_;
- x.os_descr_ = 0;
- return *this;
- }
-
- bool empty() const { return os_descr_ == 0; }
-};
-
-//]
-
-//[file_descriptor_example
-#include <boost/container/vector.hpp>
-#include <cassert>
-
-//Remember: 'file_descriptor' is NOT copyable, but it
-//can be returned from functions thanks to move semantics
-file_descriptor create_file_descriptor(const char *filename)
-{ return file_descriptor(filename); }
-
-int main()
-{
- //Open a file obtaining its descriptor, the temporary
- //returned from 'create_file_descriptor' is moved to 'fd'.
- file_descriptor fd = create_file_descriptor("filename");
- assert(!fd.empty());
-
- //Now move fd into a vector
- boost::container::vector<file_descriptor> v;
- v.push_back(boost::move(fd));
-
- //Check ownership has been transferred
- assert(fd.empty());
- assert(!v[0].empty());
-
- //Compilation error if uncommented since file_descriptor is not copyable
- //and vector copy construction requires value_type's copy constructor:
- //boost::container::vector<file_descriptor> v2(v);
- return 0;
-}
-//]

Deleted: sandbox/move/libs/move/example/doc_how_works.cpp
==============================================================================
--- sandbox/move/libs/move/example/doc_how_works.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,60 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2009.
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/move for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#include <boost/config.hpp>
-
-#if !defined(BOOST_NO_RVALUE_REFERENCES)
-
-int main()
-{
- return 0;
-}
-
-#else
-
-//[how_works_example
-#include <boost/move/move.hpp>
-#include <iostream>
-
-class sink_tester
-{
- public: //conversions provided by BOOST_COPYABLE_AND_MOVABLE
- operator ::boost::rv<sink_tester>&()
- { return *reinterpret_cast< ::boost::rv<sink_tester>* >(this); }
- operator const ::boost::rv<sink_tester>&() const
- { return *reinterpret_cast<const ::boost::rv<sink_tester>* >(this); }
-};
-
-//Functions returning different r/lvalue types
- sink_tester rvalue() { return sink_tester(); }
-const sink_tester const_rvalue() { return sink_tester(); }
- sink_tester & lvalue() { static sink_tester lv; return lv; }
-const sink_tester & const_lvalue() { static const sink_tester clv = sink_tester(); return clv; }
-
-//BOOST_RV_REF overload
-void sink(::boost::rv<sink_tester> &) { std::cout << "non-const rvalue catched" << std::endl; }
-//BOOST_COPY_ASSIGN_REF overload
-void sink(const ::boost::rv<sink_tester> &){ std::cout << "const (r-l)value catched" << std::endl; }
-//Overload provided by BOOST_COPYABLE_AND_MOVABLE
-void sink(sink_tester &) { std::cout << "non-const lvalue catched" << std::endl; }
-
-int main()
-{
- sink(const_rvalue()); //"const (r-l)value catched"
- sink(const_lvalue()); //"const (r-l)value catched"
- sink(lvalue()); //"non-const lvalue catched"
- sink(rvalue()); //"non-const rvalue catched"
- return 0;
-}
-//]
-
-#endif
-

Deleted: sandbox/move/libs/move/example/doc_move_algorithms.cpp
==============================================================================
--- sandbox/move/libs/move/example/doc_move_algorithms.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,41 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2009.
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/move for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-//[move_algorithms_example
-#include "movable.hpp"
-#include <cassert>
-#include <boost/aligned_storage.hpp>
-
-int main()
-{
- const std::size_t ArraySize = 10;
- movable movable_array[ArraySize];
- movable movable_array2[ArraySize];
- //move
- boost::move(&movable_array2[0], &movable_array2[ArraySize], &movable_array[0]);
- assert(movable_array2[0].moved());
- assert(!movable_array[0].moved());
-
- //move backward
- boost::move_backward(&movable_array[0], &movable_array[ArraySize], &movable_array2[ArraySize]);
- assert(movable_array[0].moved());
- assert(!movable_array2[0].moved());
-
- //uninitialized_move
- boost::aligned_storage< sizeof(movable)*ArraySize
- , boost::alignment_of<movable>::value>::type storage;
- movable *raw_movable = static_cast<movable*>(static_cast<void*>(&storage));
- boost::uninitialized_move(&movable_array2[0], &movable_array2[ArraySize], raw_movable);
- assert(movable_array2[0].moved());
- assert(!raw_movable[0].moved());
- return 0;
-}
-//]

Deleted: sandbox/move/libs/move/example/doc_move_inserter.cpp
==============================================================================
--- sandbox/move/libs/move/example/doc_move_inserter.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,48 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2009.
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/move for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-//[move_inserter_example
-#include <boost/container/list.hpp>
-#include "movable.hpp"
-#include <cassert>
-
-using namespace boost::container;
-
-typedef list<movable> list_t;
-typedef list_t::iterator l_iterator;
-
-template<class MoveInsertIterator>
-void test_move_inserter(list_t &l2, MoveInsertIterator mit)
-{
- //Create a list with 10 default constructed objects
- list<movable> l(10);
- assert(!l.begin()->moved());
- l2.clear();
-
- //Move construct
- for(l_iterator itbeg = l.begin(), itend = l.end(); itbeg != itend; ++itbeg){
- *mit = *itbeg;
- }
- //Check size and status
- assert(l2.size() == l.size());
- assert(l.begin()->moved());
- assert(!l2.begin()->moved());
-}
-
-int main()
-{
- list_t l2;
- test_move_inserter(l2, boost::back_move_inserter(l2));
- test_move_inserter(l2, boost::front_move_inserter(l2));
- test_move_inserter(l2, boost::move_inserter(l2, l2.end()));
- return 0;
-}
-//]

Deleted: sandbox/move/libs/move/example/doc_move_iterator.cpp
==============================================================================
--- sandbox/move/libs/move/example/doc_move_iterator.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,39 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2009.
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/move for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-//[move_iterator_example
-#include <boost/container/vector.hpp>
-#include "movable.hpp"
-#include <cassert>
-
-int main()
-{
- using namespace boost::container;
-
- //Create a vector with 10 default constructed objects
- vector<movable> v(10);
- assert(!v[0].moved());
-
- //Move construct all elements in v into v2
- vector<movable> v2( boost::make_move_iterator(v.begin())
- , boost::make_move_iterator(v.end()));
- assert(v[0].moved());
- assert(!v2[0].moved());
-
- //Now move assign all elements from in v2 back into v
- v.assign( boost::make_move_iterator(v2.begin())
- , boost::make_move_iterator(v2.end()));
- assert(v2[0].moved());
- assert(!v[0].moved());
-
- return 0;
-}
-//]

Deleted: sandbox/move/libs/move/example/movable.hpp
==============================================================================
--- sandbox/move/libs/move/example/movable.hpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,49 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2009.
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/move for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-#ifndef BOOST_MOVE_TEST_MOVABLE_HPP
-#define BOOST_MOVE_TEST_MOVABLE_HPP
-
-//[movable_definition
-//header file "movable.hpp"
-#include <boost/move/move.hpp>
-
-//A movable class
-class movable
-{
- BOOST_MOVABLE_BUT_NOT_COPYABLE(movable)
- int value_;
-
- public:
- movable() : value_(1){}
-
- //Move constructor and assignment
- movable(BOOST_RV_REF(movable) m)
- { value_ = m.value_; m.value_ = 0; }
-
- movable & operator=(BOOST_RV_REF(movable) m)
- { value_ = m.value_; m.value_ = 0; return *this; }
-
- bool moved() const //Observer
- { return value_ == 0; }
-};
-
-namespace boost{
-
-template<>
-struct has_nothrow_move<movable>
-{
- static const bool value = true;
-};
-
-} //namespace boost{
-//]
-
-#endif //BOOST_MOVE_TEST_MOVABLE_HPP

Deleted: sandbox/move/libs/move/proj/vc7ide/Move.sln
==============================================================================
--- sandbox/move/libs/move/proj/vc7ide/Move.sln 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,130 +0,0 @@
-Microsoft Visual Studio Solution File, Format Version 8.00
-Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "construct_forward_test", "construct_forward_test.vcproj", "{CD57C283-1862-42FE-BF87-B96D3A2A7912}"
- ProjectSection(ProjectDependencies) = postProject
- EndProjectSection
-EndProject
-Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "move_iterator_test", "move_iterator_test.vcproj", "{C8AD2618-79EB-8612-42FE-2A3AC9667A13}"
- ProjectSection(ProjectDependencies) = postProject
- EndProjectSection
-EndProject
-Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "move_test", "move_test.vcproj", "{CD57C283-1862-42FE-BF87-B96D3A2A7912}"
- ProjectSection(ProjectDependencies) = postProject
- EndProjectSection
-EndProject
-Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "move_algorithm_test", "move_algorithm.vcproj", "{C8AD2618-79EB-8612-42FE-2A3AC9667A13}"
- ProjectSection(ProjectDependencies) = postProject
- EndProjectSection
-EndProject
-Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "doc_clone_ptr", "doc_clone_ptr.vcproj", "{CD57C283-1862-42FE-BF87-B96D3A2A7912}"
- ProjectSection(ProjectDependencies) = postProject
- EndProjectSection
-EndProject
-Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "doc_file_descriptor", "doc_file_descriptor.vcproj", "{CD57C283-1862-42FE-BF87-B96D3A2A7912}"
- ProjectSection(ProjectDependencies) = postProject
- EndProjectSection
-EndProject
-Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "doc_move_iterator", "doc_move_iterator.vcproj", "{CD57C283-1862-42FE-BF87-B96D3A2A7912}"
- ProjectSection(ProjectDependencies) = postProject
- EndProjectSection
-EndProject
-Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "doc_move_inserter", "doc_move_inserter.vcproj", "{CD57C283-1862-42FE-BF87-B96D3A2A7912}"
- ProjectSection(ProjectDependencies) = postProject
- EndProjectSection
-EndProject
-Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "doc_move_algorithms", "doc_move_algorithms.vcproj", "{CD57C283-1862-42FE-BF87-B96D3A2A7912}"
- ProjectSection(ProjectDependencies) = postProject
- EndProjectSection
-EndProject
-Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "doc_construct_forward", "doc_construct_forward.vcproj", "{CD57C283-1862-42FE-BF87-B96D3A2A7912}"
- ProjectSection(ProjectDependencies) = postProject
- EndProjectSection
-EndProject
-Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "back_move_inserter_test", "back_move_inserter_test.vcproj", "{C8AD2618-79EB-8612-42FE-2A3AC9667A13}"
- ProjectSection(ProjectDependencies) = postProject
- EndProjectSection
-EndProject
-Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "copy_move_optimization_test", "copy_move_optimization.vcproj", "{C8AD2618-79EB-8612-42FE-2A3AC9667A13}"
- ProjectSection(ProjectDependencies) = postProject
- EndProjectSection
-EndProject
-Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "copy_elision_test_test", "copy_elision_test.vcproj", "{C8AD2618-79EB-8612-42FE-2A3AC9667A13}"
- ProjectSection(ProjectDependencies) = postProject
- EndProjectSection
-EndProject
-Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "doc_how_works", "doc_how_works.vcproj", "{C7C2F583-4FE2-1862-BF87-BA26D31A7995}"
- ProjectSection(ProjectDependencies) = postProject
- EndProjectSection
-EndProject
-Global
- GlobalSection(SolutionConfiguration) = preSolution
- Debug = Debug
- Release = Release
- EndGlobalSection
- GlobalSection(ProjectConfiguration) = postSolution
- {CD57C283-1862-42FE-BF87-B96D3A2A7912}.Debug.ActiveCfg = Debug|Win32
- {CD57C283-1862-42FE-BF87-B96D3A2A7912}.Debug.Build.0 = Debug|Win32
- {CD57C283-1862-42FE-BF87-B96D3A2A7912}.Release.ActiveCfg = Release|Win32
- {CD57C283-1862-42FE-BF87-B96D3A2A7912}.Release.Build.0 = Release|Win32
- {C8AD2618-79EB-8612-42FE-2A3AC9667A13}.Debug.ActiveCfg = Debug|Win32
- {C8AD2618-79EB-8612-42FE-2A3AC9667A13}.Debug.Build.0 = Debug|Win32
- {C8AD2618-79EB-8612-42FE-2A3AC9667A13}.Release.ActiveCfg = Release|Win32
- {C8AD2618-79EB-8612-42FE-2A3AC9667A13}.Release.Build.0 = Release|Win32
- {CD57C283-1862-42FE-BF87-B96D3A2A7912}.Debug.ActiveCfg = Debug|Win32
- {CD57C283-1862-42FE-BF87-B96D3A2A7912}.Debug.Build.0 = Debug|Win32
- {CD57C283-1862-42FE-BF87-B96D3A2A7912}.Release.ActiveCfg = Release|Win32
- {CD57C283-1862-42FE-BF87-B96D3A2A7912}.Release.Build.0 = Release|Win32
- {C8AD2618-79EB-8612-42FE-2A3AC9667A13}.Debug.ActiveCfg = Debug|Win32
- {C8AD2618-79EB-8612-42FE-2A3AC9667A13}.Debug.Build.0 = Debug|Win32
- {C8AD2618-79EB-8612-42FE-2A3AC9667A13}.Release.ActiveCfg = Release|Win32
- {C8AD2618-79EB-8612-42FE-2A3AC9667A13}.Release.Build.0 = Release|Win32
- {CD57C283-1862-42FE-BF87-B96D3A2A7912}.Debug.ActiveCfg = Debug|Win32
- {CD57C283-1862-42FE-BF87-B96D3A2A7912}.Debug.Build.0 = Debug|Win32
- {CD57C283-1862-42FE-BF87-B96D3A2A7912}.Release.ActiveCfg = Release|Win32
- {CD57C283-1862-42FE-BF87-B96D3A2A7912}.Release.Build.0 = Release|Win32
- {CD57C283-1862-42FE-BF87-B96D3A2A7912}.Debug.ActiveCfg = Debug|Win32
- {CD57C283-1862-42FE-BF87-B96D3A2A7912}.Debug.Build.0 = Debug|Win32
- {CD57C283-1862-42FE-BF87-B96D3A2A7912}.Release.ActiveCfg = Release|Win32
- {CD57C283-1862-42FE-BF87-B96D3A2A7912}.Release.Build.0 = Release|Win32
- {CD57C283-1862-42FE-BF87-B96D3A2A7912}.Debug.ActiveCfg = Debug|Win32
- {CD57C283-1862-42FE-BF87-B96D3A2A7912}.Debug.Build.0 = Debug|Win32
- {CD57C283-1862-42FE-BF87-B96D3A2A7912}.Release.ActiveCfg = Release|Win32
- {CD57C283-1862-42FE-BF87-B96D3A2A7912}.Release.Build.0 = Release|Win32
- {CD57C283-1862-42FE-BF87-B96D3A2A7912}.Debug.ActiveCfg = Debug|Win32
- {CD57C283-1862-42FE-BF87-B96D3A2A7912}.Debug.Build.0 = Debug|Win32
- {CD57C283-1862-42FE-BF87-B96D3A2A7912}.Release.ActiveCfg = Release|Win32
- {CD57C283-1862-42FE-BF87-B96D3A2A7912}.Release.Build.0 = Release|Win32
- {CD57C283-1862-42FE-BF87-B96D3A2A7912}.Debug.ActiveCfg = Debug|Win32
- {CD57C283-1862-42FE-BF87-B96D3A2A7912}.Debug.Build.0 = Debug|Win32
- {CD57C283-1862-42FE-BF87-B96D3A2A7912}.Release.ActiveCfg = Release|Win32
- {CD57C283-1862-42FE-BF87-B96D3A2A7912}.Release.Build.0 = Release|Win32
- {CD57C283-1862-42FE-BF87-B96D3A2A7912}.Debug.ActiveCfg = Debug|Win32
- {CD57C283-1862-42FE-BF87-B96D3A2A7912}.Debug.Build.0 = Debug|Win32
- {CD57C283-1862-42FE-BF87-B96D3A2A7912}.Release.ActiveCfg = Release|Win32
- {CD57C283-1862-42FE-BF87-B96D3A2A7912}.Release.Build.0 = Release|Win32
- {C8AD2618-79EB-8612-42FE-2A3AC9667A13}.Debug.ActiveCfg = Debug|Win32
- {C8AD2618-79EB-8612-42FE-2A3AC9667A13}.Debug.Build.0 = Debug|Win32
- {C8AD2618-79EB-8612-42FE-2A3AC9667A13}.Release.ActiveCfg = Release|Win32
- {C8AD2618-79EB-8612-42FE-2A3AC9667A13}.Release.Build.0 = Release|Win32
- {C8AD2618-79EB-8612-42FE-2A3AC9667A13}.Debug.ActiveCfg = Debug|Win32
- {C8AD2618-79EB-8612-42FE-2A3AC9667A13}.Debug.Build.0 = Debug|Win32
- {C8AD2618-79EB-8612-42FE-2A3AC9667A13}.Release.ActiveCfg = Release|Win32
- {C8AD2618-79EB-8612-42FE-2A3AC9667A13}.Release.Build.0 = Release|Win32
- {C8AD2618-79EB-8612-42FE-2A3AC9667A13}.Debug.ActiveCfg = Debug|Win32
- {C8AD2618-79EB-8612-42FE-2A3AC9667A13}.Debug.Build.0 = Debug|Win32
- {C8AD2618-79EB-8612-42FE-2A3AC9667A13}.Release.ActiveCfg = Release|Win32
- {C8AD2618-79EB-8612-42FE-2A3AC9667A13}.Release.Build.0 = Release|Win32
- {C7C2F583-4FE2-1862-BF87-BA26D31A7995}.Debug.ActiveCfg = Debug|Win32
- {C7C2F583-4FE2-1862-BF87-BA26D31A7995}.Debug.Build.0 = Debug|Win32
- {C7C2F583-4FE2-1862-BF87-BA26D31A7995}.Release.ActiveCfg = Release|Win32
- {C7C2F583-4FE2-1862-BF87-BA26D31A7995}.Release.Build.0 = Release|Win32
- EndGlobalSection
- GlobalSection(SolutionItems) = postSolution
- ..\..\doc\Jamfile.v2 = ..\..\doc\Jamfile.v2
- ..\..\..\..\boost\move\move.hpp = ..\..\..\..\boost\move\move.hpp
- ..\..\doc\move.qbk = ..\..\doc\move.qbk
- EndGlobalSection
- GlobalSection(ExtensibilityGlobals) = postSolution
- EndGlobalSection
- GlobalSection(ExtensibilityAddIns) = postSolution
- EndGlobalSection
-EndGlobal

Deleted: sandbox/move/libs/move/proj/vc7ide/back_move_inserter_test.vcproj
==============================================================================
--- sandbox/move/libs/move/proj/vc7ide/back_move_inserter_test.vcproj 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,134 +0,0 @@
-<?xml version="1.0" encoding="Windows-1252"?>
-<VisualStudioProject
- ProjectType="Visual C++"
- Version="7.10"
- Name="back_move_inserter_test"
- ProjectGUID="{C8AD2618-79EB-8612-42FE-2A3AC9667A13}"
- Keyword="Win32Proj">
- <Platforms>
- <Platform
- Name="Win32"/>
- </Platforms>
- <Configurations>
- <Configuration
- Name="Debug|Win32"
- OutputDirectory="../../Bin/Win32/Debug"
- IntermediateDirectory="Debug/back_move_inserter_test"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- Optimization="0"
- AdditionalIncludeDirectories="../../../.."
- PreprocessorDefinitions="WIN32;_DEBUG;_CONSOLE;BOOST_DATE_TIME_NO_LIB"
- MinimalRebuild="TRUE"
- BasicRuntimeChecks="3"
- RuntimeLibrary="3"
- DisableLanguageExtensions="FALSE"
- TreatWChar_tAsBuiltInType="TRUE"
- ForceConformanceInForLoopScope="TRUE"
- UsePrecompiledHeader="0"
- WarningLevel="4"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="3"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- AdditionalDependencies="winmm.lib"
- OutputFile="$(OutDir)/back_move_inserter_test_d.exe"
- LinkIncremental="1"
- AdditionalLibraryDirectories="../../../../stage/lib"
- GenerateDebugInformation="TRUE"
- ProgramDatabaseFile="$(OutDir)/back_move_inserter_test.pdb"
- SubSystem="1"
- TargetMachine="1"
- FixedBaseAddress="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- <Configuration
- Name="Release|Win32"
- OutputDirectory="../../Bin/Win32/Release"
- IntermediateDirectory="Release/back_move_inserter_test"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- AdditionalIncludeDirectories="../../../.."
- PreprocessorDefinitions="WIN32;NDEBUG;_CONSOLE;BOOST_DATE_TIME_NO_LIB"
- RuntimeLibrary="2"
- TreatWChar_tAsBuiltInType="TRUE"
- ForceConformanceInForLoopScope="FALSE"
- UsePrecompiledHeader="0"
- WarningLevel="4"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="0"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- AdditionalDependencies="winmm.lib"
- OutputFile="$(OutDir)/back_move_inserter_test.exe"
- LinkIncremental="1"
- AdditionalLibraryDirectories="../../../../stage/lib"
- GenerateDebugInformation="TRUE"
- SubSystem="1"
- OptimizeReferences="2"
- EnableCOMDATFolding="2"
- TargetMachine="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- </Configurations>
- <References>
- </References>
- <Files>
- <Filter
- Name="Source Files"
- Filter="cpp;c;cxx;def;odl;idl;hpj;bat;asm;asmx"
- UniqueIdentifier="{818563C3-6640-0A65-55CB-202E5BAD7FAF}">
- <File
- RelativePath="..\..\test\back_move_inserter.cpp">
- </File>
- </Filter>
- </Files>
- <Globals>
- </Globals>
-</VisualStudioProject>

Deleted: sandbox/move/libs/move/proj/vc7ide/construct_forward_test.vcproj
==============================================================================
--- sandbox/move/libs/move/proj/vc7ide/construct_forward_test.vcproj 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,134 +0,0 @@
-<?xml version="1.0" encoding="Windows-1252"?>
-<VisualStudioProject
- ProjectType="Visual C++"
- Version="7.10"
- Name="construct_forward_test"
- ProjectGUID="{C8AD2618-79EB-8612-42FE-2A3AC9667A13}"
- Keyword="Win32Proj">
- <Platforms>
- <Platform
- Name="Win32"/>
- </Platforms>
- <Configurations>
- <Configuration
- Name="Debug|Win32"
- OutputDirectory="../../Bin/Win32/Debug"
- IntermediateDirectory="Debug/construct_forward_test"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- Optimization="0"
- AdditionalIncludeDirectories="../../../.."
- PreprocessorDefinitions="WIN32;_DEBUG;_CONSOLE;BOOST_DATE_TIME_NO_LIB"
- MinimalRebuild="TRUE"
- BasicRuntimeChecks="3"
- RuntimeLibrary="3"
- DisableLanguageExtensions="TRUE"
- TreatWChar_tAsBuiltInType="TRUE"
- ForceConformanceInForLoopScope="TRUE"
- UsePrecompiledHeader="0"
- WarningLevel="4"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="3"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- AdditionalDependencies="winmm.lib"
- OutputFile="$(OutDir)/construct_forward_test_d.exe"
- LinkIncremental="1"
- AdditionalLibraryDirectories="../../../../stage/lib"
- GenerateDebugInformation="TRUE"
- ProgramDatabaseFile="$(OutDir)/construct_forward_test.pdb"
- SubSystem="1"
- TargetMachine="1"
- FixedBaseAddress="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- <Configuration
- Name="Release|Win32"
- OutputDirectory="../../Bin/Win32/Release"
- IntermediateDirectory="Release/construct_forward_test"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- AdditionalIncludeDirectories="../../../.."
- PreprocessorDefinitions="WIN32;NDEBUG;_CONSOLE;BOOST_DATE_TIME_NO_LIB"
- RuntimeLibrary="2"
- TreatWChar_tAsBuiltInType="TRUE"
- ForceConformanceInForLoopScope="FALSE"
- UsePrecompiledHeader="0"
- WarningLevel="4"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="0"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- AdditionalDependencies="winmm.lib"
- OutputFile="$(OutDir)/construct_forward_test.exe"
- LinkIncremental="1"
- AdditionalLibraryDirectories="../../../../stage/lib"
- GenerateDebugInformation="TRUE"
- SubSystem="1"
- OptimizeReferences="2"
- EnableCOMDATFolding="2"
- TargetMachine="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- </Configurations>
- <References>
- </References>
- <Files>
- <Filter
- Name="Source Files"
- Filter="cpp;c;cxx;def;odl;idl;hpj;bat;asm;asmx"
- UniqueIdentifier="{818563C3-6640-0A65-55CB-202E5BAD7FAF}">
- <File
- RelativePath="..\..\test\construct_forward.cpp">
- </File>
- </Filter>
- </Files>
- <Globals>
- </Globals>
-</VisualStudioProject>

Deleted: sandbox/move/libs/move/proj/vc7ide/copy_elision_test.vcproj
==============================================================================
--- sandbox/move/libs/move/proj/vc7ide/copy_elision_test.vcproj 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,134 +0,0 @@
-<?xml version="1.0" encoding="Windows-1252"?>
-<VisualStudioProject
- ProjectType="Visual C++"
- Version="7.10"
- Name="copy_elision_test_test"
- ProjectGUID="{C8AD2618-79EB-8612-42FE-2A3AC9667A13}"
- Keyword="Win32Proj">
- <Platforms>
- <Platform
- Name="Win32"/>
- </Platforms>
- <Configurations>
- <Configuration
- Name="Debug|Win32"
- OutputDirectory="../../Bin/Win32/Debug"
- IntermediateDirectory="Debug/copy_elision_test_test"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- Optimization="0"
- AdditionalIncludeDirectories="../../../.."
- PreprocessorDefinitions="WIN32;_DEBUG;_CONSOLE;BOOST_DATE_TIME_NO_LIB"
- MinimalRebuild="TRUE"
- BasicRuntimeChecks="3"
- RuntimeLibrary="3"
- DisableLanguageExtensions="FALSE"
- TreatWChar_tAsBuiltInType="TRUE"
- ForceConformanceInForLoopScope="TRUE"
- UsePrecompiledHeader="0"
- WarningLevel="4"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="3"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- AdditionalDependencies="winmm.lib"
- OutputFile="$(OutDir)/copy_elision_test_test_d.exe"
- LinkIncremental="1"
- AdditionalLibraryDirectories="../../../../stage/lib"
- GenerateDebugInformation="TRUE"
- ProgramDatabaseFile="$(OutDir)/copy_elision_test_test.pdb"
- SubSystem="1"
- TargetMachine="1"
- FixedBaseAddress="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- <Configuration
- Name="Release|Win32"
- OutputDirectory="../../Bin/Win32/Release"
- IntermediateDirectory="Release/copy_elision_test_test"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- AdditionalIncludeDirectories="../../../.."
- PreprocessorDefinitions="WIN32;NDEBUG;_CONSOLE;BOOST_DATE_TIME_NO_LIB"
- RuntimeLibrary="2"
- TreatWChar_tAsBuiltInType="TRUE"
- ForceConformanceInForLoopScope="FALSE"
- UsePrecompiledHeader="0"
- WarningLevel="4"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="0"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- AdditionalDependencies="winmm.lib"
- OutputFile="$(OutDir)/copy_elision_test_test.exe"
- LinkIncremental="1"
- AdditionalLibraryDirectories="../../../../stage/lib"
- GenerateDebugInformation="TRUE"
- SubSystem="1"
- OptimizeReferences="2"
- EnableCOMDATFolding="2"
- TargetMachine="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- </Configurations>
- <References>
- </References>
- <Files>
- <Filter
- Name="Source Files"
- Filter="cpp;c;cxx;def;odl;idl;hpj;bat;asm;asmx"
- UniqueIdentifier="{818563C3-6640-0A65-55CB-202E5BAD7FAF}">
- <File
- RelativePath="..\..\test\copy_elision_test.cpp">
- </File>
- </Filter>
- </Files>
- <Globals>
- </Globals>
-</VisualStudioProject>

Deleted: sandbox/move/libs/move/proj/vc7ide/copy_move_optimization.vcproj
==============================================================================
--- sandbox/move/libs/move/proj/vc7ide/copy_move_optimization.vcproj 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,134 +0,0 @@
-<?xml version="1.0" encoding="Windows-1252"?>
-<VisualStudioProject
- ProjectType="Visual C++"
- Version="7.10"
- Name="copy_move_optimization_test"
- ProjectGUID="{C8AD2618-79EB-8612-42FE-2A3AC9667A13}"
- Keyword="Win32Proj">
- <Platforms>
- <Platform
- Name="Win32"/>
- </Platforms>
- <Configurations>
- <Configuration
- Name="Debug|Win32"
- OutputDirectory="../../Bin/Win32/Debug"
- IntermediateDirectory="Debug/copy_move_optimization_test"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- Optimization="0"
- AdditionalIncludeDirectories="../../../.."
- PreprocessorDefinitions="WIN32;_DEBUG;_CONSOLE;BOOST_DATE_TIME_NO_LIB"
- MinimalRebuild="TRUE"
- BasicRuntimeChecks="3"
- RuntimeLibrary="3"
- DisableLanguageExtensions="FALSE"
- TreatWChar_tAsBuiltInType="TRUE"
- ForceConformanceInForLoopScope="TRUE"
- UsePrecompiledHeader="0"
- WarningLevel="4"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="3"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- AdditionalDependencies="winmm.lib"
- OutputFile="$(OutDir)/copy_move_optimization_test_d.exe"
- LinkIncremental="1"
- AdditionalLibraryDirectories="../../../../stage/lib"
- GenerateDebugInformation="TRUE"
- ProgramDatabaseFile="$(OutDir)/copy_move_optimization_test.pdb"
- SubSystem="1"
- TargetMachine="1"
- FixedBaseAddress="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- <Configuration
- Name="Release|Win32"
- OutputDirectory="../../Bin/Win32/Release"
- IntermediateDirectory="Release/copy_move_optimization_test"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- AdditionalIncludeDirectories="../../../.."
- PreprocessorDefinitions="WIN32;NDEBUG;_CONSOLE;BOOST_DATE_TIME_NO_LIB"
- RuntimeLibrary="2"
- TreatWChar_tAsBuiltInType="TRUE"
- ForceConformanceInForLoopScope="FALSE"
- UsePrecompiledHeader="0"
- WarningLevel="4"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="0"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- AdditionalDependencies="winmm.lib"
- OutputFile="$(OutDir)/copy_move_optimization_test.exe"
- LinkIncremental="1"
- AdditionalLibraryDirectories="../../../../stage/lib"
- GenerateDebugInformation="TRUE"
- SubSystem="1"
- OptimizeReferences="2"
- EnableCOMDATFolding="2"
- TargetMachine="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- </Configurations>
- <References>
- </References>
- <Files>
- <Filter
- Name="Source Files"
- Filter="cpp;c;cxx;def;odl;idl;hpj;bat;asm;asmx"
- UniqueIdentifier="{818563C3-6640-0A65-55CB-202E5BAD7FAF}">
- <File
- RelativePath="..\..\test\copy_move_optimization.cpp">
- </File>
- </Filter>
- </Files>
- <Globals>
- </Globals>
-</VisualStudioProject>

Deleted: sandbox/move/libs/move/proj/vc7ide/doc_clone_ptr.vcproj
==============================================================================
--- sandbox/move/libs/move/proj/vc7ide/doc_clone_ptr.vcproj 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,139 +0,0 @@
-<?xml version="1.0" encoding="Windows-1252"?>
-<VisualStudioProject
- ProjectType="Visual C++"
- Version="7.10"
- Name="doc_clone_ptr"
- ProjectGUID="{CD57C283-1862-42FE-BF87-B96D3A2A7912}"
- Keyword="Win32Proj">
- <Platforms>
- <Platform
- Name="Win32"/>
- </Platforms>
- <Configurations>
- <Configuration
- Name="Debug|Win32"
- OutputDirectory="../../Bin/Win32/Debug"
- IntermediateDirectory="Debug/doc_clone_ptr"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- Optimization="0"
- AdditionalIncludeDirectories="../../../.."
- PreprocessorDefinitions="WIN32;_DEBUG;_CONSOLE;BOOST_DATE_TIME_NO_LIB"
- MinimalRebuild="TRUE"
- BasicRuntimeChecks="3"
- RuntimeLibrary="3"
- DisableLanguageExtensions="TRUE"
- TreatWChar_tAsBuiltInType="TRUE"
- ForceConformanceInForLoopScope="TRUE"
- UsePrecompiledHeader="0"
- WarningLevel="4"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="3"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- AdditionalDependencies="winmm.lib"
- OutputFile="$(OutDir)/doc_clone_ptr_d.exe"
- LinkIncremental="1"
- AdditionalLibraryDirectories="../../../../stage/lib"
- GenerateDebugInformation="TRUE"
- ProgramDatabaseFile="$(OutDir)/doc_clone_ptr.pdb"
- SubSystem="1"
- TargetMachine="1"
- FixedBaseAddress="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- <Configuration
- Name="Release|Win32"
- OutputDirectory="../../Bin/Win32/Release"
- IntermediateDirectory="Release/doc_clone_ptr"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- AdditionalIncludeDirectories="../../../.."
- PreprocessorDefinitions="WIN32;NDEBUG;_CONSOLE;BOOST_DATE_TIME_NO_LIB"
- RuntimeLibrary="2"
- TreatWChar_tAsBuiltInType="TRUE"
- ForceConformanceInForLoopScope="FALSE"
- UsePrecompiledHeader="0"
- WarningLevel="4"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="0"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- AdditionalDependencies="winmm.lib"
- OutputFile="$(OutDir)/doc_clone_ptr.exe"
- LinkIncremental="1"
- AdditionalLibraryDirectories="../../../../stage/lib"
- GenerateDebugInformation="TRUE"
- SubSystem="1"
- OptimizeReferences="2"
- EnableCOMDATFolding="2"
- TargetMachine="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- </Configurations>
- <References>
- </References>
- <Files>
- <Filter
- Name="Source Files"
- Filter="cpp;c;cxx;def;odl;idl;hpj;bat;asm;asmx"
- UniqueIdentifier="{34957FC1-7BC5-1646-05A6-27542AA2A2FF}">
- <File
- RelativePath="..\..\example\doc_clone_ptr.cpp">
- </File>
- </Filter>
- <Filter
- Name="Header Files"
- Filter="h;hpp;hxx;hm;inl;inc;xsd"
- UniqueIdentifier="{93A78280-B78D-4B31-7E8B-6255ACE1E5FB}">
- </Filter>
- </Files>
- <Globals>
- </Globals>
-</VisualStudioProject>

Deleted: sandbox/move/libs/move/proj/vc7ide/doc_construct_forward.vcproj
==============================================================================
--- sandbox/move/libs/move/proj/vc7ide/doc_construct_forward.vcproj 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,139 +0,0 @@
-<?xml version="1.0" encoding="Windows-1252"?>
-<VisualStudioProject
- ProjectType="Visual C++"
- Version="7.10"
- Name="doc_construct_forward"
- ProjectGUID="{CD57C283-1862-42FE-BF87-B96D3A2A7912}"
- Keyword="Win32Proj">
- <Platforms>
- <Platform
- Name="Win32"/>
- </Platforms>
- <Configurations>
- <Configuration
- Name="Debug|Win32"
- OutputDirectory="../../Bin/Win32/Debug"
- IntermediateDirectory="Debug/doc_construct_forward"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- Optimization="0"
- AdditionalIncludeDirectories="../../../.."
- PreprocessorDefinitions="WIN32;_DEBUG;_CONSOLE;BOOST_DATE_TIME_NO_LIB"
- MinimalRebuild="TRUE"
- BasicRuntimeChecks="3"
- RuntimeLibrary="3"
- DisableLanguageExtensions="FALSE"
- TreatWChar_tAsBuiltInType="TRUE"
- ForceConformanceInForLoopScope="TRUE"
- UsePrecompiledHeader="0"
- WarningLevel="4"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="3"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- AdditionalDependencies="winmm.lib"
- OutputFile="$(OutDir)/doc_construct_forward_d.exe"
- LinkIncremental="1"
- AdditionalLibraryDirectories="../../../../stage/lib"
- GenerateDebugInformation="TRUE"
- ProgramDatabaseFile="$(OutDir)/doc_construct_forward.pdb"
- SubSystem="1"
- TargetMachine="1"
- FixedBaseAddress="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- <Configuration
- Name="Release|Win32"
- OutputDirectory="../../Bin/Win32/Release"
- IntermediateDirectory="Release/doc_construct_forward"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- AdditionalIncludeDirectories="../../../.."
- PreprocessorDefinitions="WIN32;NDEBUG;_CONSOLE;BOOST_DATE_TIME_NO_LIB"
- RuntimeLibrary="2"
- TreatWChar_tAsBuiltInType="TRUE"
- ForceConformanceInForLoopScope="FALSE"
- UsePrecompiledHeader="0"
- WarningLevel="4"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="0"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- AdditionalDependencies="winmm.lib"
- OutputFile="$(OutDir)/doc_construct_forward.exe"
- LinkIncremental="1"
- AdditionalLibraryDirectories="../../../../stage/lib"
- GenerateDebugInformation="TRUE"
- SubSystem="1"
- OptimizeReferences="2"
- EnableCOMDATFolding="2"
- TargetMachine="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- </Configurations>
- <References>
- </References>
- <Files>
- <Filter
- Name="Source Files"
- Filter="cpp;c;cxx;def;odl;idl;hpj;bat;asm;asmx"
- UniqueIdentifier="{34957FC1-7BC5-1646-05A6-27542AA2A2FF}">
- <File
- RelativePath="..\..\example\doc_construct_forward.cpp">
- </File>
- </Filter>
- <Filter
- Name="Header Files"
- Filter="h;hpp;hxx;hm;inl;inc;xsd"
- UniqueIdentifier="{93A78280-B78D-4B31-7E8B-6255ACE1E5FB}">
- </Filter>
- </Files>
- <Globals>
- </Globals>
-</VisualStudioProject>

Deleted: sandbox/move/libs/move/proj/vc7ide/doc_file_descriptor.vcproj
==============================================================================
--- sandbox/move/libs/move/proj/vc7ide/doc_file_descriptor.vcproj 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,139 +0,0 @@
-<?xml version="1.0" encoding="Windows-1252"?>
-<VisualStudioProject
- ProjectType="Visual C++"
- Version="7.10"
- Name="doc_file_descriptor"
- ProjectGUID="{CD57C283-1862-42FE-BF87-B96D3A2A7912}"
- Keyword="Win32Proj">
- <Platforms>
- <Platform
- Name="Win32"/>
- </Platforms>
- <Configurations>
- <Configuration
- Name="Debug|Win32"
- OutputDirectory="../../Bin/Win32/Debug"
- IntermediateDirectory="Debug/doc_file_descriptor"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- Optimization="0"
- AdditionalIncludeDirectories="../../../.."
- PreprocessorDefinitions="WIN32;_DEBUG;_CONSOLE;BOOST_DATE_TIME_NO_LIB"
- MinimalRebuild="TRUE"
- BasicRuntimeChecks="3"
- RuntimeLibrary="3"
- DisableLanguageExtensions="FALSE"
- TreatWChar_tAsBuiltInType="TRUE"
- ForceConformanceInForLoopScope="TRUE"
- UsePrecompiledHeader="0"
- WarningLevel="4"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="3"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- AdditionalDependencies="winmm.lib"
- OutputFile="$(OutDir)/doc_file_descriptor_d.exe"
- LinkIncremental="1"
- AdditionalLibraryDirectories="../../../../stage/lib"
- GenerateDebugInformation="TRUE"
- ProgramDatabaseFile="$(OutDir)/doc_file_descriptor.pdb"
- SubSystem="1"
- TargetMachine="1"
- FixedBaseAddress="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- <Configuration
- Name="Release|Win32"
- OutputDirectory="../../Bin/Win32/Release"
- IntermediateDirectory="Release/doc_file_descriptor"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- AdditionalIncludeDirectories="../../../.."
- PreprocessorDefinitions="WIN32;NDEBUG;_CONSOLE;BOOST_DATE_TIME_NO_LIB"
- RuntimeLibrary="2"
- TreatWChar_tAsBuiltInType="TRUE"
- ForceConformanceInForLoopScope="FALSE"
- UsePrecompiledHeader="0"
- WarningLevel="4"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="0"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- AdditionalDependencies="winmm.lib"
- OutputFile="$(OutDir)/doc_file_descriptor.exe"
- LinkIncremental="1"
- AdditionalLibraryDirectories="../../../../stage/lib"
- GenerateDebugInformation="TRUE"
- SubSystem="1"
- OptimizeReferences="2"
- EnableCOMDATFolding="2"
- TargetMachine="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- </Configurations>
- <References>
- </References>
- <Files>
- <Filter
- Name="Source Files"
- Filter="cpp;c;cxx;def;odl;idl;hpj;bat;asm;asmx"
- UniqueIdentifier="{34957FC1-7BC5-1646-05A6-27542AA2A2FF}">
- <File
- RelativePath="..\..\example\doc_file_descriptor.cpp">
- </File>
- </Filter>
- <Filter
- Name="Header Files"
- Filter="h;hpp;hxx;hm;inl;inc;xsd"
- UniqueIdentifier="{93A78280-B78D-4B31-7E8B-6255ACE1E5FB}">
- </Filter>
- </Files>
- <Globals>
- </Globals>
-</VisualStudioProject>

Deleted: sandbox/move/libs/move/proj/vc7ide/doc_how_works.vcproj
==============================================================================
--- sandbox/move/libs/move/proj/vc7ide/doc_how_works.vcproj 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,139 +0,0 @@
-<?xml version="1.0" encoding="Windows-1252"?>
-<VisualStudioProject
- ProjectType="Visual C++"
- Version="7.10"
- Name="doc_how_works"
- ProjectGUID="{C7C2F583-4FE2-1862-BF87-BA26D31A7995}"
- Keyword="Win32Proj">
- <Platforms>
- <Platform
- Name="Win32"/>
- </Platforms>
- <Configurations>
- <Configuration
- Name="Debug|Win32"
- OutputDirectory="../../Bin/Win32/Debug"
- IntermediateDirectory="Debug/doc_how_works"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- Optimization="0"
- AdditionalIncludeDirectories="../../../.."
- PreprocessorDefinitions="WIN32;_DEBUG;_CONSOLE;BOOST_DATE_TIME_NO_LIB"
- MinimalRebuild="TRUE"
- BasicRuntimeChecks="3"
- RuntimeLibrary="3"
- DisableLanguageExtensions="FALSE"
- TreatWChar_tAsBuiltInType="TRUE"
- ForceConformanceInForLoopScope="TRUE"
- UsePrecompiledHeader="0"
- WarningLevel="4"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="3"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- AdditionalDependencies="winmm.lib"
- OutputFile="$(OutDir)/doc_how_works_d.exe"
- LinkIncremental="1"
- AdditionalLibraryDirectories="../../../../stage/lib"
- GenerateDebugInformation="TRUE"
- ProgramDatabaseFile="$(OutDir)/doc_how_works.pdb"
- SubSystem="1"
- TargetMachine="1"
- FixedBaseAddress="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- <Configuration
- Name="Release|Win32"
- OutputDirectory="../../Bin/Win32/Release"
- IntermediateDirectory="Release/doc_how_works"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- AdditionalIncludeDirectories="../../../.."
- PreprocessorDefinitions="WIN32;NDEBUG;_CONSOLE;BOOST_DATE_TIME_NO_LIB"
- RuntimeLibrary="2"
- TreatWChar_tAsBuiltInType="TRUE"
- ForceConformanceInForLoopScope="FALSE"
- UsePrecompiledHeader="0"
- WarningLevel="4"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="0"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- AdditionalDependencies="winmm.lib"
- OutputFile="$(OutDir)/doc_how_works.exe"
- LinkIncremental="1"
- AdditionalLibraryDirectories="../../../../stage/lib"
- GenerateDebugInformation="TRUE"
- SubSystem="1"
- OptimizeReferences="2"
- EnableCOMDATFolding="2"
- TargetMachine="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- </Configurations>
- <References>
- </References>
- <Files>
- <Filter
- Name="Source Files"
- Filter="cpp;c;cxx;def;odl;idl;hpj;bat;asm;asmx"
- UniqueIdentifier="{34957FC1-7BC5-05A6-1646-2A25472AA2FF}">
- <File
- RelativePath="..\..\example\doc_how_works.cpp">
- </File>
- </Filter>
- <Filter
- Name="Header Files"
- Filter="h;hpp;hxx;hm;inl;inc;xsd"
- UniqueIdentifier="{93A78280-B78D-4B31-7E8B-6255ACE1E5FB}">
- </Filter>
- </Files>
- <Globals>
- </Globals>
-</VisualStudioProject>

Deleted: sandbox/move/libs/move/proj/vc7ide/doc_move_algorithms.vcproj
==============================================================================
--- sandbox/move/libs/move/proj/vc7ide/doc_move_algorithms.vcproj 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,139 +0,0 @@
-<?xml version="1.0" encoding="Windows-1252"?>
-<VisualStudioProject
- ProjectType="Visual C++"
- Version="7.10"
- Name="doc_move_algorithms"
- ProjectGUID="{CD57C283-1862-42FE-BF87-B96D3A2A7912}"
- Keyword="Win32Proj">
- <Platforms>
- <Platform
- Name="Win32"/>
- </Platforms>
- <Configurations>
- <Configuration
- Name="Debug|Win32"
- OutputDirectory="../../Bin/Win32/Debug"
- IntermediateDirectory="Debug/doc_move_algorithms"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- Optimization="0"
- AdditionalIncludeDirectories="../../../.."
- PreprocessorDefinitions="WIN32;_DEBUG;_CONSOLE;BOOST_DATE_TIME_NO_LIB"
- MinimalRebuild="TRUE"
- BasicRuntimeChecks="3"
- RuntimeLibrary="3"
- DisableLanguageExtensions="FALSE"
- TreatWChar_tAsBuiltInType="TRUE"
- ForceConformanceInForLoopScope="TRUE"
- UsePrecompiledHeader="0"
- WarningLevel="4"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="3"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- AdditionalDependencies="winmm.lib"
- OutputFile="$(OutDir)/doc_move_algorithms_d.exe"
- LinkIncremental="1"
- AdditionalLibraryDirectories="../../../../stage/lib"
- GenerateDebugInformation="TRUE"
- ProgramDatabaseFile="$(OutDir)/doc_move_algorithms.pdb"
- SubSystem="1"
- TargetMachine="1"
- FixedBaseAddress="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- <Configuration
- Name="Release|Win32"
- OutputDirectory="../../Bin/Win32/Release"
- IntermediateDirectory="Release/doc_move_algorithms"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- AdditionalIncludeDirectories="../../../.."
- PreprocessorDefinitions="WIN32;NDEBUG;_CONSOLE;BOOST_DATE_TIME_NO_LIB"
- RuntimeLibrary="2"
- TreatWChar_tAsBuiltInType="TRUE"
- ForceConformanceInForLoopScope="FALSE"
- UsePrecompiledHeader="0"
- WarningLevel="4"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="0"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- AdditionalDependencies="winmm.lib"
- OutputFile="$(OutDir)/doc_move_algorithms.exe"
- LinkIncremental="1"
- AdditionalLibraryDirectories="../../../../stage/lib"
- GenerateDebugInformation="TRUE"
- SubSystem="1"
- OptimizeReferences="2"
- EnableCOMDATFolding="2"
- TargetMachine="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- </Configurations>
- <References>
- </References>
- <Files>
- <Filter
- Name="Source Files"
- Filter="cpp;c;cxx;def;odl;idl;hpj;bat;asm;asmx"
- UniqueIdentifier="{34957FC1-7BC5-1646-05A6-27542AA2A2FF}">
- <File
- RelativePath="..\..\example\doc_move_algorithms.cpp">
- </File>
- </Filter>
- <Filter
- Name="Header Files"
- Filter="h;hpp;hxx;hm;inl;inc;xsd"
- UniqueIdentifier="{93A78280-B78D-4B31-7E8B-6255ACE1E5FB}">
- </Filter>
- </Files>
- <Globals>
- </Globals>
-</VisualStudioProject>

Deleted: sandbox/move/libs/move/proj/vc7ide/doc_move_inserter.vcproj
==============================================================================
--- sandbox/move/libs/move/proj/vc7ide/doc_move_inserter.vcproj 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,139 +0,0 @@
-<?xml version="1.0" encoding="Windows-1252"?>
-<VisualStudioProject
- ProjectType="Visual C++"
- Version="7.10"
- Name="doc_move_inserter"
- ProjectGUID="{CD57C283-1862-42FE-BF87-B96D3A2A7912}"
- Keyword="Win32Proj">
- <Platforms>
- <Platform
- Name="Win32"/>
- </Platforms>
- <Configurations>
- <Configuration
- Name="Debug|Win32"
- OutputDirectory="../../Bin/Win32/Debug"
- IntermediateDirectory="Debug/doc_move_inserter"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- Optimization="0"
- AdditionalIncludeDirectories="../../../.."
- PreprocessorDefinitions="WIN32;_DEBUG;_CONSOLE;BOOST_DATE_TIME_NO_LIB"
- MinimalRebuild="TRUE"
- BasicRuntimeChecks="3"
- RuntimeLibrary="3"
- DisableLanguageExtensions="FALSE"
- TreatWChar_tAsBuiltInType="TRUE"
- ForceConformanceInForLoopScope="TRUE"
- UsePrecompiledHeader="0"
- WarningLevel="4"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="3"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- AdditionalDependencies="winmm.lib"
- OutputFile="$(OutDir)/doc_move_inserter_d.exe"
- LinkIncremental="1"
- AdditionalLibraryDirectories="../../../../stage/lib"
- GenerateDebugInformation="TRUE"
- ProgramDatabaseFile="$(OutDir)/doc_move_inserter.pdb"
- SubSystem="1"
- TargetMachine="1"
- FixedBaseAddress="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- <Configuration
- Name="Release|Win32"
- OutputDirectory="../../Bin/Win32/Release"
- IntermediateDirectory="Release/doc_move_inserter"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- AdditionalIncludeDirectories="../../../.."
- PreprocessorDefinitions="WIN32;NDEBUG;_CONSOLE;BOOST_DATE_TIME_NO_LIB"
- RuntimeLibrary="2"
- TreatWChar_tAsBuiltInType="TRUE"
- ForceConformanceInForLoopScope="FALSE"
- UsePrecompiledHeader="0"
- WarningLevel="4"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="0"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- AdditionalDependencies="winmm.lib"
- OutputFile="$(OutDir)/doc_move_inserter.exe"
- LinkIncremental="1"
- AdditionalLibraryDirectories="../../../../stage/lib"
- GenerateDebugInformation="TRUE"
- SubSystem="1"
- OptimizeReferences="2"
- EnableCOMDATFolding="2"
- TargetMachine="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- </Configurations>
- <References>
- </References>
- <Files>
- <Filter
- Name="Source Files"
- Filter="cpp;c;cxx;def;odl;idl;hpj;bat;asm;asmx"
- UniqueIdentifier="{34957FC1-7BC5-1646-05A6-27542AA2A2FF}">
- <File
- RelativePath="..\..\example\doc_move_inserter.cpp">
- </File>
- </Filter>
- <Filter
- Name="Header Files"
- Filter="h;hpp;hxx;hm;inl;inc;xsd"
- UniqueIdentifier="{93A78280-B78D-4B31-7E8B-6255ACE1E5FB}">
- </Filter>
- </Files>
- <Globals>
- </Globals>
-</VisualStudioProject>

Deleted: sandbox/move/libs/move/proj/vc7ide/doc_move_iterator.vcproj
==============================================================================
--- sandbox/move/libs/move/proj/vc7ide/doc_move_iterator.vcproj 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,139 +0,0 @@
-<?xml version="1.0" encoding="Windows-1252"?>
-<VisualStudioProject
- ProjectType="Visual C++"
- Version="7.10"
- Name="doc_move_iterator"
- ProjectGUID="{CD57C283-1862-42FE-BF87-B96D3A2A7912}"
- Keyword="Win32Proj">
- <Platforms>
- <Platform
- Name="Win32"/>
- </Platforms>
- <Configurations>
- <Configuration
- Name="Debug|Win32"
- OutputDirectory="../../Bin/Win32/Debug"
- IntermediateDirectory="Debug/doc_move_iterator"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- Optimization="0"
- AdditionalIncludeDirectories="../../../.."
- PreprocessorDefinitions="WIN32;_DEBUG;_CONSOLE;BOOST_DATE_TIME_NO_LIB"
- MinimalRebuild="TRUE"
- BasicRuntimeChecks="3"
- RuntimeLibrary="3"
- DisableLanguageExtensions="FALSE"
- TreatWChar_tAsBuiltInType="TRUE"
- ForceConformanceInForLoopScope="TRUE"
- UsePrecompiledHeader="0"
- WarningLevel="4"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="3"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- AdditionalDependencies="winmm.lib"
- OutputFile="$(OutDir)/doc_move_iterator_d.exe"
- LinkIncremental="1"
- AdditionalLibraryDirectories="../../../../stage/lib"
- GenerateDebugInformation="TRUE"
- ProgramDatabaseFile="$(OutDir)/doc_move_iterator.pdb"
- SubSystem="1"
- TargetMachine="1"
- FixedBaseAddress="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- <Configuration
- Name="Release|Win32"
- OutputDirectory="../../Bin/Win32/Release"
- IntermediateDirectory="Release/doc_move_iterator"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- AdditionalIncludeDirectories="../../../.."
- PreprocessorDefinitions="WIN32;NDEBUG;_CONSOLE;BOOST_DATE_TIME_NO_LIB"
- RuntimeLibrary="2"
- TreatWChar_tAsBuiltInType="TRUE"
- ForceConformanceInForLoopScope="FALSE"
- UsePrecompiledHeader="0"
- WarningLevel="4"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="0"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- AdditionalDependencies="winmm.lib"
- OutputFile="$(OutDir)/doc_move_iterator.exe"
- LinkIncremental="1"
- AdditionalLibraryDirectories="../../../../stage/lib"
- GenerateDebugInformation="TRUE"
- SubSystem="1"
- OptimizeReferences="2"
- EnableCOMDATFolding="2"
- TargetMachine="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- </Configurations>
- <References>
- </References>
- <Files>
- <Filter
- Name="Source Files"
- Filter="cpp;c;cxx;def;odl;idl;hpj;bat;asm;asmx"
- UniqueIdentifier="{34957FC1-7BC5-1646-05A6-27542AA2A2FF}">
- <File
- RelativePath="..\..\example\doc_move_iterator.cpp">
- </File>
- </Filter>
- <Filter
- Name="Header Files"
- Filter="h;hpp;hxx;hm;inl;inc;xsd"
- UniqueIdentifier="{93A78280-B78D-4B31-7E8B-6255ACE1E5FB}">
- </Filter>
- </Files>
- <Globals>
- </Globals>
-</VisualStudioProject>

Deleted: sandbox/move/libs/move/proj/vc7ide/move_algorithm.vcproj
==============================================================================
--- sandbox/move/libs/move/proj/vc7ide/move_algorithm.vcproj 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,134 +0,0 @@
-<?xml version="1.0" encoding="Windows-1252"?>
-<VisualStudioProject
- ProjectType="Visual C++"
- Version="7.10"
- Name="move_algorithm_test"
- ProjectGUID="{C8AD2618-79EB-8612-42FE-2A3AC9667A13}"
- Keyword="Win32Proj">
- <Platforms>
- <Platform
- Name="Win32"/>
- </Platforms>
- <Configurations>
- <Configuration
- Name="Debug|Win32"
- OutputDirectory="../../Bin/Win32/Debug"
- IntermediateDirectory="Debug/move_algorithm_test"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- Optimization="0"
- AdditionalIncludeDirectories="../../../.."
- PreprocessorDefinitions="WIN32;_DEBUG;_CONSOLE;BOOST_DATE_TIME_NO_LIB"
- MinimalRebuild="TRUE"
- BasicRuntimeChecks="3"
- RuntimeLibrary="3"
- DisableLanguageExtensions="FALSE"
- TreatWChar_tAsBuiltInType="TRUE"
- ForceConformanceInForLoopScope="TRUE"
- UsePrecompiledHeader="0"
- WarningLevel="4"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="3"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- AdditionalDependencies="winmm.lib"
- OutputFile="$(OutDir)/move_algorithm_test_d.exe"
- LinkIncremental="1"
- AdditionalLibraryDirectories="../../../../stage/lib"
- GenerateDebugInformation="TRUE"
- ProgramDatabaseFile="$(OutDir)/move_algorithm_test.pdb"
- SubSystem="1"
- TargetMachine="1"
- FixedBaseAddress="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- <Configuration
- Name="Release|Win32"
- OutputDirectory="../../Bin/Win32/Release"
- IntermediateDirectory="Release/move_algorithm_test"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- AdditionalIncludeDirectories="../../../.."
- PreprocessorDefinitions="WIN32;NDEBUG;_CONSOLE;BOOST_DATE_TIME_NO_LIB"
- RuntimeLibrary="2"
- TreatWChar_tAsBuiltInType="TRUE"
- ForceConformanceInForLoopScope="FALSE"
- UsePrecompiledHeader="0"
- WarningLevel="4"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="0"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- AdditionalDependencies="winmm.lib"
- OutputFile="$(OutDir)/move_algorithm_test.exe"
- LinkIncremental="1"
- AdditionalLibraryDirectories="../../../../stage/lib"
- GenerateDebugInformation="TRUE"
- SubSystem="1"
- OptimizeReferences="2"
- EnableCOMDATFolding="2"
- TargetMachine="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- </Configurations>
- <References>
- </References>
- <Files>
- <Filter
- Name="Source Files"
- Filter="cpp;c;cxx;def;odl;idl;hpj;bat;asm;asmx"
- UniqueIdentifier="{818563C3-6640-0A65-55CB-202E5BAD7FAF}">
- <File
- RelativePath="..\..\test\move_algorithm.cpp">
- </File>
- </Filter>
- </Files>
- <Globals>
- </Globals>
-</VisualStudioProject>

Deleted: sandbox/move/libs/move/proj/vc7ide/move_iterator_test.vcproj
==============================================================================
--- sandbox/move/libs/move/proj/vc7ide/move_iterator_test.vcproj 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,134 +0,0 @@
-<?xml version="1.0" encoding="Windows-1252"?>
-<VisualStudioProject
- ProjectType="Visual C++"
- Version="7.10"
- Name="move_iterator_test"
- ProjectGUID="{C8AD2618-79EB-8612-42FE-2A3AC9667A13}"
- Keyword="Win32Proj">
- <Platforms>
- <Platform
- Name="Win32"/>
- </Platforms>
- <Configurations>
- <Configuration
- Name="Debug|Win32"
- OutputDirectory="../../Bin/Win32/Debug"
- IntermediateDirectory="Debug/move_iterator_test"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- Optimization="0"
- AdditionalIncludeDirectories="../../../.."
- PreprocessorDefinitions="WIN32;_DEBUG;_CONSOLE;BOOST_DATE_TIME_NO_LIB"
- MinimalRebuild="TRUE"
- BasicRuntimeChecks="3"
- RuntimeLibrary="3"
- DisableLanguageExtensions="FALSE"
- TreatWChar_tAsBuiltInType="TRUE"
- ForceConformanceInForLoopScope="TRUE"
- UsePrecompiledHeader="0"
- WarningLevel="4"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="3"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- AdditionalDependencies="winmm.lib"
- OutputFile="$(OutDir)/move_iterator_test_d.exe"
- LinkIncremental="1"
- AdditionalLibraryDirectories="../../../../stage/lib"
- GenerateDebugInformation="TRUE"
- ProgramDatabaseFile="$(OutDir)/move_iterator_test.pdb"
- SubSystem="1"
- TargetMachine="1"
- FixedBaseAddress="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- <Configuration
- Name="Release|Win32"
- OutputDirectory="../../Bin/Win32/Release"
- IntermediateDirectory="Release/move_iterator_test"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- AdditionalIncludeDirectories="../../../.."
- PreprocessorDefinitions="WIN32;NDEBUG;_CONSOLE;BOOST_DATE_TIME_NO_LIB"
- RuntimeLibrary="2"
- TreatWChar_tAsBuiltInType="TRUE"
- ForceConformanceInForLoopScope="FALSE"
- UsePrecompiledHeader="0"
- WarningLevel="4"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="0"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- AdditionalDependencies="winmm.lib"
- OutputFile="$(OutDir)/move_iterator_test.exe"
- LinkIncremental="1"
- AdditionalLibraryDirectories="../../../../stage/lib"
- GenerateDebugInformation="TRUE"
- SubSystem="1"
- OptimizeReferences="2"
- EnableCOMDATFolding="2"
- TargetMachine="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- </Configurations>
- <References>
- </References>
- <Files>
- <Filter
- Name="Source Files"
- Filter="cpp;c;cxx;def;odl;idl;hpj;bat;asm;asmx"
- UniqueIdentifier="{818563C3-6640-0A65-55CB-202E5BAD7FAF}">
- <File
- RelativePath="..\..\test\move_iterator.cpp">
- </File>
- </Filter>
- </Files>
- <Globals>
- </Globals>
-</VisualStudioProject>

Deleted: sandbox/move/libs/move/proj/vc7ide/move_test.vcproj
==============================================================================
--- sandbox/move/libs/move/proj/vc7ide/move_test.vcproj 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,139 +0,0 @@
-<?xml version="1.0" encoding="Windows-1252"?>
-<VisualStudioProject
- ProjectType="Visual C++"
- Version="7.10"
- Name="move_test"
- ProjectGUID="{CD57C283-1862-42FE-BF87-B96D3A2A7912}"
- Keyword="Win32Proj">
- <Platforms>
- <Platform
- Name="Win32"/>
- </Platforms>
- <Configurations>
- <Configuration
- Name="Debug|Win32"
- OutputDirectory="../../Bin/Win32/Debug"
- IntermediateDirectory="Debug/move_test"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- Optimization="0"
- AdditionalIncludeDirectories="../../../.."
- PreprocessorDefinitions="WIN32;_DEBUG;_CONSOLE;BOOST_DATE_TIME_NO_LIB"
- MinimalRebuild="TRUE"
- BasicRuntimeChecks="3"
- RuntimeLibrary="3"
- DisableLanguageExtensions="TRUE"
- TreatWChar_tAsBuiltInType="TRUE"
- ForceConformanceInForLoopScope="TRUE"
- UsePrecompiledHeader="0"
- WarningLevel="4"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="3"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- AdditionalDependencies="winmm.lib"
- OutputFile="$(OutDir)/move_test_d.exe"
- LinkIncremental="1"
- AdditionalLibraryDirectories="../../../../stage/lib"
- GenerateDebugInformation="TRUE"
- ProgramDatabaseFile="$(OutDir)/move_test.pdb"
- SubSystem="1"
- TargetMachine="1"
- FixedBaseAddress="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- <Configuration
- Name="Release|Win32"
- OutputDirectory="../../Bin/Win32/Release"
- IntermediateDirectory="Release/move_test"
- ConfigurationType="1"
- CharacterSet="2">
- <Tool
- Name="VCCLCompilerTool"
- AdditionalIncludeDirectories="../../../.."
- PreprocessorDefinitions="WIN32;NDEBUG;_CONSOLE;BOOST_DATE_TIME_NO_LIB"
- RuntimeLibrary="2"
- TreatWChar_tAsBuiltInType="TRUE"
- ForceConformanceInForLoopScope="FALSE"
- UsePrecompiledHeader="0"
- WarningLevel="4"
- Detect64BitPortabilityProblems="TRUE"
- DebugInformationFormat="0"/>
- <Tool
- Name="VCCustomBuildTool"/>
- <Tool
- Name="VCLinkerTool"
- AdditionalDependencies="winmm.lib"
- OutputFile="$(OutDir)/move_test.exe"
- LinkIncremental="1"
- AdditionalLibraryDirectories="../../../../stage/lib"
- GenerateDebugInformation="TRUE"
- SubSystem="1"
- OptimizeReferences="2"
- EnableCOMDATFolding="2"
- TargetMachine="1"/>
- <Tool
- Name="VCMIDLTool"/>
- <Tool
- Name="VCPostBuildEventTool"/>
- <Tool
- Name="VCPreBuildEventTool"/>
- <Tool
- Name="VCPreLinkEventTool"/>
- <Tool
- Name="VCResourceCompilerTool"/>
- <Tool
- Name="VCWebServiceProxyGeneratorTool"/>
- <Tool
- Name="VCXMLDataGeneratorTool"/>
- <Tool
- Name="VCWebDeploymentTool"/>
- <Tool
- Name="VCManagedWrapperGeneratorTool"/>
- <Tool
- Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
- </Configuration>
- </Configurations>
- <References>
- </References>
- <Files>
- <Filter
- Name="Source Files"
- Filter="cpp;c;cxx;def;odl;idl;hpj;bat;asm;asmx"
- UniqueIdentifier="{34957FC1-7BC5-1646-05A6-27542AA2A2FF}">
- <File
- RelativePath="..\..\test\move.cpp">
- </File>
- </Filter>
- <Filter
- Name="Header Files"
- Filter="h;hpp;hxx;hm;inl;inc;xsd"
- UniqueIdentifier="{93A78280-B78D-4B31-7E8B-6255ACE1E5FB}">
- </Filter>
- </Files>
- <Globals>
- </Globals>
-</VisualStudioProject>

Deleted: sandbox/move/libs/move/test/Jamfile.v2
==============================================================================
--- sandbox/move/libs/move/test/Jamfile.v2 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,28 +0,0 @@
-##############################################################################
-##
-## (C) Copyright Ion Gaztanaga 2008-2009 Distributed under the Boost
-## Software License, Version 1.0. (See accompanying file
-## LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-##
-##
-##############################################################################
-rule test_all
-{
- local all_rules = ;
-
- for local fileb in [ glob *.cpp ]
- {
- all_rules += [ run $(fileb)
- : # additional args
- : # test-files
- : # requirements
- ] ;
- }
-
- return $(all_rules) ;
-}
-
-test-suite move_test : [ test_all r ]
-: <link>static
-;
-

Deleted: sandbox/move/libs/move/test/back_move_inserter.cpp
==============================================================================
--- sandbox/move/libs/move/test/back_move_inserter.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,61 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright David Abrahams, Vicente Botet, Ion Gaztanaga 2009.
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/move for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-#include <boost/move/move.hpp>
-#include <boost/container/vector.hpp>
-#include <boost/container/list.hpp>
-#include <boost/container/stable_vector.hpp>
-#include "../example/movable.hpp"
-
-template<class Container>
-int move_test()
-{
- //Default construct 10 movable objects
- Container v(10);
-
- //Test default constructed value
- if(v.begin()->moved()){
- return 1;
- }
-
- //Move values
- Container v2;
- std::copy(v.begin(), v.end(), boost::back_move_inserter(v2));
-
- //Test values have been moved
- if(!v.begin()->moved()){
- return 1;
- }
-
- if(v2.size() != 10){
- return 1;
- }
-
- if(v2.begin()->moved()){
- return 1;
- }
- return 0;
-}
-
-int main()
-{
- namespace bc = ::boost::container;
-
- if(move_test< bc::vector<movable> >()){
- return 1;
- }
- if(move_test< bc::list<movable> >()){
- return 1;
- }
- if(move_test< bc::stable_vector<movable> >()){
- return 1;
- }
- return 0;
-}

Deleted: sandbox/move/libs/move/test/construct_forward.cpp
==============================================================================
--- sandbox/move/libs/move/test/construct_forward.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,102 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright David Abrahams, Vicente Botet, Ion Gaztanaga 2009.
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/move for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#include <boost/move/move.hpp>
-#include "../example/movable.hpp"
-#include "../example/copymovable.hpp"
-#include <cstdio>
-
-class non_movable
-{
- public:
- non_movable()
- {}
-};
-
-template<class MaybeRvalue>
-void catch_test(BOOST_RV_REF(MaybeRvalue) x
- ,typename ::boost::enable_if< ::boost::is_movable<MaybeRvalue> >::type* = 0)
-{ (void)x;}
-
-template<class MaybeRvalue>
-void catch_test(BOOST_COPY_ASSIGN_REF(MaybeRvalue) x
- ,typename ::boost::enable_if< ::boost::is_movable<MaybeRvalue> >::type* = 0)
-
-{ (void)x;}
-
-template<class MaybeRvalue>
-void catch_test(MaybeRvalue &x
- ,typename ::boost::enable_if< ::boost::is_movable<MaybeRvalue> >::type* = 0)
-{ (void)x;}
-
-template<class MaybeRvalue>
-void catch_test(const MaybeRvalue& x
- ,typename ::boost::disable_if< ::boost::is_movable<MaybeRvalue> >::type* = 0)
-{ (void)x;}
-
-movable create_movable()
-{ return movable(); }
-
-copy_movable create_copy_movable()
-{ return copy_movable(); }
-
-non_movable create_non_movable()
-{ return non_movable(); }
-
-
-void catch_test()
-{
- movable m;
- const movable constm;
- catch_test<movable>(boost::move(m));
- #ifdef BOOST_MOVE_MACRO_MOVE_ASSIGN_FROM_NON_CONST_RVALUE
- catch_test<movable>(create_movable());
- #endif
- catch_test<movable>(m);
- catch_test<movable>(constm);
- copy_movable cm;
- const copy_movable constcm;
- catch_test<copy_movable>(boost::move(cm));
- catch_test<copy_movable>(create_copy_movable());
- catch_test<copy_movable>(cm);
- catch_test<copy_movable>(constcm);
- non_movable nm;
- const non_movable constnm;
- catch_test<non_movable>(boost::move(nm));
- catch_test<non_movable>(create_non_movable());
- catch_test<non_movable>(nm);
- catch_test<non_movable>(constnm);
-}
-
-template<class MaybeMovableOnly, class MaybeRvalue>
-void function_construct(BOOST_FWD_REF(MaybeRvalue) x)
-{
- //Moves in case Convertible is boost::rv<movable> copies otherwise
- //For C++0x perfect forwarding
- MaybeMovableOnly m(boost::forward<MaybeRvalue>(x));
-}
-
-void forward_test()
-{
- movable m;
- function_construct<movable>(boost::move(m));
-// non_movable nm;
-// function_construct<non_movable>(boost::move(nm));
-// const non_movable cnm;
-// function_construct<non_movable>(cnm);
-}
-
-int main()
-{
- catch_test();
- forward_test();
- return 0;
-}

Deleted: sandbox/move/libs/move/test/copy_elision_test.cpp
==============================================================================
--- sandbox/move/libs/move/test/copy_elision_test.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,170 +0,0 @@
-// Copyright David Abrahams 2009. Distributed under the Boost
-// Software License, Version 1.0. (See accompanying
-// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-
-#include <iostream>
-
-#ifdef NO_MOVE
-# undef BOOST_COPY_ASSIGN_REF
-# define BOOST_COPY_ASSIGN_REF(X) X const&
-# undef BOOST_COPYABLE_AND_MOVABLE
-# define BOOST_COPYABLE_AND_MOVABLE(X)
-# define MOVE(x) (x)
-#else
-#include <boost/move/move.hpp>
-# define MOVE(x) boost::move(x)
-#endif
-
-struct X
-{
- X() : id(instances++)
- {
- std::cout << "X" << id << ": construct\n";
- }
-
- X(X const& rhs) : id(instances++)
- {
- std::cout << "X" << id << ": <- " << "X" << rhs.id << ": **copy**\n";
- ++copies;
- }
-
- // This particular test doesn't exercise assignment, but for
- // completeness:
- X& operator=(BOOST_COPY_ASSIGN_REF(X) rhs)
- {
- std::cout << "X" << id << ": <- " << "X" << rhs.id << ": assign\n";
- return *this;
- }
-
-#ifndef NO_MOVE
- X& operator=(BOOST_RV_REF(X) rhs)
- {
- std::cout << "X" << id << ": <- " << "X" << rhs.id << ": move assign\n";
- return *this;
- }
-
- X(BOOST_RV_REF(X) rhs) : id(instances++)
- {
- std::cout << "X" << id << ": <- " << "X" << rhs.id << ": ..move construct..\n";
- ++copies;
- }
-#endif
-
- ~X() { std::cout << "X" << id << ": destroy\n"; }
-
- unsigned id;
-
- static unsigned copies;
- static unsigned instances;
-
- BOOST_COPYABLE_AND_MOVABLE(X)
-};
-
-unsigned X::copies = 0;
-unsigned X::instances = 0;
-
-#define CHECK_COPIES( stmt, min, max, comment ) \
-{ \
- unsigned const old_copies = X::copies; \
- \
- std::cout << "\n" comment "\n" #stmt "\n===========\n"; \
- { \
- stmt; \
- } \
- unsigned const n = X::copies - old_copies; \
- if (n > max) \
- std::cout << "*** max is too low or compiler is buggy ***\n"; \
- if (n < min) \
- std::cout << "*** min is too high or compiler is buggy ***\n"; \
- \
- std::cout << "-----------\n" \
- << n << "/" << max \
- << " possible copies/moves made\n" \
- << max - n << "/" << max - min \
- << " possible elisions performed\n\n"; \
- \
- if (n > min) \
- std::cout << "*** " << n - min \
- << " possible elisions missed! ***\n"; \
-}
-
-struct trace
-{
- trace(char const* name)
- : name(name)
- {
- std::cout << "->: " << name << "\n";
- }
-
- ~trace()
- {
- std::cout << "<-: " << name << "\n";
- }
-
- char const* name;
-};
-
-void sink(X a)
-{
- trace t("sink");
-}
-
-X nrvo_source()
-{
- trace t("nrvo_source");
- X a;
- return a;
-}
-
-X urvo_source()
-{
- trace t("urvo_source");
- return X();
-}
-
-X identity(X a)
-{
- trace t("identity");
- return a;
-}
-
-X lvalue_;
-X& lvalue()
-{
- return lvalue_;
-}
-typedef X rvalue;
-
-X ternary( bool y )
-{
- X a, b;
- return MOVE(y?a:b);
-}
-
-int main(int argc, char* argv[])
-{
- (void)argv;
- // Double parens prevent "most vexing parse"
- CHECK_COPIES( X a(( lvalue() )), 1, 1, "Direct initialization from lvalue");
- CHECK_COPIES( X a(( rvalue() )), 0, 1, "Direct initialization from rvalue");
-
- CHECK_COPIES( X a = lvalue(), 1, 1, "Copy initialization from lvalue" );
- CHECK_COPIES( X a = rvalue(), 0, 1, "Copy initialization from rvalue" );
-
- CHECK_COPIES( sink( lvalue() ), 1, 1, "Pass lvalue by value" );
- CHECK_COPIES( sink( rvalue() ), 0, 1, "Pass rvalue by value" );
-
- CHECK_COPIES( nrvo_source(), 0, 1, "Named return value optimization (NRVO)" );
- CHECK_COPIES( urvo_source(), 0, 1, "Unnamed return value optimization (URVO)" );
-
- // Just to prove these things compose properly
- CHECK_COPIES( X a(urvo_source()), 0, 2, "Return value used as ctor arg" );
-
- // Expect to miss one possible elision here
- CHECK_COPIES( identity( rvalue() ), 0, 2, "Return rvalue passed by value" );
-
- // Expect to miss an elision in at least one of the following lines
- CHECK_COPIES( X a = ternary( argc == 1000 ), 0, 2, "Return result of ternary operation" );
- CHECK_COPIES( X a = ternary( argc != 1000 ), 0, 2, "Return result of ternary operation again" );
- return 0;
-}

Deleted: sandbox/move/libs/move/test/copy_move_optimization.cpp
==============================================================================
--- sandbox/move/libs/move/test/copy_move_optimization.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,105 +0,0 @@
-//We need to declare:
-//
-//2 conversions: rv<T> & and const rv<T> &
-//1 rv<T> & constructor: move constructor
-//1 const rv<T> & constructor: copy constructor
-//1 T & constructor: copy constructor
-//
-//Optimization:
-//Since RVO is better than move-construction,
-//avoid copy constructor overloading.
-#include <boost/move/move.hpp>
-#include <iostream>
-
-bool moved = false;
-
-class obj
-{
- BOOST_COPYABLE_AND_MOVABLE(obj)
- public:
-
- obj()
- {
- std::cout << "constructing obj" << "\n";
- }
-
- ~obj()
- {}
-
- obj(const obj &)
- {
- std::cout << "copy construct from const obj" << "\n";
- }
-
- // copy construct from movable object (non-const rvalue, explicitly moved lvalue)
- obj(BOOST_RV_REF(obj))
- {
- std::cout << "move construct from movable rvalue" << "\n";
- }
-
- obj& operator =(BOOST_COPY_ASSIGN_REF(obj))
- {
- std::cout << "copy assign from const obj" << "\n";
- return *this;
- }
-
- obj& operator =(BOOST_RV_REF(obj))
- {
- std::cout << "move assign from movable rvalue" << "\n";
- return *this;
- }
-};
-
-
-obj rvalue_func() { return obj(); }
-const obj const_rvalue_func() { return obj(); }
-obj& lvalue_func() { static obj o; return o; }
-const obj& const_lvalue_func() { static obj o; return o; }
-
-obj produce() { return obj(); }
-
-void consume(obj){}
-
-int main()
-{
- { consume(produce()); }
- { obj o = produce(); }
- { obj o(produce()); }
- {
- obj o1(rvalue_func());
- obj o2 = const_rvalue_func();
- obj o3 = lvalue_func();
- obj o4 = const_lvalue_func();
- // can't explicitly move temporaries
- //obj o5 = boost::move(rvalue_func());
- obj o5;
- //Maybe missed optimization: copied
- o5 = rvalue_func();
- //Explicit forward works OK and optimized
- o5 = boost::forward<obj>(rvalue_func());
-
- obj o7 = boost::move(lvalue_func());
- obj o8 = boost::move(const_lvalue_func());
-
- obj o;
- o = rvalue_func();
- o = const_rvalue_func();
- o = lvalue_func();
- o = const_lvalue_func();
- // can't explicitly move temporaries
- //o = boost::move(rvalue_func());
- o = boost::forward<obj>(rvalue_func());
- o = boost::move(const_rvalue_func());
- o = boost::move(lvalue_func());
- o = boost::move(const_lvalue_func());
- }
- return 0;
-}
-
-//We need to declare:
-//
-//2 conversions: rv<T> & and const rv<T> &
-//1 rv<T> & constructor: move constructor
-//1 const rv<T> & constructor: copy constructor
-//1 T & constructor: copy constructor
-

Deleted: sandbox/move/libs/move/test/move.cpp
==============================================================================
--- sandbox/move/libs/move/test/move.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,135 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright David Abrahams, Vicente Botet, Ion Gaztanaga 2009.
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/move for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-#include <boost/move/move.hpp>
-#include "../example/movable.hpp"
-#include <boost/static_assert.hpp>
-
-movable function(movable m)
-{
- return movable(boost::move(m));
-}
-
-movable functionr(BOOST_RV_REF(movable) m)
-{
- return movable(boost::move(m));
-}
-
-movable function2(movable m)
-{
- return boost::move(m);
-}
-
-BOOST_RV_REF(movable) function2r(BOOST_RV_REF(movable) m)
-{
- return boost::move(m);
-}
-
-movable move_return_function2 ()
-{
- return movable();
-}
-
-movable move_return_function ()
-{
- movable m;
- return (boost::move(m));
-}
-
-
-//Catch by value
-void function_value(movable)
-{}
-
-//Catch by reference
-void function_ref(const movable &)
-{}
-
-//Catch by reference
-void function_ref(BOOST_RV_REF(movable))
-{}
-
-void limitations_test()
-{
- movable m;
- movable cm;
-
- //move returns rv ref
- BOOST_RV_REF(movable) r = boost::move(m);
- //Conversion operator applied
- BOOST_RV_REF(movable) q = movable();
- //Dangerous for a container if const overload is disabled
- BOOST_RV_REF(movable) s = m;
- (void)r;
- (void)q;
- (void)s;
-
- //Catch by value, ok
- m = movable();
-
- //Does not compile
- //_value(m);
- //Compiles
- function_value(movable());
-
- //Does not compile
- //function_ref(movable());
- //Compiles
- function_ref(boost::move(m));
-}
-
-struct copyable
-{};
-
-movable create_movable()
-{ return movable(); }
-int main()
-{
- BOOST_STATIC_ASSERT((boost::has_nothrow_move<movable>::value == true));
- BOOST_STATIC_ASSERT((boost::has_nothrow_move<copyable>::value == false));
-
- {
- movable m;
- movable m2(boost::move(m));
- movable m3(function(movable(boost::move(m2))));
- movable m4(function(boost::move(m3)));
- }
- {
- movable m;
- movable m2(boost::move(m));
- movable m3(functionr(movable(boost::move(m2))));
- movable m4(functionr(boost::move(m3)));
- }
- {
- movable m;
- movable m2(boost::move(m));
- movable m3(function2(movable(boost::move(m2))));
- movable m4(function2(boost::move(m3)));
- }
- {
- movable m;
- movable m2(boost::move(m));
- movable m3(function2r(movable(boost::move(m2))));
- movable m4(function2r(boost::move(m3)));
- }
- {
- movable m;
- movable m2(boost::move(m));
- movable m3(move_return_function());
- }
- {
- movable m;
- movable m2(boost::move(m));
- movable m3(move_return_function2());
- }
- limitations_test();
-
- return 0;
-}

Deleted: sandbox/move/libs/move/test/move_algorithm.cpp
==============================================================================
--- sandbox/move/libs/move/test/move_algorithm.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,55 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright David Abrahams, Vicente Botet, Ion Gaztanaga 2009.
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/move for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-#include <boost/move/move.hpp>
-#include <boost/container/vector.hpp>
-#include "../example/movable.hpp"
-
-int main()
-{
- namespace bc = ::boost::container;
- //Default construct 10 movable objects
- bc::vector<movable> v(10);
- bc::vector<movable> v2(10);
-
- //Move to v2
- boost::move(v.begin(), v.end(), v2.begin());
-
- //Test values have been moved
- if(!v[0].moved()){
- return 1;
- }
-
- if(v2.size() != 10){
- return 1;
- }
-
- if(v2[0].moved()){
- return 1;
- }
-
- //Move to v again
- boost::move_backward(v2.begin(), v2.end(), v.end());
-
- //Test values have been moved
- if(!v2[0].moved()){
- return 1;
- }
-
- if(v.size() != 10){
- return 1;
- }
-
- if(v[0].moved()){
- return 1;
- }
-
- return 0;
-}

Deleted: sandbox/move/libs/move/test/move_iterator.cpp
==============================================================================
--- sandbox/move/libs/move/test/move_iterator.cpp 2011-07-21 19:07:50 EDT (Thu, 21 Jul 2011)
+++ (empty file)
@@ -1,104 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright David Abrahams, Vicente Botet, Ion Gaztanaga 2009.
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/move for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#include <boost/move/move.hpp>
-#include <boost/container/vector.hpp>
-#include "../example/movable.hpp"
-
-int main()
-{
- namespace bc = ::boost::container;
- //Default construct 10 movable objects
- bc::vector<movable> v(10);
-
- //Test default constructed value
- if(v[0].moved()){
- return 1;
- }
-
- //Move values
- bc::vector<movable> v2
- (boost::make_move_iterator(v.begin()), boost::make_move_iterator(v.end()));
-
- //Test values have been moved
- if(!v[0].moved()){
- return 1;
- }
-
- if(v2.size() != 10){
- return 1;
- }
-
- //Move again
- v.assign(boost::make_move_iterator(v2.begin()), boost::make_move_iterator(v2.end()));
-
- //Test values have been moved
- if(!v2[0].moved()){
- return 1;
- }
-
- if(v[0].moved()){
- return 1;
- }
-
- return 0;
-}
-
-/*
-#include <boost/move/move.hpp>
-
-
-class copy_movable
-{
- BOOST_COPYABLE_AND_MOVABLE(copy_movable)
- int value_;
-
- public:
- copy_movable() : value_(1){}
-
- //Move constructor and assignment
- copy_movable(BOOST_RV_REF(copy_movable) m)
- { value_ = m.value_; m.value_ = 0; }
-
- copy_movable(const copy_movable &m)
- { value_ = m.value_; }
-
- copy_movable & operator=(BOOST_RV_REF(copy_movable) m)
- { value_ = m.value_; m.value_ = 0; return *this; }
-
- copy_movable & operator=(BOOST_COPY_ASSIGN_REF(copy_movable) m)
- { value_ = m.value_; return *this; }
-
- bool moved() const //Observer
- { return value_ == 0; }
-};
-
-struct copy_movable_wrapper
-{
- copy_movable cm;
-};
-
-copy_movable produce()
-{ return copy_movable(); }
-
-
-int main()
-{
- copy_movable cm;
- cm = produce();
-
- const copy_movable_wrapper cmw;
- copy_movable_wrapper cmw2;
- cmw2 = cmw;
-
- return 0;
-}
-*/
\ No newline at end of file

Date view	Thread view	Subject view	Author view

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