Boost logo

Boost-Commit :

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&#160;1.&#160;Boost.Container">
 <link rel="up" href="../../boost_container_reference.html#header.boost.container.string_hpp" title="Header &lt;boost/container/string.hpp&gt;">
 <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 @@
 <p>boost::container::basic_string &#8212; </p>
 </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"><span class="emphasis"><em>// In header: &lt;boost/container/string.hpp&gt;
+<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis"><span class="comment">// In header: &lt;boost/container/string.hpp&gt;
 
-</em></span><span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>typename</strong></span> CharT, <span class="bold"><strong>typename</strong></span> Traits, <span class="bold"><strong>typename</strong></span> A&gt;
-<span class="bold"><strong>class</strong></span> basic_string {
-<span class="bold"><strong>public</strong></span>:
- <span class="emphasis"><em>// types</em></span>
- <span class="bold"><strong>typedef</strong></span> A allocator_type;
- <span class="bold"><strong>typedef</strong></span> allocator_type <a name="boost.container.basic_string.stored_allocator_type"></a>stored_allocator_type; <span class="emphasis"><em>// The stored allocator type. </em></span>
- <span class="bold"><strong>typedef</strong></span> CharT <a name="boost.container.basic_string.value_type"></a>value_type; <span class="emphasis"><em>// The type of object, CharT, stored in the string. </em></span>
- <span class="bold"><strong>typedef</strong></span> Traits <a name="boost.container.basic_string.traits_type"></a>traits_type; <span class="emphasis"><em>// The second template parameter Traits. </em></span>
- <span class="bold"><strong>typedef</strong></span> A::pointer <a name="boost.container.basic_string.pointer"></a>pointer; <span class="emphasis"><em>// Pointer to CharT. </em></span>
- <span class="bold"><strong>typedef</strong></span> A::const_pointer <a name="boost.container.basic_string.const_pointer"></a>const_pointer; <span class="emphasis"><em>// Const pointer to CharT. </em></span>
- <span class="bold"><strong>typedef</strong></span> A::reference <a name="boost.container.basic_string.reference"></a>reference; <span class="emphasis"><em>// Reference to CharT. </em></span>
- <span class="bold"><strong>typedef</strong></span> A::const_reference <a name="boost.container.basic_string.const_reference"></a>const_reference; <span class="emphasis"><em>// Const reference to CharT. </em></span>
- <span class="bold"><strong>typedef</strong></span> A::size_type <a name="boost.container.basic_string.size_type"></a>size_type; <span class="emphasis"><em>// An unsigned integral type. </em></span>
- <span class="bold"><strong>typedef</strong></span> A::difference_type <a name="boost.container.basic_string.difference_type"></a>difference_type; <span class="emphasis"><em>// A signed integral type. </em></span>
- <span class="bold"><strong>typedef</strong></span> pointer <a name="boost.container.basic_string.iterator"></a>iterator; <span class="emphasis"><em>// Iterator used to iterate through a string. It's a Random Access Iterator. </em></span>
- <span class="bold"><strong>typedef</strong></span> const_pointer <a name="boost.container.basic_string.const_iterator"></a>const_iterator; <span class="emphasis"><em>// Const iterator used to iterate through a string. It's a Random Access Iterator. </em></span>
- <span class="bold"><strong>typedef</strong></span> std::reverse_iterator&lt; iterator &gt; <a name="boost.container.basic_string.reverse_iterator"></a>reverse_iterator; <span class="emphasis"><em>// Iterator used to iterate backwards through a string. </em></span>
- <span class="bold"><strong>typedef</strong></span> std::reverse_iterator&lt; const_iterator &gt; <a name="boost.container.basic_string.const_reverse_iterator"></a>const_reverse_iterator; <span class="emphasis"><em>// Const iterator used to iterate backwards through a string. </em></span>
+</span><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> CharT<span class="special">,</span> <span class="keyword">typename</span> Traits<span class="special">,</span> <span class="keyword">typename</span> A<span class="special">&gt;</span>
+<span class="keyword">class</span> basic_string <span class="special">{</span>
+<span class="keyword">public</span><span class="special">:</span>
+ <span class="comment">// types</span>
+ <span class="keyword">typedef</span> <span class="identifier">A</span> allocator_type<span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">allocator_type</span> <a name="boost.container.basic_string.stored_allocator_type"></a><span class="identifier">stored_allocator_type</span><span class="special">;</span> <span class="comment">// The stored allocator type. </span>
+ <span class="keyword">typedef</span> <span class="identifier">CharT</span> <a name="boost.container.basic_string.value_type"></a><span class="identifier">value_type</span><span class="special">;</span> <span class="comment">// The type of object, CharT, stored in the string. </span>
+ <span class="keyword">typedef</span> <span class="identifier">Traits</span> <a name="boost.container.basic_string.traits_type"></a><span class="identifier">traits_type</span><span class="special">;</span> <span class="comment">// The second template parameter Traits. </span>
+ <span class="keyword">typedef</span> <span class="identifier">A</span><span class="special">::</span><span class="identifier">pointer</span> <a name="boost.container.basic_string.pointer"></a><span class="identifier">pointer</span><span class="special">;</span> <span class="comment">// Pointer to CharT. </span>
+ <span class="keyword">typedef</span> <span class="identifier">A</span><span class="special">::</span><span class="identifier">const_pointer</span> <a name="boost.container.basic_string.const_pointer"></a><span class="identifier">const_pointer</span><span class="special">;</span> <span class="comment">// Const pointer to CharT. </span>
+ <span class="keyword">typedef</span> <span class="identifier">A</span><span class="special">::</span><span class="identifier">reference</span> <a name="boost.container.basic_string.reference"></a><span class="identifier">reference</span><span class="special">;</span> <span class="comment">// Reference to CharT. </span>
+ <span class="keyword">typedef</span> <span class="identifier">A</span><span class="special">::</span><span class="identifier">const_reference</span> <a name="boost.container.basic_string.const_reference"></a><span class="identifier">const_reference</span><span class="special">;</span> <span class="comment">// Const reference to CharT. </span>
+ <span class="keyword">typedef</span> <span class="identifier">A</span><span class="special">::</span><span class="identifier">size_type</span> <a name="boost.container.basic_string.size_type"></a><span class="identifier">size_type</span><span class="special">;</span> <span class="comment">// An unsigned integral type. </span>
+ <span class="keyword">typedef</span> <span class="identifier">A</span><span class="special">::</span><span class="identifier">difference_type</span> <a name="boost.container.basic_string.difference_type"></a><span class="identifier">difference_type</span><span class="special">;</span> <span class="comment">// A signed integral type. </span>
+ <span class="keyword">typedef</span> <span class="identifier">pointer</span> <a name="boost.container.basic_string.iterator"></a><span class="identifier">iterator</span><span class="special">;</span> <span class="comment">// Iterator used to iterate through a string. It's a Random Access Iterator. </span>
+ <span class="keyword">typedef</span> <span class="identifier">const_pointer</span> <a name="boost.container.basic_string.const_iterator"></a><span class="identifier">const_iterator</span><span class="special">;</span> <span class="comment">// Const iterator used to iterate through a string. It's a Random Access Iterator. </span>
+ <span class="keyword">typedef</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">reverse_iterator</span><span class="special">&lt;</span> <span class="identifier">iterator</span> <span class="special">&gt;</span> <a name="boost.container.basic_string.reverse_iterator"></a><span class="identifier">reverse_iterator</span><span class="special">;</span> <span class="comment">// Iterator used to iterate backwards through a string. </span>
+ <span class="keyword">typedef</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">reverse_iterator</span><span class="special">&lt;</span> <span class="identifier">const_iterator</span> <span class="special">&gt;</span> <a name="boost.container.basic_string.const_reverse_iterator"></a><span class="identifier">const_reverse_iterator</span><span class="special">;</span> <span class="comment">// Const iterator used to iterate backwards through a string. </span>
 
- <span class="emphasis"><em>// construct/copy/destruct</em></span>
- basic_string(reserve_t, std::size_t,
- <span class="bold"><strong>const</strong></span> allocator_type &amp; = allocator_type());
- basic_string(<span class="bold"><strong>const</strong></span> allocator_type &amp; = allocator_type());
- basic_string(<span class="bold"><strong>const</strong></span> basic_string &amp;);
- basic_string(basic_string &amp;&amp;);
- basic_string(<span class="bold"><strong>const</strong></span> basic_string &amp;, size_type, size_type = npos,
- <span class="bold"><strong>const</strong></span> allocator_type &amp; = allocator_type());
- basic_string(<span class="bold"><strong>const</strong></span> CharT *, size_type,
- <span class="bold"><strong>const</strong></span> allocator_type &amp; = allocator_type());
- basic_string(<span class="bold"><strong>const</strong></span> CharT *, <span class="bold"><strong>const</strong></span> allocator_type &amp; = allocator_type());
- basic_string(size_type, CharT, <span class="bold"><strong>const</strong></span> allocator_type &amp; = allocator_type());
- <span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>typename</strong></span> InputIterator&gt;
- basic_string(InputIterator, InputIterator,
- <span class="bold"><strong>const</strong></span> allocator_type &amp; = allocator_type());
- basic_string&amp; operator=(<span class="bold"><strong>const</strong></span> basic_string &amp;);
- basic_string&amp; operator=(basic_string &amp;&amp;);
- basic_string&amp; operator=(<span class="bold"><strong>const</strong></span> CharT *);
- basic_string&amp; operator=(CharT);
- ~basic_string();
+ <span class="comment">// construct/copy/destruct</span>
+ basic_string<span class="special">(</span><span class="keyword">const</span> <span class="identifier">allocator_type</span> <span class="special">&amp;</span> <span class="special">=</span> <span class="identifier">allocator_type</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span>
+ basic_string<span class="special">(</span><span class="keyword">const</span> basic_string <span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
+ basic_string<span class="special">(</span>basic_string <span class="special">&amp;&amp;</span><span class="special">)</span><span class="special">;</span>
+ basic_string<span class="special">(</span><span class="keyword">const</span> basic_string <span class="special">&amp;</span><span class="special">,</span> <span class="identifier">size_type</span><span class="special">,</span> <span class="identifier">size_type</span> <span class="special">=</span> <span class="identifier">npos</span><span class="special">,</span>
+ <span class="keyword">const</span> <span class="identifier">allocator_type</span> <span class="special">&amp;</span> <span class="special">=</span> <span class="identifier">allocator_type</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span>
+ basic_string<span class="special">(</span><span class="keyword">const</span> <span class="identifier">CharT</span> <span class="special">*</span><span class="special">,</span> <span class="identifier">size_type</span><span class="special">,</span>
+ <span class="keyword">const</span> <span class="identifier">allocator_type</span> <span class="special">&amp;</span> <span class="special">=</span> <span class="identifier">allocator_type</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span>
+ basic_string<span class="special">(</span><span class="keyword">const</span> <span class="identifier">CharT</span> <span class="special">*</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">allocator_type</span> <span class="special">&amp;</span> <span class="special">=</span> <span class="identifier">allocator_type</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span>
+ basic_string<span class="special">(</span><span class="identifier">size_type</span><span class="special">,</span> <span class="identifier">CharT</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">allocator_type</span> <span class="special">&amp;</span> <span class="special">=</span> <span class="identifier">allocator_type</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span>
+ <span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> InputIterator<span class="special">&gt;</span>
+ basic_string<span class="special">(</span><span class="identifier">InputIterator</span><span class="special">,</span> <span class="identifier">InputIterator</span><span class="special">,</span>
+ <span class="keyword">const</span> <span class="identifier">allocator_type</span> <span class="special">&amp;</span> <span class="special">=</span> <span class="identifier">allocator_type</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span>
+ basic_string&amp; operator=<span class="special">(</span><span class="keyword">const</span> basic_string <span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
+ basic_string&amp; operator=<span class="special">(</span>basic_string <span class="special">&amp;&amp;</span><span class="special">)</span><span class="special">;</span>
+ basic_string&amp; operator=<span class="special">(</span><span class="keyword">const</span> <span class="identifier">CharT</span> <span class="special">*</span><span class="special">)</span><span class="special">;</span>
+ basic_string&amp; operator=<span class="special">(</span><span class="identifier">CharT</span><span class="special">)</span><span class="special">;</span>
+ ~basic_string<span class="special">(</span><span class="special">)</span><span class="special">;</span>
 
- <span class="emphasis"><em>// public member functions</em></span>
- <span class="type">iterator</span> begin() ;
- <span class="type">const_iterator</span> begin() <span class="bold"><strong>const</strong></span>;
- <span class="type">iterator</span> end() ;
- <span class="type">const_iterator</span> end() <span class="bold"><strong>const</strong></span>;
- <span class="type">reverse_iterator</span> rbegin() ;
- <span class="type">const_reverse_iterator</span> rbegin() <span class="bold"><strong>const</strong></span>;
- <span class="type">reverse_iterator</span> rend() ;
- <span class="type">const_reverse_iterator</span> rend() <span class="bold"><strong>const</strong></span>;
- <span class="type">allocator_type</span> get_allocator() <span class="bold"><strong>const</strong></span>;
- <span class="type">size_type</span> size() <span class="bold"><strong>const</strong></span>;
- <span class="type">size_type</span> length() <span class="bold"><strong>const</strong></span>;
- <span class="type">size_type</span> max_size() <span class="bold"><strong>const</strong></span>;
- <span class="type"><span class="bold"><strong>void</strong></span></span> resize(size_type, CharT) ;
- <span class="type"><span class="bold"><strong>void</strong></span></span> resize(size_type) ;
- <span class="type"><span class="bold"><strong>void</strong></span></span> reserve(size_type) ;
- <span class="type">size_type</span> capacity() <span class="bold"><strong>const</strong></span>;
- <span class="type"><span class="bold"><strong>void</strong></span></span> clear() ;
- <span class="type"><span class="bold"><strong>bool</strong></span></span> empty() <span class="bold"><strong>const</strong></span>;
- <span class="type">reference</span> operator[](size_type) ;
- <span class="type">const_reference</span> operator[](size_type) <span class="bold"><strong>const</strong></span>;
- <span class="type">reference</span> at(size_type) ;
- <span class="type">const_reference</span> at(size_type) <span class="bold"><strong>const</strong></span>;
- <span class="type">basic_string &amp;</span> operator+=(<span class="bold"><strong>const</strong></span> basic_string &amp;) ;
- <span class="type">basic_string &amp;</span> operator+=(<span class="bold"><strong>const</strong></span> CharT *) ;
- <span class="type">basic_string &amp;</span> operator+=(CharT) ;
- <span class="type">basic_string &amp;</span> append(<span class="bold"><strong>const</strong></span> basic_string &amp;) ;
- <span class="type">basic_string &amp;</span> append(<span class="bold"><strong>const</strong></span> basic_string &amp;, size_type, size_type) ;
- <span class="type">basic_string &amp;</span> append(<span class="bold"><strong>const</strong></span> CharT *, size_type) ;
- <span class="type">basic_string &amp;</span> append(<span class="bold"><strong>const</strong></span> CharT *) ;
- <span class="type">basic_string &amp;</span> append(size_type, CharT) ;
- <span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>typename</strong></span> InputIter&gt; <span class="type">basic_string &amp;</span> append(InputIter, InputIter) ;
- <span class="type"><span class="bold"><strong>void</strong></span></span> push_back(CharT) ;
- <span class="type"><span class="bold"><strong>void</strong></span></span> pop_back() ;
- <span class="type">basic_string &amp;</span> assign(<span class="bold"><strong>const</strong></span> basic_string &amp;) ;
- <span class="type">basic_string &amp;</span> assign(basic_string &amp;&amp;) ;
- <span class="type">basic_string &amp;</span> assign(<span class="bold"><strong>const</strong></span> basic_string &amp;, size_type, size_type) ;
- <span class="type">basic_string &amp;</span> assign(<span class="bold"><strong>const</strong></span> CharT *, size_type) ;
- <span class="type">basic_string &amp;</span> assign(<span class="bold"><strong>const</strong></span> CharT *) ;
- <span class="type">basic_string &amp;</span> assign(size_type, CharT) ;
- <span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>typename</strong></span> InputIter&gt; <span class="type">basic_string &amp;</span> assign(InputIter, InputIter) ;
- <span class="type">basic_string &amp;</span> assign(<span class="bold"><strong>const</strong></span> CharT *, <span class="bold"><strong>const</strong></span> CharT *) ;
- <span class="type">basic_string &amp;</span> insert(size_type, <span class="bold"><strong>const</strong></span> basic_string &amp;) ;
- <span class="type">basic_string &amp;</span>
- insert(size_type, <span class="bold"><strong>const</strong></span> basic_string &amp;, size_type, size_type) ;
- <span class="type">basic_string &amp;</span> insert(size_type, <span class="bold"><strong>const</strong></span> CharT *, size_type) ;
- <span class="type">basic_string &amp;</span> insert(size_type, <span class="bold"><strong>const</strong></span> CharT *) ;
- <span class="type">basic_string &amp;</span> insert(size_type, size_type, CharT) ;
- <span class="type">iterator</span> insert(iterator, CharT) ;
- <span class="type"><span class="bold"><strong>void</strong></span></span> insert(iterator, std::size_t, CharT) ;
- <span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>typename</strong></span> InputIter&gt; <span class="type"><span class="bold"><strong>void</strong></span></span> insert(iterator, InputIter, InputIter) ;
- <span class="type">basic_string &amp;</span> erase(size_type = 0, size_type = npos) ;
- <span class="type">iterator</span> erase(iterator) ;
- <span class="type">iterator</span> erase(iterator, iterator) ;
- <span class="type">basic_string &amp;</span> replace(size_type, size_type, <span class="bold"><strong>const</strong></span> basic_string &amp;) ;
- <span class="type">basic_string &amp;</span>
- replace(size_type, size_type, <span class="bold"><strong>const</strong></span> basic_string &amp;, size_type, size_type) ;
- <span class="type">basic_string &amp;</span> replace(size_type, size_type, <span class="bold"><strong>const</strong></span> CharT *, size_type) ;
- <span class="type">basic_string &amp;</span> replace(size_type, size_type, <span class="bold"><strong>const</strong></span> CharT *) ;
- <span class="type">basic_string &amp;</span> replace(size_type, size_type, size_type, CharT) ;
- <span class="type">basic_string &amp;</span> replace(iterator, iterator, <span class="bold"><strong>const</strong></span> basic_string &amp;) ;
- <span class="type">basic_string &amp;</span> replace(iterator, iterator, <span class="bold"><strong>const</strong></span> CharT *, size_type) ;
- <span class="type">basic_string &amp;</span> replace(iterator, iterator, <span class="bold"><strong>const</strong></span> CharT *) ;
- <span class="type">basic_string &amp;</span> replace(iterator, iterator, size_type, CharT) ;
- <span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>typename</strong></span> InputIter&gt;
- <span class="type">basic_string &amp;</span> replace(iterator, iterator, InputIter, InputIter) ;
- <span class="type">size_type</span> copy(CharT *, size_type, size_type = 0) <span class="bold"><strong>const</strong></span>;
- <span class="type"><span class="bold"><strong>void</strong></span></span> swap(basic_string &amp;) ;
- <span class="type"><span class="bold"><strong>const</strong></span> CharT *</span> c_str() <span class="bold"><strong>const</strong></span>;
- <span class="type"><span class="bold"><strong>const</strong></span> CharT *</span> data() <span class="bold"><strong>const</strong></span>;
- <span class="type">size_type</span> find(<span class="bold"><strong>const</strong></span> basic_string &amp;, size_type = 0) <span class="bold"><strong>const</strong></span>;
- <span class="type">size_type</span> find(<span class="bold"><strong>const</strong></span> CharT *, size_type = 0) <span class="bold"><strong>const</strong></span>;
- <span class="type">size_type</span> find(<span class="bold"><strong>const</strong></span> CharT *, size_type, size_type) <span class="bold"><strong>const</strong></span>;
- <span class="type">size_type</span> find(CharT, size_type = 0) <span class="bold"><strong>const</strong></span>;
- <span class="type">size_type</span> rfind(<span class="bold"><strong>const</strong></span> basic_string &amp;, size_type = npos) <span class="bold"><strong>const</strong></span>;
- <span class="type">size_type</span> rfind(<span class="bold"><strong>const</strong></span> CharT *, size_type = npos) <span class="bold"><strong>const</strong></span>;
- <span class="type">size_type</span> rfind(<span class="bold"><strong>const</strong></span> CharT *, size_type, size_type) <span class="bold"><strong>const</strong></span>;
- <span class="type">size_type</span> rfind(CharT, size_type = npos) <span class="bold"><strong>const</strong></span>;
- <span class="type">size_type</span> find_first_of(<span class="bold"><strong>const</strong></span> basic_string &amp;, size_type = 0) <span class="bold"><strong>const</strong></span>;
- <span class="type">size_type</span> find_first_of(<span class="bold"><strong>const</strong></span> CharT *, size_type = 0) <span class="bold"><strong>const</strong></span>;
- <span class="type">size_type</span> find_first_of(<span class="bold"><strong>const</strong></span> CharT *, size_type, size_type) <span class="bold"><strong>const</strong></span>;
- <span class="type">size_type</span> find_first_of(CharT, size_type = 0) <span class="bold"><strong>const</strong></span>;
- <span class="type">size_type</span> find_last_of(<span class="bold"><strong>const</strong></span> basic_string &amp;, size_type = npos) <span class="bold"><strong>const</strong></span>;
- <span class="type">size_type</span> find_last_of(<span class="bold"><strong>const</strong></span> CharT *, size_type = npos) <span class="bold"><strong>const</strong></span>;
- <span class="type">size_type</span> find_last_of(<span class="bold"><strong>const</strong></span> CharT *, size_type, size_type) <span class="bold"><strong>const</strong></span>;
- <span class="type">size_type</span> find_last_of(CharT, size_type = npos) <span class="bold"><strong>const</strong></span>;
- <span class="type">size_type</span> find_first_not_of(<span class="bold"><strong>const</strong></span> basic_string &amp;, size_type = 0) <span class="bold"><strong>const</strong></span>;
- <span class="type">size_type</span> find_first_not_of(<span class="bold"><strong>const</strong></span> CharT *, size_type = 0) <span class="bold"><strong>const</strong></span>;
- <span class="type">size_type</span> find_first_not_of(<span class="bold"><strong>const</strong></span> CharT *, size_type, size_type) <span class="bold"><strong>const</strong></span>;
- <span class="type">size_type</span> find_first_not_of(CharT, size_type = 0) <span class="bold"><strong>const</strong></span>;
- <span class="type">size_type</span> find_last_not_of(<span class="bold"><strong>const</strong></span> basic_string &amp;, size_type = npos) <span class="bold"><strong>const</strong></span>;
- <span class="type">size_type</span> find_last_not_of(<span class="bold"><strong>const</strong></span> CharT *, size_type = npos) <span class="bold"><strong>const</strong></span>;
- <span class="type">size_type</span> find_last_not_of(<span class="bold"><strong>const</strong></span> CharT *, size_type, size_type) <span class="bold"><strong>const</strong></span>;
- <span class="type">size_type</span> find_last_not_of(CharT, size_type = npos) <span class="bold"><strong>const</strong></span>;
- <span class="type">basic_string</span> substr(size_type = 0, size_type = npos) <span class="bold"><strong>const</strong></span>;
- <span class="type"><span class="bold"><strong>int</strong></span></span> compare(<span class="bold"><strong>const</strong></span> basic_string &amp;) <span class="bold"><strong>const</strong></span>;
- <span class="type"><span class="bold"><strong>int</strong></span></span> compare(size_type, size_type, <span class="bold"><strong>const</strong></span> basic_string &amp;) <span class="bold"><strong>const</strong></span>;
- <span class="type"><span class="bold"><strong>int</strong></span></span> compare(size_type, size_type, <span class="bold"><strong>const</strong></span> basic_string &amp;, size_type,
- size_type) <span class="bold"><strong>const</strong></span>;
- <span class="type"><span class="bold"><strong>int</strong></span></span> compare(<span class="bold"><strong>const</strong></span> CharT *) <span class="bold"><strong>const</strong></span>;
- <span class="type"><span class="bold"><strong>int</strong></span></span> compare(size_type, size_type, <span class="bold"><strong>const</strong></span> CharT *, size_type = npos) <span class="bold"><strong>const</strong></span>;
- <span class="bold"><strong>static</strong></span> <span class="type"><span class="bold"><strong>const</strong></span> size_type</span> npos; <span class="emphasis"><em>// The largest possible value of type size_type. That is, size_type(-1). </em></span>
-};</pre></div>
+ <span class="comment">// public member functions</span>
+ <span class="identifier">iterator</span> begin<span class="special">(</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">const_iterator</span> begin<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">iterator</span> end<span class="special">(</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">const_iterator</span> end<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">reverse_iterator</span> rbegin<span class="special">(</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">const_reverse_iterator</span> rbegin<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">reverse_iterator</span> rend<span class="special">(</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">const_reverse_iterator</span> rend<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">allocator_type</span> get_allocator<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">size_type</span> size<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">size_type</span> length<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">size_type</span> max_size<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="keyword">void</span> resize<span class="special">(</span><span class="identifier">size_type</span><span class="special">,</span> <span class="identifier">CharT</span><span class="special">)</span><span class="special">;</span>
+ <span class="keyword">void</span> resize<span class="special">(</span><span class="identifier">size_type</span><span class="special">)</span><span class="special">;</span>
+ <span class="keyword">void</span> reserve<span class="special">(</span><span class="identifier">size_type</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">size_type</span> capacity<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="keyword">void</span> clear<span class="special">(</span><span class="special">)</span><span class="special">;</span>
+ <span class="keyword">bool</span> empty<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">reference</span> operator[]<span class="special">(</span><span class="identifier">size_type</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">const_reference</span> operator[]<span class="special">(</span><span class="identifier">size_type</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">reference</span> at<span class="special">(</span><span class="identifier">size_type</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">const_reference</span> at<span class="special">(</span><span class="identifier">size_type</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ basic_string <span class="special">&amp;</span> operator+=<span class="special">(</span><span class="keyword">const</span> basic_string <span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
+ basic_string <span class="special">&amp;</span> operator+=<span class="special">(</span><span class="keyword">const</span> <span class="identifier">CharT</span> <span class="special">*</span><span class="special">)</span><span class="special">;</span>
+ basic_string <span class="special">&amp;</span> operator+=<span class="special">(</span><span class="identifier">CharT</span><span class="special">)</span><span class="special">;</span>
+ basic_string <span class="special">&amp;</span> append<span class="special">(</span><span class="keyword">const</span> basic_string <span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
+ basic_string <span class="special">&amp;</span> append<span class="special">(</span><span class="keyword">const</span> basic_string <span class="special">&amp;</span><span class="special">,</span> <span class="identifier">size_type</span><span class="special">,</span> <span class="identifier">size_type</span><span class="special">)</span><span class="special">;</span>
+ basic_string <span class="special">&amp;</span> append<span class="special">(</span><span class="keyword">const</span> <span class="identifier">CharT</span> <span class="special">*</span><span class="special">,</span> <span class="identifier">size_type</span><span class="special">)</span><span class="special">;</span>
+ basic_string <span class="special">&amp;</span> append<span class="special">(</span><span class="keyword">const</span> <span class="identifier">CharT</span> <span class="special">*</span><span class="special">)</span><span class="special">;</span>
+ basic_string <span class="special">&amp;</span> append<span class="special">(</span><span class="identifier">size_type</span><span class="special">,</span> <span class="identifier">CharT</span><span class="special">)</span><span class="special">;</span>
+ <span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> InputIter<span class="special">&gt;</span> basic_string <span class="special">&amp;</span> append<span class="special">(</span><span class="identifier">InputIter</span><span class="special">,</span> <span class="identifier">InputIter</span><span class="special">)</span><span class="special">;</span>
+ <span class="keyword">void</span> push_back<span class="special">(</span><span class="identifier">CharT</span><span class="special">)</span><span class="special">;</span>
+ <span class="keyword">void</span> pop_back<span class="special">(</span><span class="special">)</span><span class="special">;</span>
+ basic_string <span class="special">&amp;</span> assign<span class="special">(</span><span class="keyword">const</span> basic_string <span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
+ basic_string <span class="special">&amp;</span> assign<span class="special">(</span>basic_string <span class="special">&amp;&amp;</span><span class="special">)</span><span class="special">;</span>
+ basic_string <span class="special">&amp;</span> assign<span class="special">(</span><span class="keyword">const</span> basic_string <span class="special">&amp;</span><span class="special">,</span> <span class="identifier">size_type</span><span class="special">,</span> <span class="identifier">size_type</span><span class="special">)</span><span class="special">;</span>
+ basic_string <span class="special">&amp;</span> assign<span class="special">(</span><span class="keyword">const</span> <span class="identifier">CharT</span> <span class="special">*</span><span class="special">,</span> <span class="identifier">size_type</span><span class="special">)</span><span class="special">;</span>
+ basic_string <span class="special">&amp;</span> assign<span class="special">(</span><span class="keyword">const</span> <span class="identifier">CharT</span> <span class="special">*</span><span class="special">)</span><span class="special">;</span>
+ basic_string <span class="special">&amp;</span> assign<span class="special">(</span><span class="identifier">size_type</span><span class="special">,</span> <span class="identifier">CharT</span><span class="special">)</span><span class="special">;</span>
+ <span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> InputIter<span class="special">&gt;</span> basic_string <span class="special">&amp;</span> assign<span class="special">(</span><span class="identifier">InputIter</span><span class="special">,</span> <span class="identifier">InputIter</span><span class="special">)</span><span class="special">;</span>
+ basic_string <span class="special">&amp;</span> assign<span class="special">(</span><span class="keyword">const</span> <span class="identifier">CharT</span> <span class="special">*</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">CharT</span> <span class="special">*</span><span class="special">)</span><span class="special">;</span>
+ basic_string <span class="special">&amp;</span> insert<span class="special">(</span><span class="identifier">size_type</span><span class="special">,</span> <span class="keyword">const</span> basic_string <span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
+ basic_string <span class="special">&amp;</span> insert<span class="special">(</span><span class="identifier">size_type</span><span class="special">,</span> <span class="keyword">const</span> basic_string <span class="special">&amp;</span><span class="special">,</span> <span class="identifier">size_type</span><span class="special">,</span> <span class="identifier">size_type</span><span class="special">)</span><span class="special">;</span>
+ basic_string <span class="special">&amp;</span> insert<span class="special">(</span><span class="identifier">size_type</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">CharT</span> <span class="special">*</span><span class="special">,</span> <span class="identifier">size_type</span><span class="special">)</span><span class="special">;</span>
+ basic_string <span class="special">&amp;</span> insert<span class="special">(</span><span class="identifier">size_type</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">CharT</span> <span class="special">*</span><span class="special">)</span><span class="special">;</span>
+ basic_string <span class="special">&amp;</span> insert<span class="special">(</span><span class="identifier">size_type</span><span class="special">,</span> <span class="identifier">size_type</span><span class="special">,</span> <span class="identifier">CharT</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">iterator</span> insert<span class="special">(</span><span class="identifier">iterator</span><span class="special">,</span> <span class="identifier">CharT</span><span class="special">)</span><span class="special">;</span>
+ <span class="keyword">void</span> insert<span class="special">(</span><span class="identifier">iterator</span><span class="special">,</span> <span class="identifier">size_type</span><span class="special">,</span> <span class="identifier">CharT</span><span class="special">)</span><span class="special">;</span>
+ <span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> InputIter<span class="special">&gt;</span> <span class="keyword">void</span> insert<span class="special">(</span><span class="identifier">iterator</span><span class="special">,</span> <span class="identifier">InputIter</span><span class="special">,</span> <span class="identifier">InputIter</span><span class="special">)</span><span class="special">;</span>
+ basic_string <span class="special">&amp;</span> erase<span class="special">(</span><span class="identifier">size_type</span> <span class="special">=</span> <span class="number">0</span><span class="special">,</span> <span class="identifier">size_type</span> <span class="special">=</span> <span class="identifier">npos</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">iterator</span> erase<span class="special">(</span><span class="identifier">iterator</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">iterator</span> erase<span class="special">(</span><span class="identifier">iterator</span><span class="special">,</span> <span class="identifier">iterator</span><span class="special">)</span><span class="special">;</span>
+ basic_string <span class="special">&amp;</span> replace<span class="special">(</span><span class="identifier">size_type</span><span class="special">,</span> <span class="identifier">size_type</span><span class="special">,</span> <span class="keyword">const</span> basic_string <span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
+ basic_string <span class="special">&amp;</span>
+ replace<span class="special">(</span><span class="identifier">size_type</span><span class="special">,</span> <span class="identifier">size_type</span><span class="special">,</span> <span class="keyword">const</span> basic_string <span class="special">&amp;</span><span class="special">,</span> <span class="identifier">size_type</span><span class="special">,</span> <span class="identifier">size_type</span><span class="special">)</span><span class="special">;</span>
+ basic_string <span class="special">&amp;</span> replace<span class="special">(</span><span class="identifier">size_type</span><span class="special">,</span> <span class="identifier">size_type</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">CharT</span> <span class="special">*</span><span class="special">,</span> <span class="identifier">size_type</span><span class="special">)</span><span class="special">;</span>
+ basic_string <span class="special">&amp;</span> replace<span class="special">(</span><span class="identifier">size_type</span><span class="special">,</span> <span class="identifier">size_type</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">CharT</span> <span class="special">*</span><span class="special">)</span><span class="special">;</span>
+ basic_string <span class="special">&amp;</span> replace<span class="special">(</span><span class="identifier">size_type</span><span class="special">,</span> <span class="identifier">size_type</span><span class="special">,</span> <span class="identifier">size_type</span><span class="special">,</span> <span class="identifier">CharT</span><span class="special">)</span><span class="special">;</span>
+ basic_string <span class="special">&amp;</span> replace<span class="special">(</span><span class="identifier">iterator</span><span class="special">,</span> <span class="identifier">iterator</span><span class="special">,</span> <span class="keyword">const</span> basic_string <span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
+ basic_string <span class="special">&amp;</span> replace<span class="special">(</span><span class="identifier">iterator</span><span class="special">,</span> <span class="identifier">iterator</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">CharT</span> <span class="special">*</span><span class="special">,</span> <span class="identifier">size_type</span><span class="special">)</span><span class="special">;</span>
+ basic_string <span class="special">&amp;</span> replace<span class="special">(</span><span class="identifier">iterator</span><span class="special">,</span> <span class="identifier">iterator</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">CharT</span> <span class="special">*</span><span class="special">)</span><span class="special">;</span>
+ basic_string <span class="special">&amp;</span> replace<span class="special">(</span><span class="identifier">iterator</span><span class="special">,</span> <span class="identifier">iterator</span><span class="special">,</span> <span class="identifier">size_type</span><span class="special">,</span> <span class="identifier">CharT</span><span class="special">)</span><span class="special">;</span>
+ <span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> InputIter<span class="special">&gt;</span>
+ basic_string <span class="special">&amp;</span> replace<span class="special">(</span><span class="identifier">iterator</span><span class="special">,</span> <span class="identifier">iterator</span><span class="special">,</span> <span class="identifier">InputIter</span><span class="special">,</span> <span class="identifier">InputIter</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">size_type</span> copy<span class="special">(</span><span class="identifier">CharT</span> <span class="special">*</span><span class="special">,</span> <span class="identifier">size_type</span><span class="special">,</span> <span class="identifier">size_type</span> <span class="special">=</span> <span class="number">0</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="keyword">void</span> swap<span class="special">(</span>basic_string <span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
+ <span class="keyword">const</span> <span class="identifier">CharT</span> <span class="special">*</span> c_str<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="keyword">const</span> <span class="identifier">CharT</span> <span class="special">*</span> data<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">size_type</span> find<span class="special">(</span><span class="keyword">const</span> basic_string <span class="special">&amp;</span><span class="special">,</span> <span class="identifier">size_type</span> <span class="special">=</span> <span class="number">0</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">size_type</span> find<span class="special">(</span><span class="keyword">const</span> <span class="identifier">CharT</span> <span class="special">*</span><span class="special">,</span> <span class="identifier">size_type</span> <span class="special">=</span> <span class="number">0</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">size_type</span> find<span class="special">(</span><span class="keyword">const</span> <span class="identifier">CharT</span> <span class="special">*</span><span class="special">,</span> <span class="identifier">size_type</span><span class="special">,</span> <span class="identifier">size_type</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">size_type</span> find<span class="special">(</span><span class="identifier">CharT</span><span class="special">,</span> <span class="identifier">size_type</span> <span class="special">=</span> <span class="number">0</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">size_type</span> rfind<span class="special">(</span><span class="keyword">const</span> basic_string <span class="special">&amp;</span><span class="special">,</span> <span class="identifier">size_type</span> <span class="special">=</span> <span class="identifier">npos</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">size_type</span> rfind<span class="special">(</span><span class="keyword">const</span> <span class="identifier">CharT</span> <span class="special">*</span><span class="special">,</span> <span class="identifier">size_type</span> <span class="special">=</span> <span class="identifier">npos</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">size_type</span> rfind<span class="special">(</span><span class="keyword">const</span> <span class="identifier">CharT</span> <span class="special">*</span><span class="special">,</span> <span class="identifier">size_type</span><span class="special">,</span> <span class="identifier">size_type</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">size_type</span> rfind<span class="special">(</span><span class="identifier">CharT</span><span class="special">,</span> <span class="identifier">size_type</span> <span class="special">=</span> <span class="identifier">npos</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">size_type</span> find_first_of<span class="special">(</span><span class="keyword">const</span> basic_string <span class="special">&amp;</span><span class="special">,</span> <span class="identifier">size_type</span> <span class="special">=</span> <span class="number">0</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">size_type</span> find_first_of<span class="special">(</span><span class="keyword">const</span> <span class="identifier">CharT</span> <span class="special">*</span><span class="special">,</span> <span class="identifier">size_type</span> <span class="special">=</span> <span class="number">0</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">size_type</span> find_first_of<span class="special">(</span><span class="keyword">const</span> <span class="identifier">CharT</span> <span class="special">*</span><span class="special">,</span> <span class="identifier">size_type</span><span class="special">,</span> <span class="identifier">size_type</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">size_type</span> find_first_of<span class="special">(</span><span class="identifier">CharT</span><span class="special">,</span> <span class="identifier">size_type</span> <span class="special">=</span> <span class="number">0</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">size_type</span> find_last_of<span class="special">(</span><span class="keyword">const</span> basic_string <span class="special">&amp;</span><span class="special">,</span> <span class="identifier">size_type</span> <span class="special">=</span> <span class="identifier">npos</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">size_type</span> find_last_of<span class="special">(</span><span class="keyword">const</span> <span class="identifier">CharT</span> <span class="special">*</span><span class="special">,</span> <span class="identifier">size_type</span> <span class="special">=</span> <span class="identifier">npos</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">size_type</span> find_last_of<span class="special">(</span><span class="keyword">const</span> <span class="identifier">CharT</span> <span class="special">*</span><span class="special">,</span> <span class="identifier">size_type</span><span class="special">,</span> <span class="identifier">size_type</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">size_type</span> find_last_of<span class="special">(</span><span class="identifier">CharT</span><span class="special">,</span> <span class="identifier">size_type</span> <span class="special">=</span> <span class="identifier">npos</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">size_type</span> find_first_not_of<span class="special">(</span><span class="keyword">const</span> basic_string <span class="special">&amp;</span><span class="special">,</span> <span class="identifier">size_type</span> <span class="special">=</span> <span class="number">0</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">size_type</span> find_first_not_of<span class="special">(</span><span class="keyword">const</span> <span class="identifier">CharT</span> <span class="special">*</span><span class="special">,</span> <span class="identifier">size_type</span> <span class="special">=</span> <span class="number">0</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">size_type</span> find_first_not_of<span class="special">(</span><span class="keyword">const</span> <span class="identifier">CharT</span> <span class="special">*</span><span class="special">,</span> <span class="identifier">size_type</span><span class="special">,</span> <span class="identifier">size_type</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">size_type</span> find_first_not_of<span class="special">(</span><span class="identifier">CharT</span><span class="special">,</span> <span class="identifier">size_type</span> <span class="special">=</span> <span class="number">0</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">size_type</span> find_last_not_of<span class="special">(</span><span class="keyword">const</span> basic_string <span class="special">&amp;</span><span class="special">,</span> <span class="identifier">size_type</span> <span class="special">=</span> <span class="identifier">npos</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">size_type</span> find_last_not_of<span class="special">(</span><span class="keyword">const</span> <span class="identifier">CharT</span> <span class="special">*</span><span class="special">,</span> <span class="identifier">size_type</span> <span class="special">=</span> <span class="identifier">npos</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">size_type</span> find_last_not_of<span class="special">(</span><span class="keyword">const</span> <span class="identifier">CharT</span> <span class="special">*</span><span class="special">,</span> <span class="identifier">size_type</span><span class="special">,</span> <span class="identifier">size_type</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">size_type</span> find_last_not_of<span class="special">(</span><span class="identifier">CharT</span><span class="special">,</span> <span class="identifier">size_type</span> <span class="special">=</span> <span class="identifier">npos</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ basic_string substr<span class="special">(</span><span class="identifier">size_type</span> <span class="special">=</span> <span class="number">0</span><span class="special">,</span> <span class="identifier">size_type</span> <span class="special">=</span> <span class="identifier">npos</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="keyword">int</span> compare<span class="special">(</span><span class="keyword">const</span> basic_string <span class="special">&amp;</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="keyword">int</span> compare<span class="special">(</span><span class="identifier">size_type</span><span class="special">,</span> <span class="identifier">size_type</span><span class="special">,</span> <span class="keyword">const</span> basic_string <span class="special">&amp;</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="keyword">int</span> compare<span class="special">(</span><span class="identifier">size_type</span><span class="special">,</span> <span class="identifier">size_type</span><span class="special">,</span> <span class="keyword">const</span> basic_string <span class="special">&amp;</span><span class="special">,</span> <span class="identifier">size_type</span><span class="special">,</span>
+ <span class="identifier">size_type</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="keyword">int</span> compare<span class="special">(</span><span class="keyword">const</span> <span class="identifier">CharT</span> <span class="special">*</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="keyword">int</span> compare<span class="special">(</span><span class="identifier">size_type</span><span class="special">,</span> <span class="identifier">size_type</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">CharT</span> <span class="special">*</span><span class="special">,</span> <span class="identifier">size_type</span> <span class="special">=</span> <span class="identifier">npos</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="keyword">static</span> <span class="keyword">const</span> <span class="identifier">size_type</span> npos<span class="special">;</span> <span class="comment">// The largest possible value of type size_type. That is, size_type(-1). </span>
+<span class="special">}</span><span class="special">;</span></pre></div>
 <div class="refsect1" lang="en">
-<a name="id531627"></a><h2>Description</h2>
+<a name="id871628"></a><h2>Description</h2>
 <p>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.</p>
 <p>The basic_string class is parameterized by character type, and by that type's Character Traits.</p>
 <p>This class has performance characteristics very much like vector&lt;&gt;, 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.</p>
@@ -183,86 +180,84 @@
 <p>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).</p>
 <p>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. </p>
 <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>
 <p>
-<span class="bold"><strong>typedef</strong></span> A <a name="boost.container.basic_string.allocator_type"></a>allocator_type;</p>
+<span class="keyword">typedef</span> <span class="identifier">A</span> <a name="boost.container.basic_string.allocator_type"></a><span class="identifier">allocator_type</span><span class="special">;</span></p>
 <p>The allocator type </p>
 </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,
- <span class="bold"><strong>const</strong></span> allocator_type &amp; a = allocator_type());</pre></li>
 <li>
-<pre class="literallayout"><a name="id326048-bb"></a>basic_string(<span class="bold"><strong>const</strong></span> allocator_type &amp; a = allocator_type());</pre>
+<pre class="literallayout"><a name="id406498-bb"></a><span class="identifier">basic_string</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">allocator_type</span> <span class="special">&amp;</span> a <span class="special">=</span> <span class="identifier">allocator_type</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Constructs a basic_string taking the allocator as parameter.</p>
 <p><span class="bold"><strong>Throws</strong></span>: If allocator_type's copy constructor throws. </p>
 </li>
 <li>
-<pre class="literallayout"><a name="id326071-bb"></a>basic_string(<span class="bold"><strong>const</strong></span> basic_string &amp; s);</pre>
+<pre class="literallayout"><a name="id406521-bb"></a><span class="identifier">basic_string</span><span class="special">(</span><span class="keyword">const</span> basic_string <span class="special">&amp;</span> s<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Copy constructs a basic_string.</p>
 <p><span class="bold"><strong>Postcondition</strong></span>: x == *this.</p>
 <p><span class="bold"><strong>Throws</strong></span>: If allocator_type's default constructor or copy constructor throws. </p>
 </li>
 <li>
-<pre class="literallayout"><a name="id326100-bb"></a>basic_string(basic_string &amp;&amp; s);</pre>
+<pre class="literallayout"><a name="id406550-bb"></a><span class="identifier">basic_string</span><span class="special">(</span>basic_string <span class="special">&amp;&amp;</span> s<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Move constructor. Moves mx's resources to *this.</p>
 <p><span class="bold"><strong>Throws</strong></span>: If allocator_type's copy constructor throws.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><a name="id326128-bb"></a>basic_string(<span class="bold"><strong>const</strong></span> basic_string &amp; s, size_type pos, size_type n = npos,
- <span class="bold"><strong>const</strong></span> allocator_type &amp; a = allocator_type());</pre>
+<pre class="literallayout"><a name="id406578-bb"></a><span class="identifier">basic_string</span><span class="special">(</span><span class="keyword">const</span> basic_string <span class="special">&amp;</span> s<span class="special">,</span> <span class="identifier">size_type</span> pos<span class="special">,</span> <span class="identifier">size_type</span> n <span class="special">=</span> <span class="identifier">npos</span><span class="special">,</span>
+ <span class="keyword">const</span> <span class="identifier">allocator_type</span> <span class="special">&amp;</span> a <span class="special">=</span> <span class="identifier">allocator_type</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Constructs a basic_string taking the allocator as parameter, and is initialized by a specific number of characters of the s string. </p>
 </li>
 <li>
-<pre class="literallayout"><a name="id326164-bb"></a>basic_string(<span class="bold"><strong>const</strong></span> CharT * s, size_type n,
- <span class="bold"><strong>const</strong></span> allocator_type &amp; a = allocator_type());</pre>
+<pre class="literallayout"><a name="id406614-bb"></a><span class="identifier">basic_string</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">CharT</span> <span class="special">*</span> s<span class="special">,</span> <span class="identifier">size_type</span> n<span class="special">,</span>
+ <span class="keyword">const</span> <span class="identifier">allocator_type</span> <span class="special">&amp;</span> a <span class="special">=</span> <span class="identifier">allocator_type</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Constructs a basic_string taking the allocator as parameter, and is initialized by a specific number of characters of the s c-string. </p>
 </li>
 <li>
-<pre class="literallayout"><a name="id326189-bb"></a>basic_string(<span class="bold"><strong>const</strong></span> CharT * s, <span class="bold"><strong>const</strong></span> allocator_type &amp; a = allocator_type());</pre>
+<pre class="literallayout"><a name="id406639-bb"></a><span class="identifier">basic_string</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">CharT</span> <span class="special">*</span> s<span class="special">,</span> <span class="keyword">const</span> <span class="identifier">allocator_type</span> <span class="special">&amp;</span> a <span class="special">=</span> <span class="identifier">allocator_type</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Constructs a basic_string taking the allocator as parameter, and is initialized by the null-terminated s c-string. </p>
 </li>
 <li>
-<pre class="literallayout"><a name="id326209-bb"></a>basic_string(size_type n, CharT c,
- <span class="bold"><strong>const</strong></span> allocator_type &amp; a = allocator_type());</pre>
+<pre class="literallayout"><a name="id406659-bb"></a><span class="identifier">basic_string</span><span class="special">(</span><span class="identifier">size_type</span> n<span class="special">,</span> <span class="identifier">CharT</span> c<span class="special">,</span>
+ <span class="keyword">const</span> <span class="identifier">allocator_type</span> <span class="special">&amp;</span> a <span class="special">=</span> <span class="identifier">allocator_type</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Constructs a basic_string taking the allocator as parameter, and is initialized by n copies of c. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>typename</strong></span> InputIterator&gt;
- <a name="id326234-bb"></a>basic_string(InputIterator f, InputIterator l,
- <span class="bold"><strong>const</strong></span> allocator_type &amp; a = allocator_type());</pre>
+<pre class="literallayout"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> InputIterator<span class="special">&gt;</span>
+ <a name="id406684-bb"></a><span class="identifier">basic_string</span><span class="special">(</span><span class="identifier">InputIterator</span> f<span class="special">,</span> <span class="identifier">InputIterator</span> l<span class="special">,</span>
+ <span class="keyword">const</span> <span class="identifier">allocator_type</span> <span class="special">&amp;</span> a <span class="special">=</span> <span class="identifier">allocator_type</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Constructs a basic_string taking the allocator as parameter, and a range of iterators. </p>
 </li>
 <li>
-<pre class="literallayout">basic_string&amp; <a name="id326287-bb"></a><span class="bold"><strong>operator</strong></span>=(<span class="bold"><strong>const</strong></span> basic_string &amp; s);</pre>
+<pre class="literallayout">basic_string&amp; <a name="id406737-bb"></a><span class="keyword">operator</span><span class="special">=</span><span class="special">(</span><span class="keyword">const</span> basic_string <span class="special">&amp;</span> s<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Copy constructs a string.</p>
 <p><span class="bold"><strong>Postcondition</strong></span>: x == *this.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Linear to the elements x contains. </p>
 </li>
 <li>
-<pre class="literallayout">basic_string&amp; <a name="id326316-bb"></a><span class="bold"><strong>operator</strong></span>=(basic_string &amp;&amp; ms);</pre>
+<pre class="literallayout">basic_string&amp; <a name="id406766-bb"></a><span class="keyword">operator</span><span class="special">=</span><span class="special">(</span>basic_string <span class="special">&amp;&amp;</span> ms<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Move constructor. Moves mx's resources to *this.</p>
 <p><span class="bold"><strong>Throws</strong></span>: If allocator_type's copy constructor throws.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout">basic_string&amp; <a name="id326344-bb"></a><span class="bold"><strong>operator</strong></span>=(<span class="bold"><strong>const</strong></span> CharT * s);</pre>
+<pre class="literallayout">basic_string&amp; <a name="id406794-bb"></a><span class="keyword">operator</span><span class="special">=</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">CharT</span> <span class="special">*</span> s<span class="special">)</span><span class="special">;</span></pre>
 <span class="bold"><strong>Effects</strong></span>: Assignment from a null-terminated c-string. </li>
 <li>
-<pre class="literallayout">basic_string&amp; <a name="id326356-bb"></a><span class="bold"><strong>operator</strong></span>=(CharT c);</pre>
+<pre class="literallayout">basic_string&amp; <a name="id406806-bb"></a><span class="keyword">operator</span><span class="special">=</span><span class="special">(</span><span class="identifier">CharT</span> c<span class="special">)</span><span class="special">;</span></pre>
 <span class="bold"><strong>Effects</strong></span>: Assignment from character. </li>
 <li>
-<pre class="literallayout"><a name="id326266-bb"></a>~basic_string();</pre>
+<pre class="literallayout"><a name="id406716-bb"></a><span class="special">~</span><span class="identifier">basic_string</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Destroys the basic_string. All used memory is deallocated.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
@@ -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"><span class="type">iterator</span> <a name="id321719-bb"></a>begin() ;</pre>
+<pre class="literallayout"><span class="identifier">iterator</span> <a name="id403553-bb"></a><span class="identifier">begin</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns an iterator to the first element contained in the vector.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">const_iterator</span> <a name="id321744-bb"></a>begin() <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">const_iterator</span> <a name="id403578-bb"></a><span class="identifier">begin</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns a const_iterator to the first element contained in the vector.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">iterator</span> <a name="id321770-bb"></a>end() ;</pre>
+<pre class="literallayout"><span class="identifier">iterator</span> <a name="id403603-bb"></a><span class="identifier">end</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns an iterator to the end of the vector.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">const_iterator</span> <a name="id321795-bb"></a>end() <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">const_iterator</span> <a name="id403628-bb"></a><span class="identifier">end</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns a const_iterator to the end of the vector.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">reverse_iterator</span> <a name="id321820-bb"></a>rbegin() ;</pre>
+<pre class="literallayout"><span class="identifier">reverse_iterator</span> <a name="id403653-bb"></a><span class="identifier">rbegin</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns a reverse_iterator pointing to the beginning of the reversed vector.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">const_reverse_iterator</span> <a name="id321845-bb"></a>rbegin() <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">const_reverse_iterator</span> <a name="id403679-bb"></a><span class="identifier">rbegin</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns a const_reverse_iterator pointing to the beginning of the reversed vector.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">reverse_iterator</span> <a name="id321870-bb"></a>rend() ;</pre>
+<pre class="literallayout"><span class="identifier">reverse_iterator</span> <a name="id403704-bb"></a><span class="identifier">rend</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns a reverse_iterator pointing to the end of the reversed vector.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">const_reverse_iterator</span> <a name="id321896-bb"></a>rend() <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">const_reverse_iterator</span> <a name="id403729-bb"></a><span class="identifier">rend</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns a const_reverse_iterator pointing to the end of the reversed vector.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">allocator_type</span> <a name="id321921-bb"></a>get_allocator() <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">allocator_type</span> <a name="id403754-bb"></a><span class="identifier">get_allocator</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns a copy of the internal allocator.</p>
 <p><span class="bold"><strong>Throws</strong></span>: If allocator's copy constructor throws.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">size_type</span> <a name="id321946-bb"></a>size() <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">size_type</span> <a name="id403779-bb"></a><span class="identifier">size</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns the number of the elements contained in the vector.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">size_type</span> <a name="id321972-bb"></a>length() <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">size_type</span> <a name="id403806-bb"></a><span class="identifier">length</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns the number of the elements contained in the vector.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">size_type</span> <a name="id321999-bb"></a>max_size() <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">size_type</span> <a name="id403832-bb"></a><span class="identifier">max_size</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns the largest possible size of the vector.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type"><span class="bold"><strong>void</strong></span></span> <a name="id322024-bb"></a>resize(size_type n, CharT c) ;</pre>
+<pre class="literallayout"><span class="keyword">void</span> <a name="id403857-bb"></a><span class="identifier">resize</span><span class="special">(</span><span class="identifier">size_type</span> n<span class="special">,</span> <span class="identifier">CharT</span> c<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Inserts or erases elements at the end such that the size becomes n. New elements are copy constructed from x.</p>
 <p><span class="bold"><strong>Throws</strong></span>: If memory allocation throws, or T's copy constructor throws.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Linear to the difference between size() and new_size. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type"><span class="bold"><strong>void</strong></span></span> <a name="id322061-bb"></a>resize(size_type n) ;</pre>
+<pre class="literallayout"><span class="keyword">void</span> <a name="id403895-bb"></a><span class="identifier">resize</span><span class="special">(</span><span class="identifier">size_type</span> n<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Inserts or erases elements at the end such that the size becomes n. New elements are default constructed.</p>
 <p><span class="bold"><strong>Throws</strong></span>: If memory allocation throws, or T's copy constructor throws.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Linear to the difference between size() and new_size. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type"><span class="bold"><strong>void</strong></span></span> <a name="id322094-bb"></a>reserve(size_type res_arg) ;</pre>
+<pre class="literallayout"><span class="keyword">void</span> <a name="id403927-bb"></a><span class="identifier">reserve</span><span class="special">(</span><span class="identifier">size_type</span> res_arg<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: 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.</p>
 <p><span class="bold"><strong>Throws</strong></span>: If memory allocation allocation throws or T's copy constructor throws. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">size_type</span> <a name="id322118-bb"></a>capacity() <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">size_type</span> <a name="id403951-bb"></a><span class="identifier">capacity</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Number of elements for which memory has been allocated. capacity() is always greater than or equal to size().</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type"><span class="bold"><strong>void</strong></span></span> <a name="id322143-bb"></a>clear() ;</pre>
+<pre class="literallayout"><span class="keyword">void</span> <a name="id403976-bb"></a><span class="identifier">clear</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Erases all the elements of the vector.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Linear to the number of elements in the vector. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type"><span class="bold"><strong>bool</strong></span></span> <a name="id322168-bb"></a>empty() <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="keyword">bool</span> <a name="id404001-bb"></a><span class="identifier">empty</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns true if the vector contains no elements.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">reference</span> <a name="id322193-bb"></a><span class="bold"><strong>operator</strong></span>[](size_type n) ;</pre>
+<pre class="literallayout"><span class="identifier">reference</span> <a name="id404027-bb"></a><span class="keyword">operator</span><span class="special">[</span><span class="special">]</span><span class="special">(</span><span class="identifier">size_type</span> n<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Requires</strong></span>: size() &lt; n.</p>
 <p><span class="bold"><strong>Effects</strong></span>: Returns a reference to the nth element from the beginning of the container.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">const_reference</span> <a name="id322229-bb"></a><span class="bold"><strong>operator</strong></span>[](size_type n) <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">const_reference</span> <a name="id404063-bb"></a><span class="keyword">operator</span><span class="special">[</span><span class="special">]</span><span class="special">(</span><span class="identifier">size_type</span> n<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Requires</strong></span>: size() &lt; n.</p>
 <p><span class="bold"><strong>Effects</strong></span>: Returns a const reference to the nth element from the beginning of the container.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">reference</span> <a name="id322265-bb"></a>at(size_type n) ;</pre>
+<pre class="literallayout"><span class="identifier">reference</span> <a name="id404099-bb"></a><span class="identifier">at</span><span class="special">(</span><span class="identifier">size_type</span> n<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Requires</strong></span>: size() &lt; n.</p>
 <p><span class="bold"><strong>Effects</strong></span>: Returns a reference to the nth element from the beginning of the container.</p>
 <p><span class="bold"><strong>Throws</strong></span>: std::range_error if n &gt;= size()</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">const_reference</span> <a name="id322301-bb"></a>at(size_type n) <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">const_reference</span> <a name="id404135-bb"></a><span class="identifier">at</span><span class="special">(</span><span class="identifier">size_type</span> n<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Requires</strong></span>: size() &lt; n.</p>
 <p><span class="bold"><strong>Effects</strong></span>: Returns a const reference to the nth element from the beginning of the container.</p>
 <p><span class="bold"><strong>Throws</strong></span>: std::range_error if n &gt;= size()</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">basic_string &amp;</span> <a name="id322337-bb"></a><span class="bold"><strong>operator</strong></span>+=(<span class="bold"><strong>const</strong></span> basic_string &amp; s) ;</pre>
+<pre class="literallayout">basic_string <span class="special">&amp;</span> <a name="id404171-bb"></a><span class="keyword">operator</span><span class="special">+=</span><span class="special">(</span><span class="keyword">const</span> basic_string <span class="special">&amp;</span> s<span class="special">)</span><span class="special">;</span></pre>
 <span class="bold"><strong>Effects</strong></span>: Appends string s to *this. </li>
 <li>
-<pre class="literallayout"><span class="type">basic_string &amp;</span> <a name="id322360-bb"></a><span class="bold"><strong>operator</strong></span>+=(<span class="bold"><strong>const</strong></span> CharT * s) ;</pre>
+<pre class="literallayout">basic_string <span class="special">&amp;</span> <a name="id404193-bb"></a><span class="keyword">operator</span><span class="special">+=</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">CharT</span> <span class="special">*</span> s<span class="special">)</span><span class="special">;</span></pre>
 <span class="bold"><strong>Effects</strong></span>: Appends c-string s to *this. </li>
 <li>
-<pre class="literallayout"><span class="type">basic_string &amp;</span> <a name="id322379-bb"></a><span class="bold"><strong>operator</strong></span>+=(CharT c) ;</pre>
+<pre class="literallayout">basic_string <span class="special">&amp;</span> <a name="id404213-bb"></a><span class="keyword">operator</span><span class="special">+=</span><span class="special">(</span><span class="identifier">CharT</span> c<span class="special">)</span><span class="special">;</span></pre>
 <span class="bold"><strong>Effects</strong></span>: Appends character c to *this. </li>
 <li>
-<pre class="literallayout"><span class="type">basic_string &amp;</span> <a name="id322398-bb"></a>append(<span class="bold"><strong>const</strong></span> basic_string &amp; s) ;</pre>
+<pre class="literallayout">basic_string <span class="special">&amp;</span> <a name="id404232-bb"></a><span class="identifier">append</span><span class="special">(</span><span class="keyword">const</span> basic_string <span class="special">&amp;</span> s<span class="special">)</span><span class="special">;</span></pre>
 <span class="bold"><strong>Effects</strong></span>: Appends string s to *this. </li>
 <li>
-<pre class="literallayout"><span class="type">basic_string &amp;</span> <a name="id322421-bb"></a>append(<span class="bold"><strong>const</strong></span> basic_string &amp; s, size_type pos, size_type n) ;</pre>
+<pre class="literallayout">basic_string <span class="special">&amp;</span> <a name="id404255-bb"></a><span class="identifier">append</span><span class="special">(</span><span class="keyword">const</span> basic_string <span class="special">&amp;</span> s<span class="special">,</span> <span class="identifier">size_type</span> pos<span class="special">,</span> <span class="identifier">size_type</span> n<span class="special">)</span><span class="special">;</span></pre>
 <span class="bold"><strong>Effects</strong></span>: Appends the range [pos, pos + n) from string s to *this. </li>
 <li>
-<pre class="literallayout"><span class="type">basic_string &amp;</span> <a name="id322455-bb"></a>append(<span class="bold"><strong>const</strong></span> CharT * s, size_type n) ;</pre>
+<pre class="literallayout">basic_string <span class="special">&amp;</span> <a name="id404288-bb"></a><span class="identifier">append</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">CharT</span> <span class="special">*</span> s<span class="special">,</span> <span class="identifier">size_type</span> n<span class="special">)</span><span class="special">;</span></pre>
 <span class="bold"><strong>Effects</strong></span>: Appends the range [s, s + n) from c-string s to *this. </li>
 <li>
-<pre class="literallayout"><span class="type">basic_string &amp;</span> <a name="id322480-bb"></a>append(<span class="bold"><strong>const</strong></span> CharT * s) ;</pre>
+<pre class="literallayout">basic_string <span class="special">&amp;</span> <a name="id404313-bb"></a><span class="identifier">append</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">CharT</span> <span class="special">*</span> s<span class="special">)</span><span class="special">;</span></pre>
 <span class="bold"><strong>Effects</strong></span>: Appends the c-string s to *this. </li>
 <li>
-<pre class="literallayout"><span class="type">basic_string &amp;</span> <a name="id322499-bb"></a>append(size_type n, CharT c) ;</pre>
+<pre class="literallayout">basic_string <span class="special">&amp;</span> <a name="id404333-bb"></a><span class="identifier">append</span><span class="special">(</span><span class="identifier">size_type</span> n<span class="special">,</span> <span class="identifier">CharT</span> c<span class="special">)</span><span class="special">;</span></pre>
 <span class="bold"><strong>Effects</strong></span>: Appends the n times the character c to *this. </li>
 <li>
-<pre class="literallayout"><span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>typename</strong></span> InputIter&gt;
- <span class="type">basic_string &amp;</span> <a name="id322523-bb"></a>append(InputIter first, InputIter last) ;</pre>
+<pre class="literallayout"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> InputIter<span class="special">&gt;</span>
+ basic_string <span class="special">&amp;</span> <a name="id404357-bb"></a><span class="identifier">append</span><span class="special">(</span><span class="identifier">InputIter</span> first<span class="special">,</span> <span class="identifier">InputIter</span> last<span class="special">)</span><span class="special">;</span></pre>
 <span class="bold"><strong>Effects</strong></span>: Appends the range [first, last) *this. </li>
 <li>
-<pre class="literallayout"><span class="type"><span class="bold"><strong>void</strong></span></span> <a name="id322553-bb"></a>push_back(CharT c) ;</pre>
+<pre class="literallayout"><span class="keyword">void</span> <a name="id404387-bb"></a><span class="identifier">push_back</span><span class="special">(</span><span class="identifier">CharT</span> c<span class="special">)</span><span class="special">;</span></pre>
 <span class="bold"><strong>Effects</strong></span>: Inserts a copy of c at the end of the vector. </li>
 <li>
-<pre class="literallayout"><span class="type"><span class="bold"><strong>void</strong></span></span> <a name="id322570-bb"></a>pop_back() ;</pre>
+<pre class="literallayout"><span class="keyword">void</span> <a name="id404403-bb"></a><span class="identifier">pop_back</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre>
 <span class="bold"><strong>Effects</strong></span>: Removes the last element from the vector. </li>
 <li>
-<pre class="literallayout"><span class="type">basic_string &amp;</span> <a name="id322582-bb"></a>assign(<span class="bold"><strong>const</strong></span> basic_string &amp; s) ;</pre>
+<pre class="literallayout">basic_string <span class="special">&amp;</span> <a name="id404415-bb"></a><span class="identifier">assign</span><span class="special">(</span><span class="keyword">const</span> basic_string <span class="special">&amp;</span> s<span class="special">)</span><span class="special">;</span></pre>
 <span class="bold"><strong>Effects</strong></span>: Assigns the value s to *this. </li>
 <li>
-<pre class="literallayout"><span class="type">basic_string &amp;</span> <a name="id322605-bb"></a>assign(basic_string &amp;&amp; ms) ;</pre>
+<pre class="literallayout">basic_string <span class="special">&amp;</span> <a name="id404438-bb"></a><span class="identifier">assign</span><span class="special">(</span>basic_string <span class="special">&amp;&amp;</span> ms<span class="special">)</span><span class="special">;</span></pre>
 <span class="bold"><strong>Effects</strong></span>: Moves the resources from ms *this. </li>
 <li>
-<pre class="literallayout"><span class="type">basic_string &amp;</span> <a name="id322626-bb"></a>assign(<span class="bold"><strong>const</strong></span> basic_string &amp; s, size_type pos, size_type n) ;</pre>
+<pre class="literallayout">basic_string <span class="special">&amp;</span> <a name="id404460-bb"></a><span class="identifier">assign</span><span class="special">(</span><span class="keyword">const</span> basic_string <span class="special">&amp;</span> s<span class="special">,</span> <span class="identifier">size_type</span> pos<span class="special">,</span> <span class="identifier">size_type</span> n<span class="special">)</span><span class="special">;</span></pre>
 <span class="bold"><strong>Effects</strong></span>: Assigns the range [pos, pos + n) from s to *this. </li>
 <li>
-<pre class="literallayout"><span class="type">basic_string &amp;</span> <a name="id322659-bb"></a>assign(<span class="bold"><strong>const</strong></span> CharT * s, size_type n) ;</pre>
+<pre class="literallayout">basic_string <span class="special">&amp;</span> <a name="id404492-bb"></a><span class="identifier">assign</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">CharT</span> <span class="special">*</span> s<span class="special">,</span> <span class="identifier">size_type</span> n<span class="special">)</span><span class="special">;</span></pre>
 <span class="bold"><strong>Effects</strong></span>: Assigns the range [s, s + n) from s to *this. </li>
 <li>
-<pre class="literallayout"><span class="type">basic_string &amp;</span> <a name="id322683-bb"></a>assign(<span class="bold"><strong>const</strong></span> CharT * s) ;</pre>
+<pre class="literallayout">basic_string <span class="special">&amp;</span> <a name="id404516-bb"></a><span class="identifier">assign</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">CharT</span> <span class="special">*</span> s<span class="special">)</span><span class="special">;</span></pre>
 <span class="bold"><strong>Effects</strong></span>: Assigns the c-string s to *this. </li>
 <li>
-<pre class="literallayout"><span class="type">basic_string &amp;</span> <a name="id322702-bb"></a>assign(size_type n, CharT c) ;</pre>
+<pre class="literallayout">basic_string <span class="special">&amp;</span> <a name="id404535-bb"></a><span class="identifier">assign</span><span class="special">(</span><span class="identifier">size_type</span> n<span class="special">,</span> <span class="identifier">CharT</span> c<span class="special">)</span><span class="special">;</span></pre>
 <span class="bold"><strong>Effects</strong></span>: Assigns the character c n-times to *this. </li>
 <li>
-<pre class="literallayout"><span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>typename</strong></span> InputIter&gt;
- <span class="type">basic_string &amp;</span> <a name="id322726-bb"></a>assign(InputIter first, InputIter last) ;</pre>
+<pre class="literallayout"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> InputIter<span class="special">&gt;</span>
+ basic_string <span class="special">&amp;</span> <a name="id404559-bb"></a><span class="identifier">assign</span><span class="special">(</span><span class="identifier">InputIter</span> first<span class="special">,</span> <span class="identifier">InputIter</span> last<span class="special">)</span><span class="special">;</span></pre>
 <span class="bold"><strong>Effects</strong></span>: Assigns the range [first, last) to *this. </li>
 <li>
-<pre class="literallayout"><span class="type">basic_string &amp;</span> <a name="id322756-bb"></a>assign(<span class="bold"><strong>const</strong></span> CharT * f, <span class="bold"><strong>const</strong></span> CharT * l) ;</pre>
+<pre class="literallayout">basic_string <span class="special">&amp;</span> <a name="id404589-bb"></a><span class="identifier">assign</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">CharT</span> <span class="special">*</span> f<span class="special">,</span> <span class="keyword">const</span> <span class="identifier">CharT</span> <span class="special">*</span> l<span class="special">)</span><span class="special">;</span></pre>
 <span class="bold"><strong>Effects</strong></span>: Assigns the range [f, l) to *this. </li>
 <li>
-<pre class="literallayout"><span class="type">basic_string &amp;</span> <a name="id322780-bb"></a>insert(size_type pos, <span class="bold"><strong>const</strong></span> basic_string &amp; s) ;</pre>
+<pre class="literallayout">basic_string <span class="special">&amp;</span> <a name="id404613-bb"></a><span class="identifier">insert</span><span class="special">(</span><span class="identifier">size_type</span> pos<span class="special">,</span> <span class="keyword">const</span> basic_string <span class="special">&amp;</span> s<span class="special">)</span><span class="special">;</span></pre>
 <span class="bold"><strong>Effects</strong></span>: Inserts the string s before pos. </li>
 <li>
-<pre class="literallayout"><span class="type">basic_string &amp;</span>
-<a name="id322808-bb"></a>insert(size_type pos, <span class="bold"><strong>const</strong></span> basic_string &amp; s, size_type beg, size_type n) ;</pre>
+<pre class="literallayout">basic_string <span class="special">&amp;</span>
+<a name="id404641-bb"></a><span class="identifier">insert</span><span class="special">(</span><span class="identifier">size_type</span> pos<span class="special">,</span> <span class="keyword">const</span> basic_string <span class="special">&amp;</span> s<span class="special">,</span> <span class="identifier">size_type</span> beg<span class="special">,</span> <span class="identifier">size_type</span> n<span class="special">)</span><span class="special">;</span></pre>
 <span class="bold"><strong>Effects</strong></span>: Inserts the range [pos, pos + n) from string s before pos. </li>
 <li>
-<pre class="literallayout"><span class="type">basic_string &amp;</span> <a name="id322846-bb"></a>insert(size_type pos, <span class="bold"><strong>const</strong></span> CharT * s, size_type n) ;</pre>
+<pre class="literallayout">basic_string <span class="special">&amp;</span> <a name="id404679-bb"></a><span class="identifier">insert</span><span class="special">(</span><span class="identifier">size_type</span> pos<span class="special">,</span> <span class="keyword">const</span> <span class="identifier">CharT</span> <span class="special">*</span> s<span class="special">,</span> <span class="identifier">size_type</span> n<span class="special">)</span><span class="special">;</span></pre>
 <span class="bold"><strong>Effects</strong></span>: Inserts the range [s, s + n) before pos. </li>
 <li>
-<pre class="literallayout"><span class="type">basic_string &amp;</span> <a name="id322875-bb"></a>insert(size_type pos, <span class="bold"><strong>const</strong></span> CharT * s) ;</pre>
+<pre class="literallayout">basic_string <span class="special">&amp;</span> <a name="id404708-bb"></a><span class="identifier">insert</span><span class="special">(</span><span class="identifier">size_type</span> pos<span class="special">,</span> <span class="keyword">const</span> <span class="identifier">CharT</span> <span class="special">*</span> s<span class="special">)</span><span class="special">;</span></pre>
 <span class="bold"><strong>Effects</strong></span>: Inserts the c-string s before pos. </li>
 <li>
-<pre class="literallayout"><span class="type">basic_string &amp;</span> <a name="id322899-bb"></a>insert(size_type pos, size_type n, CharT c) ;</pre>
+<pre class="literallayout">basic_string <span class="special">&amp;</span> <a name="id404732-bb"></a><span class="identifier">insert</span><span class="special">(</span><span class="identifier">size_type</span> pos<span class="special">,</span> <span class="identifier">size_type</span> n<span class="special">,</span> <span class="identifier">CharT</span> c<span class="special">)</span><span class="special">;</span></pre>
 <span class="bold"><strong>Effects</strong></span>: Inserts the character c n-times before pos. </li>
 <li>
-<pre class="literallayout"><span class="type">iterator</span> <a name="id322928-bb"></a>insert(iterator position, CharT c) ;</pre>
+<pre class="literallayout"><span class="identifier">iterator</span> <a name="id404761-bb"></a><span class="identifier">insert</span><span class="special">(</span><span class="identifier">iterator</span> position<span class="special">,</span> <span class="identifier">CharT</span> c<span class="special">)</span><span class="special">;</span></pre>
 <span class="bold"><strong>Effects</strong></span>: Inserts the character c before position. </li>
 <li>
-<pre class="literallayout"><span class="type"><span class="bold"><strong>void</strong></span></span> <a name="id322949-bb"></a>insert(iterator position, std::size_t n, CharT c) ;</pre>
+<pre class="literallayout"><span class="keyword">void</span> <a name="id404783-bb"></a><span class="identifier">insert</span><span class="special">(</span><span class="identifier">iterator</span> position<span class="special">,</span> <span class="identifier">size_type</span> n<span class="special">,</span> <span class="identifier">CharT</span> c<span class="special">)</span><span class="special">;</span></pre>
 <span class="bold"><strong>Effects</strong></span>: Inserts the character c n-times before position. </li>
 <li>
-<pre class="literallayout"><span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>typename</strong></span> InputIter&gt;
- <span class="type"><span class="bold"><strong>void</strong></span></span> <a name="id322976-bb"></a>insert(iterator p, InputIter first, InputIter last) ;</pre>
+<pre class="literallayout"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> InputIter<span class="special">&gt;</span>
+ <span class="keyword">void</span> <a name="id404809-bb"></a><span class="identifier">insert</span><span class="special">(</span><span class="identifier">iterator</span> p<span class="special">,</span> <span class="identifier">InputIter</span> first<span class="special">,</span> <span class="identifier">InputIter</span> last<span class="special">)</span><span class="special">;</span></pre>
 <span class="bold"><strong>Effects</strong></span>: Inserts the range [first, last) before position. </li>
 <li>
-<pre class="literallayout"><span class="type">basic_string &amp;</span> <a name="id323008-bb"></a>erase(size_type pos = 0, size_type n = npos) ;</pre>
+<pre class="literallayout">basic_string <span class="special">&amp;</span> <a name="id404841-bb"></a><span class="identifier">erase</span><span class="special">(</span><span class="identifier">size_type</span> pos <span class="special">=</span> <span class="number">0</span><span class="special">,</span> <span class="identifier">size_type</span> n <span class="special">=</span> <span class="identifier">npos</span><span class="special">)</span><span class="special">;</span></pre>
 <span class="bold"><strong>Effects</strong></span>: Inserts the range [pos, pos + n). </li>
 <li>
-<pre class="literallayout"><span class="type">iterator</span> <a name="id323037-bb"></a>erase(iterator position) ;</pre>
+<pre class="literallayout"><span class="identifier">iterator</span> <a name="id404870-bb"></a><span class="identifier">erase</span><span class="special">(</span><span class="identifier">iterator</span> position<span class="special">)</span><span class="special">;</span></pre>
 <span class="bold"><strong>Effects</strong></span>: Erases the character pointed by position. </li>
 <li>
-<pre class="literallayout"><span class="type">iterator</span> <a name="id323054-bb"></a>erase(iterator first, iterator last) ;</pre>
+<pre class="literallayout"><span class="identifier">iterator</span> <a name="id404887-bb"></a><span class="identifier">erase</span><span class="special">(</span><span class="identifier">iterator</span> first<span class="special">,</span> <span class="identifier">iterator</span> last<span class="special">)</span><span class="special">;</span></pre>
 <span class="bold"><strong>Effects</strong></span>: Erases the range [first, last). </li>
 <li>
-<pre class="literallayout"><span class="type">basic_string &amp;</span> <a name="id323075-bb"></a>replace(size_type pos, size_type n, <span class="bold"><strong>const</strong></span> basic_string &amp; s) ;</pre>
+<pre class="literallayout">basic_string <span class="special">&amp;</span> <a name="id404909-bb"></a><span class="identifier">replace</span><span class="special">(</span><span class="identifier">size_type</span> pos<span class="special">,</span> <span class="identifier">size_type</span> n<span class="special">,</span> <span class="keyword">const</span> basic_string <span class="special">&amp;</span> s<span class="special">)</span><span class="special">;</span></pre>
 <span class="bold"><strong>Effects</strong></span>: Replaces a substring of *this with the string s. </li>
 <li>
-<pre class="literallayout"><span class="type">basic_string &amp;</span>
-<a name="id323108-bb"></a>replace(size_type pos1, size_type n1, <span class="bold"><strong>const</strong></span> basic_string &amp; s, size_type pos2,
- size_type n2) ;</pre>
+<pre class="literallayout">basic_string <span class="special">&amp;</span>
+<a name="id404941-bb"></a><span class="identifier">replace</span><span class="special">(</span><span class="identifier">size_type</span> pos1<span class="special">,</span> <span class="identifier">size_type</span> n1<span class="special">,</span> <span class="keyword">const</span> basic_string <span class="special">&amp;</span> s<span class="special">,</span> <span class="identifier">size_type</span> pos2<span class="special">,</span>
+ <span class="identifier">size_type</span> n2<span class="special">)</span><span class="special">;</span></pre>
 <span class="bold"><strong>Effects</strong></span>: Replaces a substring of *this with a substring of s. </li>
 <li>
-<pre class="literallayout"><span class="type">basic_string &amp;</span>
-<a name="id323150-bb"></a>replace(size_type pos, size_type n1, <span class="bold"><strong>const</strong></span> CharT * s, size_type n2) ;</pre>
+<pre class="literallayout">basic_string <span class="special">&amp;</span>
+<a name="id404983-bb"></a><span class="identifier">replace</span><span class="special">(</span><span class="identifier">size_type</span> pos<span class="special">,</span> <span class="identifier">size_type</span> n1<span class="special">,</span> <span class="keyword">const</span> <span class="identifier">CharT</span> <span class="special">*</span> s<span class="special">,</span> <span class="identifier">size_type</span> n2<span class="special">)</span><span class="special">;</span></pre>
 <span class="bold"><strong>Effects</strong></span>: Replaces a substring of *this with the first n1 characters of s. </li>
 <li>
-<pre class="literallayout"><span class="type">basic_string &amp;</span> <a name="id323183-bb"></a>replace(size_type pos, size_type n1, <span class="bold"><strong>const</strong></span> CharT * s) ;</pre>
+<pre class="literallayout">basic_string <span class="special">&amp;</span> <a name="id405017-bb"></a><span class="identifier">replace</span><span class="special">(</span><span class="identifier">size_type</span> pos<span class="special">,</span> <span class="identifier">size_type</span> n1<span class="special">,</span> <span class="keyword">const</span> <span class="identifier">CharT</span> <span class="special">*</span> s<span class="special">)</span><span class="special">;</span></pre>
 <span class="bold"><strong>Effects</strong></span>: Replaces a substring of *this with a null-terminated character array. </li>
 <li>
-<pre class="literallayout"><span class="type">basic_string &amp;</span> <a name="id323212-bb"></a>replace(size_type pos, size_type n1, size_type n2, CharT c) ;</pre>
+<pre class="literallayout">basic_string <span class="special">&amp;</span> <a name="id405410-bb"></a><span class="identifier">replace</span><span class="special">(</span><span class="identifier">size_type</span> pos<span class="special">,</span> <span class="identifier">size_type</span> n1<span class="special">,</span> <span class="identifier">size_type</span> n2<span class="special">,</span> <span class="identifier">CharT</span> c<span class="special">)</span><span class="special">;</span></pre>
 <span class="bold"><strong>Effects</strong></span>: Replaces a substring of *this with n1 copies of c. </li>
 <li>
-<pre class="literallayout"><span class="type">basic_string &amp;</span> <a name="id323246-bb"></a>replace(iterator first, iterator last, <span class="bold"><strong>const</strong></span> basic_string &amp; s) ;</pre>
+<pre class="literallayout">basic_string <span class="special">&amp;</span> <a name="id405444-bb"></a><span class="identifier">replace</span><span class="special">(</span><span class="identifier">iterator</span> first<span class="special">,</span> <span class="identifier">iterator</span> last<span class="special">,</span> <span class="keyword">const</span> basic_string <span class="special">&amp;</span> s<span class="special">)</span><span class="special">;</span></pre>
 <span class="bold"><strong>Effects</strong></span>: Replaces a substring of *this with the string s. </li>
 <li>
-<pre class="literallayout"><span class="type">basic_string &amp;</span>
-<a name="id323278-bb"></a>replace(iterator first, iterator last, <span class="bold"><strong>const</strong></span> CharT * s, size_type n) ;</pre>
+<pre class="literallayout">basic_string <span class="special">&amp;</span>
+<a name="id405476-bb"></a><span class="identifier">replace</span><span class="special">(</span><span class="identifier">iterator</span> first<span class="special">,</span> <span class="identifier">iterator</span> last<span class="special">,</span> <span class="keyword">const</span> <span class="identifier">CharT</span> <span class="special">*</span> s<span class="special">,</span> <span class="identifier">size_type</span> n<span class="special">)</span><span class="special">;</span></pre>
 <span class="bold"><strong>Effects</strong></span>: Replaces a substring of *this with the first n characters of s. </li>
 <li>
-<pre class="literallayout"><span class="type">basic_string &amp;</span> <a name="id323312-bb"></a>replace(iterator first, iterator last, <span class="bold"><strong>const</strong></span> CharT * s) ;</pre>
+<pre class="literallayout">basic_string <span class="special">&amp;</span> <a name="id405510-bb"></a><span class="identifier">replace</span><span class="special">(</span><span class="identifier">iterator</span> first<span class="special">,</span> <span class="identifier">iterator</span> last<span class="special">,</span> <span class="keyword">const</span> <span class="identifier">CharT</span> <span class="special">*</span> s<span class="special">)</span><span class="special">;</span></pre>
 <span class="bold"><strong>Effects</strong></span>: Replaces a substring of *this with a null-terminated character array. </li>
 <li>
-<pre class="literallayout"><span class="type">basic_string &amp;</span> <a name="id325070-bb"></a>replace(iterator first, iterator last, size_type n, CharT c) ;</pre>
+<pre class="literallayout">basic_string <span class="special">&amp;</span> <a name="id405538-bb"></a><span class="identifier">replace</span><span class="special">(</span><span class="identifier">iterator</span> first<span class="special">,</span> <span class="identifier">iterator</span> last<span class="special">,</span> <span class="identifier">size_type</span> n<span class="special">,</span> <span class="identifier">CharT</span> c<span class="special">)</span><span class="special">;</span></pre>
 <span class="bold"><strong>Effects</strong></span>: Replaces a substring of *this with n copies of c. </li>
 <li>
-<pre class="literallayout"><span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>typename</strong></span> InputIter&gt;
- <span class="type">basic_string &amp;</span>
- <a name="id325104-bb"></a>replace(iterator first, iterator last, InputIter f, InputIter l) ;</pre>
+<pre class="literallayout"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> InputIter<span class="special">&gt;</span>
+ basic_string <span class="special">&amp;</span>
+ <a name="id405572-bb"></a><span class="identifier">replace</span><span class="special">(</span><span class="identifier">iterator</span> first<span class="special">,</span> <span class="identifier">iterator</span> last<span class="special">,</span> <span class="identifier">InputIter</span> f<span class="special">,</span> <span class="identifier">InputIter</span> l<span class="special">)</span><span class="special">;</span></pre>
 <span class="bold"><strong>Effects</strong></span>: Replaces a substring of *this with the range [f, l) </li>
 <li>
-<pre class="literallayout"><span class="type">size_type</span> <a name="id325144-bb"></a>copy(CharT * s, size_type n, size_type pos = 0) <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">size_type</span> <a name="id405612-bb"></a><span class="identifier">copy</span><span class="special">(</span><span class="identifier">CharT</span> <span class="special">*</span> s<span class="special">,</span> <span class="identifier">size_type</span> n<span class="special">,</span> <span class="identifier">size_type</span> pos <span class="special">=</span> <span class="number">0</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <span class="bold"><strong>Effects</strong></span>: Copies a substring of *this to a buffer. </li>
 <li>
-<pre class="literallayout"><span class="type"><span class="bold"><strong>void</strong></span></span> <a name="id325172-bb"></a>swap(basic_string &amp; x) ;</pre>
+<pre class="literallayout"><span class="keyword">void</span> <a name="id405640-bb"></a><span class="identifier">swap</span><span class="special">(</span>basic_string <span class="special">&amp;</span> x<span class="special">)</span><span class="special">;</span></pre>
 <span class="bold"><strong>Effects</strong></span>: Swaps the contents of two strings. </li>
 <li>
-<pre class="literallayout"><span class="type"><span class="bold"><strong>const</strong></span> CharT *</span> <a name="id325192-bb"></a>c_str() <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="keyword">const</span> <span class="identifier">CharT</span> <span class="special">*</span> <a name="id405660-bb"></a><span class="identifier">c_str</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Returns</strong></span>: 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. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type"><span class="bold"><strong>const</strong></span> CharT *</span> <a name="id325205-bb"></a>data() <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="keyword">const</span> <span class="identifier">CharT</span> <span class="special">*</span> <a name="id405673-bb"></a><span class="identifier">data</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Returns</strong></span>: 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. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">size_type</span> <a name="id325218-bb"></a>find(<span class="bold"><strong>const</strong></span> basic_string &amp; s, size_type pos = 0) <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">size_type</span> <a name="id405686-bb"></a><span class="identifier">find</span><span class="special">(</span><span class="keyword">const</span> basic_string <span class="special">&amp;</span> s<span class="special">,</span> <span class="identifier">size_type</span> pos <span class="special">=</span> <span class="number">0</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Searches for s as a substring of *this, beginning at character pos of *this. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">size_type</span> <a name="id325247-bb"></a>find(<span class="bold"><strong>const</strong></span> CharT * s, size_type pos = 0) <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">size_type</span> <a name="id405715-bb"></a><span class="identifier">find</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">CharT</span> <span class="special">*</span> s<span class="special">,</span> <span class="identifier">size_type</span> pos <span class="special">=</span> <span class="number">0</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Searches for a null-terminated character array as a substring of *this, beginning at character pos of *this. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">size_type</span> <a name="id325272-bb"></a>find(<span class="bold"><strong>const</strong></span> CharT * s, size_type pos, size_type n) <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">size_type</span> <a name="id405740-bb"></a><span class="identifier">find</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">CharT</span> <span class="special">*</span> s<span class="special">,</span> <span class="identifier">size_type</span> pos<span class="special">,</span> <span class="identifier">size_type</span> n<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Searches for the first n characters of s as a substring of *this, beginning at character pos of *this. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">size_type</span> <a name="id325300-bb"></a>find(CharT c, size_type pos = 0) <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">size_type</span> <a name="id405768-bb"></a><span class="identifier">find</span><span class="special">(</span><span class="identifier">CharT</span> c<span class="special">,</span> <span class="identifier">size_type</span> pos <span class="special">=</span> <span class="number">0</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Searches for the character c, beginning at character position pos. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">size_type</span> <a name="id325325-bb"></a>rfind(<span class="bold"><strong>const</strong></span> basic_string &amp; s, size_type pos = npos) <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">size_type</span> <a name="id405793-bb"></a><span class="identifier">rfind</span><span class="special">(</span><span class="keyword">const</span> basic_string <span class="special">&amp;</span> s<span class="special">,</span> <span class="identifier">size_type</span> pos <span class="special">=</span> <span class="identifier">npos</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Searches backward for s as a substring of *this, beginning at character position min(pos, size()) </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">size_type</span> <a name="id325354-bb"></a>rfind(<span class="bold"><strong>const</strong></span> CharT * s, size_type pos = npos) <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">size_type</span> <a name="id405822-bb"></a><span class="identifier">rfind</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">CharT</span> <span class="special">*</span> s<span class="special">,</span> <span class="identifier">size_type</span> pos <span class="special">=</span> <span class="identifier">npos</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Searches backward for a null-terminated character array as a substring of *this, beginning at character min(pos, size()) </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">size_type</span> <a name="id325379-bb"></a>rfind(<span class="bold"><strong>const</strong></span> CharT * s, size_type pos, size_type n) <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">size_type</span> <a name="id405847-bb"></a><span class="identifier">rfind</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">CharT</span> <span class="special">*</span> s<span class="special">,</span> <span class="identifier">size_type</span> pos<span class="special">,</span> <span class="identifier">size_type</span> n<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Searches backward for the first n characters of s as a substring of *this, beginning at character position min(pos, size()). </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">size_type</span> <a name="id325406-bb"></a>rfind(CharT c, size_type pos = npos) <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">size_type</span> <a name="id405874-bb"></a><span class="identifier">rfind</span><span class="special">(</span><span class="identifier">CharT</span> c<span class="special">,</span> <span class="identifier">size_type</span> pos <span class="special">=</span> <span class="identifier">npos</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Searches backward for a null-terminated character array as a substring of *this, beginning at character min(pos, size()). </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">size_type</span> <a name="id325432-bb"></a>find_first_of(<span class="bold"><strong>const</strong></span> basic_string &amp; s, size_type pos = 0) <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">size_type</span> <a name="id405900-bb"></a><span class="identifier">find_first_of</span><span class="special">(</span><span class="keyword">const</span> basic_string <span class="special">&amp;</span> s<span class="special">,</span> <span class="identifier">size_type</span> pos <span class="special">=</span> <span class="number">0</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Searches within *this, beginning at pos, for the first character that is equal to any character within s. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">size_type</span> <a name="id325460-bb"></a>find_first_of(<span class="bold"><strong>const</strong></span> CharT * s, size_type pos = 0) <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">size_type</span> <a name="id405928-bb"></a><span class="identifier">find_first_of</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">CharT</span> <span class="special">*</span> s<span class="special">,</span> <span class="identifier">size_type</span> pos <span class="special">=</span> <span class="number">0</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Searches within *this, beginning at pos, for the first character that is equal to any character within s. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">size_type</span> <a name="id325486-bb"></a>find_first_of(<span class="bold"><strong>const</strong></span> CharT * s, size_type pos, size_type n) <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">size_type</span> <a name="id405954-bb"></a><span class="identifier">find_first_of</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">CharT</span> <span class="special">*</span> s<span class="special">,</span> <span class="identifier">size_type</span> pos<span class="special">,</span> <span class="identifier">size_type</span> n<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Searches within *this, beginning at pos, for the first character that is equal to any character within the first n characters of s. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">size_type</span> <a name="id325513-bb"></a>find_first_of(CharT c, size_type pos = 0) <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">size_type</span> <a name="id405981-bb"></a><span class="identifier">find_first_of</span><span class="special">(</span><span class="identifier">CharT</span> c<span class="special">,</span> <span class="identifier">size_type</span> pos <span class="special">=</span> <span class="number">0</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Searches within *this, beginning at pos, for the first character that is equal to c. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">size_type</span> <a name="id325538-bb"></a>find_last_of(<span class="bold"><strong>const</strong></span> basic_string &amp; s, size_type pos = npos) <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">size_type</span> <a name="id406006-bb"></a><span class="identifier">find_last_of</span><span class="special">(</span><span class="keyword">const</span> basic_string <span class="special">&amp;</span> s<span class="special">,</span> <span class="identifier">size_type</span> pos <span class="special">=</span> <span class="identifier">npos</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Searches backward within *this, beginning at min(pos, size()), for the first character that is equal to any character within s. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">size_type</span> <a name="id325567-bb"></a>find_last_of(<span class="bold"><strong>const</strong></span> CharT * s, size_type pos = npos) <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">size_type</span> <a name="id406035-bb"></a><span class="identifier">find_last_of</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">CharT</span> <span class="special">*</span> s<span class="special">,</span> <span class="identifier">size_type</span> pos <span class="special">=</span> <span class="identifier">npos</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Searches backward *this, beginning at min(pos, size()), for the first character that is equal to any character within s. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">size_type</span> <a name="id325592-bb"></a>find_last_of(<span class="bold"><strong>const</strong></span> CharT * s, size_type pos, size_type n) <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">size_type</span> <a name="id406060-bb"></a><span class="identifier">find_last_of</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">CharT</span> <span class="special">*</span> s<span class="special">,</span> <span class="identifier">size_type</span> pos<span class="special">,</span> <span class="identifier">size_type</span> n<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: 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. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">size_type</span> <a name="id325620-bb"></a>find_last_of(CharT c, size_type pos = npos) <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">size_type</span> <a name="id406088-bb"></a><span class="identifier">find_last_of</span><span class="special">(</span><span class="identifier">CharT</span> c<span class="special">,</span> <span class="identifier">size_type</span> pos <span class="special">=</span> <span class="identifier">npos</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Searches backward *this, beginning at min(pos, size()), for the first character that is equal to c. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">size_type</span> <a name="id325645-bb"></a>find_first_not_of(<span class="bold"><strong>const</strong></span> basic_string &amp; s, size_type pos = 0) <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">size_type</span> <a name="id406113-bb"></a><span class="identifier">find_first_not_of</span><span class="special">(</span><span class="keyword">const</span> basic_string <span class="special">&amp;</span> s<span class="special">,</span> <span class="identifier">size_type</span> pos <span class="special">=</span> <span class="number">0</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Searches within *this, beginning at pos, for the first character that is not equal to any character within s. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">size_type</span> <a name="id325674-bb"></a>find_first_not_of(<span class="bold"><strong>const</strong></span> CharT * s, size_type pos = 0) <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">size_type</span> <a name="id406142-bb"></a><span class="identifier">find_first_not_of</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">CharT</span> <span class="special">*</span> s<span class="special">,</span> <span class="identifier">size_type</span> pos <span class="special">=</span> <span class="number">0</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Searches within *this, beginning at pos, for the first character that is not equal to any character within s. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">size_type</span> <a name="id325699-bb"></a>find_first_not_of(<span class="bold"><strong>const</strong></span> CharT * s, size_type pos, size_type n) <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">size_type</span> <a name="id406167-bb"></a><span class="identifier">find_first_not_of</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">CharT</span> <span class="special">*</span> s<span class="special">,</span> <span class="identifier">size_type</span> pos<span class="special">,</span> <span class="identifier">size_type</span> n<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Searches within *this, beginning at pos, for the first character that is not equal to any character within the first n characters of s. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">size_type</span> <a name="id325727-bb"></a>find_first_not_of(CharT c, size_type pos = 0) <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">size_type</span> <a name="id406195-bb"></a><span class="identifier">find_first_not_of</span><span class="special">(</span><span class="identifier">CharT</span> c<span class="special">,</span> <span class="identifier">size_type</span> pos <span class="special">=</span> <span class="number">0</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Searches within *this, beginning at pos, for the first character that is not equal to c. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">size_type</span> <a name="id325752-bb"></a>find_last_not_of(<span class="bold"><strong>const</strong></span> basic_string &amp; s, size_type pos = npos) <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">size_type</span> <a name="id406220-bb"></a><span class="identifier">find_last_not_of</span><span class="special">(</span><span class="keyword">const</span> basic_string <span class="special">&amp;</span> s<span class="special">,</span> <span class="identifier">size_type</span> pos <span class="special">=</span> <span class="identifier">npos</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Searches backward within *this, beginning at min(pos, size()), for the first character that is not equal to any character within s. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">size_type</span> <a name="id325781-bb"></a>find_last_not_of(<span class="bold"><strong>const</strong></span> CharT * s, size_type pos = npos) <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">size_type</span> <a name="id406249-bb"></a><span class="identifier">find_last_not_of</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">CharT</span> <span class="special">*</span> s<span class="special">,</span> <span class="identifier">size_type</span> pos <span class="special">=</span> <span class="identifier">npos</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Searches backward *this, beginning at min(pos, size()), for the first character that is not equal to any character within s. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">size_type</span> <a name="id325806-bb"></a>find_last_not_of(<span class="bold"><strong>const</strong></span> CharT * s, size_type pos, size_type n) <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">size_type</span> <a name="id406274-bb"></a><span class="identifier">find_last_not_of</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">CharT</span> <span class="special">*</span> s<span class="special">,</span> <span class="identifier">size_type</span> pos<span class="special">,</span> <span class="identifier">size_type</span> n<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: 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. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">size_type</span> <a name="id325834-bb"></a>find_last_not_of(CharT c, size_type pos = npos) <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">size_type</span> <a name="id406302-bb"></a><span class="identifier">find_last_not_of</span><span class="special">(</span><span class="identifier">CharT</span> c<span class="special">,</span> <span class="identifier">size_type</span> pos <span class="special">=</span> <span class="identifier">npos</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Searches backward *this, beginning at min(pos, size()), for the first character that is not equal to c. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">basic_string</span> <a name="id325859-bb"></a>substr(size_type pos = 0, size_type n = npos) <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout">basic_string <a name="id406327-bb"></a><span class="identifier">substr</span><span class="special">(</span><span class="identifier">size_type</span> pos <span class="special">=</span> <span class="number">0</span><span class="special">,</span> <span class="identifier">size_type</span> n <span class="special">=</span> <span class="identifier">npos</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <span class="bold"><strong>Effects</strong></span>: Returns a substring of *this. </li>
 <li>
-<pre class="literallayout"><span class="type"><span class="bold"><strong>int</strong></span></span> <a name="id325886-bb"></a>compare(<span class="bold"><strong>const</strong></span> basic_string &amp; s) <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="keyword">int</span> <a name="id406354-bb"></a><span class="identifier">compare</span><span class="special">(</span><span class="keyword">const</span> basic_string <span class="special">&amp;</span> s<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <span class="bold"><strong>Effects</strong></span>: Three-way lexicographical comparison of s and *this. </li>
 <li>
-<pre class="literallayout"><span class="type"><span class="bold"><strong>int</strong></span></span> <a name="id325907-bb"></a>compare(size_type pos1, size_type n1, <span class="bold"><strong>const</strong></span> basic_string &amp; s) <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="keyword">int</span> <a name="id406375-bb"></a><span class="identifier">compare</span><span class="special">(</span><span class="identifier">size_type</span> pos1<span class="special">,</span> <span class="identifier">size_type</span> n1<span class="special">,</span> <span class="keyword">const</span> basic_string <span class="special">&amp;</span> s<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Three-way lexicographical comparison of s and a substring of *this. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type"><span class="bold"><strong>int</strong></span></span> <a name="id325938-bb"></a>compare(size_type pos1, size_type n1, <span class="bold"><strong>const</strong></span> basic_string &amp; s,
- size_type pos2, size_type n2) <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="keyword">int</span> <a name="id406406-bb"></a><span class="identifier">compare</span><span class="special">(</span><span class="identifier">size_type</span> pos1<span class="special">,</span> <span class="identifier">size_type</span> n1<span class="special">,</span> <span class="keyword">const</span> basic_string <span class="special">&amp;</span> s<span class="special">,</span>
+ <span class="identifier">size_type</span> pos2<span class="special">,</span> <span class="identifier">size_type</span> n2<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Three-way lexicographical comparison of a substring of s and a substring of *this. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type"><span class="bold"><strong>int</strong></span></span> <a name="id325979-bb"></a>compare(<span class="bold"><strong>const</strong></span> CharT * s) <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="keyword">int</span> <a name="id406447-bb"></a><span class="identifier">compare</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">CharT</span> <span class="special">*</span> s<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <span class="bold"><strong>Effects</strong></span>: Three-way lexicographical comparison of s and *this. </li>
 <li>
-<pre class="literallayout"><span class="type"><span class="bold"><strong>int</strong></span></span> <a name="id325996-bb"></a>compare(size_type pos1, size_type n1, <span class="bold"><strong>const</strong></span> CharT * s,
- size_type n2 = npos) <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="keyword">int</span> <a name="id406464-bb"></a><span class="identifier">compare</span><span class="special">(</span><span class="identifier">size_type</span> pos1<span class="special">,</span> <span class="identifier">size_type</span> n1<span class="special">,</span> <span class="keyword">const</span> <span class="identifier">CharT</span> <span class="special">*</span> s<span class="special">,</span>
+ <span class="identifier">size_type</span> n2 <span class="special">=</span> <span class="identifier">npos</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Three-way lexicographical comparison of the first min(len, traits::length(s) characters of s and a substring of *this. </p>
 </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<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2009 -2011 Ion Gaztanaga<p>
         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)
       </p>
@@ -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&#160;1.&#160;Boost.Container">
 <link rel="up" href="../../boost_container_reference.html#header.boost.container.deque_hpp" title="Header &lt;boost/container/deque.hpp&gt;">
 <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 @@
 <p>boost::container::deque &#8212; </p>
 </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"><span class="emphasis"><em>// In header: &lt;boost/container/deque.hpp&gt;
+<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis"><span class="comment">// In header: &lt;boost/container/deque.hpp&gt;
 
-</em></span><span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>typename</strong></span> T, <span class="bold"><strong>typename</strong></span> Alloc&gt;
-<span class="bold"><strong>class</strong></span> deque {
-<span class="bold"><strong>public</strong></span>:
- <span class="emphasis"><em>// types</em></span>
- <span class="bold"><strong>typedef</strong></span> Base::iterator <a name="boost.container.deque.iterator"></a>iterator;
- <span class="bold"><strong>typedef</strong></span> Base::const_iterator <a name="boost.container.deque.const_iterator"></a>const_iterator;
- <span class="bold"><strong>typedef</strong></span> std::reverse_iterator&lt; const_iterator &gt; <a name="boost.container.deque.const_reverse_iterator"></a>const_reverse_iterator;
- <span class="bold"><strong>typedef</strong></span> std::reverse_iterator&lt; iterator &gt; <a name="boost.container.deque.reverse_iterator"></a>reverse_iterator;
+</span><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> T<span class="special">,</span> <span class="keyword">typename</span> Alloc<span class="special">&gt;</span>
+<span class="keyword">class</span> deque <span class="special">{</span>
+<span class="keyword">public</span><span class="special">:</span>
+ <span class="comment">// types</span>
+ <span class="keyword">typedef</span> <span class="identifier">Base</span><span class="special">::</span><span class="identifier">iterator</span> <a name="boost.container.deque.iterator"></a><span class="identifier">iterator</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">Base</span><span class="special">::</span><span class="identifier">const_iterator</span> <a name="boost.container.deque.const_iterator"></a><span class="identifier">const_iterator</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">reverse_iterator</span><span class="special">&lt;</span> <span class="identifier">const_iterator</span> <span class="special">&gt;</span> <a name="boost.container.deque.const_reverse_iterator"></a><span class="identifier">const_reverse_iterator</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">reverse_iterator</span><span class="special">&lt;</span> <span class="identifier">iterator</span> <span class="special">&gt;</span> <a name="boost.container.deque.reverse_iterator"></a><span class="identifier">reverse_iterator</span><span class="special">;</span>
 
- <span class="emphasis"><em>// construct/copy/destruct</em></span>
- deque(<span class="bold"><strong>const</strong></span> allocator_type &amp; = allocator_type());
- deque(<span class="bold"><strong>const</strong></span> deque &amp;);
- deque(deque &amp;&amp;);
- deque(size_type, <span class="bold"><strong>const</strong></span> value_type &amp;,
- <span class="bold"><strong>const</strong></span> allocator_type &amp; = allocator_type());
- deque(size_type);
- <span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>typename</strong></span> InpIt&gt;
- deque(InpIt, InpIt, <span class="bold"><strong>const</strong></span> allocator_type &amp; = allocator_type());
- deque&amp; operator=(<span class="bold"><strong>const</strong></span> deque &amp;);
- deque&amp; operator=(deque &amp;&amp;);
- ~deque();
+ <span class="comment">// construct/copy/destruct</span>
+ deque<span class="special">(</span><span class="keyword">const</span> <span class="identifier">allocator_type</span> <span class="special">&amp;</span> <span class="special">=</span> <span class="identifier">allocator_type</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span>
+ deque<span class="special">(</span><span class="identifier">size_type</span><span class="special">)</span><span class="special">;</span>
+ deque<span class="special">(</span><span class="identifier">size_type</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">value_type</span> <span class="special">&amp;</span><span class="special">,</span>
+ <span class="keyword">const</span> <span class="identifier">allocator_type</span> <span class="special">&amp;</span> <span class="special">=</span> <span class="identifier">allocator_type</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span>
+ deque<span class="special">(</span><span class="keyword">const</span> deque <span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
+ deque<span class="special">(</span>deque <span class="special">&amp;&amp;</span><span class="special">)</span><span class="special">;</span>
+ <span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> InpIt<span class="special">&gt;</span>
+ deque<span class="special">(</span><span class="identifier">InpIt</span><span class="special">,</span> <span class="identifier">InpIt</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">allocator_type</span> <span class="special">&amp;</span> <span class="special">=</span> <span class="identifier">allocator_type</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span>
+ deque&amp; operator=<span class="special">(</span><span class="keyword">const</span> deque <span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
+ deque&amp; operator=<span class="special">(</span>deque <span class="special">&amp;&amp;</span><span class="special">)</span><span class="special">;</span>
+ ~deque<span class="special">(</span><span class="special">)</span><span class="special">;</span>
 
- <span class="emphasis"><em>// public member functions</em></span>
- <span class="type">allocator_type</span> get_allocator() <span class="bold"><strong>const</strong></span>;
- <span class="type">iterator</span> begin() ;
- <span class="type">iterator</span> end() ;
- <span class="type">const_iterator</span> begin() <span class="bold"><strong>const</strong></span>;
- <span class="type">const_iterator</span> end() <span class="bold"><strong>const</strong></span>;
- <span class="type">reverse_iterator</span> rbegin() ;
- <span class="type">reverse_iterator</span> rend() ;
- <span class="type">const_reverse_iterator</span> rbegin() <span class="bold"><strong>const</strong></span>;
- <span class="type">const_reverse_iterator</span> rend() <span class="bold"><strong>const</strong></span>;
- <span class="type">const_iterator</span> cbegin() <span class="bold"><strong>const</strong></span>;
- <span class="type">const_iterator</span> cend() <span class="bold"><strong>const</strong></span>;
- <span class="type">const_reverse_iterator</span> crbegin() <span class="bold"><strong>const</strong></span>;
- <span class="type">const_reverse_iterator</span> crend() <span class="bold"><strong>const</strong></span>;
- <span class="type">reference</span> operator[](size_type) ;
- <span class="type">const_reference</span> operator[](size_type) <span class="bold"><strong>const</strong></span>;
- <span class="type"><span class="bold"><strong>void</strong></span></span> priv_range_check(size_type) <span class="bold"><strong>const</strong></span>;
- <span class="type">reference</span> at(size_type) ;
- <span class="type">const_reference</span> at(size_type) <span class="bold"><strong>const</strong></span>;
- <span class="type">reference</span> front() ;
- <span class="type">reference</span> back() ;
- <span class="type">const_reference</span> front() <span class="bold"><strong>const</strong></span>;
- <span class="type">const_reference</span> back() <span class="bold"><strong>const</strong></span>;
- <span class="type">size_type</span> size() <span class="bold"><strong>const</strong></span>;
- <span class="type">size_type</span> max_size() <span class="bold"><strong>const</strong></span>;
- <span class="type"><span class="bold"><strong>bool</strong></span></span> empty() <span class="bold"><strong>const</strong></span>;
- <span class="type"><span class="bold"><strong>void</strong></span></span> swap(deque &amp;) ;
- <span class="type"><span class="bold"><strong>void</strong></span></span> assign(size_type, <span class="bold"><strong>const</strong></span> T &amp;) ;
- <span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>typename</strong></span> InpIt&gt; <span class="type"><span class="bold"><strong>void</strong></span></span> assign(InpIt, InpIt) ;
- <span class="type"><span class="bold"><strong>void</strong></span></span> push_back(<span class="bold"><strong>const</strong></span> T &amp;) ;
- <span class="type"><span class="bold"><strong>void</strong></span></span> push_back(value_type &amp;&amp;) ;
- <span class="type"><span class="bold"><strong>void</strong></span></span> push_front(<span class="bold"><strong>const</strong></span> T &amp;) ;
- <span class="type"><span class="bold"><strong>void</strong></span></span> push_front(value_type &amp;&amp;) ;
- <span class="type"><span class="bold"><strong>void</strong></span></span> pop_back() ;
- <span class="type"><span class="bold"><strong>void</strong></span></span> pop_front() ;
- <span class="type">iterator</span> insert(const_iterator, <span class="bold"><strong>const</strong></span> T &amp;) ;
- <span class="type">iterator</span> insert(const_iterator, value_type &amp;&amp;) ;
- <span class="type"><span class="bold"><strong>void</strong></span></span> insert(const_iterator, size_type, <span class="bold"><strong>const</strong></span> value_type &amp;) ;
- <span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>typename</strong></span> InpIt&gt; <span class="type"><span class="bold"><strong>void</strong></span></span> insert(const_iterator, InpIt, InpIt) ;
- <span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>class</strong></span>... Args&gt; <span class="type"><span class="bold"><strong>void</strong></span></span> emplace_back(Args &amp;&amp;...) ;
- <span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>class</strong></span>... Args&gt; <span class="type"><span class="bold"><strong>void</strong></span></span> emplace_front(Args &amp;&amp;...) ;
- <span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>class</strong></span>... Args&gt; <span class="type">iterator</span> emplace(const_iterator, Args &amp;&amp;...) ;
- <span class="type"><span class="bold"><strong>void</strong></span></span> resize(size_type, <span class="bold"><strong>const</strong></span> value_type &amp;) ;
- <span class="type"><span class="bold"><strong>void</strong></span></span> resize(size_type) ;
- <span class="type">iterator</span> erase(const_iterator) ;
- <span class="type">iterator</span> erase(const_iterator, const_iterator) ;
- <span class="type"><span class="bold"><strong>void</strong></span></span> clear() ;
-};</pre></div>
+ <span class="comment">// public member functions</span>
+ <span class="identifier">allocator_type</span> get_allocator<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">iterator</span> begin<span class="special">(</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">iterator</span> end<span class="special">(</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">const_iterator</span> begin<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">const_iterator</span> end<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">reverse_iterator</span> rbegin<span class="special">(</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">reverse_iterator</span> rend<span class="special">(</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">const_reverse_iterator</span> rbegin<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">const_reverse_iterator</span> rend<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">const_iterator</span> cbegin<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">const_iterator</span> cend<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">const_reverse_iterator</span> crbegin<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">const_reverse_iterator</span> crend<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">reference</span> operator[]<span class="special">(</span><span class="identifier">size_type</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">const_reference</span> operator[]<span class="special">(</span><span class="identifier">size_type</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">reference</span> at<span class="special">(</span><span class="identifier">size_type</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">const_reference</span> at<span class="special">(</span><span class="identifier">size_type</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">reference</span> front<span class="special">(</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">const_reference</span> front<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">reference</span> back<span class="special">(</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">const_reference</span> back<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">size_type</span> size<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">size_type</span> max_size<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="keyword">bool</span> empty<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="keyword">void</span> swap<span class="special">(</span>deque <span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
+ <span class="keyword">void</span> assign<span class="special">(</span><span class="identifier">size_type</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">T</span> <span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
+ <span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> InpIt<span class="special">&gt;</span> <span class="keyword">void</span> assign<span class="special">(</span><span class="identifier">InpIt</span><span class="special">,</span> <span class="identifier">InpIt</span><span class="special">)</span><span class="special">;</span>
+ <span class="keyword">void</span> pop_back<span class="special">(</span><span class="special">)</span><span class="special">;</span>
+ <span class="keyword">void</span> pop_front<span class="special">(</span><span class="special">)</span><span class="special">;</span>
+ <span class="keyword">void</span> insert<span class="special">(</span><span class="identifier">const_iterator</span><span class="special">,</span> <span class="identifier">size_type</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">value_type</span> <span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
+ <span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> InpIt<span class="special">&gt;</span> <span class="keyword">void</span> insert<span class="special">(</span><span class="identifier">const_iterator</span><span class="special">,</span> <span class="identifier">InpIt</span><span class="special">,</span> <span class="identifier">InpIt</span><span class="special">)</span><span class="special">;</span>
+ <span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span><span class="special">...</span> Args<span class="special">&gt;</span> <span class="keyword">void</span> emplace_back<span class="special">(</span><span class="identifier">Args</span> <span class="special">&amp;&amp;</span><span class="special">...</span><span class="special">)</span><span class="special">;</span>
+ <span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span><span class="special">...</span> Args<span class="special">&gt;</span> <span class="keyword">void</span> emplace_front<span class="special">(</span><span class="identifier">Args</span> <span class="special">&amp;&amp;</span><span class="special">...</span><span class="special">)</span><span class="special">;</span>
+ <span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span><span class="special">...</span> Args<span class="special">&gt;</span> <span class="identifier">iterator</span> emplace<span class="special">(</span><span class="identifier">const_iterator</span><span class="special">,</span> <span class="identifier">Args</span> <span class="special">&amp;&amp;</span><span class="special">...</span><span class="special">)</span><span class="special">;</span>
+ <span class="keyword">void</span> resize<span class="special">(</span><span class="identifier">size_type</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">value_type</span> <span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
+ <span class="keyword">void</span> resize<span class="special">(</span><span class="identifier">size_type</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">iterator</span> erase<span class="special">(</span><span class="identifier">const_iterator</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">iterator</span> erase<span class="special">(</span><span class="identifier">const_iterator</span><span class="special">,</span> <span class="identifier">const_iterator</span><span class="special">)</span><span class="special">;</span>
+ <span class="keyword">void</span> clear<span class="special">(</span><span class="special">)</span><span class="special">;</span>
+<span class="special">}</span><span class="special">;</span></pre></div>
 <div class="refsect1" lang="en">
-<a name="id473130"></a><h2>Description</h2>
+<a name="id741801"></a><h2>Description</h2>
 <p>Deque class </p>
 <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(<span class="bold"><strong>const</strong></span> allocator_type &amp; a = allocator_type());</pre></li>
-<li><pre class="literallayout"><a name="id294178-bb"></a>deque(<span class="bold"><strong>const</strong></span> deque &amp; x);</pre></li>
-<li><pre class="literallayout"><a name="id294187-bb"></a>deque(deque &amp;&amp; mx);</pre></li>
-<li><pre class="literallayout"><a name="id294196-bb"></a>deque(size_type n, <span class="bold"><strong>const</strong></span> value_type &amp; value,
- <span class="bold"><strong>const</strong></span> allocator_type &amp; a = allocator_type());</pre></li>
-<li><pre class="literallayout"><a name="id294214-bb"></a>deque(size_type n);</pre></li>
-<li><pre class="literallayout"><span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>typename</strong></span> InpIt&gt;
- <a name="id294220-bb"></a>deque(InpIt first, InpIt last, <span class="bold"><strong>const</strong></span> allocator_type &amp; a = allocator_type());</pre></li>
-<li><pre class="literallayout">deque&amp; <a name="id294245-bb"></a><span class="bold"><strong>operator</strong></span>=(<span class="bold"><strong>const</strong></span> deque &amp; x);</pre></li>
-<li><pre class="literallayout">deque&amp; <a name="id294254-bb"></a><span class="bold"><strong>operator</strong></span>=(deque &amp;&amp; x);</pre></li>
-<li><pre class="literallayout"><a name="id294244-bb"></a>~deque();</pre></li>
+<li>
+<pre class="literallayout"><a name="id372806-bb"></a><span class="identifier">deque</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">allocator_type</span> <span class="special">&amp;</span> a <span class="special">=</span> <span class="identifier">allocator_type</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span></pre>
+<p><span class="bold"><strong>Effects</strong></span>: Constructs a deque taking the allocator as parameter.</p>
+<p><span class="bold"><strong>Throws</strong></span>: If allocator_type's copy constructor throws.</p>
+<p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
+</li>
+<li>
+<pre class="literallayout"><a name="id372833-bb"></a><span class="identifier">deque</span><span class="special">(</span><span class="identifier">size_type</span> n<span class="special">)</span><span class="special">;</span></pre>
+<p><span class="bold"><strong>Effects</strong></span>: Constructs a deque that will use a copy of allocator a and inserts n default contructed values.</p>
+<p><span class="bold"><strong>Throws</strong></span>: If allocator_type's default constructor or copy constructor throws or T's default or copy constructor throws.</p>
+<p><span class="bold"><strong>Complexity</strong></span>: Linear to n. </p>
+</li>
+<li>
+<pre class="literallayout"><a name="id372858-bb"></a><span class="identifier">deque</span><span class="special">(</span><span class="identifier">size_type</span> n<span class="special">,</span> <span class="keyword">const</span> <span class="identifier">value_type</span> <span class="special">&amp;</span> value<span class="special">,</span>
+ <span class="keyword">const</span> <span class="identifier">allocator_type</span> <span class="special">&amp;</span> a <span class="special">=</span> <span class="identifier">allocator_type</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span></pre>
+<p><span class="bold"><strong>Effects</strong></span>: Constructs a deque that will use a copy of allocator a and inserts n copies of value.</p>
+<p><span class="bold"><strong>Throws</strong></span>: If allocator_type's default constructor or copy constructor throws or T's default or copy constructor throws.</p>
+<p><span class="bold"><strong>Complexity</strong></span>: Linear to n. </p>
+</li>
+<li>
+<pre class="literallayout"><a name="id372896-bb"></a><span class="identifier">deque</span><span class="special">(</span><span class="keyword">const</span> deque <span class="special">&amp;</span> x<span class="special">)</span><span class="special">;</span></pre>
+<p><span class="bold"><strong>Effects</strong></span>: Copy constructs a deque.</p>
+<p><span class="bold"><strong>Postcondition</strong></span>: x == *this.</p>
+<p><span class="bold"><strong>Complexity</strong></span>: Linear to the elements x contains. </p>
+</li>
+<li>
+<pre class="literallayout"><a name="id372924-bb"></a><span class="identifier">deque</span><span class="special">(</span>deque <span class="special">&amp;&amp;</span> mx<span class="special">)</span><span class="special">;</span></pre>
+<p><span class="bold"><strong>Effects</strong></span>: Move constructor. Moves mx's resources to *this.</p>
+<p><span class="bold"><strong>Throws</strong></span>: If allocator_type's copy constructor throws.</p>
+<p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
+</li>
+<li>
+<pre class="literallayout"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> InpIt<span class="special">&gt;</span>
+ <a name="id372952-bb"></a><span class="identifier">deque</span><span class="special">(</span><span class="identifier">InpIt</span> first<span class="special">,</span> <span class="identifier">InpIt</span> last<span class="special">,</span> <span class="keyword">const</span> <span class="identifier">allocator_type</span> <span class="special">&amp;</span> a <span class="special">=</span> <span class="identifier">allocator_type</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span></pre>
+<p><span class="bold"><strong>Effects</strong></span>: Constructs a deque that will use a copy of allocator a and inserts a copy of the range [first, last) in the deque.</p>
+<p><span class="bold"><strong>Throws</strong></span>: If allocator_type's default constructor or copy constructor throws or T's constructor taking an dereferenced InIt throws.</p>
+<p><span class="bold"><strong>Complexity</strong></span>: Linear to the range [first, last). </p>
+</li>
+<li>
+<pre class="literallayout">deque&amp; <a name="id373016-bb"></a><span class="keyword">operator</span><span class="special">=</span><span class="special">(</span><span class="keyword">const</span> deque <span class="special">&amp;</span> x<span class="special">)</span><span class="special">;</span></pre>
+<p><span class="bold"><strong>Effects</strong></span>: Makes *this contain the same elements as x.</p>
+<p><span class="bold"><strong>Postcondition</strong></span>: this-&gt;size() == x.size(). *this contains a copy of each of x's elements.</p>
+<p><span class="bold"><strong>Throws</strong></span>: If memory allocation throws or T's copy constructor throws.</p>
+<p><span class="bold"><strong>Complexity</strong></span>: Linear to the number of elements in x. </p>
+</li>
+<li>
+<pre class="literallayout">deque&amp; <a name="id373052-bb"></a><span class="keyword">operator</span><span class="special">=</span><span class="special">(</span>deque <span class="special">&amp;&amp;</span> x<span class="special">)</span><span class="special">;</span></pre>
+<p><span class="bold"><strong>Effects</strong></span>: Move assignment. All mx's values are transferred to *this.</p>
+<p><span class="bold"><strong>Postcondition</strong></span>: x.empty(). *this contains a the elements x had before the function.</p>
+<p><span class="bold"><strong>Throws</strong></span>: If allocator_type's copy constructor throws.</p>
+<p><span class="bold"><strong>Complexity</strong></span>: Linear. </p>
+</li>
+<li>
+<pre class="literallayout"><a name="id372995-bb"></a><span class="special">~</span><span class="identifier">deque</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre>
+<p><span class="bold"><strong>Effects</strong></span>: Destroys the deque. All stored values are destroyed and used memory is deallocated.</p>
+<p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
+<p><span class="bold"><strong>Complexity</strong></span>: Linear to the number of elements. </p>
+</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"><span class="type">allocator_type</span> <a name="id293690-bb"></a>get_allocator() <span class="bold"><strong>const</strong></span>;</pre></li>
-<li><pre class="literallayout"><span class="type">iterator</span> <a name="id293696-bb"></a>begin() ;</pre></li>
-<li><pre class="literallayout"><span class="type">iterator</span> <a name="id293702-bb"></a>end() ;</pre></li>
-<li><pre class="literallayout"><span class="type">const_iterator</span> <a name="id293708-bb"></a>begin() <span class="bold"><strong>const</strong></span>;</pre></li>
-<li><pre class="literallayout"><span class="type">const_iterator</span> <a name="id293714-bb"></a>end() <span class="bold"><strong>const</strong></span>;</pre></li>
-<li><pre class="literallayout"><span class="type">reverse_iterator</span> <a name="id293720-bb"></a>rbegin() ;</pre></li>
-<li><pre class="literallayout"><span class="type">reverse_iterator</span> <a name="id293726-bb"></a>rend() ;</pre></li>
-<li><pre class="literallayout"><span class="type">const_reverse_iterator</span> <a name="id293732-bb"></a>rbegin() <span class="bold"><strong>const</strong></span>;</pre></li>
-<li><pre class="literallayout"><span class="type">const_reverse_iterator</span> <a name="id293738-bb"></a>rend() <span class="bold"><strong>const</strong></span>;</pre></li>
-<li><pre class="literallayout"><span class="type">const_iterator</span> <a name="id293744-bb"></a>cbegin() <span class="bold"><strong>const</strong></span>;</pre></li>
-<li><pre class="literallayout"><span class="type">const_iterator</span> <a name="id293750-bb"></a>cend() <span class="bold"><strong>const</strong></span>;</pre></li>
-<li><pre class="literallayout"><span class="type">const_reverse_iterator</span> <a name="id293756-bb"></a>crbegin() <span class="bold"><strong>const</strong></span>;</pre></li>
-<li><pre class="literallayout"><span class="type">const_reverse_iterator</span> <a name="id293762-bb"></a>crend() <span class="bold"><strong>const</strong></span>;</pre></li>
-<li><pre class="literallayout"><span class="type">reference</span> <a name="id293768-bb"></a><span class="bold"><strong>operator</strong></span>[](size_type n) ;</pre></li>
-<li><pre class="literallayout"><span class="type">const_reference</span> <a name="id293779-bb"></a><span class="bold"><strong>operator</strong></span>[](size_type n) <span class="bold"><strong>const</strong></span>;</pre></li>
-<li><pre class="literallayout"><span class="type"><span class="bold"><strong>void</strong></span></span> <a name="id293790-bb"></a>priv_range_check(size_type n) <span class="bold"><strong>const</strong></span>;</pre></li>
-<li><pre class="literallayout"><span class="type">reference</span> <a name="id293801-bb"></a>at(size_type n) ;</pre></li>
-<li><pre class="literallayout"><span class="type">const_reference</span> <a name="id293812-bb"></a>at(size_type n) <span class="bold"><strong>const</strong></span>;</pre></li>
-<li><pre class="literallayout"><span class="type">reference</span> <a name="id293822-bb"></a>front() ;</pre></li>
-<li><pre class="literallayout"><span class="type">reference</span> <a name="id293828-bb"></a>back() ;</pre></li>
-<li><pre class="literallayout"><span class="type">const_reference</span> <a name="id293834-bb"></a>front() <span class="bold"><strong>const</strong></span>;</pre></li>
-<li><pre class="literallayout"><span class="type">const_reference</span> <a name="id293840-bb"></a>back() <span class="bold"><strong>const</strong></span>;</pre></li>
-<li><pre class="literallayout"><span class="type">size_type</span> <a name="id293846-bb"></a>size() <span class="bold"><strong>const</strong></span>;</pre></li>
-<li><pre class="literallayout"><span class="type">size_type</span> <a name="id293852-bb"></a>max_size() <span class="bold"><strong>const</strong></span>;</pre></li>
-<li><pre class="literallayout"><span class="type"><span class="bold"><strong>bool</strong></span></span> <a name="id293858-bb"></a>empty() <span class="bold"><strong>const</strong></span>;</pre></li>
-<li><pre class="literallayout"><span class="type"><span class="bold"><strong>void</strong></span></span> <a name="id293864-bb"></a>swap(deque &amp; x) ;</pre></li>
-<li><pre class="literallayout"><span class="type"><span class="bold"><strong>void</strong></span></span> <a name="id293878-bb"></a>assign(size_type n, <span class="bold"><strong>const</strong></span> T &amp; val) ;</pre></li>
-<li><pre class="literallayout"><span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>typename</strong></span> InpIt&gt; <span class="type"><span class="bold"><strong>void</strong></span></span> <a name="id293893-bb"></a>assign(InpIt first, InpIt last) ;</pre></li>
-<li><pre class="literallayout"><span class="type"><span class="bold"><strong>void</strong></span></span> <a name="id293915-bb"></a>push_back(<span class="bold"><strong>const</strong></span> T &amp; t) ;</pre></li>
-<li><pre class="literallayout"><span class="type"><span class="bold"><strong>void</strong></span></span> <a name="id293926-bb"></a>push_back(value_type &amp;&amp; t) ;</pre></li>
-<li><pre class="literallayout"><span class="type"><span class="bold"><strong>void</strong></span></span> <a name="id293936-bb"></a>push_front(<span class="bold"><strong>const</strong></span> T &amp; t) ;</pre></li>
-<li><pre class="literallayout"><span class="type"><span class="bold"><strong>void</strong></span></span> <a name="id293947-bb"></a>push_front(value_type &amp;&amp; t) ;</pre></li>
-<li><pre class="literallayout"><span class="type"><span class="bold"><strong>void</strong></span></span> <a name="id293958-bb"></a>pop_back() ;</pre></li>
-<li><pre class="literallayout"><span class="type"><span class="bold"><strong>void</strong></span></span> <a name="id293964-bb"></a>pop_front() ;</pre></li>
-<li><pre class="literallayout"><span class="type">iterator</span> <a name="id293970-bb"></a>insert(const_iterator position, <span class="bold"><strong>const</strong></span> T &amp; x) ;</pre></li>
-<li><pre class="literallayout"><span class="type">iterator</span> <a name="id293986-bb"></a>insert(const_iterator position, value_type &amp;&amp; mx) ;</pre></li>
-<li><pre class="literallayout"><span class="type"><span class="bold"><strong>void</strong></span></span> <a name="id294001-bb"></a>insert(const_iterator pos, size_type n, <span class="bold"><strong>const</strong></span> value_type &amp; x) ;</pre></li>
-<li><pre class="literallayout"><span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>typename</strong></span> InpIt&gt;
- <span class="type"><span class="bold"><strong>void</strong></span></span> <a name="id294022-bb"></a>insert(const_iterator pos, InpIt first, InpIt last) ;</pre></li>
-<li><pre class="literallayout"><span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>class</strong></span>... Args&gt; <span class="type"><span class="bold"><strong>void</strong></span></span> <a name="id294048-bb"></a>emplace_back(Args &amp;&amp;... args) ;</pre></li>
-<li><pre class="literallayout"><span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>class</strong></span>... Args&gt; <span class="type"><span class="bold"><strong>void</strong></span></span> <a name="id294067-bb"></a>emplace_front(Args &amp;&amp;... args) ;</pre></li>
-<li><pre class="literallayout"><span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>class</strong></span>... Args&gt; <span class="type">iterator</span> <a name="id294086-bb"></a>emplace(const_iterator p, Args &amp;&amp;... args) ;</pre></li>
-<li><pre class="literallayout"><span class="type"><span class="bold"><strong>void</strong></span></span> <a name="id294110-bb"></a>resize(size_type new_size, <span class="bold"><strong>const</strong></span> value_type &amp; x) ;</pre></li>
-<li><pre class="literallayout"><span class="type"><span class="bold"><strong>void</strong></span></span> <a name="id294126-bb"></a>resize(size_type new_size) ;</pre></li>
-<li><pre class="literallayout"><span class="type">iterator</span> <a name="id294137-bb"></a>erase(const_iterator pos) ;</pre></li>
-<li><pre class="literallayout"><span class="type">iterator</span> <a name="id294148-bb"></a>erase(const_iterator first, const_iterator last) ;</pre></li>
-<li><pre class="literallayout"><span class="type"><span class="bold"><strong>void</strong></span></span> <a name="id294163-bb"></a>clear() ;</pre></li>
+<li>
+<pre class="literallayout"><span class="identifier">allocator_type</span> <a name="id371439-bb"></a><span class="identifier">get_allocator</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
+<p><span class="bold"><strong>Effects</strong></span>: Returns a copy of the internal allocator.</p>
+<p><span class="bold"><strong>Throws</strong></span>: If allocator's copy constructor throws.</p>
+<p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
+</li>
+<li>
+<pre class="literallayout"><span class="identifier">iterator</span> <a name="id371464-bb"></a><span class="identifier">begin</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre>
+<p><span class="bold"><strong>Effects</strong></span>: Returns an iterator to the first element contained in the deque.</p>
+<p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
+<p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
+</li>
+<li>
+<pre class="literallayout"><span class="identifier">iterator</span> <a name="id371489-bb"></a><span class="identifier">end</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre>
+<p><span class="bold"><strong>Effects</strong></span>: Returns an iterator to the end of the deque.</p>
+<p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
+<p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
+</li>
+<li>
+<pre class="literallayout"><span class="identifier">const_iterator</span> <a name="id371514-bb"></a><span class="identifier">begin</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
+<p><span class="bold"><strong>Effects</strong></span>: Returns a const_iterator to the first element contained in the deque.</p>
+<p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
+<p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
+</li>
+<li>
+<pre class="literallayout"><span class="identifier">const_iterator</span> <a name="id371540-bb"></a><span class="identifier">end</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
+<p><span class="bold"><strong>Effects</strong></span>: Returns a const_iterator to the end of the deque.</p>
+<p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
+<p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
+</li>
+<li>
+<pre class="literallayout"><span class="identifier">reverse_iterator</span> <a name="id371565-bb"></a><span class="identifier">rbegin</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre>
+<p><span class="bold"><strong>Effects</strong></span>: Returns a reverse_iterator pointing to the beginning of the reversed deque.</p>
+<p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
+<p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
+</li>
+<li>
+<pre class="literallayout"><span class="identifier">reverse_iterator</span> <a name="id371590-bb"></a><span class="identifier">rend</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre>
+<p><span class="bold"><strong>Effects</strong></span>: Returns a reverse_iterator pointing to the end of the reversed deque.</p>
+<p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
+<p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
+</li>
+<li>
+<pre class="literallayout"><span class="identifier">const_reverse_iterator</span> <a name="id371615-bb"></a><span class="identifier">rbegin</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
+<p><span class="bold"><strong>Effects</strong></span>: Returns a const_reverse_iterator pointing to the beginning of the reversed deque.</p>
+<p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
+<p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
+</li>
+<li>
+<pre class="literallayout"><span class="identifier">const_reverse_iterator</span> <a name="id371640-bb"></a><span class="identifier">rend</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
+<p><span class="bold"><strong>Effects</strong></span>: Returns a const_reverse_iterator pointing to the end of the reversed deque.</p>
+<p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
+<p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
+</li>
+<li>
+<pre class="literallayout"><span class="identifier">const_iterator</span> <a name="id371666-bb"></a><span class="identifier">cbegin</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
+<p><span class="bold"><strong>Effects</strong></span>: Returns a const_iterator to the first element contained in the deque.</p>
+<p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
+<p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
+</li>
+<li>
+<pre class="literallayout"><span class="identifier">const_iterator</span> <a name="id371691-bb"></a><span class="identifier">cend</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
+<p><span class="bold"><strong>Effects</strong></span>: Returns a const_iterator to the end of the deque.</p>
+<p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
+<p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
+</li>
+<li>
+<pre class="literallayout"><span class="identifier">const_reverse_iterator</span> <a name="id371716-bb"></a><span class="identifier">crbegin</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
+<p><span class="bold"><strong>Effects</strong></span>: Returns a const_reverse_iterator pointing to the beginning of the reversed deque.</p>
+<p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
+<p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
+</li>
+<li>
+<pre class="literallayout"><span class="identifier">const_reverse_iterator</span> <a name="id371741-bb"></a><span class="identifier">crend</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
+<p><span class="bold"><strong>Effects</strong></span>: Returns a const_reverse_iterator pointing to the end of the reversed deque.</p>
+<p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
+<p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
+</li>
+<li>
+<pre class="literallayout"><span class="identifier">reference</span> <a name="id371766-bb"></a><span class="keyword">operator</span><span class="special">[</span><span class="special">]</span><span class="special">(</span><span class="identifier">size_type</span> n<span class="special">)</span><span class="special">;</span></pre>
+<p><span class="bold"><strong>Requires</strong></span>: size() &lt; n.</p>
+<p><span class="bold"><strong>Effects</strong></span>: Returns a reference to the nth element from the beginning of the container.</p>
+<p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
+<p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
+</li>
+<li>
+<pre class="literallayout"><span class="identifier">const_reference</span> <a name="id371802-bb"></a><span class="keyword">operator</span><span class="special">[</span><span class="special">]</span><span class="special">(</span><span class="identifier">size_type</span> n<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
+<p><span class="bold"><strong>Requires</strong></span>: size() &lt; n.</p>
+<p><span class="bold"><strong>Effects</strong></span>: Returns a const reference to the nth element from the beginning of the container.</p>
+<p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
+<p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
+</li>
+<li>
+<pre class="literallayout"><span class="identifier">reference</span> <a name="id371838-bb"></a><span class="identifier">at</span><span class="special">(</span><span class="identifier">size_type</span> n<span class="special">)</span><span class="special">;</span></pre>
+<p><span class="bold"><strong>Requires</strong></span>: size() &lt; n.</p>
+<p><span class="bold"><strong>Effects</strong></span>: Returns a reference to the nth element from the beginning of the container.</p>
+<p><span class="bold"><strong>Throws</strong></span>: std::range_error if n &gt;= size()</p>
+<p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
+</li>
+<li>
+<pre class="literallayout"><span class="identifier">const_reference</span> <a name="id372022-bb"></a><span class="identifier">at</span><span class="special">(</span><span class="identifier">size_type</span> n<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
+<p><span class="bold"><strong>Requires</strong></span>: size() &lt; n.</p>
+<p><span class="bold"><strong>Effects</strong></span>: Returns a const reference to the nth element from the beginning of the container.</p>
+<p><span class="bold"><strong>Throws</strong></span>: std::range_error if n &gt;= size()</p>
+<p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
+</li>
+<li>
+<pre class="literallayout"><span class="identifier">reference</span> <a name="id372058-bb"></a><span class="identifier">front</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre>
+<p><span class="bold"><strong>Requires</strong></span>: !empty()</p>
+<p><span class="bold"><strong>Effects</strong></span>: Returns a reference to the first element of the container.</p>
+<p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
+<p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
+</li>
+<li>
+<pre class="literallayout"><span class="identifier">const_reference</span> <a name="id372090-bb"></a><span class="identifier">front</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
+<p><span class="bold"><strong>Requires</strong></span>: !empty()</p>
+<p><span class="bold"><strong>Effects</strong></span>: Returns a const reference to the first element from the beginning of the container.</p>
+<p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
+<p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
+</li>
+<li>
+<pre class="literallayout"><span class="identifier">reference</span> <a name="id372122-bb"></a><span class="identifier">back</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre>
+<p><span class="bold"><strong>Requires</strong></span>: !empty()</p>
+<p><span class="bold"><strong>Effects</strong></span>: Returns a reference to the last element of the container.</p>
+<p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
+<p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
+</li>
+<li>
+<pre class="literallayout"><span class="identifier">const_reference</span> <a name="id372154-bb"></a><span class="identifier">back</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
+<p><span class="bold"><strong>Requires</strong></span>: !empty()</p>
+<p><span class="bold"><strong>Effects</strong></span>: Returns a const reference to the last element of the container.</p>
+<p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
+<p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
+</li>
+<li>
+<pre class="literallayout"><span class="identifier">size_type</span> <a name="id372185-bb"></a><span class="identifier">size</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
+<p><span class="bold"><strong>Effects</strong></span>: Returns the number of the elements contained in the deque.</p>
+<p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
+<p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
+</li>
+<li>
+<pre class="literallayout"><span class="identifier">size_type</span> <a name="id372212-bb"></a><span class="identifier">max_size</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
+<p><span class="bold"><strong>Effects</strong></span>: Returns the largest possible size of the deque.</p>
+<p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
+<p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
+</li>
+<li>
+<pre class="literallayout"><span class="keyword">bool</span> <a name="id372237-bb"></a><span class="identifier">empty</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
+<p><span class="bold"><strong>Effects</strong></span>: Returns true if the deque contains no elements.</p>
+<p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
+<p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
+</li>
+<li>
+<pre class="literallayout"><span class="keyword">void</span> <a name="id372262-bb"></a><span class="identifier">swap</span><span class="special">(</span>deque <span class="special">&amp;</span> x<span class="special">)</span><span class="special">;</span></pre>
+<p><span class="bold"><strong>Effects</strong></span>: Swaps the contents of *this and x. If this-&gt;allocator_type() != x.allocator_type() allocators are also swapped.</p>
+<p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
+<p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
+</li>
+<li>
+<pre class="literallayout"><span class="keyword">void</span> <a name="id372294-bb"></a><span class="identifier">assign</span><span class="special">(</span><span class="identifier">size_type</span> n<span class="special">,</span> <span class="keyword">const</span> <span class="identifier">T</span> <span class="special">&amp;</span> val<span class="special">)</span><span class="special">;</span></pre>
+<p><span class="bold"><strong>Effects</strong></span>: Assigns the n copies of val to *this.</p>
+<p><span class="bold"><strong>Throws</strong></span>: If memory allocation throws or T's copy constructor throws.</p>
+<p><span class="bold"><strong>Complexity</strong></span>: Linear to n. </p>
+</li>
+<li>
+<pre class="literallayout"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> InpIt<span class="special">&gt;</span> <span class="keyword">void</span> <a name="id372330-bb"></a><span class="identifier">assign</span><span class="special">(</span><span class="identifier">InpIt</span> first<span class="special">,</span> <span class="identifier">InpIt</span> last<span class="special">)</span><span class="special">;</span></pre>
+<p><span class="bold"><strong>Effects</strong></span>: Assigns the the range [first, last) to *this.</p>
+<p><span class="bold"><strong>Throws</strong></span>: If memory allocation throws or T's constructor from dereferencing InpIt throws.</p>
+<p><span class="bold"><strong>Complexity</strong></span>: Linear to n. </p>
+</li>
+<li>
+<pre class="literallayout"><span class="keyword">void</span> <a name="id372371-bb"></a><span class="identifier">pop_back</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre>
+<p><span class="bold"><strong>Effects</strong></span>: Removes the last element from the deque.</p>
+<p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
+<p><span class="bold"><strong>Complexity</strong></span>: Constant time. </p>
+</li>
+<li>
+<pre class="literallayout"><span class="keyword">void</span> <a name="id372396-bb"></a><span class="identifier">pop_front</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre>
+<p><span class="bold"><strong>Effects</strong></span>: Removes the first element from the deque.</p>
+<p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
+<p><span class="bold"><strong>Complexity</strong></span>: Constant time. </p>
+</li>
+<li>
+<pre class="literallayout"><span class="keyword">void</span> <a name="id372422-bb"></a><span class="identifier">insert</span><span class="special">(</span><span class="identifier">const_iterator</span> pos<span class="special">,</span> <span class="identifier">size_type</span> n<span class="special">,</span> <span class="keyword">const</span> <span class="identifier">value_type</span> <span class="special">&amp;</span> x<span class="special">)</span><span class="special">;</span></pre>
+<p><span class="bold"><strong>Requires</strong></span>: pos must be a valid iterator of *this.</p>
+<p><span class="bold"><strong>Effects</strong></span>: Insert n copies of x before pos.</p>
+<p><span class="bold"><strong>Throws</strong></span>: If memory allocation throws or T's copy constructor throws.</p>
+<p><span class="bold"><strong>Complexity</strong></span>: Linear to n. </p>
+</li>
+<li>
+<pre class="literallayout"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> InpIt<span class="special">&gt;</span>
+ <span class="keyword">void</span> <a name="id372468-bb"></a><span class="identifier">insert</span><span class="special">(</span><span class="identifier">const_iterator</span> pos<span class="special">,</span> <span class="identifier">InpIt</span> first<span class="special">,</span> <span class="identifier">InpIt</span> last<span class="special">)</span><span class="special">;</span></pre>
+<p><span class="bold"><strong>Requires</strong></span>: pos must be a valid iterator of *this.</p>
+<p><span class="bold"><strong>Effects</strong></span>: Insert a copy of the [first, last) range before pos.</p>
+<p><span class="bold"><strong>Throws</strong></span>: If memory allocation throws, T's constructor from a dereferenced InpIt throws or T's copy constructor throws.</p>
+<p><span class="bold"><strong>Complexity</strong></span>: Linear to std::distance [first, last). </p>
+</li>
+<li>
+<pre class="literallayout"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span><span class="special">...</span> Args<span class="special">&gt;</span> <span class="keyword">void</span> <a name="id372520-bb"></a><span class="identifier">emplace_back</span><span class="special">(</span><span class="identifier">Args</span> <span class="special">&amp;&amp;</span><span class="special">...</span> args<span class="special">)</span><span class="special">;</span></pre>
+<p><span class="bold"><strong>Effects</strong></span>: Inserts an object of type T constructed with std::forward&lt;Args&gt;(args)... in the end of the deque.</p>
+<p><span class="bold"><strong>Throws</strong></span>: If memory allocation throws or the in-place constructor throws.</p>
+<p><span class="bold"><strong>Complexity</strong></span>: Amortized constant time </p>
+</li>
+<li>
+<pre class="literallayout"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span><span class="special">...</span> Args<span class="special">&gt;</span> <span class="keyword">void</span> <a name="id372558-bb"></a><span class="identifier">emplace_front</span><span class="special">(</span><span class="identifier">Args</span> <span class="special">&amp;&amp;</span><span class="special">...</span> args<span class="special">)</span><span class="special">;</span></pre>
+<p><span class="bold"><strong>Effects</strong></span>: Inserts an object of type T constructed with std::forward&lt;Args&gt;(args)... in the beginning of the deque.</p>
+<p><span class="bold"><strong>Throws</strong></span>: If memory allocation throws or the in-place constructor throws.</p>
+<p><span class="bold"><strong>Complexity</strong></span>: Amortized constant time </p>
+</li>
+<li>
+<pre class="literallayout"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span><span class="special">...</span> Args<span class="special">&gt;</span> <span class="identifier">iterator</span> <a name="id372597-bb"></a><span class="identifier">emplace</span><span class="special">(</span><span class="identifier">const_iterator</span> p<span class="special">,</span> <span class="identifier">Args</span> <span class="special">&amp;&amp;</span><span class="special">...</span> args<span class="special">)</span><span class="special">;</span></pre>
+<p><span class="bold"><strong>Requires</strong></span>: position must be a valid iterator of *this.</p>
+<p><span class="bold"><strong>Effects</strong></span>: Inserts an object of type T constructed with std::forward&lt;Args&gt;(args)... before position</p>
+<p><span class="bold"><strong>Throws</strong></span>: If memory allocation throws or the in-place constructor throws.</p>
+<p><span class="bold"><strong>Complexity</strong></span>: If position is end(), amortized constant time Linear time otherwise. </p>
+</li>
+<li>
+<pre class="literallayout"><span class="keyword">void</span> <a name="id372646-bb"></a><span class="identifier">resize</span><span class="special">(</span><span class="identifier">size_type</span> new_size<span class="special">,</span> <span class="keyword">const</span> <span class="identifier">value_type</span> <span class="special">&amp;</span> x<span class="special">)</span><span class="special">;</span></pre>
+<p><span class="bold"><strong>Effects</strong></span>: Inserts or erases elements at the end such that the size becomes n. New elements are copy constructed from x.</p>
+<p><span class="bold"><strong>Throws</strong></span>: If memory allocation throws, or T's copy constructor throws.</p>
+<p><span class="bold"><strong>Complexity</strong></span>: Linear to the difference between size() and new_size. </p>
+</li>
+<li>
+<pre class="literallayout"><span class="keyword">void</span> <a name="id372683-bb"></a><span class="identifier">resize</span><span class="special">(</span><span class="identifier">size_type</span> new_size<span class="special">)</span><span class="special">;</span></pre>
+<p><span class="bold"><strong>Effects</strong></span>: Inserts or erases elements at the end such that the size becomes n. New elements are default constructed.</p>
+<p><span class="bold"><strong>Throws</strong></span>: If memory allocation throws, or T's copy constructor throws.</p>
+<p><span class="bold"><strong>Complexity</strong></span>: Linear to the difference between size() and new_size. </p>
+</li>
+<li>
+<pre class="literallayout"><span class="identifier">iterator</span> <a name="id372716-bb"></a><span class="identifier">erase</span><span class="special">(</span><span class="identifier">const_iterator</span> pos<span class="special">)</span><span class="special">;</span></pre>
+<p><span class="bold"><strong>Effects</strong></span>: Erases the element at position pos.</p>
+<p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
+<p><span class="bold"><strong>Complexity</strong></span>: 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. </p>
+</li>
+<li>
+<pre class="literallayout"><span class="identifier">iterator</span> <a name="id372746-bb"></a><span class="identifier">erase</span><span class="special">(</span><span class="identifier">const_iterator</span> first<span class="special">,</span> <span class="identifier">const_iterator</span> last<span class="special">)</span><span class="special">;</span></pre>
+<p><span class="bold"><strong>Effects</strong></span>: Erases the elements pointed by [first, last).</p>
+<p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
+<p><span class="bold"><strong>Complexity</strong></span>: 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). </p>
+</li>
+<li>
+<pre class="literallayout"><span class="keyword">void</span> <a name="id372780-bb"></a><span class="identifier">clear</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre>
+<p><span class="bold"><strong>Effects</strong></span>: Erases all the elements of the deque.</p>
+<p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
+<p><span class="bold"><strong>Complexity</strong></span>: Linear to the number of elements in the deque. </p>
+</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<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2009 -2011 Ion Gaztanaga<p>
         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)
       </p>
@@ -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&#160;1.&#160;Boost.Container">
 <link rel="up" href="../../boost_container_reference.html#header.boost.container.flat_map_hpp" title="Header &lt;boost/container/flat_map.hpp&gt;">
 <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 @@
 <p>boost::container::flat_map &#8212; </p>
 </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"><span class="emphasis"><em>// In header: &lt;boost/container/flat_map.hpp&gt;
+<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis"><span class="comment">// In header: &lt;boost/container/flat_map.hpp&gt;
 
-</em></span><span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>typename</strong></span> Key, <span class="bold"><strong>typename</strong></span> T, <span class="bold"><strong>typename</strong></span> Pred, <span class="bold"><strong>typename</strong></span> Alloc&gt;
-<span class="bold"><strong>class</strong></span> flat_map {
-<span class="bold"><strong>public</strong></span>:
- <span class="emphasis"><em>// types</em></span>
- <span class="bold"><strong>typedef</strong></span> impl_tree_t::key_type <a name="boost.container.flat_map.key_type"></a>key_type;
- <span class="bold"><strong>typedef</strong></span> T <a name="boost.container.flat_map.mapped_type"></a>mapped_type;
- <span class="bold"><strong>typedef</strong></span> std::pair&lt; key_type, mapped_type &gt; <a name="boost.container.flat_map.value_type"></a>value_type;
- <span class="bold"><strong>typedef</strong></span> Alloc::pointer <a name="boost.container.flat_map.pointer"></a>pointer;
- <span class="bold"><strong>typedef</strong></span> Alloc::const_pointer <a name="boost.container.flat_map.const_pointer"></a>const_pointer;
- <span class="bold"><strong>typedef</strong></span> Alloc::reference <a name="boost.container.flat_map.reference"></a>reference;
- <span class="bold"><strong>typedef</strong></span> Alloc::const_reference <a name="boost.container.flat_map.const_reference"></a>const_reference;
- <span class="bold"><strong>typedef</strong></span> <span class="emphasis"><em>unspecified</em></span> <a name="boost.container.flat_map.value_compare"></a>value_compare;
- <span class="bold"><strong>typedef</strong></span> Pred <a name="boost.container.flat_map.key_compare"></a>key_compare;
- <span class="bold"><strong>typedef</strong></span> <span class="emphasis"><em>unspecified</em></span> <a name="boost.container.flat_map.iterator"></a>iterator;
- <span class="bold"><strong>typedef</strong></span> <span class="emphasis"><em>unspecified</em></span> <a name="boost.container.flat_map.const_iterator"></a>const_iterator;
- <span class="bold"><strong>typedef</strong></span> <span class="emphasis"><em>unspecified</em></span> <a name="boost.container.flat_map.reverse_iterator"></a>reverse_iterator;
- <span class="bold"><strong>typedef</strong></span> <span class="emphasis"><em>unspecified</em></span> <a name="boost.container.flat_map.const_reverse_iterator"></a>const_reverse_iterator;
- <span class="bold"><strong>typedef</strong></span> impl_tree_t::size_type <a name="boost.container.flat_map.size_type"></a>size_type;
- <span class="bold"><strong>typedef</strong></span> impl_tree_t::difference_type <a name="boost.container.flat_map.difference_type"></a>difference_type;
- <span class="bold"><strong>typedef</strong></span> Alloc <a name="boost.container.flat_map.allocator_type"></a>allocator_type;
- <span class="bold"><strong>typedef</strong></span> Alloc <a name="boost.container.flat_map.stored_allocator_type"></a>stored_allocator_type;
+</span><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> Key<span class="special">,</span> <span class="keyword">typename</span> T<span class="special">,</span> <span class="keyword">typename</span> Pred<span class="special">,</span> <span class="keyword">typename</span> Alloc<span class="special">&gt;</span>
+<span class="keyword">class</span> flat_map <span class="special">{</span>
+<span class="keyword">public</span><span class="special">:</span>
+ <span class="comment">// types</span>
+ <span class="keyword">typedef</span> <span class="identifier">impl_tree_t</span><span class="special">::</span><span class="identifier">key_type</span> <a name="boost.container.flat_map.key_type"></a><span class="identifier">key_type</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">T</span> <a name="boost.container.flat_map.mapped_type"></a><span class="identifier">mapped_type</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span> <span class="identifier">key_type</span><span class="special">,</span> <span class="identifier">mapped_type</span> <span class="special">&gt;</span> <a name="boost.container.flat_map.value_type"></a><span class="identifier">value_type</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">Alloc</span><span class="special">::</span><span class="identifier">pointer</span> <a name="boost.container.flat_map.pointer"></a><span class="identifier">pointer</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">Alloc</span><span class="special">::</span><span class="identifier">const_pointer</span> <a name="boost.container.flat_map.const_pointer"></a><span class="identifier">const_pointer</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">Alloc</span><span class="special">::</span><span class="identifier">reference</span> <a name="boost.container.flat_map.reference"></a><span class="identifier">reference</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">Alloc</span><span class="special">::</span><span class="identifier">const_reference</span> <a name="boost.container.flat_map.const_reference"></a><span class="identifier">const_reference</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="emphasis"><em><span class="identifier">unspecified</span></em></span> <a name="boost.container.flat_map.value_compare"></a><span class="identifier">value_compare</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">Pred</span> <a name="boost.container.flat_map.key_compare"></a><span class="identifier">key_compare</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="emphasis"><em><span class="identifier">unspecified</span></em></span> <a name="boost.container.flat_map.iterator"></a><span class="identifier">iterator</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="emphasis"><em><span class="identifier">unspecified</span></em></span> <a name="boost.container.flat_map.const_iterator"></a><span class="identifier">const_iterator</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="emphasis"><em><span class="identifier">unspecified</span></em></span> <a name="boost.container.flat_map.reverse_iterator"></a><span class="identifier">reverse_iterator</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="emphasis"><em><span class="identifier">unspecified</span></em></span> <a name="boost.container.flat_map.const_reverse_iterator"></a><span class="identifier">const_reverse_iterator</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">impl_tree_t</span><span class="special">::</span><span class="identifier">size_type</span> <a name="boost.container.flat_map.size_type"></a><span class="identifier">size_type</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">impl_tree_t</span><span class="special">::</span><span class="identifier">difference_type</span> <a name="boost.container.flat_map.difference_type"></a><span class="identifier">difference_type</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">Alloc</span> <a name="boost.container.flat_map.allocator_type"></a><span class="identifier">allocator_type</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">Alloc</span> <a name="boost.container.flat_map.stored_allocator_type"></a><span class="identifier">stored_allocator_type</span><span class="special">;</span>
 
- <span class="emphasis"><em>// construct/copy/destruct</em></span>
- flat_map(<span class="bold"><strong>const</strong></span> Pred &amp; = Pred(), <span class="bold"><strong>const</strong></span> allocator_type &amp; = allocator_type());
- <span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>typename</strong></span> InputIterator&gt;
- flat_map(InputIterator, InputIterator, <span class="bold"><strong>const</strong></span> Pred &amp; = Pred(),
- <span class="bold"><strong>const</strong></span> allocator_type &amp; = allocator_type());
- <span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>typename</strong></span> InputIterator&gt;
- flat_map(ordered_unique_range_t, InputIterator, InputIterator,
- <span class="bold"><strong>const</strong></span> Pred &amp; = Pred(),
- <span class="bold"><strong>const</strong></span> allocator_type &amp; = allocator_type());
- flat_map(<span class="bold"><strong>const</strong></span> flat_map&lt; Key, T, Pred, Alloc &gt; &amp;);
- flat_map(flat_map &amp;&amp;);
- flat_map&amp; operator=(<span class="bold"><strong>const</strong></span> flat_map &amp;);
- flat_map&amp; operator=(flat_map &amp;&amp;);
+ <span class="comment">// construct/copy/destruct</span>
+ flat_map<span class="special">(</span><span class="keyword">const</span> <span class="identifier">Pred</span> <span class="special">&amp;</span> <span class="special">=</span> <span class="identifier">Pred</span><span class="special">(</span><span class="special">)</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">allocator_type</span> <span class="special">&amp;</span> <span class="special">=</span> <span class="identifier">allocator_type</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span>
+ <span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> InputIterator<span class="special">&gt;</span>
+ flat_map<span class="special">(</span><span class="identifier">InputIterator</span><span class="special">,</span> <span class="identifier">InputIterator</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Pred</span> <span class="special">&amp;</span> <span class="special">=</span> <span class="identifier">Pred</span><span class="special">(</span><span class="special">)</span><span class="special">,</span>
+ <span class="keyword">const</span> <span class="identifier">allocator_type</span> <span class="special">&amp;</span> <span class="special">=</span> <span class="identifier">allocator_type</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span>
+ <span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> InputIterator<span class="special">&gt;</span>
+ flat_map<span class="special">(</span><span class="identifier">ordered_unique_range_t</span><span class="special">,</span> <span class="identifier">InputIterator</span><span class="special">,</span> <span class="identifier">InputIterator</span><span class="special">,</span>
+ <span class="keyword">const</span> <span class="identifier">Pred</span> <span class="special">&amp;</span> <span class="special">=</span> <span class="identifier">Pred</span><span class="special">(</span><span class="special">)</span><span class="special">,</span>
+ <span class="keyword">const</span> <span class="identifier">allocator_type</span> <span class="special">&amp;</span> <span class="special">=</span> <span class="identifier">allocator_type</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span>
+ flat_map<span class="special">(</span><span class="keyword">const</span> flat_map<span class="special">&lt;</span> <span class="identifier">Key</span><span class="special">,</span> <span class="identifier">T</span><span class="special">,</span> <span class="identifier">Pred</span><span class="special">,</span> <span class="identifier">Alloc</span> <span class="special">&gt;</span> <span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
+ flat_map<span class="special">(</span>flat_map <span class="special">&amp;&amp;</span><span class="special">)</span><span class="special">;</span>
+ flat_map&amp; operator=<span class="special">(</span><span class="keyword">const</span> flat_map <span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
+ flat_map&amp; operator=<span class="special">(</span>flat_map <span class="special">&amp;&amp;</span><span class="special">)</span><span class="special">;</span>
 
- <span class="emphasis"><em>// public member functions</em></span>
- <span class="type">key_compare</span> key_comp() <span class="bold"><strong>const</strong></span>;
- <span class="type">value_compare</span> value_comp() <span class="bold"><strong>const</strong></span>;
- <span class="type">allocator_type</span> get_allocator() <span class="bold"><strong>const</strong></span>;
- <span class="type"><span class="bold"><strong>const</strong></span> stored_allocator_type &amp;</span> get_stored_allocator() <span class="bold"><strong>const</strong></span>;
- <span class="type">stored_allocator_type &amp;</span> get_stored_allocator() ;
- <span class="type">iterator</span> begin() ;
- <span class="type">const_iterator</span> begin() <span class="bold"><strong>const</strong></span>;
- <span class="type">const_iterator</span> cbegin() <span class="bold"><strong>const</strong></span>;
- <span class="type">iterator</span> end() ;
- <span class="type">const_iterator</span> end() <span class="bold"><strong>const</strong></span>;
- <span class="type">const_iterator</span> cend() <span class="bold"><strong>const</strong></span>;
- <span class="type">reverse_iterator</span> rbegin() ;
- <span class="type">const_reverse_iterator</span> rbegin() <span class="bold"><strong>const</strong></span>;
- <span class="type">const_reverse_iterator</span> crbegin() <span class="bold"><strong>const</strong></span>;
- <span class="type">reverse_iterator</span> rend() ;
- <span class="type">const_reverse_iterator</span> rend() <span class="bold"><strong>const</strong></span>;
- <span class="type">const_reverse_iterator</span> crend() <span class="bold"><strong>const</strong></span>;
- <span class="type"><span class="bold"><strong>bool</strong></span></span> empty() <span class="bold"><strong>const</strong></span>;
- <span class="type">size_type</span> size() <span class="bold"><strong>const</strong></span>;
- <span class="type">size_type</span> max_size() <span class="bold"><strong>const</strong></span>;
- <span class="type">T &amp;</span> operator[](<span class="bold"><strong>const</strong></span> key_type &amp;) ;
- <span class="type">T &amp;</span> operator[](key_type &amp;&amp;) ;
- <span class="type">T &amp;</span> at(<span class="bold"><strong>const</strong></span> key_type &amp;) ;
- <span class="type"><span class="bold"><strong>const</strong></span> T &amp;</span> at(<span class="bold"><strong>const</strong></span> key_type &amp;) <span class="bold"><strong>const</strong></span>;
- <span class="type"><span class="bold"><strong>void</strong></span></span> swap(flat_map &amp;) ;
- <span class="type">std::pair&lt; iterator, <span class="bold"><strong>bool</strong></span> &gt;</span> insert(<span class="bold"><strong>const</strong></span> value_type &amp;) ;
- <span class="type">std::pair&lt; iterator, <span class="bold"><strong>bool</strong></span> &gt;</span> insert(value_type &amp;&amp;) ;
- <span class="type">std::pair&lt; iterator, <span class="bold"><strong>bool</strong></span> &gt;</span> insert(impl_value_type &amp;&amp;) ;
- <span class="type">iterator</span> insert(const_iterator, <span class="bold"><strong>const</strong></span> value_type &amp;) ;
- <span class="type">iterator</span> insert(const_iterator, value_type &amp;&amp;) ;
- <span class="type">iterator</span> insert(const_iterator, impl_value_type &amp;&amp;) ;
- <span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>typename</strong></span> InputIterator&gt; <span class="type"><span class="bold"><strong>void</strong></span></span> insert(InputIterator, InputIterator) ;
- <span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>class</strong></span>... Args&gt; <span class="type">iterator</span> emplace(Args &amp;&amp;...) ;
- <span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>class</strong></span>... Args&gt; <span class="type">iterator</span> emplace_hint(const_iterator, Args &amp;&amp;...) ;
- <span class="type">iterator</span> erase(const_iterator) ;
- <span class="type">size_type</span> erase(<span class="bold"><strong>const</strong></span> key_type &amp;) ;
- <span class="type">iterator</span> erase(const_iterator, const_iterator) ;
- <span class="type"><span class="bold"><strong>void</strong></span></span> clear() ;
- <span class="type"><span class="bold"><strong>void</strong></span></span> shrink_to_fit() ;
- <span class="type">iterator</span> find(<span class="bold"><strong>const</strong></span> key_type &amp;) ;
- <span class="type">const_iterator</span> find(<span class="bold"><strong>const</strong></span> key_type &amp;) <span class="bold"><strong>const</strong></span>;
- <span class="type">size_type</span> count(<span class="bold"><strong>const</strong></span> key_type &amp;) <span class="bold"><strong>const</strong></span>;
- <span class="type">iterator</span> lower_bound(<span class="bold"><strong>const</strong></span> key_type &amp;) ;
- <span class="type">const_iterator</span> lower_bound(<span class="bold"><strong>const</strong></span> key_type &amp;) <span class="bold"><strong>const</strong></span>;
- <span class="type">iterator</span> upper_bound(<span class="bold"><strong>const</strong></span> key_type &amp;) ;
- <span class="type">const_iterator</span> upper_bound(<span class="bold"><strong>const</strong></span> key_type &amp;) <span class="bold"><strong>const</strong></span>;
- <span class="type">std::pair&lt; iterator, iterator &gt;</span> equal_range(<span class="bold"><strong>const</strong></span> key_type &amp;) ;
- <span class="type">std::pair&lt; const_iterator, const_iterator &gt;</span>
- equal_range(<span class="bold"><strong>const</strong></span> key_type &amp;) <span class="bold"><strong>const</strong></span>;
- <span class="type">size_type</span> capacity() <span class="bold"><strong>const</strong></span>;
- <span class="type"><span class="bold"><strong>void</strong></span></span> reserve(size_type) ;
-};</pre></div>
+ <span class="comment">// public member functions</span>
+ <span class="identifier">key_compare</span> key_comp<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">value_compare</span> value_comp<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">allocator_type</span> get_allocator<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="keyword">const</span> <span class="identifier">stored_allocator_type</span> <span class="special">&amp;</span> get_stored_allocator<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">stored_allocator_type</span> <span class="special">&amp;</span> get_stored_allocator<span class="special">(</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">iterator</span> begin<span class="special">(</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">const_iterator</span> begin<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">const_iterator</span> cbegin<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">iterator</span> end<span class="special">(</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">const_iterator</span> end<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">const_iterator</span> cend<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">reverse_iterator</span> rbegin<span class="special">(</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">const_reverse_iterator</span> rbegin<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">const_reverse_iterator</span> crbegin<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">reverse_iterator</span> rend<span class="special">(</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">const_reverse_iterator</span> rend<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">const_reverse_iterator</span> crend<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="keyword">bool</span> empty<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">size_type</span> size<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">size_type</span> max_size<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">T</span> <span class="special">&amp;</span> operator[]<span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">T</span> <span class="special">&amp;</span> operator[]<span class="special">(</span><span class="identifier">key_type</span> <span class="special">&amp;&amp;</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">T</span> <span class="special">&amp;</span> at<span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
+ <span class="keyword">const</span> <span class="identifier">T</span> <span class="special">&amp;</span> at<span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="keyword">void</span> swap<span class="special">(</span>flat_map <span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span> <span class="identifier">iterator</span><span class="special">,</span> <span class="keyword">bool</span> <span class="special">&gt;</span> insert<span class="special">(</span><span class="keyword">const</span> <span class="identifier">value_type</span> <span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span> <span class="identifier">iterator</span><span class="special">,</span> <span class="keyword">bool</span> <span class="special">&gt;</span> insert<span class="special">(</span><span class="identifier">value_type</span> <span class="special">&amp;&amp;</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span> <span class="identifier">iterator</span><span class="special">,</span> <span class="keyword">bool</span> <span class="special">&gt;</span> insert<span class="special">(</span><span class="identifier">impl_value_type</span> <span class="special">&amp;&amp;</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">iterator</span> insert<span class="special">(</span><span class="identifier">const_iterator</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">value_type</span> <span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">iterator</span> insert<span class="special">(</span><span class="identifier">const_iterator</span><span class="special">,</span> <span class="identifier">value_type</span> <span class="special">&amp;&amp;</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">iterator</span> insert<span class="special">(</span><span class="identifier">const_iterator</span><span class="special">,</span> <span class="identifier">impl_value_type</span> <span class="special">&amp;&amp;</span><span class="special">)</span><span class="special">;</span>
+ <span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> InputIterator<span class="special">&gt;</span> <span class="keyword">void</span> insert<span class="special">(</span><span class="identifier">InputIterator</span><span class="special">,</span> <span class="identifier">InputIterator</span><span class="special">)</span><span class="special">;</span>
+ <span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span><span class="special">...</span> Args<span class="special">&gt;</span> <span class="identifier">iterator</span> emplace<span class="special">(</span><span class="identifier">Args</span> <span class="special">&amp;&amp;</span><span class="special">...</span><span class="special">)</span><span class="special">;</span>
+ <span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span><span class="special">...</span> Args<span class="special">&gt;</span> <span class="identifier">iterator</span> emplace_hint<span class="special">(</span><span class="identifier">const_iterator</span><span class="special">,</span> <span class="identifier">Args</span> <span class="special">&amp;&amp;</span><span class="special">...</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">iterator</span> erase<span class="special">(</span><span class="identifier">const_iterator</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">size_type</span> erase<span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">iterator</span> erase<span class="special">(</span><span class="identifier">const_iterator</span><span class="special">,</span> <span class="identifier">const_iterator</span><span class="special">)</span><span class="special">;</span>
+ <span class="keyword">void</span> clear<span class="special">(</span><span class="special">)</span><span class="special">;</span>
+ <span class="keyword">void</span> shrink_to_fit<span class="special">(</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">iterator</span> find<span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">const_iterator</span> find<span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">size_type</span> count<span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">iterator</span> lower_bound<span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">const_iterator</span> lower_bound<span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">iterator</span> upper_bound<span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">const_iterator</span> upper_bound<span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span> <span class="identifier">iterator</span><span class="special">,</span> <span class="identifier">iterator</span> <span class="special">&gt;</span> equal_range<span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span> <span class="identifier">const_iterator</span><span class="special">,</span> <span class="identifier">const_iterator</span> <span class="special">&gt;</span>
+ equal_range<span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">size_type</span> capacity<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="keyword">void</span> reserve<span class="special">(</span><span class="identifier">size_type</span><span class="special">)</span><span class="special">;</span>
+<span class="special">}</span><span class="special">;</span></pre></div>
 <div class="refsect1" lang="en">
-<a name="id476024"></a><h2>Description</h2>
+<a name="id753002"></a><h2>Description</h2>
 <p>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.</p>
 <p>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&lt;Key,T&gt; the key_type is Key and the value_type is std::pair&lt;Key,T&gt; (unlike std::map&lt;Key, T&gt; which value_type is std::pair&lt;<span class="bold"><strong>const</strong></span> Key, T&gt;).</p>
-<p>Pred is the ordering function for Keys (e.g. std::less&lt;Key&gt;).</p>
-<p>Alloc is the allocator to allocate the value_types (e.g. allocator&lt; std::pair&lt;Key, T&gt; &gt;).</p>
+<p>Pred is the ordering function for Keys (e.g. <span class="emphasis"><em>std::less&lt;Key&gt;</em></span>).</p>
+<p>Alloc is the allocator to allocate the value_types (e.g. <span class="emphasis"><em>allocator&lt; std::pair&lt;Key, T&gt; &gt;</em></span>).</p>
 <p>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</p>
 <p>Erasing an element of a flat_map invalidates iterators and references pointing to elements that come after (their keys are bigger) the erased element. </p>
 <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(<span class="bold"><strong>const</strong></span> Pred &amp; comp = Pred(),
- <span class="bold"><strong>const</strong></span> allocator_type &amp; a = allocator_type());</pre>
+<pre class="literallayout"><a name="id376452-bb"></a><span class="identifier">flat_map</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">Pred</span> <span class="special">&amp;</span> comp <span class="special">=</span> <span class="identifier">Pred</span><span class="special">(</span><span class="special">)</span><span class="special">,</span>
+ <span class="keyword">const</span> <span class="identifier">allocator_type</span> <span class="special">&amp;</span> a <span class="special">=</span> <span class="identifier">allocator_type</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Constructs an empty flat_map using the specified comparison object and allocator.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>typename</strong></span> InputIterator&gt;
- <a name="id296156-bb"></a>flat_map(InputIterator first, InputIterator last,
- <span class="bold"><strong>const</strong></span> Pred &amp; comp = Pred(),
- <span class="bold"><strong>const</strong></span> allocator_type &amp; a = allocator_type());</pre>
+<pre class="literallayout"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> InputIterator<span class="special">&gt;</span>
+ <a name="id376480-bb"></a><span class="identifier">flat_map</span><span class="special">(</span><span class="identifier">InputIterator</span> first<span class="special">,</span> <span class="identifier">InputIterator</span> last<span class="special">,</span>
+ <span class="keyword">const</span> <span class="identifier">Pred</span> <span class="special">&amp;</span> comp <span class="special">=</span> <span class="identifier">Pred</span><span class="special">(</span><span class="special">)</span><span class="special">,</span>
+ <span class="keyword">const</span> <span class="identifier">allocator_type</span> <span class="special">&amp;</span> a <span class="special">=</span> <span class="identifier">allocator_type</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Constructs an empty flat_map using the specified comparison object and allocator, and inserts elements from the range [first ,last ).</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Linear in N if the range [first ,last ) is already sorted using comp and otherwise N logN, where N is last - first. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>typename</strong></span> InputIterator&gt;
- <a name="id296200-bb"></a>flat_map(ordered_unique_range_t, InputIterator first, InputIterator last,
- <span class="bold"><strong>const</strong></span> Pred &amp; comp = Pred(),
- <span class="bold"><strong>const</strong></span> allocator_type &amp; a = allocator_type());</pre>
+<pre class="literallayout"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> InputIterator<span class="special">&gt;</span>
+ <a name="id376525-bb"></a><span class="identifier">flat_map</span><span class="special">(</span><span class="identifier">ordered_unique_range_t</span><span class="special">,</span> <span class="identifier">InputIterator</span> first<span class="special">,</span> <span class="identifier">InputIterator</span> last<span class="special">,</span>
+ <span class="keyword">const</span> <span class="identifier">Pred</span> <span class="special">&amp;</span> comp <span class="special">=</span> <span class="identifier">Pred</span><span class="special">(</span><span class="special">)</span><span class="special">,</span>
+ <span class="keyword">const</span> <span class="identifier">allocator_type</span> <span class="special">&amp;</span> a <span class="special">=</span> <span class="identifier">allocator_type</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: 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.</p>
 <p><span class="bold"><strong>Requires</strong></span>: [first ,last) must be ordered according to the predicate and must be unique values.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Linear in N. </p>
 </li>
 <li>
-<pre class="literallayout"><a name="id296255-bb"></a>flat_map(<span class="bold"><strong>const</strong></span> flat_map&lt; Key, T, Pred, Alloc &gt; &amp; x);</pre>
+<pre class="literallayout"><a name="id376580-bb"></a><span class="identifier">flat_map</span><span class="special">(</span><span class="keyword">const</span> flat_map<span class="special">&lt;</span> <span class="identifier">Key</span><span class="special">,</span> <span class="identifier">T</span><span class="special">,</span> <span class="identifier">Pred</span><span class="special">,</span> <span class="identifier">Alloc</span> <span class="special">&gt;</span> <span class="special">&amp;</span> x<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Copy constructs a flat_map.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Linear in x.size(). </p>
 </li>
 <li>
-<pre class="literallayout"><a name="id296278-bb"></a>flat_map(flat_map &amp;&amp; x);</pre>
+<pre class="literallayout"><a name="id376603-bb"></a><span class="identifier">flat_map</span><span class="special">(</span>flat_map <span class="special">&amp;&amp;</span> x<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Move constructs a flat_map. Constructs *this using x's resources.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Construct.</p>
 <p><span class="bold"><strong>Postcondition</strong></span>: x is emptied. </p>
 </li>
 <li>
-<pre class="literallayout">flat_map&amp; <a name="id296306-bb"></a><span class="bold"><strong>operator</strong></span>=(<span class="bold"><strong>const</strong></span> flat_map &amp; x);</pre>
+<pre class="literallayout">flat_map&amp; <a name="id376630-bb"></a><span class="keyword">operator</span><span class="special">=</span><span class="special">(</span><span class="keyword">const</span> flat_map <span class="special">&amp;</span> x<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Makes *this a copy of x.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Linear in x.size(). </p>
 </li>
 <li>
-<pre class="literallayout">flat_map&amp; <a name="id296328-bb"></a><span class="bold"><strong>operator</strong></span>=(flat_map &amp;&amp; mx);</pre>
+<pre class="literallayout">flat_map&amp; <a name="id376653-bb"></a><span class="keyword">operator</span><span class="special">=</span><span class="special">(</span>flat_map <span class="special">&amp;&amp;</span> mx<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Move constructs a flat_map. Constructs *this using x's resources.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Construct.</p>
 <p><span class="bold"><strong>Postcondition</strong></span>: x is emptied. </p>
@@ -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"><span class="type">key_compare</span> <a name="id294767-bb"></a>key_comp() <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">key_compare</span> <a name="id373448-bb"></a><span class="identifier">key_comp</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns the comparison object out of which a was constructed.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">value_compare</span> <a name="id294788-bb"></a>value_comp() <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">value_compare</span> <a name="id373468-bb"></a><span class="identifier">value_comp</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns an object of value_compare constructed out of the comparison object.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">allocator_type</span> <a name="id294807-bb"></a>get_allocator() <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">allocator_type</span> <a name="id373487-bb"></a><span class="identifier">get_allocator</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns a copy of the Allocator that was passed to the object's constructor.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
-<li><pre class="literallayout"><span class="type"><span class="bold"><strong>const</strong></span> stored_allocator_type &amp;</span> <a name="id294826-bb"></a>get_stored_allocator() <span class="bold"><strong>const</strong></span>;</pre></li>
-<li><pre class="literallayout"><span class="type">stored_allocator_type &amp;</span> <a name="id294832-bb"></a>get_stored_allocator() ;</pre></li>
+<li><pre class="literallayout"><span class="keyword">const</span> <span class="identifier">stored_allocator_type</span> <span class="special">&amp;</span> <a name="id373506-bb"></a><span class="identifier">get_stored_allocator</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre></li>
+<li><pre class="literallayout"><span class="identifier">stored_allocator_type</span> <span class="special">&amp;</span> <a name="id373512-bb"></a><span class="identifier">get_stored_allocator</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre></li>
 <li>
-<pre class="literallayout"><span class="type">iterator</span> <a name="id294838-bb"></a>begin() ;</pre>
+<pre class="literallayout"><span class="identifier">iterator</span> <a name="id373518-bb"></a><span class="identifier">begin</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns an iterator to the first element contained in the container.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">const_iterator</span> <a name="id294863-bb"></a>begin() <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">const_iterator</span> <a name="id373544-bb"></a><span class="identifier">begin</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns a const_iterator to the first element contained in the container.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">const_iterator</span> <a name="id294888-bb"></a>cbegin() <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">const_iterator</span> <a name="id373569-bb"></a><span class="identifier">cbegin</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns a const_iterator to the first element contained in the container.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">iterator</span> <a name="id294914-bb"></a>end() ;</pre>
+<pre class="literallayout"><span class="identifier">iterator</span> <a name="id373594-bb"></a><span class="identifier">end</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns an iterator to the end of the container.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">const_iterator</span> <a name="id294939-bb"></a>end() <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">const_iterator</span> <a name="id373619-bb"></a><span class="identifier">end</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns a const_iterator to the end of the container.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">const_iterator</span> <a name="id294964-bb"></a>cend() <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">const_iterator</span> <a name="id373644-bb"></a><span class="identifier">cend</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns a const_iterator to the end of the container.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">reverse_iterator</span> <a name="id294989-bb"></a>rbegin() ;</pre>
+<pre class="literallayout"><span class="identifier">reverse_iterator</span> <a name="id373670-bb"></a><span class="identifier">rbegin</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns a reverse_iterator pointing to the beginning of the reversed container.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">const_reverse_iterator</span> <a name="id295014-bb"></a>rbegin() <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">const_reverse_iterator</span> <a name="id373695-bb"></a><span class="identifier">rbegin</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns a const_reverse_iterator pointing to the beginning of the reversed container.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">const_reverse_iterator</span> <a name="id295040-bb"></a>crbegin() <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">const_reverse_iterator</span> <a name="id373720-bb"></a><span class="identifier">crbegin</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns a const_reverse_iterator pointing to the beginning of the reversed container.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">reverse_iterator</span> <a name="id295065-bb"></a>rend() ;</pre>
+<pre class="literallayout"><span class="identifier">reverse_iterator</span> <a name="id373745-bb"></a><span class="identifier">rend</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns a reverse_iterator pointing to the end of the reversed container.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">const_reverse_iterator</span> <a name="id295090-bb"></a>rend() <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">const_reverse_iterator</span> <a name="id373770-bb"></a><span class="identifier">rend</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns a const_reverse_iterator pointing to the end of the reversed container.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">const_reverse_iterator</span> <a name="id295115-bb"></a>crend() <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">const_reverse_iterator</span> <a name="id373796-bb"></a><span class="identifier">crend</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns a const_reverse_iterator pointing to the end of the reversed container.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type"><span class="bold"><strong>bool</strong></span></span> <a name="id295140-bb"></a>empty() <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="keyword">bool</span> <a name="id373821-bb"></a><span class="identifier">empty</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns true if the container contains no elements.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">size_type</span> <a name="id295166-bb"></a>size() <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">size_type</span> <a name="id373846-bb"></a><span class="identifier">size</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns the number of the elements contained in the container.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">size_type</span> <a name="id295191-bb"></a>max_size() <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">size_type</span> <a name="id373871-bb"></a><span class="identifier">max_size</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns the largest possible size of the container.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">T &amp;</span> <a name="id295216-bb"></a><span class="bold"><strong>operator</strong></span>[](<span class="bold"><strong>const</strong></span> key_type &amp; k) ;</pre>
+<pre class="literallayout"><span class="identifier">T</span> <span class="special">&amp;</span> <a name="id373896-bb"></a><span class="keyword">operator</span><span class="special">[</span><span class="special">]</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span> k<span class="special">)</span><span class="special">;</span></pre>
 <p>Effects: If there is no key equivalent to x in the flat_map, inserts value_type(x, T()) into the flat_map.</p>
 <p>Returns: A reference to the mapped_type corresponding to x in *this.</p>
 <p>Complexity: Logarithmic. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">T &amp;</span> <a name="id295235-bb"></a><span class="bold"><strong>operator</strong></span>[](key_type &amp;&amp; mk) ;</pre>
+<pre class="literallayout"><span class="identifier">T</span> <span class="special">&amp;</span> <a name="id373916-bb"></a><span class="keyword">operator</span><span class="special">[</span><span class="special">]</span><span class="special">(</span><span class="identifier">key_type</span> <span class="special">&amp;&amp;</span> mk<span class="special">)</span><span class="special">;</span></pre>
 <p>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)</p>
 <p>Returns: A reference to the mapped_type corresponding to x in *this.</p>
 <p>Complexity: Logarithmic. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">T &amp;</span> <a name="id295254-bb"></a>at(<span class="bold"><strong>const</strong></span> key_type &amp; k) ;</pre>
+<pre class="literallayout"><span class="identifier">T</span> <span class="special">&amp;</span> <a name="id373935-bb"></a><span class="identifier">at</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span> k<span class="special">)</span><span class="special">;</span></pre>
 <p>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. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type"><span class="bold"><strong>const</strong></span> T &amp;</span> <a name="id295269-bb"></a>at(<span class="bold"><strong>const</strong></span> key_type &amp; k) <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="keyword">const</span> <span class="identifier">T</span> <span class="special">&amp;</span> <a name="id373949-bb"></a><span class="identifier">at</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span> k<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p>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. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type"><span class="bold"><strong>void</strong></span></span> <a name="id295283-bb"></a>swap(flat_map &amp; x) ;</pre>
+<pre class="literallayout"><span class="keyword">void</span> <a name="id373964-bb"></a><span class="identifier">swap</span><span class="special">(</span>flat_map <span class="special">&amp;</span> x<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Swaps the contents of *this and x. If this-&gt;allocator_type() != x.allocator_type() allocators are also swapped.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">std::pair&lt; iterator, <span class="bold"><strong>bool</strong></span> &gt;</span> <a name="id295316-bb"></a>insert(<span class="bold"><strong>const</strong></span> value_type &amp; x) ;</pre>
+<pre class="literallayout"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span> <span class="identifier">iterator</span><span class="special">,</span> <span class="keyword">bool</span> <span class="special">&gt;</span> <a name="id373996-bb"></a><span class="identifier">insert</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">value_type</span> <span class="special">&amp;</span> x<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Inserts x if and only if there is no element in the container with key equivalent to the key of x.</p>
 <p><span class="bold"><strong>Returns</strong></span>: 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.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic search time plus linear insertion to the elements with bigger keys than x.</p>
 <p><span class="bold"><strong>Note</strong></span>: If an element it's inserted it might invalidate elements. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">std::pair&lt; iterator, <span class="bold"><strong>bool</strong></span> &gt;</span> <a name="id295353-bb"></a>insert(value_type &amp;&amp; x) ;</pre>
+<pre class="literallayout"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span> <span class="identifier">iterator</span><span class="special">,</span> <span class="keyword">bool</span> <span class="special">&gt;</span> <a name="id374033-bb"></a><span class="identifier">insert</span><span class="special">(</span><span class="identifier">value_type</span> <span class="special">&amp;&amp;</span> x<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: 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.</p>
 <p><span class="bold"><strong>Returns</strong></span>: 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.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic search time plus linear insertion to the elements with bigger keys than x.</p>
 <p><span class="bold"><strong>Note</strong></span>: If an element it's inserted it might invalidate elements. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">std::pair&lt; iterator, <span class="bold"><strong>bool</strong></span> &gt;</span> <a name="id295390-bb"></a>insert(impl_value_type &amp;&amp; x) ;</pre>
+<pre class="literallayout"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span> <span class="identifier">iterator</span><span class="special">,</span> <span class="keyword">bool</span> <span class="special">&gt;</span> <a name="id374070-bb"></a><span class="identifier">insert</span><span class="special">(</span><span class="identifier">impl_value_type</span> <span class="special">&amp;&amp;</span> x<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: 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.</p>
 <p><span class="bold"><strong>Returns</strong></span>: 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.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic search time plus linear insertion to the elements with bigger keys than x.</p>
 <p><span class="bold"><strong>Note</strong></span>: If an element it's inserted it might invalidate elements. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">iterator</span> <a name="id295427-bb"></a>insert(const_iterator position, <span class="bold"><strong>const</strong></span> value_type &amp; x) ;</pre>
+<pre class="literallayout"><span class="identifier">iterator</span> <a name="id374108-bb"></a><span class="identifier">insert</span><span class="special">(</span><span class="identifier">const_iterator</span> position<span class="special">,</span> <span class="keyword">const</span> <span class="identifier">value_type</span> <span class="special">&amp;</span> x<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: 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.</p>
 <p><span class="bold"><strong>Returns</strong></span>: An iterator pointing to the element with key equivalent to the key of x.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic search time (constant if x is inserted right before p) plus insertion linear to the elements with bigger keys than x.</p>
 <p><span class="bold"><strong>Note</strong></span>: If an element it's inserted it might invalidate elements. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">iterator</span> <a name="id295469-bb"></a>insert(const_iterator position, value_type &amp;&amp; x) ;</pre>
+<pre class="literallayout"><span class="identifier">iterator</span> <a name="id374150-bb"></a><span class="identifier">insert</span><span class="special">(</span><span class="identifier">const_iterator</span> position<span class="special">,</span> <span class="identifier">value_type</span> <span class="special">&amp;&amp;</span> x<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Inserts an element move constructed from x in the container. p is a hint pointing to where the insert should start to search.</p>
 <p><span class="bold"><strong>Returns</strong></span>: An iterator pointing to the element with key equivalent to the key of x.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic search time (constant if x is inserted right before p) plus insertion linear to the elements with bigger keys than x.</p>
 <p><span class="bold"><strong>Note</strong></span>: If an element it's inserted it might invalidate elements. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">iterator</span> <a name="id295511-bb"></a>insert(const_iterator position, impl_value_type &amp;&amp; x) ;</pre>
+<pre class="literallayout"><span class="identifier">iterator</span> <a name="id375836-bb"></a><span class="identifier">insert</span><span class="special">(</span><span class="identifier">const_iterator</span> position<span class="special">,</span> <span class="identifier">impl_value_type</span> <span class="special">&amp;&amp;</span> x<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Inserts an element move constructed from x in the container. p is a hint pointing to where the insert should start to search.</p>
 <p><span class="bold"><strong>Returns</strong></span>: An iterator pointing to the element with key equivalent to the key of x.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic search time (constant if x is inserted right before p) plus insertion linear to the elements with bigger keys than x.</p>
 <p><span class="bold"><strong>Note</strong></span>: If an element it's inserted it might invalidate elements. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>typename</strong></span> InputIterator&gt;
- <span class="type"><span class="bold"><strong>void</strong></span></span> <a name="id295553-bb"></a>insert(InputIterator first, InputIterator last) ;</pre>
+<pre class="literallayout"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> InputIterator<span class="special">&gt;</span>
+ <span class="keyword">void</span> <a name="id375878-bb"></a><span class="identifier">insert</span><span class="special">(</span><span class="identifier">InputIterator</span> first<span class="special">,</span> <span class="identifier">InputIterator</span> last<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Requires</strong></span>: i, j are not iterators into *this.</p>
 <p><span class="bold"><strong>Effects</strong></span>: 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.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: N log(size()+N) (N is the distance from i to j) search time plus N*size() insertion time.</p>
 <p><span class="bold"><strong>Note</strong></span>: If an element it's inserted it might invalidate elements. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>class</strong></span>... Args&gt; <span class="type">iterator</span> <a name="id295601-bb"></a>emplace(Args &amp;&amp;... args) ;</pre>
+<pre class="literallayout"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span><span class="special">...</span> Args<span class="special">&gt;</span> <span class="identifier">iterator</span> <a name="id375926-bb"></a><span class="identifier">emplace</span><span class="special">(</span><span class="identifier">Args</span> <span class="special">&amp;&amp;</span><span class="special">...</span> args<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Inserts an object of type T constructed with std::forward&lt;Args&gt;(args)... if and only if there is no element in the container with key equivalent to the key of x.</p>
 <p><span class="bold"><strong>Returns</strong></span>: 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.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic search time plus linear insertion to the elements with bigger keys than x.</p>
 <p><span class="bold"><strong>Note</strong></span>: If an element it's inserted it might invalidate elements. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>class</strong></span>... Args&gt;
- <span class="type">iterator</span> <a name="id295647-bb"></a>emplace_hint(const_iterator hint, Args &amp;&amp;... args) ;</pre>
+<pre class="literallayout"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span><span class="special">...</span> Args<span class="special">&gt;</span>
+ <span class="identifier">iterator</span> <a name="id375972-bb"></a><span class="identifier">emplace_hint</span><span class="special">(</span><span class="identifier">const_iterator</span> hint<span class="special">,</span> <span class="identifier">Args</span> <span class="special">&amp;&amp;</span><span class="special">...</span> args<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Inserts an object of type T constructed with std::forward&lt;Args&gt;(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.</p>
 <p><span class="bold"><strong>Returns</strong></span>: An iterator pointing to the element with key equivalent to the key of x.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic search time (constant if x is inserted right before p) plus insertion linear to the elements with bigger keys than x.</p>
 <p><span class="bold"><strong>Note</strong></span>: If an element it's inserted it might invalidate elements. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">iterator</span> <a name="id295697-bb"></a>erase(const_iterator position) ;</pre>
+<pre class="literallayout"><span class="identifier">iterator</span> <a name="id376022-bb"></a><span class="identifier">erase</span><span class="special">(</span><span class="identifier">const_iterator</span> position<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Erases the element pointed to by position.</p>
 <p><span class="bold"><strong>Returns</strong></span>: Returns an iterator pointing to the element immediately following q prior to the element being erased. If no such element exists, returns end().</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Linear to the elements with keys bigger than position</p>
 <p><span class="bold"><strong>Note</strong></span>: Invalidates elements with keys not less than the erased element. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">size_type</span> <a name="id295733-bb"></a>erase(<span class="bold"><strong>const</strong></span> key_type &amp; x) ;</pre>
+<pre class="literallayout"><span class="identifier">size_type</span> <a name="id376058-bb"></a><span class="identifier">erase</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span> x<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Erases all elements in the container with key equivalent to x.</p>
 <p><span class="bold"><strong>Returns</strong></span>: Returns the number of erased elements.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic search time plus erasure time linear to the elements with bigger keys. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">iterator</span> <a name="id295763-bb"></a>erase(const_iterator first, const_iterator last) ;</pre>
+<pre class="literallayout"><span class="identifier">iterator</span> <a name="id376088-bb"></a><span class="identifier">erase</span><span class="special">(</span><span class="identifier">const_iterator</span> first<span class="special">,</span> <span class="identifier">const_iterator</span> last<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Erases all the elements in the range [first, last).</p>
 <p><span class="bold"><strong>Returns</strong></span>: Returns last.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: size()*N where N is the distance from first to last.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic search time plus erasure time linear to the elements with bigger keys. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type"><span class="bold"><strong>void</strong></span></span> <a name="id295804-bb"></a>clear() ;</pre>
+<pre class="literallayout"><span class="keyword">void</span> <a name="id376129-bb"></a><span class="identifier">clear</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: erase(a.begin(),a.end()).</p>
 <p><span class="bold"><strong>Postcondition</strong></span>: size() == 0.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: linear in size(). </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type"><span class="bold"><strong>void</strong></span></span> <a name="id295829-bb"></a>shrink_to_fit() ;</pre>
+<pre class="literallayout"><span class="keyword">void</span> <a name="id376154-bb"></a><span class="identifier">shrink_to_fit</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre>
 <span class="bold"><strong>Effects</strong></span>: Tries to deallocate the excess of memory created <p><span class="bold"><strong>Throws</strong></span>: If memory allocation throws, or T's copy constructor throws.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Linear to size(). </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">iterator</span> <a name="id295856-bb"></a>find(<span class="bold"><strong>const</strong></span> key_type &amp; x) ;</pre>
+<pre class="literallayout"><span class="identifier">iterator</span> <a name="id376180-bb"></a><span class="identifier">find</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span> x<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Returns</strong></span>: An iterator pointing to an element with the key equivalent to x, or end() if such an element is not found.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">const_iterator</span> <a name="id295880-bb"></a>find(<span class="bold"><strong>const</strong></span> key_type &amp; x) <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">const_iterator</span> <a name="id376204-bb"></a><span class="identifier">find</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span> x<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Returns</strong></span>: A const_iterator pointing to an element with the key equivalent to x, or end() if such an element is not found.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic.s </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">size_type</span> <a name="id295904-bb"></a>count(<span class="bold"><strong>const</strong></span> key_type &amp; x) <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">size_type</span> <a name="id376228-bb"></a><span class="identifier">count</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span> x<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Returns</strong></span>: The number of elements with key equivalent to x.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: log(size())+count(k) </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">iterator</span> <a name="id295928-bb"></a>lower_bound(<span class="bold"><strong>const</strong></span> key_type &amp; x) ;</pre>
+<pre class="literallayout"><span class="identifier">iterator</span> <a name="id376252-bb"></a><span class="identifier">lower_bound</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span> x<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Returns</strong></span>: An iterator pointing to the first element with key not less than k, or a.end() if such an element is not found.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">const_iterator</span> <a name="id295952-bb"></a>lower_bound(<span class="bold"><strong>const</strong></span> key_type &amp; x) <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">const_iterator</span> <a name="id376276-bb"></a><span class="identifier">lower_bound</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span> x<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Returns</strong></span>: A const iterator pointing to the first element with key not less than k, or a.end() if such an element is not found.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">iterator</span> <a name="id295976-bb"></a>upper_bound(<span class="bold"><strong>const</strong></span> key_type &amp; x) ;</pre>
+<pre class="literallayout"><span class="identifier">iterator</span> <a name="id376300-bb"></a><span class="identifier">upper_bound</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span> x<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Returns</strong></span>: An iterator pointing to the first element with key not less than x, or end() if such an element is not found.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">const_iterator</span> <a name="id296000-bb"></a>upper_bound(<span class="bold"><strong>const</strong></span> key_type &amp; x) <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">const_iterator</span> <a name="id376324-bb"></a><span class="identifier">upper_bound</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span> x<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Returns</strong></span>: A const iterator pointing to the first element with key not less than x, or end() if such an element is not found.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">std::pair&lt; iterator, iterator &gt;</span> <a name="id296024-bb"></a>equal_range(<span class="bold"><strong>const</strong></span> key_type &amp; x) ;</pre>
+<pre class="literallayout"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span> <span class="identifier">iterator</span><span class="special">,</span> <span class="identifier">iterator</span> <span class="special">&gt;</span> <a name="id376348-bb"></a><span class="identifier">equal_range</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span> x<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Equivalent to std::make_pair(this-&gt;lower_bound(k), this-&gt;upper_bound(k)).</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">std::pair&lt; const_iterator, const_iterator &gt;</span>
-<a name="id296048-bb"></a>equal_range(<span class="bold"><strong>const</strong></span> key_type &amp; x) <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span> <span class="identifier">const_iterator</span><span class="special">,</span> <span class="identifier">const_iterator</span> <span class="special">&gt;</span>
+<a name="id376372-bb"></a><span class="identifier">equal_range</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span> x<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Equivalent to std::make_pair(this-&gt;lower_bound(k), this-&gt;upper_bound(k)).</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">size_type</span> <a name="id296072-bb"></a>capacity() <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">size_type</span> <a name="id376396-bb"></a><span class="identifier">capacity</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Number of elements for which memory has been allocated. capacity() is always greater than or equal to size().</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type"><span class="bold"><strong>void</strong></span></span> <a name="id296097-bb"></a>reserve(size_type count) ;</pre>
+<pre class="literallayout"><span class="keyword">void</span> <a name="id376422-bb"></a><span class="identifier">reserve</span><span class="special">(</span><span class="identifier">size_type</span> count<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: 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.</p>
 <p><span class="bold"><strong>Throws</strong></span>: If memory allocation allocation throws or T's copy constructor throws.</p>
 <p><span class="bold"><strong>Note</strong></span>: If capacity() is less than "count", iterators and references to to values might be invalidated. </p>
@@ -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<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2009 -2011 Ion Gaztanaga<p>
         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)
       </p>
@@ -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&#160;1.&#160;Boost.Container">
 <link rel="up" href="../../boost_container_reference.html#header.boost.container.flat_map_hpp" title="Header &lt;boost/container/flat_map.hpp&gt;">
 <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 @@
 <p>boost::container::flat_multimap &#8212; </p>
 </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"><span class="emphasis"><em>// In header: &lt;boost/container/flat_map.hpp&gt;
+<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis"><span class="comment">// In header: &lt;boost/container/flat_map.hpp&gt;
 
-</em></span><span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>typename</strong></span> Key, <span class="bold"><strong>typename</strong></span> T, <span class="bold"><strong>typename</strong></span> Pred, <span class="bold"><strong>typename</strong></span> Alloc&gt;
-<span class="bold"><strong>class</strong></span> flat_multimap {
-<span class="bold"><strong>public</strong></span>:
- <span class="emphasis"><em>// types</em></span>
- <span class="bold"><strong>typedef</strong></span> impl_tree_t::key_type <a name="boost.container.flat_multimap.key_type"></a>key_type;
- <span class="bold"><strong>typedef</strong></span> T <a name="boost.container.flat_multimap.mapped_type"></a>mapped_type;
- <span class="bold"><strong>typedef</strong></span> std::pair&lt; key_type, mapped_type &gt; <a name="boost.container.flat_multimap.value_type"></a>value_type;
- <span class="bold"><strong>typedef</strong></span> Alloc::pointer <a name="boost.container.flat_multimap.pointer"></a>pointer;
- <span class="bold"><strong>typedef</strong></span> Alloc::const_pointer <a name="boost.container.flat_multimap.const_pointer"></a>const_pointer;
- <span class="bold"><strong>typedef</strong></span> Alloc::reference <a name="boost.container.flat_multimap.reference"></a>reference;
- <span class="bold"><strong>typedef</strong></span> Alloc::const_reference <a name="boost.container.flat_multimap.const_reference"></a>const_reference;
- <span class="bold"><strong>typedef</strong></span> <span class="emphasis"><em>unspecified</em></span> <a name="boost.container.flat_multimap.value_compare"></a>value_compare;
- <span class="bold"><strong>typedef</strong></span> Pred <a name="boost.container.flat_multimap.key_compare"></a>key_compare;
- <span class="bold"><strong>typedef</strong></span> <span class="emphasis"><em>unspecified</em></span> <a name="boost.container.flat_multimap.iterator"></a>iterator;
- <span class="bold"><strong>typedef</strong></span> <span class="emphasis"><em>unspecified</em></span> <a name="boost.container.flat_multimap.const_iterator"></a>const_iterator;
- <span class="bold"><strong>typedef</strong></span> <span class="emphasis"><em>unspecified</em></span> <a name="boost.container.flat_multimap.reverse_iterator"></a>reverse_iterator;
- <span class="bold"><strong>typedef</strong></span> <span class="emphasis"><em>unspecified</em></span> <a name="boost.container.flat_multimap.const_reverse_iterator"></a>const_reverse_iterator;
- <span class="bold"><strong>typedef</strong></span> impl_tree_t::size_type <a name="boost.container.flat_multimap.size_type"></a>size_type;
- <span class="bold"><strong>typedef</strong></span> impl_tree_t::difference_type <a name="boost.container.flat_multimap.difference_type"></a>difference_type;
- <span class="bold"><strong>typedef</strong></span> Alloc <a name="boost.container.flat_multimap.allocator_type"></a>allocator_type;
- <span class="bold"><strong>typedef</strong></span> Alloc <a name="boost.container.flat_multimap.stored_allocator_type"></a>stored_allocator_type;
+</span><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> Key<span class="special">,</span> <span class="keyword">typename</span> T<span class="special">,</span> <span class="keyword">typename</span> Pred<span class="special">,</span> <span class="keyword">typename</span> Alloc<span class="special">&gt;</span>
+<span class="keyword">class</span> flat_multimap <span class="special">{</span>
+<span class="keyword">public</span><span class="special">:</span>
+ <span class="comment">// types</span>
+ <span class="keyword">typedef</span> <span class="identifier">impl_tree_t</span><span class="special">::</span><span class="identifier">key_type</span> <a name="boost.container.flat_multimap.key_type"></a><span class="identifier">key_type</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">T</span> <a name="boost.container.flat_multimap.mapped_type"></a><span class="identifier">mapped_type</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span> <span class="identifier">key_type</span><span class="special">,</span> <span class="identifier">mapped_type</span> <span class="special">&gt;</span> <a name="boost.container.flat_multimap.value_type"></a><span class="identifier">value_type</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">Alloc</span><span class="special">::</span><span class="identifier">pointer</span> <a name="boost.container.flat_multimap.pointer"></a><span class="identifier">pointer</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">Alloc</span><span class="special">::</span><span class="identifier">const_pointer</span> <a name="boost.container.flat_multimap.const_pointer"></a><span class="identifier">const_pointer</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">Alloc</span><span class="special">::</span><span class="identifier">reference</span> <a name="boost.container.flat_multimap.reference"></a><span class="identifier">reference</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">Alloc</span><span class="special">::</span><span class="identifier">const_reference</span> <a name="boost.container.flat_multimap.const_reference"></a><span class="identifier">const_reference</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="emphasis"><em><span class="identifier">unspecified</span></em></span> <a name="boost.container.flat_multimap.value_compare"></a><span class="identifier">value_compare</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">Pred</span> <a name="boost.container.flat_multimap.key_compare"></a><span class="identifier">key_compare</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="emphasis"><em><span class="identifier">unspecified</span></em></span> <a name="boost.container.flat_multimap.iterator"></a><span class="identifier">iterator</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="emphasis"><em><span class="identifier">unspecified</span></em></span> <a name="boost.container.flat_multimap.const_iterator"></a><span class="identifier">const_iterator</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="emphasis"><em><span class="identifier">unspecified</span></em></span> <a name="boost.container.flat_multimap.reverse_iterator"></a><span class="identifier">reverse_iterator</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="emphasis"><em><span class="identifier">unspecified</span></em></span> <a name="boost.container.flat_multimap.const_reverse_iterator"></a><span class="identifier">const_reverse_iterator</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">impl_tree_t</span><span class="special">::</span><span class="identifier">size_type</span> <a name="boost.container.flat_multimap.size_type"></a><span class="identifier">size_type</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">impl_tree_t</span><span class="special">::</span><span class="identifier">difference_type</span> <a name="boost.container.flat_multimap.difference_type"></a><span class="identifier">difference_type</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">Alloc</span> <a name="boost.container.flat_multimap.allocator_type"></a><span class="identifier">allocator_type</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">Alloc</span> <a name="boost.container.flat_multimap.stored_allocator_type"></a><span class="identifier">stored_allocator_type</span><span class="special">;</span>
 
- <span class="emphasis"><em>// construct/copy/destruct</em></span>
- flat_multimap(<span class="bold"><strong>const</strong></span> Pred &amp; = Pred(),
- <span class="bold"><strong>const</strong></span> allocator_type &amp; = allocator_type());
- <span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>typename</strong></span> InputIterator&gt;
- flat_multimap(InputIterator, InputIterator, <span class="bold"><strong>const</strong></span> Pred &amp; = Pred(),
- <span class="bold"><strong>const</strong></span> allocator_type &amp; = allocator_type());
- <span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>typename</strong></span> InputIterator&gt;
- flat_multimap(ordered_range_t, InputIterator, InputIterator,
- <span class="bold"><strong>const</strong></span> Pred &amp; = Pred(),
- <span class="bold"><strong>const</strong></span> allocator_type &amp; = allocator_type());
- flat_multimap(<span class="bold"><strong>const</strong></span> flat_multimap&lt; Key, T, Pred, Alloc &gt; &amp;);
- flat_multimap(flat_multimap &amp;&amp;);
- flat_multimap&amp; operator=(<span class="bold"><strong>const</strong></span> flat_multimap &amp;);
- flat_multimap&amp; operator=(flat_multimap &amp;&amp;);
+ <span class="comment">// construct/copy/destruct</span>
+ flat_multimap<span class="special">(</span><span class="keyword">const</span> <span class="identifier">Pred</span> <span class="special">&amp;</span> <span class="special">=</span> <span class="identifier">Pred</span><span class="special">(</span><span class="special">)</span><span class="special">,</span>
+ <span class="keyword">const</span> <span class="identifier">allocator_type</span> <span class="special">&amp;</span> <span class="special">=</span> <span class="identifier">allocator_type</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span>
+ <span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> InputIterator<span class="special">&gt;</span>
+ flat_multimap<span class="special">(</span><span class="identifier">InputIterator</span><span class="special">,</span> <span class="identifier">InputIterator</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Pred</span> <span class="special">&amp;</span> <span class="special">=</span> <span class="identifier">Pred</span><span class="special">(</span><span class="special">)</span><span class="special">,</span>
+ <span class="keyword">const</span> <span class="identifier">allocator_type</span> <span class="special">&amp;</span> <span class="special">=</span> <span class="identifier">allocator_type</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span>
+ <span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> InputIterator<span class="special">&gt;</span>
+ flat_multimap<span class="special">(</span><span class="identifier">ordered_range_t</span><span class="special">,</span> <span class="identifier">InputIterator</span><span class="special">,</span> <span class="identifier">InputIterator</span><span class="special">,</span>
+ <span class="keyword">const</span> <span class="identifier">Pred</span> <span class="special">&amp;</span> <span class="special">=</span> <span class="identifier">Pred</span><span class="special">(</span><span class="special">)</span><span class="special">,</span>
+ <span class="keyword">const</span> <span class="identifier">allocator_type</span> <span class="special">&amp;</span> <span class="special">=</span> <span class="identifier">allocator_type</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span>
+ flat_multimap<span class="special">(</span><span class="keyword">const</span> flat_multimap<span class="special">&lt;</span> <span class="identifier">Key</span><span class="special">,</span> <span class="identifier">T</span><span class="special">,</span> <span class="identifier">Pred</span><span class="special">,</span> <span class="identifier">Alloc</span> <span class="special">&gt;</span> <span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
+ flat_multimap<span class="special">(</span>flat_multimap <span class="special">&amp;&amp;</span><span class="special">)</span><span class="special">;</span>
+ flat_multimap&amp; operator=<span class="special">(</span><span class="keyword">const</span> flat_multimap <span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
+ flat_multimap&amp; operator=<span class="special">(</span>flat_multimap <span class="special">&amp;&amp;</span><span class="special">)</span><span class="special">;</span>
 
- <span class="emphasis"><em>// public member functions</em></span>
- <span class="type">key_compare</span> key_comp() <span class="bold"><strong>const</strong></span>;
- <span class="type">value_compare</span> value_comp() <span class="bold"><strong>const</strong></span>;
- <span class="type">allocator_type</span> get_allocator() <span class="bold"><strong>const</strong></span>;
- <span class="type"><span class="bold"><strong>const</strong></span> stored_allocator_type &amp;</span> get_stored_allocator() <span class="bold"><strong>const</strong></span>;
- <span class="type">stored_allocator_type &amp;</span> get_stored_allocator() ;
- <span class="type">iterator</span> begin() ;
- <span class="type">const_iterator</span> begin() <span class="bold"><strong>const</strong></span>;
- <span class="type">iterator</span> end() ;
- <span class="type">const_iterator</span> end() <span class="bold"><strong>const</strong></span>;
- <span class="type">reverse_iterator</span> rbegin() ;
- <span class="type">const_reverse_iterator</span> rbegin() <span class="bold"><strong>const</strong></span>;
- <span class="type">reverse_iterator</span> rend() ;
- <span class="type">const_reverse_iterator</span> rend() <span class="bold"><strong>const</strong></span>;
- <span class="type"><span class="bold"><strong>bool</strong></span></span> empty() <span class="bold"><strong>const</strong></span>;
- <span class="type">size_type</span> size() <span class="bold"><strong>const</strong></span>;
- <span class="type">size_type</span> max_size() <span class="bold"><strong>const</strong></span>;
- <span class="type"><span class="bold"><strong>void</strong></span></span> swap(flat_multimap &amp;) ;
- <span class="type">iterator</span> insert(<span class="bold"><strong>const</strong></span> value_type &amp;) ;
- <span class="type">iterator</span> insert(value_type &amp;&amp;) ;
- <span class="type">iterator</span> insert(impl_value_type &amp;&amp;) ;
- <span class="type">iterator</span> insert(const_iterator, <span class="bold"><strong>const</strong></span> value_type &amp;) ;
- <span class="type">iterator</span> insert(const_iterator, value_type &amp;&amp;) ;
- <span class="type">iterator</span> insert(const_iterator, impl_value_type &amp;&amp;) ;
- <span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>typename</strong></span> InputIterator&gt; <span class="type"><span class="bold"><strong>void</strong></span></span> insert(InputIterator, InputIterator) ;
- <span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>class</strong></span>... Args&gt; <span class="type">iterator</span> emplace(Args &amp;&amp;...) ;
- <span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>class</strong></span>... Args&gt; <span class="type">iterator</span> emplace_hint(const_iterator, Args &amp;&amp;...) ;
- <span class="type">iterator</span> erase(const_iterator) ;
- <span class="type">size_type</span> erase(<span class="bold"><strong>const</strong></span> key_type &amp;) ;
- <span class="type">iterator</span> erase(const_iterator, const_iterator) ;
- <span class="type"><span class="bold"><strong>void</strong></span></span> clear() ;
- <span class="type"><span class="bold"><strong>void</strong></span></span> shrink_to_fit() ;
- <span class="type">iterator</span> find(<span class="bold"><strong>const</strong></span> key_type &amp;) ;
- <span class="type">const_iterator</span> find(<span class="bold"><strong>const</strong></span> key_type &amp;) <span class="bold"><strong>const</strong></span>;
- <span class="type">size_type</span> count(<span class="bold"><strong>const</strong></span> key_type &amp;) <span class="bold"><strong>const</strong></span>;
- <span class="type">iterator</span> lower_bound(<span class="bold"><strong>const</strong></span> key_type &amp;) ;
- <span class="type">const_iterator</span> lower_bound(<span class="bold"><strong>const</strong></span> key_type &amp;) <span class="bold"><strong>const</strong></span>;
- <span class="type">iterator</span> upper_bound(<span class="bold"><strong>const</strong></span> key_type &amp;) ;
- <span class="type">const_iterator</span> upper_bound(<span class="bold"><strong>const</strong></span> key_type &amp;) <span class="bold"><strong>const</strong></span>;
- <span class="type">std::pair&lt; iterator, iterator &gt;</span> equal_range(<span class="bold"><strong>const</strong></span> key_type &amp;) ;
- <span class="type">std::pair&lt; const_iterator, const_iterator &gt;</span>
- equal_range(<span class="bold"><strong>const</strong></span> key_type &amp;) <span class="bold"><strong>const</strong></span>;
- <span class="type">size_type</span> capacity() <span class="bold"><strong>const</strong></span>;
- <span class="type"><span class="bold"><strong>void</strong></span></span> reserve(size_type) ;
-};</pre></div>
+ <span class="comment">// public member functions</span>
+ <span class="identifier">key_compare</span> key_comp<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">value_compare</span> value_comp<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">allocator_type</span> get_allocator<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="keyword">const</span> <span class="identifier">stored_allocator_type</span> <span class="special">&amp;</span> get_stored_allocator<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">stored_allocator_type</span> <span class="special">&amp;</span> get_stored_allocator<span class="special">(</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">iterator</span> begin<span class="special">(</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">const_iterator</span> begin<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">iterator</span> end<span class="special">(</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">const_iterator</span> end<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">reverse_iterator</span> rbegin<span class="special">(</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">const_reverse_iterator</span> rbegin<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">reverse_iterator</span> rend<span class="special">(</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">const_reverse_iterator</span> rend<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="keyword">bool</span> empty<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">size_type</span> size<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">size_type</span> max_size<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="keyword">void</span> swap<span class="special">(</span>flat_multimap <span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">iterator</span> insert<span class="special">(</span><span class="keyword">const</span> <span class="identifier">value_type</span> <span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">iterator</span> insert<span class="special">(</span><span class="identifier">value_type</span> <span class="special">&amp;&amp;</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">iterator</span> insert<span class="special">(</span><span class="identifier">impl_value_type</span> <span class="special">&amp;&amp;</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">iterator</span> insert<span class="special">(</span><span class="identifier">const_iterator</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">value_type</span> <span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">iterator</span> insert<span class="special">(</span><span class="identifier">const_iterator</span><span class="special">,</span> <span class="identifier">value_type</span> <span class="special">&amp;&amp;</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">iterator</span> insert<span class="special">(</span><span class="identifier">const_iterator</span><span class="special">,</span> <span class="identifier">impl_value_type</span> <span class="special">&amp;&amp;</span><span class="special">)</span><span class="special">;</span>
+ <span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> InputIterator<span class="special">&gt;</span> <span class="keyword">void</span> insert<span class="special">(</span><span class="identifier">InputIterator</span><span class="special">,</span> <span class="identifier">InputIterator</span><span class="special">)</span><span class="special">;</span>
+ <span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span><span class="special">...</span> Args<span class="special">&gt;</span> <span class="identifier">iterator</span> emplace<span class="special">(</span><span class="identifier">Args</span> <span class="special">&amp;&amp;</span><span class="special">...</span><span class="special">)</span><span class="special">;</span>
+ <span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span><span class="special">...</span> Args<span class="special">&gt;</span> <span class="identifier">iterator</span> emplace_hint<span class="special">(</span><span class="identifier">const_iterator</span><span class="special">,</span> <span class="identifier">Args</span> <span class="special">&amp;&amp;</span><span class="special">...</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">iterator</span> erase<span class="special">(</span><span class="identifier">const_iterator</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">size_type</span> erase<span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">iterator</span> erase<span class="special">(</span><span class="identifier">const_iterator</span><span class="special">,</span> <span class="identifier">const_iterator</span><span class="special">)</span><span class="special">;</span>
+ <span class="keyword">void</span> clear<span class="special">(</span><span class="special">)</span><span class="special">;</span>
+ <span class="keyword">void</span> shrink_to_fit<span class="special">(</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">iterator</span> find<span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">const_iterator</span> find<span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">size_type</span> count<span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">iterator</span> lower_bound<span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">const_iterator</span> lower_bound<span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">iterator</span> upper_bound<span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">const_iterator</span> upper_bound<span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span> <span class="identifier">iterator</span><span class="special">,</span> <span class="identifier">iterator</span> <span class="special">&gt;</span> equal_range<span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span> <span class="identifier">const_iterator</span><span class="special">,</span> <span class="identifier">const_iterator</span> <span class="special">&gt;</span>
+ equal_range<span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">size_type</span> capacity<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="keyword">void</span> reserve<span class="special">(</span><span class="identifier">size_type</span><span class="special">)</span><span class="special">;</span>
+<span class="special">}</span><span class="special">;</span></pre></div>
 <div class="refsect1" lang="en">
-<a name="id480922"></a><h2>Description</h2>
+<a name="id760764"></a><h2>Description</h2>
 <p>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.</p>
 <p>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&lt;Key,T&gt; the key_type is Key and the value_type is std::pair&lt;Key,T&gt; (unlike std::multimap&lt;Key, T&gt; which value_type is std::pair&lt;<span class="bold"><strong>const</strong></span> Key, T&gt;).</p>
-<p>Pred is the ordering function for Keys (e.g. std::less&lt;Key&gt;).</p>
-<p>Alloc is the allocator to allocate the value_types (e.g. allocator&lt; std::pair&lt;Key, T&gt; &gt;). </p>
+<p>Pred is the ordering function for Keys (e.g. <span class="emphasis"><em>std::less&lt;Key&gt;</em></span>).</p>
+<p>Alloc is the allocator to allocate the value_types (e.g. <span class="emphasis"><em>allocator&lt; std::pair&lt;Key, T&gt; &gt;</em></span>). </p>
 <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(<span class="bold"><strong>const</strong></span> Pred &amp; comp = Pred(),
- <span class="bold"><strong>const</strong></span> allocator_type &amp; a = allocator_type());</pre>
+<pre class="literallayout"><a name="id377982-bb"></a><span class="identifier">flat_multimap</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">Pred</span> <span class="special">&amp;</span> comp <span class="special">=</span> <span class="identifier">Pred</span><span class="special">(</span><span class="special">)</span><span class="special">,</span>
+ <span class="keyword">const</span> <span class="identifier">allocator_type</span> <span class="special">&amp;</span> a <span class="special">=</span> <span class="identifier">allocator_type</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Constructs an empty flat_multimap using the specified comparison object and allocator.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>typename</strong></span> InputIterator&gt;
- <a name="id297816-bb"></a>flat_multimap(InputIterator first, InputIterator last,
- <span class="bold"><strong>const</strong></span> Pred &amp; comp = Pred(),
- <span class="bold"><strong>const</strong></span> allocator_type &amp; a = allocator_type());</pre>
+<pre class="literallayout"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> InputIterator<span class="special">&gt;</span>
+ <a name="id379400-bb"></a><span class="identifier">flat_multimap</span><span class="special">(</span><span class="identifier">InputIterator</span> first<span class="special">,</span> <span class="identifier">InputIterator</span> last<span class="special">,</span>
+ <span class="keyword">const</span> <span class="identifier">Pred</span> <span class="special">&amp;</span> comp <span class="special">=</span> <span class="identifier">Pred</span><span class="special">(</span><span class="special">)</span><span class="special">,</span>
+ <span class="keyword">const</span> <span class="identifier">allocator_type</span> <span class="special">&amp;</span> a <span class="special">=</span> <span class="identifier">allocator_type</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Constructs an empty flat_multimap using the specified comparison object and allocator, and inserts elements from the range [first ,last ).</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Linear in N if the range [first ,last ) is already sorted using comp and otherwise N logN, where N is last - first. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>typename</strong></span> InputIterator&gt;
- <a name="id297860-bb"></a>flat_multimap(ordered_range_t, InputIterator first, InputIterator last,
- <span class="bold"><strong>const</strong></span> Pred &amp; comp = Pred(),
- <span class="bold"><strong>const</strong></span> allocator_type &amp; a = allocator_type());</pre>
+<pre class="literallayout"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> InputIterator<span class="special">&gt;</span>
+ <a name="id379444-bb"></a><span class="identifier">flat_multimap</span><span class="special">(</span><span class="identifier">ordered_range_t</span><span class="special">,</span> <span class="identifier">InputIterator</span> first<span class="special">,</span> <span class="identifier">InputIterator</span> last<span class="special">,</span>
+ <span class="keyword">const</span> <span class="identifier">Pred</span> <span class="special">&amp;</span> comp <span class="special">=</span> <span class="identifier">Pred</span><span class="special">(</span><span class="special">)</span><span class="special">,</span>
+ <span class="keyword">const</span> <span class="identifier">allocator_type</span> <span class="special">&amp;</span> a <span class="special">=</span> <span class="identifier">allocator_type</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: 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.</p>
 <p><span class="bold"><strong>Requires</strong></span>: [first ,last) must be ordered according to the predicate.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Linear in N. </p>
 </li>
 <li>
-<pre class="literallayout"><a name="id297916-bb"></a>flat_multimap(<span class="bold"><strong>const</strong></span> flat_multimap&lt; Key, T, Pred, Alloc &gt; &amp; x);</pre>
+<pre class="literallayout"><a name="id379501-bb"></a><span class="identifier">flat_multimap</span><span class="special">(</span><span class="keyword">const</span> flat_multimap<span class="special">&lt;</span> <span class="identifier">Key</span><span class="special">,</span> <span class="identifier">T</span><span class="special">,</span> <span class="identifier">Pred</span><span class="special">,</span> <span class="identifier">Alloc</span> <span class="special">&gt;</span> <span class="special">&amp;</span> x<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Copy constructs a flat_multimap.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Linear in x.size(). </p>
 </li>
 <li>
-<pre class="literallayout"><a name="id297939-bb"></a>flat_multimap(flat_multimap &amp;&amp; x);</pre>
+<pre class="literallayout"><a name="id379524-bb"></a><span class="identifier">flat_multimap</span><span class="special">(</span>flat_multimap <span class="special">&amp;&amp;</span> x<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Move constructs a flat_multimap. Constructs *this using x's resources.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Construct.</p>
 <p><span class="bold"><strong>Postcondition</strong></span>: x is emptied. </p>
 </li>
 <li>
-<pre class="literallayout">flat_multimap&amp; <a name="id297967-bb"></a><span class="bold"><strong>operator</strong></span>=(<span class="bold"><strong>const</strong></span> flat_multimap &amp; x);</pre>
+<pre class="literallayout">flat_multimap&amp; <a name="id379551-bb"></a><span class="keyword">operator</span><span class="special">=</span><span class="special">(</span><span class="keyword">const</span> flat_multimap <span class="special">&amp;</span> x<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Makes *this a copy of x.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Linear in x.size(). </p>
 </li>
 <li>
-<pre class="literallayout">flat_multimap&amp; <a name="id297990-bb"></a><span class="bold"><strong>operator</strong></span>=(flat_multimap &amp;&amp; mx);</pre>
+<pre class="literallayout">flat_multimap&amp; <a name="id379574-bb"></a><span class="keyword">operator</span><span class="special">=</span><span class="special">(</span>flat_multimap <span class="special">&amp;&amp;</span> mx<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: this-&gt;swap(x.get()).</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </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"><span class="type">key_compare</span> <a name="id296482-bb"></a>key_comp() <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">key_compare</span> <a name="id376814-bb"></a><span class="identifier">key_comp</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns the comparison object out of which a was constructed.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">value_compare</span> <a name="id296502-bb"></a>value_comp() <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">value_compare</span> <a name="id376834-bb"></a><span class="identifier">value_comp</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns an object of value_compare constructed out of the comparison object.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">allocator_type</span> <a name="id296522-bb"></a>get_allocator() <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">allocator_type</span> <a name="id376854-bb"></a><span class="identifier">get_allocator</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns a copy of the Allocator that was passed to the object's constructor.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
-<li><pre class="literallayout"><span class="type"><span class="bold"><strong>const</strong></span> stored_allocator_type &amp;</span> <a name="id296541-bb"></a>get_stored_allocator() <span class="bold"><strong>const</strong></span>;</pre></li>
-<li><pre class="literallayout"><span class="type">stored_allocator_type &amp;</span> <a name="id296547-bb"></a>get_stored_allocator() ;</pre></li>
+<li><pre class="literallayout"><span class="keyword">const</span> <span class="identifier">stored_allocator_type</span> <span class="special">&amp;</span> <a name="id376873-bb"></a><span class="identifier">get_stored_allocator</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre></li>
+<li><pre class="literallayout"><span class="identifier">stored_allocator_type</span> <span class="special">&amp;</span> <a name="id376879-bb"></a><span class="identifier">get_stored_allocator</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre></li>
 <li>
-<pre class="literallayout"><span class="type">iterator</span> <a name="id296553-bb"></a>begin() ;</pre>
+<pre class="literallayout"><span class="identifier">iterator</span> <a name="id376885-bb"></a><span class="identifier">begin</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns an iterator to the first element contained in the container.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">const_iterator</span> <a name="id296578-bb"></a>begin() <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">const_iterator</span> <a name="id376910-bb"></a><span class="identifier">begin</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns a const_iterator to the first element contained in the container.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">iterator</span> <a name="id296603-bb"></a>end() ;</pre>
+<pre class="literallayout"><span class="identifier">iterator</span> <a name="id376935-bb"></a><span class="identifier">end</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns an iterator to the end of the container.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">const_iterator</span> <a name="id296628-bb"></a>end() <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">const_iterator</span> <a name="id376960-bb"></a><span class="identifier">end</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns a const_iterator to the end of the container.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">reverse_iterator</span> <a name="id296654-bb"></a>rbegin() ;</pre>
+<pre class="literallayout"><span class="identifier">reverse_iterator</span> <a name="id376986-bb"></a><span class="identifier">rbegin</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns a reverse_iterator pointing to the beginning of the reversed container.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">const_reverse_iterator</span> <a name="id296679-bb"></a>rbegin() <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">const_reverse_iterator</span> <a name="id377011-bb"></a><span class="identifier">rbegin</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns a const_reverse_iterator pointing to the beginning of the reversed container.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">reverse_iterator</span> <a name="id296704-bb"></a>rend() ;</pre>
+<pre class="literallayout"><span class="identifier">reverse_iterator</span> <a name="id377036-bb"></a><span class="identifier">rend</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns a reverse_iterator pointing to the end of the reversed container.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">const_reverse_iterator</span> <a name="id296729-bb"></a>rend() <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">const_reverse_iterator</span> <a name="id377061-bb"></a><span class="identifier">rend</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns a const_reverse_iterator pointing to the end of the reversed container.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type"><span class="bold"><strong>bool</strong></span></span> <a name="id296754-bb"></a>empty() <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="keyword">bool</span> <a name="id377086-bb"></a><span class="identifier">empty</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns true if the container contains no elements.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">size_type</span> <a name="id296780-bb"></a>size() <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">size_type</span> <a name="id377112-bb"></a><span class="identifier">size</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns the number of the elements contained in the container.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">size_type</span> <a name="id296805-bb"></a>max_size() <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">size_type</span> <a name="id377137-bb"></a><span class="identifier">max_size</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns the largest possible size of the container.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type"><span class="bold"><strong>void</strong></span></span> <a name="id296830-bb"></a>swap(flat_multimap &amp; x) ;</pre>
+<pre class="literallayout"><span class="keyword">void</span> <a name="id377162-bb"></a><span class="identifier">swap</span><span class="special">(</span>flat_multimap <span class="special">&amp;</span> x<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Swaps the contents of *this and x. If this-&gt;allocator_type() != x.allocator_type() allocators are also swapped.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">iterator</span> <a name="id296862-bb"></a>insert(<span class="bold"><strong>const</strong></span> value_type &amp; x) ;</pre>
+<pre class="literallayout"><span class="identifier">iterator</span> <a name="id377194-bb"></a><span class="identifier">insert</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">value_type</span> <span class="special">&amp;</span> x<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Inserts x and returns the iterator pointing to the newly inserted element.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic search time plus linear insertion to the elements with bigger keys than x.</p>
 <p><span class="bold"><strong>Note</strong></span>: If an element it's inserted it might invalidate elements. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">iterator</span> <a name="id296894-bb"></a>insert(value_type &amp;&amp; x) ;</pre>
+<pre class="literallayout"><span class="identifier">iterator</span> <a name="id377226-bb"></a><span class="identifier">insert</span><span class="special">(</span><span class="identifier">value_type</span> <span class="special">&amp;&amp;</span> x<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Inserts a new value move-constructed from x and returns the iterator pointing to the newly inserted element.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic search time plus linear insertion to the elements with bigger keys than x.</p>
 <p><span class="bold"><strong>Note</strong></span>: If an element it's inserted it might invalidate elements. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">iterator</span> <a name="id297062-bb"></a>insert(impl_value_type &amp;&amp; x) ;</pre>
+<pre class="literallayout"><span class="identifier">iterator</span> <a name="id377257-bb"></a><span class="identifier">insert</span><span class="special">(</span><span class="identifier">impl_value_type</span> <span class="special">&amp;&amp;</span> x<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Inserts a new value move-constructed from x and returns the iterator pointing to the newly inserted element.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic search time plus linear insertion to the elements with bigger keys than x.</p>
 <p><span class="bold"><strong>Note</strong></span>: If an element it's inserted it might invalidate elements. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">iterator</span> <a name="id297093-bb"></a>insert(const_iterator position, <span class="bold"><strong>const</strong></span> value_type &amp; x) ;</pre>
+<pre class="literallayout"><span class="identifier">iterator</span> <a name="id377288-bb"></a><span class="identifier">insert</span><span class="special">(</span><span class="identifier">const_iterator</span> position<span class="special">,</span> <span class="keyword">const</span> <span class="identifier">value_type</span> <span class="special">&amp;</span> x<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Inserts a copy of x in the container. p is a hint pointing to where the insert should start to search.</p>
 <p><span class="bold"><strong>Returns</strong></span>: An iterator pointing to the element with key equivalent to the key of x.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: 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.</p>
 <p><span class="bold"><strong>Note</strong></span>: If an element it's inserted it might invalidate elements. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">iterator</span> <a name="id297135-bb"></a>insert(const_iterator position, value_type &amp;&amp; x) ;</pre>
+<pre class="literallayout"><span class="identifier">iterator</span> <a name="id377330-bb"></a><span class="identifier">insert</span><span class="special">(</span><span class="identifier">const_iterator</span> position<span class="special">,</span> <span class="identifier">value_type</span> <span class="special">&amp;&amp;</span> x<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Inserts a value move constructed from x in the container. p is a hint pointing to where the insert should start to search.</p>
 <p><span class="bold"><strong>Returns</strong></span>: An iterator pointing to the element with key equivalent to the key of x.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: 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.</p>
 <p><span class="bold"><strong>Note</strong></span>: If an element it's inserted it might invalidate elements. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">iterator</span> <a name="id297177-bb"></a>insert(const_iterator position, impl_value_type &amp;&amp; x) ;</pre>
+<pre class="literallayout"><span class="identifier">iterator</span> <a name="id377372-bb"></a><span class="identifier">insert</span><span class="special">(</span><span class="identifier">const_iterator</span> position<span class="special">,</span> <span class="identifier">impl_value_type</span> <span class="special">&amp;&amp;</span> x<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Inserts a value move constructed from x in the container. p is a hint pointing to where the insert should start to search.</p>
 <p><span class="bold"><strong>Returns</strong></span>: An iterator pointing to the element with key equivalent to the key of x.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: 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.</p>
 <p><span class="bold"><strong>Note</strong></span>: If an element it's inserted it might invalidate elements. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>typename</strong></span> InputIterator&gt;
- <span class="type"><span class="bold"><strong>void</strong></span></span> <a name="id297219-bb"></a>insert(InputIterator first, InputIterator last) ;</pre>
+<pre class="literallayout"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> InputIterator<span class="special">&gt;</span>
+ <span class="keyword">void</span> <a name="id377414-bb"></a><span class="identifier">insert</span><span class="special">(</span><span class="identifier">InputIterator</span> first<span class="special">,</span> <span class="identifier">InputIterator</span> last<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Requires</strong></span>: i, j are not iterators into *this.</p>
 <p><span class="bold"><strong>Effects</strong></span>: inserts each element from the range [i,j) .</p>
 <p><span class="bold"><strong>Complexity</strong></span>: N log(size()+N) (N is the distance from i to j) search time plus N*size() insertion time.</p>
 <p><span class="bold"><strong>Note</strong></span>: If an element it's inserted it might invalidate elements. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>class</strong></span>... Args&gt; <span class="type">iterator</span> <a name="id297267-bb"></a>emplace(Args &amp;&amp;... args) ;</pre>
+<pre class="literallayout"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span><span class="special">...</span> Args<span class="special">&gt;</span> <span class="identifier">iterator</span> <a name="id377462-bb"></a><span class="identifier">emplace</span><span class="special">(</span><span class="identifier">Args</span> <span class="special">&amp;&amp;</span><span class="special">...</span> args<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Inserts an object of type T constructed with std::forward&lt;Args&gt;(args)... and returns the iterator pointing to the newly inserted element.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic search time plus linear insertion to the elements with bigger keys than x.</p>
 <p><span class="bold"><strong>Note</strong></span>: If an element it's inserted it might invalidate elements. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>class</strong></span>... Args&gt;
- <span class="type">iterator</span> <a name="id297307-bb"></a>emplace_hint(const_iterator hint, Args &amp;&amp;... args) ;</pre>
+<pre class="literallayout"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span><span class="special">...</span> Args<span class="special">&gt;</span>
+ <span class="identifier">iterator</span> <a name="id377502-bb"></a><span class="identifier">emplace_hint</span><span class="special">(</span><span class="identifier">const_iterator</span> hint<span class="special">,</span> <span class="identifier">Args</span> <span class="special">&amp;&amp;</span><span class="special">...</span> args<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Inserts an object of type T constructed with std::forward&lt;Args&gt;(args)... in the container. p is a hint pointing to where the insert should start to search.</p>
 <p><span class="bold"><strong>Returns</strong></span>: An iterator pointing to the element with key equivalent to the key of x.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: 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.</p>
 <p><span class="bold"><strong>Note</strong></span>: If an element it's inserted it might invalidate elements. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">iterator</span> <a name="id297357-bb"></a>erase(const_iterator position) ;</pre>
+<pre class="literallayout"><span class="identifier">iterator</span> <a name="id377552-bb"></a><span class="identifier">erase</span><span class="special">(</span><span class="identifier">const_iterator</span> position<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Erases the element pointed to by position.</p>
 <p><span class="bold"><strong>Returns</strong></span>: Returns an iterator pointing to the element immediately following q prior to the element being erased. If no such element exists, returns end().</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Linear to the elements with keys bigger than position</p>
 <p><span class="bold"><strong>Note</strong></span>: Invalidates elements with keys not less than the erased element. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">size_type</span> <a name="id297393-bb"></a>erase(<span class="bold"><strong>const</strong></span> key_type &amp; x) ;</pre>
+<pre class="literallayout"><span class="identifier">size_type</span> <a name="id377588-bb"></a><span class="identifier">erase</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span> x<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Erases all elements in the container with key equivalent to x.</p>
 <p><span class="bold"><strong>Returns</strong></span>: Returns the number of erased elements.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic search time plus erasure time linear to the elements with bigger keys. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">iterator</span> <a name="id297423-bb"></a>erase(const_iterator first, const_iterator last) ;</pre>
+<pre class="literallayout"><span class="identifier">iterator</span> <a name="id377618-bb"></a><span class="identifier">erase</span><span class="special">(</span><span class="identifier">const_iterator</span> first<span class="special">,</span> <span class="identifier">const_iterator</span> last<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Erases all the elements in the range [first, last).</p>
 <p><span class="bold"><strong>Returns</strong></span>: Returns last.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: size()*N where N is the distance from first to last.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic search time plus erasure time linear to the elements with bigger keys. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type"><span class="bold"><strong>void</strong></span></span> <a name="id297464-bb"></a>clear() ;</pre>
+<pre class="literallayout"><span class="keyword">void</span> <a name="id377659-bb"></a><span class="identifier">clear</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: erase(a.begin(),a.end()).</p>
 <p><span class="bold"><strong>Postcondition</strong></span>: size() == 0.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: linear in size(). </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type"><span class="bold"><strong>void</strong></span></span> <a name="id297489-bb"></a>shrink_to_fit() ;</pre>
+<pre class="literallayout"><span class="keyword">void</span> <a name="id377684-bb"></a><span class="identifier">shrink_to_fit</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre>
 <span class="bold"><strong>Effects</strong></span>: Tries to deallocate the excess of memory created <p><span class="bold"><strong>Throws</strong></span>: If memory allocation throws, or T's copy constructor throws.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Linear to size(). </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">iterator</span> <a name="id297516-bb"></a>find(<span class="bold"><strong>const</strong></span> key_type &amp; x) ;</pre>
+<pre class="literallayout"><span class="identifier">iterator</span> <a name="id377710-bb"></a><span class="identifier">find</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span> x<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Returns</strong></span>: An iterator pointing to an element with the key equivalent to x, or end() if such an element is not found.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">const_iterator</span> <a name="id297540-bb"></a>find(<span class="bold"><strong>const</strong></span> key_type &amp; x) <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">const_iterator</span> <a name="id377734-bb"></a><span class="identifier">find</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span> x<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Returns</strong></span>: An const_iterator pointing to an element with the key equivalent to x, or end() if such an element is not found.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">size_type</span> <a name="id297564-bb"></a>count(<span class="bold"><strong>const</strong></span> key_type &amp; x) <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">size_type</span> <a name="id377758-bb"></a><span class="identifier">count</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span> x<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Returns</strong></span>: The number of elements with key equivalent to x.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: log(size())+count(k) </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">iterator</span> <a name="id297588-bb"></a>lower_bound(<span class="bold"><strong>const</strong></span> key_type &amp; x) ;</pre>
+<pre class="literallayout"><span class="identifier">iterator</span> <a name="id377782-bb"></a><span class="identifier">lower_bound</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span> x<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Returns</strong></span>: An iterator pointing to the first element with key not less than k, or a.end() if such an element is not found.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">const_iterator</span> <a name="id297612-bb"></a>lower_bound(<span class="bold"><strong>const</strong></span> key_type &amp; x) <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">const_iterator</span> <a name="id377806-bb"></a><span class="identifier">lower_bound</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span> x<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Returns</strong></span>: A const iterator pointing to the first element with key not less than k, or a.end() if such an element is not found.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">iterator</span> <a name="id297636-bb"></a>upper_bound(<span class="bold"><strong>const</strong></span> key_type &amp; x) ;</pre>
+<pre class="literallayout"><span class="identifier">iterator</span> <a name="id377830-bb"></a><span class="identifier">upper_bound</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span> x<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Returns</strong></span>: An iterator pointing to the first element with key not less than x, or end() if such an element is not found.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">const_iterator</span> <a name="id297660-bb"></a>upper_bound(<span class="bold"><strong>const</strong></span> key_type &amp; x) <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">const_iterator</span> <a name="id377854-bb"></a><span class="identifier">upper_bound</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span> x<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Returns</strong></span>: A const iterator pointing to the first element with key not less than x, or end() if such an element is not found.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">std::pair&lt; iterator, iterator &gt;</span> <a name="id297684-bb"></a>equal_range(<span class="bold"><strong>const</strong></span> key_type &amp; x) ;</pre>
+<pre class="literallayout"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span> <span class="identifier">iterator</span><span class="special">,</span> <span class="identifier">iterator</span> <span class="special">&gt;</span> <a name="id377878-bb"></a><span class="identifier">equal_range</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span> x<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Equivalent to std::make_pair(this-&gt;lower_bound(k), this-&gt;upper_bound(k)).</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">std::pair&lt; const_iterator, const_iterator &gt;</span>
-<a name="id297708-bb"></a>equal_range(<span class="bold"><strong>const</strong></span> key_type &amp; x) <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span> <span class="identifier">const_iterator</span><span class="special">,</span> <span class="identifier">const_iterator</span> <span class="special">&gt;</span>
+<a name="id377902-bb"></a><span class="identifier">equal_range</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span> x<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Equivalent to std::make_pair(this-&gt;lower_bound(k), this-&gt;upper_bound(k)).</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">size_type</span> <a name="id297732-bb"></a>capacity() <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">size_type</span> <a name="id377926-bb"></a><span class="identifier">capacity</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Number of elements for which memory has been allocated. capacity() is always greater than or equal to size().</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type"><span class="bold"><strong>void</strong></span></span> <a name="id297757-bb"></a>reserve(size_type count) ;</pre>
+<pre class="literallayout"><span class="keyword">void</span> <a name="id377952-bb"></a><span class="identifier">reserve</span><span class="special">(</span><span class="identifier">size_type</span> count<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: 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.</p>
 <p><span class="bold"><strong>Throws</strong></span>: If memory allocation allocation throws or T's copy constructor throws.</p>
 <p><span class="bold"><strong>Note</strong></span>: If capacity() is less than "count", iterators and references to to values might be invalidated. </p>
@@ -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<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2009 -2011 Ion Gaztanaga<p>
         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)
       </p>
@@ -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&#160;1.&#160;Boost.Container">
 <link rel="up" href="../../boost_container_reference.html#header.boost.container.flat_set_hpp" title="Header &lt;boost/container/flat_set.hpp&gt;">
 <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 @@
 <p>boost::container::flat_multiset &#8212; </p>
 </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"><span class="emphasis"><em>// In header: &lt;boost/container/flat_set.hpp&gt;
+<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis"><span class="comment">// In header: &lt;boost/container/flat_set.hpp&gt;
 
-</em></span><span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>typename</strong></span> T, <span class="bold"><strong>typename</strong></span> Pred, <span class="bold"><strong>typename</strong></span> Alloc&gt;
-<span class="bold"><strong>class</strong></span> flat_multiset {
-<span class="bold"><strong>public</strong></span>:
- <span class="emphasis"><em>// types</em></span>
- <span class="bold"><strong>typedef</strong></span> tree_t::key_type <a name="boost.container.flat_multiset.key_type"></a>key_type;
- <span class="bold"><strong>typedef</strong></span> tree_t::value_type <a name="boost.container.flat_multiset.value_type"></a>value_type;
- <span class="bold"><strong>typedef</strong></span> tree_t::pointer <a name="boost.container.flat_multiset.pointer"></a>pointer;
- <span class="bold"><strong>typedef</strong></span> tree_t::const_pointer <a name="boost.container.flat_multiset.const_pointer"></a>const_pointer;
- <span class="bold"><strong>typedef</strong></span> tree_t::reference <a name="boost.container.flat_multiset.reference"></a>reference;
- <span class="bold"><strong>typedef</strong></span> tree_t::const_reference <a name="boost.container.flat_multiset.const_reference"></a>const_reference;
- <span class="bold"><strong>typedef</strong></span> tree_t::key_compare <a name="boost.container.flat_multiset.key_compare"></a>key_compare;
- <span class="bold"><strong>typedef</strong></span> tree_t::value_compare <a name="boost.container.flat_multiset.value_compare"></a>value_compare;
- <span class="bold"><strong>typedef</strong></span> tree_t::iterator <a name="boost.container.flat_multiset.iterator"></a>iterator;
- <span class="bold"><strong>typedef</strong></span> tree_t::const_iterator <a name="boost.container.flat_multiset.const_iterator"></a>const_iterator;
- <span class="bold"><strong>typedef</strong></span> tree_t::reverse_iterator <a name="boost.container.flat_multiset.reverse_iterator"></a>reverse_iterator;
- <span class="bold"><strong>typedef</strong></span> tree_t::const_reverse_iterator <a name="boost.container.flat_multiset.const_reverse_iterator"></a>const_reverse_iterator;
- <span class="bold"><strong>typedef</strong></span> tree_t::size_type <a name="boost.container.flat_multiset.size_type"></a>size_type;
- <span class="bold"><strong>typedef</strong></span> tree_t::difference_type <a name="boost.container.flat_multiset.difference_type"></a>difference_type;
- <span class="bold"><strong>typedef</strong></span> tree_t::allocator_type <a name="boost.container.flat_multiset.allocator_type"></a>allocator_type;
- <span class="bold"><strong>typedef</strong></span> tree_t::stored_allocator_type <a name="boost.container.flat_multiset.stored_allocator_type"></a>stored_allocator_type;
+</span><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> T<span class="special">,</span> <span class="keyword">typename</span> Pred<span class="special">,</span> <span class="keyword">typename</span> Alloc<span class="special">&gt;</span>
+<span class="keyword">class</span> flat_multiset <span class="special">{</span>
+<span class="keyword">public</span><span class="special">:</span>
+ <span class="comment">// types</span>
+ <span class="keyword">typedef</span> <span class="identifier">tree_t</span><span class="special">::</span><span class="identifier">key_type</span> <a name="boost.container.flat_multiset.key_type"></a><span class="identifier">key_type</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">tree_t</span><span class="special">::</span><span class="identifier">value_type</span> <a name="boost.container.flat_multiset.value_type"></a><span class="identifier">value_type</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">tree_t</span><span class="special">::</span><span class="identifier">pointer</span> <a name="boost.container.flat_multiset.pointer"></a><span class="identifier">pointer</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">tree_t</span><span class="special">::</span><span class="identifier">const_pointer</span> <a name="boost.container.flat_multiset.const_pointer"></a><span class="identifier">const_pointer</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">tree_t</span><span class="special">::</span><span class="identifier">reference</span> <a name="boost.container.flat_multiset.reference"></a><span class="identifier">reference</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">tree_t</span><span class="special">::</span><span class="identifier">const_reference</span> <a name="boost.container.flat_multiset.const_reference"></a><span class="identifier">const_reference</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">tree_t</span><span class="special">::</span><span class="identifier">key_compare</span> <a name="boost.container.flat_multiset.key_compare"></a><span class="identifier">key_compare</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">tree_t</span><span class="special">::</span><span class="identifier">value_compare</span> <a name="boost.container.flat_multiset.value_compare"></a><span class="identifier">value_compare</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">tree_t</span><span class="special">::</span><span class="identifier">iterator</span> <a name="boost.container.flat_multiset.iterator"></a><span class="identifier">iterator</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">tree_t</span><span class="special">::</span><span class="identifier">const_iterator</span> <a name="boost.container.flat_multiset.const_iterator"></a><span class="identifier">const_iterator</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">tree_t</span><span class="special">::</span><span class="identifier">reverse_iterator</span> <a name="boost.container.flat_multiset.reverse_iterator"></a><span class="identifier">reverse_iterator</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">tree_t</span><span class="special">::</span><span class="identifier">const_reverse_iterator</span> <a name="boost.container.flat_multiset.const_reverse_iterator"></a><span class="identifier">const_reverse_iterator</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">tree_t</span><span class="special">::</span><span class="identifier">size_type</span> <a name="boost.container.flat_multiset.size_type"></a><span class="identifier">size_type</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">tree_t</span><span class="special">::</span><span class="identifier">difference_type</span> <a name="boost.container.flat_multiset.difference_type"></a><span class="identifier">difference_type</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">tree_t</span><span class="special">::</span><span class="identifier">allocator_type</span> <a name="boost.container.flat_multiset.allocator_type"></a><span class="identifier">allocator_type</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">tree_t</span><span class="special">::</span><span class="identifier">stored_allocator_type</span> <a name="boost.container.flat_multiset.stored_allocator_type"></a><span class="identifier">stored_allocator_type</span><span class="special">;</span>
 
- <span class="emphasis"><em>// construct/copy/destruct</em></span>
- flat_multiset(<span class="bold"><strong>const</strong></span> Pred &amp; = Pred(),
- <span class="bold"><strong>const</strong></span> allocator_type &amp; = allocator_type());
- <span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>typename</strong></span> InputIterator&gt;
- flat_multiset(InputIterator, InputIterator, <span class="bold"><strong>const</strong></span> Pred &amp; = Pred(),
- <span class="bold"><strong>const</strong></span> allocator_type &amp; = allocator_type());
- <span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>typename</strong></span> InputIterator&gt;
- flat_multiset(ordered_range_t, InputIterator, InputIterator,
- <span class="bold"><strong>const</strong></span> Pred &amp; = Pred(),
- <span class="bold"><strong>const</strong></span> allocator_type &amp; = allocator_type());
- flat_multiset(<span class="bold"><strong>const</strong></span> flat_multiset&lt; T, Pred, Alloc &gt; &amp;);
- flat_multiset(flat_multiset &amp;&amp;);
- flat_multiset&amp; operator=(<span class="bold"><strong>const</strong></span> flat_multiset &amp;);
- flat_multiset&amp; operator=(flat_multiset &amp;&amp;);
+ <span class="comment">// construct/copy/destruct</span>
+ flat_multiset<span class="special">(</span><span class="keyword">const</span> <span class="identifier">Pred</span> <span class="special">&amp;</span> <span class="special">=</span> <span class="identifier">Pred</span><span class="special">(</span><span class="special">)</span><span class="special">,</span>
+ <span class="keyword">const</span> <span class="identifier">allocator_type</span> <span class="special">&amp;</span> <span class="special">=</span> <span class="identifier">allocator_type</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span>
+ <span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> InputIterator<span class="special">&gt;</span>
+ flat_multiset<span class="special">(</span><span class="identifier">InputIterator</span><span class="special">,</span> <span class="identifier">InputIterator</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Pred</span> <span class="special">&amp;</span> <span class="special">=</span> <span class="identifier">Pred</span><span class="special">(</span><span class="special">)</span><span class="special">,</span>
+ <span class="keyword">const</span> <span class="identifier">allocator_type</span> <span class="special">&amp;</span> <span class="special">=</span> <span class="identifier">allocator_type</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span>
+ <span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> InputIterator<span class="special">&gt;</span>
+ flat_multiset<span class="special">(</span><span class="identifier">ordered_range_t</span><span class="special">,</span> <span class="identifier">InputIterator</span><span class="special">,</span> <span class="identifier">InputIterator</span><span class="special">,</span>
+ <span class="keyword">const</span> <span class="identifier">Pred</span> <span class="special">&amp;</span> <span class="special">=</span> <span class="identifier">Pred</span><span class="special">(</span><span class="special">)</span><span class="special">,</span>
+ <span class="keyword">const</span> <span class="identifier">allocator_type</span> <span class="special">&amp;</span> <span class="special">=</span> <span class="identifier">allocator_type</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span>
+ flat_multiset<span class="special">(</span><span class="keyword">const</span> flat_multiset<span class="special">&lt;</span> <span class="identifier">T</span><span class="special">,</span> <span class="identifier">Pred</span><span class="special">,</span> <span class="identifier">Alloc</span> <span class="special">&gt;</span> <span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
+ flat_multiset<span class="special">(</span>flat_multiset <span class="special">&amp;&amp;</span><span class="special">)</span><span class="special">;</span>
+ flat_multiset&amp; operator=<span class="special">(</span><span class="keyword">const</span> flat_multiset <span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
+ flat_multiset&amp; operator=<span class="special">(</span>flat_multiset <span class="special">&amp;&amp;</span><span class="special">)</span><span class="special">;</span>
 
- <span class="emphasis"><em>// public member functions</em></span>
- <span class="type">key_compare</span> key_comp() <span class="bold"><strong>const</strong></span>;
- <span class="type">value_compare</span> value_comp() <span class="bold"><strong>const</strong></span>;
- <span class="type">allocator_type</span> get_allocator() <span class="bold"><strong>const</strong></span>;
- <span class="type"><span class="bold"><strong>const</strong></span> stored_allocator_type &amp;</span> get_stored_allocator() <span class="bold"><strong>const</strong></span>;
- <span class="type">stored_allocator_type &amp;</span> get_stored_allocator() ;
- <span class="type">iterator</span> begin() ;
- <span class="type">const_iterator</span> begin() <span class="bold"><strong>const</strong></span>;
- <span class="type">const_iterator</span> cbegin() <span class="bold"><strong>const</strong></span>;
- <span class="type">iterator</span> end() ;
- <span class="type">const_iterator</span> end() <span class="bold"><strong>const</strong></span>;
- <span class="type">const_iterator</span> cend() <span class="bold"><strong>const</strong></span>;
- <span class="type">reverse_iterator</span> rbegin() ;
- <span class="type">const_reverse_iterator</span> rbegin() <span class="bold"><strong>const</strong></span>;
- <span class="type">const_reverse_iterator</span> crbegin() <span class="bold"><strong>const</strong></span>;
- <span class="type">reverse_iterator</span> rend() ;
- <span class="type">const_reverse_iterator</span> rend() <span class="bold"><strong>const</strong></span>;
- <span class="type">const_reverse_iterator</span> crend() <span class="bold"><strong>const</strong></span>;
- <span class="type"><span class="bold"><strong>bool</strong></span></span> empty() <span class="bold"><strong>const</strong></span>;
- <span class="type">size_type</span> size() <span class="bold"><strong>const</strong></span>;
- <span class="type">size_type</span> max_size() <span class="bold"><strong>const</strong></span>;
- <span class="type"><span class="bold"><strong>void</strong></span></span> swap(flat_multiset &amp;) ;
- <span class="type">iterator</span> insert(<span class="bold"><strong>const</strong></span> T &amp;) ;
- <span class="type">iterator</span> insert(value_type &amp;&amp;) ;
- <span class="type">iterator</span> insert(const_iterator, <span class="bold"><strong>const</strong></span> T &amp;) ;
- <span class="type">iterator</span> insert(const_iterator, value_type &amp;&amp;) ;
- <span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>typename</strong></span> InputIterator&gt; <span class="type"><span class="bold"><strong>void</strong></span></span> insert(InputIterator, InputIterator) ;
- <span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>class</strong></span>... Args&gt; <span class="type">iterator</span> emplace(Args &amp;&amp;...) ;
- <span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>class</strong></span>... Args&gt; <span class="type">iterator</span> emplace_hint(const_iterator, Args &amp;&amp;...) ;
- <span class="type">iterator</span> erase(const_iterator) ;
- <span class="type">size_type</span> erase(<span class="bold"><strong>const</strong></span> key_type &amp;) ;
- <span class="type">iterator</span> erase(const_iterator, const_iterator) ;
- <span class="type"><span class="bold"><strong>void</strong></span></span> clear() ;
- <span class="type"><span class="bold"><strong>void</strong></span></span> shrink_to_fit() ;
- <span class="type">iterator</span> find(<span class="bold"><strong>const</strong></span> key_type &amp;) ;
- <span class="type">const_iterator</span> find(<span class="bold"><strong>const</strong></span> key_type &amp;) <span class="bold"><strong>const</strong></span>;
- <span class="type">size_type</span> count(<span class="bold"><strong>const</strong></span> key_type &amp;) <span class="bold"><strong>const</strong></span>;
- <span class="type">iterator</span> lower_bound(<span class="bold"><strong>const</strong></span> key_type &amp;) ;
- <span class="type">const_iterator</span> lower_bound(<span class="bold"><strong>const</strong></span> key_type &amp;) <span class="bold"><strong>const</strong></span>;
- <span class="type">iterator</span> upper_bound(<span class="bold"><strong>const</strong></span> key_type &amp;) ;
- <span class="type">const_iterator</span> upper_bound(<span class="bold"><strong>const</strong></span> key_type &amp;) <span class="bold"><strong>const</strong></span>;
- <span class="type">std::pair&lt; const_iterator, const_iterator &gt;</span>
- equal_range(<span class="bold"><strong>const</strong></span> key_type &amp;) <span class="bold"><strong>const</strong></span>;
- <span class="type">std::pair&lt; iterator, iterator &gt;</span> equal_range(<span class="bold"><strong>const</strong></span> key_type &amp;) ;
- <span class="type">size_type</span> capacity() <span class="bold"><strong>const</strong></span>;
- <span class="type"><span class="bold"><strong>void</strong></span></span> reserve(size_type) ;
-};</pre></div>
+ <span class="comment">// public member functions</span>
+ <span class="identifier">key_compare</span> key_comp<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">value_compare</span> value_comp<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">allocator_type</span> get_allocator<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="keyword">const</span> <span class="identifier">stored_allocator_type</span> <span class="special">&amp;</span> get_stored_allocator<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">stored_allocator_type</span> <span class="special">&amp;</span> get_stored_allocator<span class="special">(</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">iterator</span> begin<span class="special">(</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">const_iterator</span> begin<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">const_iterator</span> cbegin<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">iterator</span> end<span class="special">(</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">const_iterator</span> end<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">const_iterator</span> cend<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">reverse_iterator</span> rbegin<span class="special">(</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">const_reverse_iterator</span> rbegin<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">const_reverse_iterator</span> crbegin<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">reverse_iterator</span> rend<span class="special">(</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">const_reverse_iterator</span> rend<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">const_reverse_iterator</span> crend<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="keyword">bool</span> empty<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">size_type</span> size<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">size_type</span> max_size<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="keyword">void</span> swap<span class="special">(</span>flat_multiset <span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">iterator</span> insert<span class="special">(</span><span class="keyword">const</span> <span class="identifier">T</span> <span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">iterator</span> insert<span class="special">(</span><span class="identifier">value_type</span> <span class="special">&amp;&amp;</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">iterator</span> insert<span class="special">(</span><span class="identifier">const_iterator</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">T</span> <span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">iterator</span> insert<span class="special">(</span><span class="identifier">const_iterator</span><span class="special">,</span> <span class="identifier">value_type</span> <span class="special">&amp;&amp;</span><span class="special">)</span><span class="special">;</span>
+ <span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> InputIterator<span class="special">&gt;</span> <span class="keyword">void</span> insert<span class="special">(</span><span class="identifier">InputIterator</span><span class="special">,</span> <span class="identifier">InputIterator</span><span class="special">)</span><span class="special">;</span>
+ <span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span><span class="special">...</span> Args<span class="special">&gt;</span> <span class="identifier">iterator</span> emplace<span class="special">(</span><span class="identifier">Args</span> <span class="special">&amp;&amp;</span><span class="special">...</span><span class="special">)</span><span class="special">;</span>
+ <span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span><span class="special">...</span> Args<span class="special">&gt;</span> <span class="identifier">iterator</span> emplace_hint<span class="special">(</span><span class="identifier">const_iterator</span><span class="special">,</span> <span class="identifier">Args</span> <span class="special">&amp;&amp;</span><span class="special">...</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">iterator</span> erase<span class="special">(</span><span class="identifier">const_iterator</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">size_type</span> erase<span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">iterator</span> erase<span class="special">(</span><span class="identifier">const_iterator</span><span class="special">,</span> <span class="identifier">const_iterator</span><span class="special">)</span><span class="special">;</span>
+ <span class="keyword">void</span> clear<span class="special">(</span><span class="special">)</span><span class="special">;</span>
+ <span class="keyword">void</span> shrink_to_fit<span class="special">(</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">iterator</span> find<span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">const_iterator</span> find<span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">size_type</span> count<span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">iterator</span> lower_bound<span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">const_iterator</span> lower_bound<span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">iterator</span> upper_bound<span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">const_iterator</span> upper_bound<span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span> <span class="identifier">const_iterator</span><span class="special">,</span> <span class="identifier">const_iterator</span> <span class="special">&gt;</span>
+ equal_range<span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span> <span class="identifier">iterator</span><span class="special">,</span> <span class="identifier">iterator</span> <span class="special">&gt;</span> equal_range<span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">size_type</span> capacity<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="keyword">void</span> reserve<span class="special">(</span><span class="identifier">size_type</span><span class="special">)</span><span class="special">;</span>
+<span class="special">}</span><span class="special">;</span></pre></div>
 <div class="refsect1" lang="en">
-<a name="id489304"></a><h2>Description</h2>
+<a name="id779927"></a><h2>Description</h2>
 <p>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.</p>
 <p>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</p>
 <p>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. </p>
 <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(<span class="bold"><strong>const</strong></span> Pred &amp; comp = Pred(),
- <span class="bold"><strong>const</strong></span> allocator_type &amp; a = allocator_type());</pre></li>
-<li><pre class="literallayout"><span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>typename</strong></span> InputIterator&gt;
- <a name="id303386-bb"></a>flat_multiset(InputIterator first, InputIterator last,
- <span class="bold"><strong>const</strong></span> Pred &amp; comp = Pred(),
- <span class="bold"><strong>const</strong></span> allocator_type &amp; a = allocator_type());</pre></li>
-<li>
-<pre class="literallayout"><span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>typename</strong></span> InputIterator&gt;
- <a name="id303567-bb"></a>flat_multiset(ordered_range_t, InputIterator first, InputIterator last,
- <span class="bold"><strong>const</strong></span> Pred &amp; comp = Pred(),
- <span class="bold"><strong>const</strong></span> allocator_type &amp; a = allocator_type());</pre>
+<li><pre class="literallayout"><a name="id382992-bb"></a><span class="identifier">flat_multiset</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">Pred</span> <span class="special">&amp;</span> comp <span class="special">=</span> <span class="identifier">Pred</span><span class="special">(</span><span class="special">)</span><span class="special">,</span>
+ <span class="keyword">const</span> <span class="identifier">allocator_type</span> <span class="special">&amp;</span> a <span class="special">=</span> <span class="identifier">allocator_type</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span></pre></li>
+<li><pre class="literallayout"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> InputIterator<span class="special">&gt;</span>
+ <a name="id383008-bb"></a><span class="identifier">flat_multiset</span><span class="special">(</span><span class="identifier">InputIterator</span> first<span class="special">,</span> <span class="identifier">InputIterator</span> last<span class="special">,</span>
+ <span class="keyword">const</span> <span class="identifier">Pred</span> <span class="special">&amp;</span> comp <span class="special">=</span> <span class="identifier">Pred</span><span class="special">(</span><span class="special">)</span><span class="special">,</span>
+ <span class="keyword">const</span> <span class="identifier">allocator_type</span> <span class="special">&amp;</span> a <span class="special">=</span> <span class="identifier">allocator_type</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span></pre></li>
+<li>
+<pre class="literallayout"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> InputIterator<span class="special">&gt;</span>
+ <a name="id383039-bb"></a><span class="identifier">flat_multiset</span><span class="special">(</span><span class="identifier">ordered_range_t</span><span class="special">,</span> <span class="identifier">InputIterator</span> first<span class="special">,</span> <span class="identifier">InputIterator</span> last<span class="special">,</span>
+ <span class="keyword">const</span> <span class="identifier">Pred</span> <span class="special">&amp;</span> comp <span class="special">=</span> <span class="identifier">Pred</span><span class="special">(</span><span class="special">)</span><span class="special">,</span>
+ <span class="keyword">const</span> <span class="identifier">allocator_type</span> <span class="special">&amp;</span> a <span class="special">=</span> <span class="identifier">allocator_type</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: 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.</p>
 <p><span class="bold"><strong>Requires</strong></span>: [first ,last) must be ordered according to the predicate.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Linear in N. </p>
 </li>
-<li><pre class="literallayout"><a name="id303623-bb"></a>flat_multiset(<span class="bold"><strong>const</strong></span> flat_multiset&lt; T, Pred, Alloc &gt; &amp; x);</pre></li>
-<li><pre class="literallayout"><a name="id303633-bb"></a>flat_multiset(flat_multiset &amp;&amp; x);</pre></li>
-<li><pre class="literallayout">flat_multiset&amp; <a name="id303641-bb"></a><span class="bold"><strong>operator</strong></span>=(<span class="bold"><strong>const</strong></span> flat_multiset &amp; x);</pre></li>
-<li><pre class="literallayout">flat_multiset&amp; <a name="id303651-bb"></a><span class="bold"><strong>operator</strong></span>=(flat_multiset &amp;&amp; mx);</pre></li>
+<li><pre class="literallayout"><a name="id383096-bb"></a><span class="identifier">flat_multiset</span><span class="special">(</span><span class="keyword">const</span> flat_multiset<span class="special">&lt;</span> <span class="identifier">T</span><span class="special">,</span> <span class="identifier">Pred</span><span class="special">,</span> <span class="identifier">Alloc</span> <span class="special">&gt;</span> <span class="special">&amp;</span> x<span class="special">)</span><span class="special">;</span></pre></li>
+<li><pre class="literallayout"><a name="id383105-bb"></a><span class="identifier">flat_multiset</span><span class="special">(</span>flat_multiset <span class="special">&amp;&amp;</span> x<span class="special">)</span><span class="special">;</span></pre></li>
+<li><pre class="literallayout">flat_multiset&amp; <a name="id383114-bb"></a><span class="keyword">operator</span><span class="special">=</span><span class="special">(</span><span class="keyword">const</span> flat_multiset <span class="special">&amp;</span> x<span class="special">)</span><span class="special">;</span></pre></li>
+<li><pre class="literallayout">flat_multiset&amp; <a name="id383123-bb"></a><span class="keyword">operator</span><span class="special">=</span><span class="special">(</span>flat_multiset <span class="special">&amp;&amp;</span> mx<span class="special">)</span><span class="special">;</span></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"><span class="type">key_compare</span> <a name="id302175-bb"></a>key_comp() <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">key_compare</span> <a name="id381797-bb"></a><span class="identifier">key_comp</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns the comparison object out of which a was constructed.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">value_compare</span> <a name="id302196-bb"></a>value_comp() <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">value_compare</span> <a name="id381818-bb"></a><span class="identifier">value_comp</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns an object of value_compare constructed out of the comparison object.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">allocator_type</span> <a name="id302215-bb"></a>get_allocator() <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">allocator_type</span> <a name="id381837-bb"></a><span class="identifier">get_allocator</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns a copy of the Allocator that was passed to the object's constructor.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
-<li><pre class="literallayout"><span class="type"><span class="bold"><strong>const</strong></span> stored_allocator_type &amp;</span> <a name="id302234-bb"></a>get_stored_allocator() <span class="bold"><strong>const</strong></span>;</pre></li>
-<li><pre class="literallayout"><span class="type">stored_allocator_type &amp;</span> <a name="id302240-bb"></a>get_stored_allocator() ;</pre></li>
+<li><pre class="literallayout"><span class="keyword">const</span> <span class="identifier">stored_allocator_type</span> <span class="special">&amp;</span> <a name="id381856-bb"></a><span class="identifier">get_stored_allocator</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre></li>
+<li><pre class="literallayout"><span class="identifier">stored_allocator_type</span> <span class="special">&amp;</span> <a name="id381862-bb"></a><span class="identifier">get_stored_allocator</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre></li>
 <li>
-<pre class="literallayout"><span class="type">iterator</span> <a name="id302246-bb"></a>begin() ;</pre>
+<pre class="literallayout"><span class="identifier">iterator</span> <a name="id381868-bb"></a><span class="identifier">begin</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns an iterator to the first element contained in the container.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">const_iterator</span> <a name="id302271-bb"></a>begin() <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">const_iterator</span> <a name="id381893-bb"></a><span class="identifier">begin</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns a const_iterator to the first element contained in the container.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">const_iterator</span> <a name="id302297-bb"></a>cbegin() <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">const_iterator</span> <a name="id381918-bb"></a><span class="identifier">cbegin</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns a const_iterator to the first element contained in the container.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">iterator</span> <a name="id302322-bb"></a>end() ;</pre>
+<pre class="literallayout"><span class="identifier">iterator</span> <a name="id381944-bb"></a><span class="identifier">end</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns an iterator to the end of the container.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">const_iterator</span> <a name="id302347-bb"></a>end() <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">const_iterator</span> <a name="id381969-bb"></a><span class="identifier">end</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns a const_iterator to the end of the container.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">const_iterator</span> <a name="id302372-bb"></a>cend() <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">const_iterator</span> <a name="id381994-bb"></a><span class="identifier">cend</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns a const_iterator to the end of the container.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">reverse_iterator</span> <a name="id302397-bb"></a>rbegin() ;</pre>
+<pre class="literallayout"><span class="identifier">reverse_iterator</span> <a name="id382019-bb"></a><span class="identifier">rbegin</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns a reverse_iterator pointing to the beginning of the reversed container.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">const_reverse_iterator</span> <a name="id302423-bb"></a>rbegin() <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">const_reverse_iterator</span> <a name="id382044-bb"></a><span class="identifier">rbegin</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns a const_reverse_iterator pointing to the beginning of the reversed container.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">const_reverse_iterator</span> <a name="id302448-bb"></a>crbegin() <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">const_reverse_iterator</span> <a name="id382070-bb"></a><span class="identifier">crbegin</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns a const_reverse_iterator pointing to the beginning of the reversed container.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">reverse_iterator</span> <a name="id302473-bb"></a>rend() ;</pre>
+<pre class="literallayout"><span class="identifier">reverse_iterator</span> <a name="id382095-bb"></a><span class="identifier">rend</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns a reverse_iterator pointing to the end of the reversed container.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">const_reverse_iterator</span> <a name="id302498-bb"></a>rend() <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">const_reverse_iterator</span> <a name="id382120-bb"></a><span class="identifier">rend</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns a const_reverse_iterator pointing to the end of the reversed container.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">const_reverse_iterator</span> <a name="id302523-bb"></a>crend() <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">const_reverse_iterator</span> <a name="id382145-bb"></a><span class="identifier">crend</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns a const_reverse_iterator pointing to the end of the reversed container.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type"><span class="bold"><strong>bool</strong></span></span> <a name="id302549-bb"></a>empty() <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="keyword">bool</span> <a name="id382170-bb"></a><span class="identifier">empty</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns true if the container contains no elements.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">size_type</span> <a name="id302574-bb"></a>size() <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">size_type</span> <a name="id382196-bb"></a><span class="identifier">size</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns the number of the elements contained in the container.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">size_type</span> <a name="id302599-bb"></a>max_size() <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">size_type</span> <a name="id382221-bb"></a><span class="identifier">max_size</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns the largest possible size of the container.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type"><span class="bold"><strong>void</strong></span></span> <a name="id302624-bb"></a>swap(flat_multiset &amp; x) ;</pre>
+<pre class="literallayout"><span class="keyword">void</span> <a name="id382246-bb"></a><span class="identifier">swap</span><span class="special">(</span>flat_multiset <span class="special">&amp;</span> x<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Swaps the contents of *this and x. If this-&gt;allocator_type() != x.allocator_type() allocators are also swapped.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">iterator</span> <a name="id302657-bb"></a>insert(<span class="bold"><strong>const</strong></span> T &amp; x) ;</pre>
+<pre class="literallayout"><span class="identifier">iterator</span> <a name="id382278-bb"></a><span class="identifier">insert</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">T</span> <span class="special">&amp;</span> x<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Inserts x and returns the iterator pointing to the newly inserted element.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic search time plus linear insertion to the elements with bigger keys than x.</p>
 <p><span class="bold"><strong>Note</strong></span>: If an element it's inserted it might invalidate elements. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">iterator</span> <a name="id302688-bb"></a>insert(value_type &amp;&amp; x) ;</pre>
+<pre class="literallayout"><span class="identifier">iterator</span> <a name="id382310-bb"></a><span class="identifier">insert</span><span class="special">(</span><span class="identifier">value_type</span> <span class="special">&amp;&amp;</span> x<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Inserts a new value_type move constructed from x and returns the iterator pointing to the newly inserted element.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic search time plus linear insertion to the elements with bigger keys than x.</p>
 <p><span class="bold"><strong>Note</strong></span>: If an element it's inserted it might invalidate elements. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">iterator</span> <a name="id302719-bb"></a>insert(const_iterator p, <span class="bold"><strong>const</strong></span> T &amp; x) ;</pre>
+<pre class="literallayout"><span class="identifier">iterator</span> <a name="id382341-bb"></a><span class="identifier">insert</span><span class="special">(</span><span class="identifier">const_iterator</span> p<span class="special">,</span> <span class="keyword">const</span> <span class="identifier">T</span> <span class="special">&amp;</span> x<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Inserts a copy of x in the container. p is a hint pointing to where the insert should start to search.</p>
 <p><span class="bold"><strong>Returns</strong></span>: An iterator pointing to the element with key equivalent to the key of x.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic search time (constant if x is inserted right before p) plus insertion linear to the elements with bigger keys than x.</p>
 <p><span class="bold"><strong>Note</strong></span>: If an element it's inserted it might invalidate elements. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">iterator</span> <a name="id302761-bb"></a>insert(const_iterator position, value_type &amp;&amp; x) ;</pre>
+<pre class="literallayout"><span class="identifier">iterator</span> <a name="id382383-bb"></a><span class="identifier">insert</span><span class="special">(</span><span class="identifier">const_iterator</span> position<span class="special">,</span> <span class="identifier">value_type</span> <span class="special">&amp;&amp;</span> x<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Inserts a new value move constructed from x in the container. p is a hint pointing to where the insert should start to search.</p>
 <p><span class="bold"><strong>Returns</strong></span>: An iterator pointing to the element with key equivalent to the key of x.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic search time (constant if x is inserted right before p) plus insertion linear to the elements with bigger keys than x.</p>
 <p><span class="bold"><strong>Note</strong></span>: If an element it's inserted it might invalidate elements. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>typename</strong></span> InputIterator&gt;
- <span class="type"><span class="bold"><strong>void</strong></span></span> <a name="id302803-bb"></a>insert(InputIterator first, InputIterator last) ;</pre>
+<pre class="literallayout"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> InputIterator<span class="special">&gt;</span>
+ <span class="keyword">void</span> <a name="id382425-bb"></a><span class="identifier">insert</span><span class="special">(</span><span class="identifier">InputIterator</span> first<span class="special">,</span> <span class="identifier">InputIterator</span> last<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Requires</strong></span>: i, j are not iterators into *this.</p>
 <p><span class="bold"><strong>Effects</strong></span>: inserts each element from the range [i,j) .</p>
 <p><span class="bold"><strong>Complexity</strong></span>: N log(size()+N) (N is the distance from i to j) search time plus N*size() insertion time.</p>
 <p><span class="bold"><strong>Note</strong></span>: If an element it's inserted it might invalidate elements. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>class</strong></span>... Args&gt; <span class="type">iterator</span> <a name="id302851-bb"></a>emplace(Args &amp;&amp;... args) ;</pre>
+<pre class="literallayout"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span><span class="special">...</span> Args<span class="special">&gt;</span> <span class="identifier">iterator</span> <a name="id382473-bb"></a><span class="identifier">emplace</span><span class="special">(</span><span class="identifier">Args</span> <span class="special">&amp;&amp;</span><span class="special">...</span> args<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Inserts an object of type T constructed with std::forward&lt;Args&gt;(args)... and returns the iterator pointing to the newly inserted element.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic search time plus linear insertion to the elements with bigger keys than x.</p>
 <p><span class="bold"><strong>Note</strong></span>: If an element it's inserted it might invalidate elements. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>class</strong></span>... Args&gt;
- <span class="type">iterator</span> <a name="id302891-bb"></a>emplace_hint(const_iterator hint, Args &amp;&amp;... args) ;</pre>
+<pre class="literallayout"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span><span class="special">...</span> Args<span class="special">&gt;</span>
+ <span class="identifier">iterator</span> <a name="id382512-bb"></a><span class="identifier">emplace_hint</span><span class="special">(</span><span class="identifier">const_iterator</span> hint<span class="special">,</span> <span class="identifier">Args</span> <span class="special">&amp;&amp;</span><span class="special">...</span> args<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Inserts an object of type T constructed with std::forward&lt;Args&gt;(args)... in the container. p is a hint pointing to where the insert should start to search.</p>
 <p><span class="bold"><strong>Returns</strong></span>: An iterator pointing to the element with key equivalent to the key of x.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic search time (constant if x is inserted right before p) plus insertion linear to the elements with bigger keys than x.</p>
 <p><span class="bold"><strong>Note</strong></span>: If an element it's inserted it might invalidate elements. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">iterator</span> <a name="id302941-bb"></a>erase(const_iterator position) ;</pre>
+<pre class="literallayout"><span class="identifier">iterator</span> <a name="id382563-bb"></a><span class="identifier">erase</span><span class="special">(</span><span class="identifier">const_iterator</span> position<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Erases the element pointed to by position.</p>
 <p><span class="bold"><strong>Returns</strong></span>: Returns an iterator pointing to the element immediately following q prior to the element being erased. If no such element exists, returns end().</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Linear to the elements with keys bigger than position</p>
 <p><span class="bold"><strong>Note</strong></span>: Invalidates elements with keys not less than the erased element. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">size_type</span> <a name="id302977-bb"></a>erase(<span class="bold"><strong>const</strong></span> key_type &amp; x) ;</pre>
+<pre class="literallayout"><span class="identifier">size_type</span> <a name="id382599-bb"></a><span class="identifier">erase</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span> x<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Erases all elements in the container with key equivalent to x.</p>
 <p><span class="bold"><strong>Returns</strong></span>: Returns the number of erased elements.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic search time plus erasure time linear to the elements with bigger keys. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">iterator</span> <a name="id303007-bb"></a>erase(const_iterator first, const_iterator last) ;</pre>
+<pre class="literallayout"><span class="identifier">iterator</span> <a name="id382629-bb"></a><span class="identifier">erase</span><span class="special">(</span><span class="identifier">const_iterator</span> first<span class="special">,</span> <span class="identifier">const_iterator</span> last<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Erases all the elements in the range [first, last).</p>
 <p><span class="bold"><strong>Returns</strong></span>: Returns last.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: size()*N where N is the distance from first to last.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic search time plus erasure time linear to the elements with bigger keys. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type"><span class="bold"><strong>void</strong></span></span> <a name="id303048-bb"></a>clear() ;</pre>
+<pre class="literallayout"><span class="keyword">void</span> <a name="id382670-bb"></a><span class="identifier">clear</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: erase(a.begin(),a.end()).</p>
 <p><span class="bold"><strong>Postcondition</strong></span>: size() == 0.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: linear in size(). </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type"><span class="bold"><strong>void</strong></span></span> <a name="id303073-bb"></a>shrink_to_fit() ;</pre>
+<pre class="literallayout"><span class="keyword">void</span> <a name="id382695-bb"></a><span class="identifier">shrink_to_fit</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre>
 <span class="bold"><strong>Effects</strong></span>: Tries to deallocate the excess of memory created <p><span class="bold"><strong>Throws</strong></span>: If memory allocation throws, or T's copy constructor throws.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Linear to size(). </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">iterator</span> <a name="id303099-bb"></a>find(<span class="bold"><strong>const</strong></span> key_type &amp; x) ;</pre>
+<pre class="literallayout"><span class="identifier">iterator</span> <a name="id382721-bb"></a><span class="identifier">find</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span> x<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Returns</strong></span>: An iterator pointing to an element with the key equivalent to x, or end() if such an element is not found.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">const_iterator</span> <a name="id303123-bb"></a>find(<span class="bold"><strong>const</strong></span> key_type &amp; x) <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">const_iterator</span> <a name="id382745-bb"></a><span class="identifier">find</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span> x<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Returns</strong></span>: A const_iterator pointing to an element with the key equivalent to x, or end() if such an element is not found.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic.s </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">size_type</span> <a name="id303147-bb"></a>count(<span class="bold"><strong>const</strong></span> key_type &amp; x) <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">size_type</span> <a name="id382769-bb"></a><span class="identifier">count</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span> x<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Returns</strong></span>: The number of elements with key equivalent to x.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: log(size())+count(k) </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">iterator</span> <a name="id303171-bb"></a>lower_bound(<span class="bold"><strong>const</strong></span> key_type &amp; x) ;</pre>
+<pre class="literallayout"><span class="identifier">iterator</span> <a name="id382793-bb"></a><span class="identifier">lower_bound</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span> x<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Returns</strong></span>: An iterator pointing to the first element with key not less than k, or a.end() if such an element is not found.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">const_iterator</span> <a name="id303195-bb"></a>lower_bound(<span class="bold"><strong>const</strong></span> key_type &amp; x) <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">const_iterator</span> <a name="id382817-bb"></a><span class="identifier">lower_bound</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span> x<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Returns</strong></span>: A const iterator pointing to the first element with key not less than k, or a.end() if such an element is not found.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">iterator</span> <a name="id303219-bb"></a>upper_bound(<span class="bold"><strong>const</strong></span> key_type &amp; x) ;</pre>
+<pre class="literallayout"><span class="identifier">iterator</span> <a name="id382841-bb"></a><span class="identifier">upper_bound</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span> x<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Returns</strong></span>: An iterator pointing to the first element with key not less than x, or end() if such an element is not found.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">const_iterator</span> <a name="id303243-bb"></a>upper_bound(<span class="bold"><strong>const</strong></span> key_type &amp; x) <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">const_iterator</span> <a name="id382865-bb"></a><span class="identifier">upper_bound</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span> x<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Returns</strong></span>: A const iterator pointing to the first element with key not less than x, or end() if such an element is not found.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">std::pair&lt; const_iterator, const_iterator &gt;</span>
-<a name="id303267-bb"></a>equal_range(<span class="bold"><strong>const</strong></span> key_type &amp; x) <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span> <span class="identifier">const_iterator</span><span class="special">,</span> <span class="identifier">const_iterator</span> <span class="special">&gt;</span>
+<a name="id382889-bb"></a><span class="identifier">equal_range</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span> x<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Equivalent to std::make_pair(this-&gt;lower_bound(k), this-&gt;upper_bound(k)).</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">std::pair&lt; iterator, iterator &gt;</span> <a name="id303291-bb"></a>equal_range(<span class="bold"><strong>const</strong></span> key_type &amp; x) ;</pre>
+<pre class="literallayout"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span> <span class="identifier">iterator</span><span class="special">,</span> <span class="identifier">iterator</span> <span class="special">&gt;</span> <a name="id382913-bb"></a><span class="identifier">equal_range</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span> x<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Equivalent to std::make_pair(this-&gt;lower_bound(k), this-&gt;upper_bound(k)).</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">size_type</span> <a name="id303315-bb"></a>capacity() <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">size_type</span> <a name="id382937-bb"></a><span class="identifier">capacity</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Number of elements for which memory has been allocated. capacity() is always greater than or equal to size().</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type"><span class="bold"><strong>void</strong></span></span> <a name="id303341-bb"></a>reserve(size_type count) ;</pre>
+<pre class="literallayout"><span class="keyword">void</span> <a name="id382962-bb"></a><span class="identifier">reserve</span><span class="special">(</span><span class="identifier">size_type</span> count<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: 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.</p>
 <p><span class="bold"><strong>Throws</strong></span>: If memory allocation allocation throws or T's copy constructor throws.</p>
 <p><span class="bold"><strong>Note</strong></span>: If capacity() is less than "count", iterators and references to to values might be invalidated. </p>
@@ -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<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2009 -2011 Ion Gaztanaga<p>
         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)
       </p>
@@ -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&#160;1.&#160;Boost.Container">
 <link rel="up" href="../../boost_container_reference.html#header.boost.container.flat_set_hpp" title="Header &lt;boost/container/flat_set.hpp&gt;">
 <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 @@
 <p>boost::container::flat_set &#8212; </p>
 </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"><span class="emphasis"><em>// In header: &lt;boost/container/flat_set.hpp&gt;
+<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis"><span class="comment">// In header: &lt;boost/container/flat_set.hpp&gt;
 
-</em></span><span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>typename</strong></span> T, <span class="bold"><strong>typename</strong></span> Pred, <span class="bold"><strong>typename</strong></span> Alloc&gt;
-<span class="bold"><strong>class</strong></span> flat_set {
-<span class="bold"><strong>public</strong></span>:
- <span class="emphasis"><em>// types</em></span>
- <span class="bold"><strong>typedef</strong></span> tree_t::key_type <a name="boost.container.flat_set.key_type"></a>key_type;
- <span class="bold"><strong>typedef</strong></span> tree_t::value_type <a name="boost.container.flat_set.value_type"></a>value_type;
- <span class="bold"><strong>typedef</strong></span> tree_t::pointer <a name="boost.container.flat_set.pointer"></a>pointer;
- <span class="bold"><strong>typedef</strong></span> tree_t::const_pointer <a name="boost.container.flat_set.const_pointer"></a>const_pointer;
- <span class="bold"><strong>typedef</strong></span> tree_t::reference <a name="boost.container.flat_set.reference"></a>reference;
- <span class="bold"><strong>typedef</strong></span> tree_t::const_reference <a name="boost.container.flat_set.const_reference"></a>const_reference;
- <span class="bold"><strong>typedef</strong></span> tree_t::key_compare <a name="boost.container.flat_set.key_compare"></a>key_compare;
- <span class="bold"><strong>typedef</strong></span> tree_t::value_compare <a name="boost.container.flat_set.value_compare"></a>value_compare;
- <span class="bold"><strong>typedef</strong></span> tree_t::iterator <a name="boost.container.flat_set.iterator"></a>iterator;
- <span class="bold"><strong>typedef</strong></span> tree_t::const_iterator <a name="boost.container.flat_set.const_iterator"></a>const_iterator;
- <span class="bold"><strong>typedef</strong></span> tree_t::reverse_iterator <a name="boost.container.flat_set.reverse_iterator"></a>reverse_iterator;
- <span class="bold"><strong>typedef</strong></span> tree_t::const_reverse_iterator <a name="boost.container.flat_set.const_reverse_iterator"></a>const_reverse_iterator;
- <span class="bold"><strong>typedef</strong></span> tree_t::size_type <a name="boost.container.flat_set.size_type"></a>size_type;
- <span class="bold"><strong>typedef</strong></span> tree_t::difference_type <a name="boost.container.flat_set.difference_type"></a>difference_type;
- <span class="bold"><strong>typedef</strong></span> tree_t::allocator_type <a name="boost.container.flat_set.allocator_type"></a>allocator_type;
- <span class="bold"><strong>typedef</strong></span> tree_t::stored_allocator_type <a name="boost.container.flat_set.stored_allocator_type"></a>stored_allocator_type;
+</span><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> T<span class="special">,</span> <span class="keyword">typename</span> Pred<span class="special">,</span> <span class="keyword">typename</span> Alloc<span class="special">&gt;</span>
+<span class="keyword">class</span> flat_set <span class="special">{</span>
+<span class="keyword">public</span><span class="special">:</span>
+ <span class="comment">// types</span>
+ <span class="keyword">typedef</span> <span class="identifier">tree_t</span><span class="special">::</span><span class="identifier">key_type</span> <a name="boost.container.flat_set.key_type"></a><span class="identifier">key_type</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">tree_t</span><span class="special">::</span><span class="identifier">value_type</span> <a name="boost.container.flat_set.value_type"></a><span class="identifier">value_type</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">tree_t</span><span class="special">::</span><span class="identifier">pointer</span> <a name="boost.container.flat_set.pointer"></a><span class="identifier">pointer</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">tree_t</span><span class="special">::</span><span class="identifier">const_pointer</span> <a name="boost.container.flat_set.const_pointer"></a><span class="identifier">const_pointer</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">tree_t</span><span class="special">::</span><span class="identifier">reference</span> <a name="boost.container.flat_set.reference"></a><span class="identifier">reference</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">tree_t</span><span class="special">::</span><span class="identifier">const_reference</span> <a name="boost.container.flat_set.const_reference"></a><span class="identifier">const_reference</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">tree_t</span><span class="special">::</span><span class="identifier">key_compare</span> <a name="boost.container.flat_set.key_compare"></a><span class="identifier">key_compare</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">tree_t</span><span class="special">::</span><span class="identifier">value_compare</span> <a name="boost.container.flat_set.value_compare"></a><span class="identifier">value_compare</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">tree_t</span><span class="special">::</span><span class="identifier">iterator</span> <a name="boost.container.flat_set.iterator"></a><span class="identifier">iterator</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">tree_t</span><span class="special">::</span><span class="identifier">const_iterator</span> <a name="boost.container.flat_set.const_iterator"></a><span class="identifier">const_iterator</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">tree_t</span><span class="special">::</span><span class="identifier">reverse_iterator</span> <a name="boost.container.flat_set.reverse_iterator"></a><span class="identifier">reverse_iterator</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">tree_t</span><span class="special">::</span><span class="identifier">const_reverse_iterator</span> <a name="boost.container.flat_set.const_reverse_iterator"></a><span class="identifier">const_reverse_iterator</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">tree_t</span><span class="special">::</span><span class="identifier">size_type</span> <a name="boost.container.flat_set.size_type"></a><span class="identifier">size_type</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">tree_t</span><span class="special">::</span><span class="identifier">difference_type</span> <a name="boost.container.flat_set.difference_type"></a><span class="identifier">difference_type</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">tree_t</span><span class="special">::</span><span class="identifier">allocator_type</span> <a name="boost.container.flat_set.allocator_type"></a><span class="identifier">allocator_type</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">tree_t</span><span class="special">::</span><span class="identifier">stored_allocator_type</span> <a name="boost.container.flat_set.stored_allocator_type"></a><span class="identifier">stored_allocator_type</span><span class="special">;</span>
 
- <span class="emphasis"><em>// construct/copy/destruct</em></span>
- flat_set(<span class="bold"><strong>const</strong></span> Pred &amp; = Pred(), <span class="bold"><strong>const</strong></span> allocator_type &amp; = allocator_type());
- <span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>typename</strong></span> InputIterator&gt;
- flat_set(InputIterator, InputIterator, <span class="bold"><strong>const</strong></span> Pred &amp; = Pred(),
- <span class="bold"><strong>const</strong></span> allocator_type &amp; = allocator_type());
- <span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>typename</strong></span> InputIterator&gt;
- flat_set(ordered_unique_range_t, InputIterator, InputIterator,
- <span class="bold"><strong>const</strong></span> Pred &amp; = Pred(),
- <span class="bold"><strong>const</strong></span> allocator_type &amp; = allocator_type());
- flat_set(<span class="bold"><strong>const</strong></span> flat_set&lt; T, Pred, Alloc &gt; &amp;);
- flat_set(flat_set &amp;&amp;);
- flat_set&amp; operator=(<span class="bold"><strong>const</strong></span> flat_set &amp;);
- flat_set&amp; operator=(flat_set &amp;&amp;);
+ <span class="comment">// construct/copy/destruct</span>
+ flat_set<span class="special">(</span><span class="keyword">const</span> <span class="identifier">Pred</span> <span class="special">&amp;</span> <span class="special">=</span> <span class="identifier">Pred</span><span class="special">(</span><span class="special">)</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">allocator_type</span> <span class="special">&amp;</span> <span class="special">=</span> <span class="identifier">allocator_type</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span>
+ <span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> InputIterator<span class="special">&gt;</span>
+ flat_set<span class="special">(</span><span class="identifier">InputIterator</span><span class="special">,</span> <span class="identifier">InputIterator</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Pred</span> <span class="special">&amp;</span> <span class="special">=</span> <span class="identifier">Pred</span><span class="special">(</span><span class="special">)</span><span class="special">,</span>
+ <span class="keyword">const</span> <span class="identifier">allocator_type</span> <span class="special">&amp;</span> <span class="special">=</span> <span class="identifier">allocator_type</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span>
+ <span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> InputIterator<span class="special">&gt;</span>
+ flat_set<span class="special">(</span><span class="identifier">ordered_unique_range_t</span><span class="special">,</span> <span class="identifier">InputIterator</span><span class="special">,</span> <span class="identifier">InputIterator</span><span class="special">,</span>
+ <span class="keyword">const</span> <span class="identifier">Pred</span> <span class="special">&amp;</span> <span class="special">=</span> <span class="identifier">Pred</span><span class="special">(</span><span class="special">)</span><span class="special">,</span>
+ <span class="keyword">const</span> <span class="identifier">allocator_type</span> <span class="special">&amp;</span> <span class="special">=</span> <span class="identifier">allocator_type</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span>
+ flat_set<span class="special">(</span><span class="keyword">const</span> flat_set<span class="special">&lt;</span> <span class="identifier">T</span><span class="special">,</span> <span class="identifier">Pred</span><span class="special">,</span> <span class="identifier">Alloc</span> <span class="special">&gt;</span> <span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
+ flat_set<span class="special">(</span>flat_set <span class="special">&amp;&amp;</span><span class="special">)</span><span class="special">;</span>
+ flat_set&amp; operator=<span class="special">(</span><span class="keyword">const</span> flat_set <span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
+ flat_set&amp; operator=<span class="special">(</span>flat_set <span class="special">&amp;&amp;</span><span class="special">)</span><span class="special">;</span>
 
- <span class="emphasis"><em>// public member functions</em></span>
- <span class="type">key_compare</span> key_comp() <span class="bold"><strong>const</strong></span>;
- <span class="type">value_compare</span> value_comp() <span class="bold"><strong>const</strong></span>;
- <span class="type">allocator_type</span> get_allocator() <span class="bold"><strong>const</strong></span>;
- <span class="type"><span class="bold"><strong>const</strong></span> stored_allocator_type &amp;</span> get_stored_allocator() <span class="bold"><strong>const</strong></span>;
- <span class="type">stored_allocator_type &amp;</span> get_stored_allocator() ;
- <span class="type">iterator</span> begin() ;
- <span class="type">const_iterator</span> begin() <span class="bold"><strong>const</strong></span>;
- <span class="type">const_iterator</span> cbegin() <span class="bold"><strong>const</strong></span>;
- <span class="type">iterator</span> end() ;
- <span class="type">const_iterator</span> end() <span class="bold"><strong>const</strong></span>;
- <span class="type">const_iterator</span> cend() <span class="bold"><strong>const</strong></span>;
- <span class="type">reverse_iterator</span> rbegin() ;
- <span class="type">const_reverse_iterator</span> rbegin() <span class="bold"><strong>const</strong></span>;
- <span class="type">const_reverse_iterator</span> crbegin() <span class="bold"><strong>const</strong></span>;
- <span class="type">reverse_iterator</span> rend() ;
- <span class="type">const_reverse_iterator</span> rend() <span class="bold"><strong>const</strong></span>;
- <span class="type">const_reverse_iterator</span> crend() <span class="bold"><strong>const</strong></span>;
- <span class="type"><span class="bold"><strong>bool</strong></span></span> empty() <span class="bold"><strong>const</strong></span>;
- <span class="type">size_type</span> size() <span class="bold"><strong>const</strong></span>;
- <span class="type">size_type</span> max_size() <span class="bold"><strong>const</strong></span>;
- <span class="type"><span class="bold"><strong>void</strong></span></span> swap(flat_set &amp;) ;
- <span class="type">std::pair&lt; iterator, <span class="bold"><strong>bool</strong></span> &gt;</span> insert(<span class="bold"><strong>const</strong></span> T &amp;) ;
- <span class="type">std::pair&lt; iterator, <span class="bold"><strong>bool</strong></span> &gt;</span> insert(value_type &amp;&amp;) ;
- <span class="type">iterator</span> insert(const_iterator, <span class="bold"><strong>const</strong></span> T &amp;) ;
- <span class="type">iterator</span> insert(const_iterator, value_type &amp;&amp;) ;
- <span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>typename</strong></span> InputIterator&gt; <span class="type"><span class="bold"><strong>void</strong></span></span> insert(InputIterator, InputIterator) ;
- <span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>class</strong></span>... Args&gt; <span class="type">iterator</span> emplace(Args &amp;&amp;...) ;
- <span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>class</strong></span>... Args&gt; <span class="type">iterator</span> emplace_hint(const_iterator, Args &amp;&amp;...) ;
- <span class="type">iterator</span> erase(const_iterator) ;
- <span class="type">size_type</span> erase(<span class="bold"><strong>const</strong></span> key_type &amp;) ;
- <span class="type">iterator</span> erase(const_iterator, const_iterator) ;
- <span class="type"><span class="bold"><strong>void</strong></span></span> clear() ;
- <span class="type"><span class="bold"><strong>void</strong></span></span> shrink_to_fit() ;
- <span class="type">iterator</span> find(<span class="bold"><strong>const</strong></span> key_type &amp;) ;
- <span class="type">const_iterator</span> find(<span class="bold"><strong>const</strong></span> key_type &amp;) <span class="bold"><strong>const</strong></span>;
- <span class="type">size_type</span> count(<span class="bold"><strong>const</strong></span> key_type &amp;) <span class="bold"><strong>const</strong></span>;
- <span class="type">iterator</span> lower_bound(<span class="bold"><strong>const</strong></span> key_type &amp;) ;
- <span class="type">const_iterator</span> lower_bound(<span class="bold"><strong>const</strong></span> key_type &amp;) <span class="bold"><strong>const</strong></span>;
- <span class="type">iterator</span> upper_bound(<span class="bold"><strong>const</strong></span> key_type &amp;) ;
- <span class="type">const_iterator</span> upper_bound(<span class="bold"><strong>const</strong></span> key_type &amp;) <span class="bold"><strong>const</strong></span>;
- <span class="type">std::pair&lt; const_iterator, const_iterator &gt;</span>
- equal_range(<span class="bold"><strong>const</strong></span> key_type &amp;) <span class="bold"><strong>const</strong></span>;
- <span class="type">std::pair&lt; iterator, iterator &gt;</span> equal_range(<span class="bold"><strong>const</strong></span> key_type &amp;) ;
- <span class="type">size_type</span> capacity() <span class="bold"><strong>const</strong></span>;
- <span class="type"><span class="bold"><strong>void</strong></span></span> reserve(size_type) ;
-};</pre></div>
+ <span class="comment">// public member functions</span>
+ <span class="identifier">key_compare</span> key_comp<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">value_compare</span> value_comp<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">allocator_type</span> get_allocator<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="keyword">const</span> <span class="identifier">stored_allocator_type</span> <span class="special">&amp;</span> get_stored_allocator<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">stored_allocator_type</span> <span class="special">&amp;</span> get_stored_allocator<span class="special">(</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">iterator</span> begin<span class="special">(</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">const_iterator</span> begin<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">const_iterator</span> cbegin<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">iterator</span> end<span class="special">(</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">const_iterator</span> end<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">const_iterator</span> cend<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">reverse_iterator</span> rbegin<span class="special">(</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">const_reverse_iterator</span> rbegin<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">const_reverse_iterator</span> crbegin<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">reverse_iterator</span> rend<span class="special">(</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">const_reverse_iterator</span> rend<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">const_reverse_iterator</span> crend<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="keyword">bool</span> empty<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">size_type</span> size<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">size_type</span> max_size<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="keyword">void</span> swap<span class="special">(</span>flat_set <span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span> <span class="identifier">iterator</span><span class="special">,</span> <span class="keyword">bool</span> <span class="special">&gt;</span> insert<span class="special">(</span><span class="keyword">const</span> <span class="identifier">T</span> <span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span> <span class="identifier">iterator</span><span class="special">,</span> <span class="keyword">bool</span> <span class="special">&gt;</span> insert<span class="special">(</span><span class="identifier">value_type</span> <span class="special">&amp;&amp;</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">iterator</span> insert<span class="special">(</span><span class="identifier">const_iterator</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">T</span> <span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">iterator</span> insert<span class="special">(</span><span class="identifier">const_iterator</span><span class="special">,</span> <span class="identifier">value_type</span> <span class="special">&amp;&amp;</span><span class="special">)</span><span class="special">;</span>
+ <span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> InputIterator<span class="special">&gt;</span> <span class="keyword">void</span> insert<span class="special">(</span><span class="identifier">InputIterator</span><span class="special">,</span> <span class="identifier">InputIterator</span><span class="special">)</span><span class="special">;</span>
+ <span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span><span class="special">...</span> Args<span class="special">&gt;</span> <span class="identifier">iterator</span> emplace<span class="special">(</span><span class="identifier">Args</span> <span class="special">&amp;&amp;</span><span class="special">...</span><span class="special">)</span><span class="special">;</span>
+ <span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span><span class="special">...</span> Args<span class="special">&gt;</span> <span class="identifier">iterator</span> emplace_hint<span class="special">(</span><span class="identifier">const_iterator</span><span class="special">,</span> <span class="identifier">Args</span> <span class="special">&amp;&amp;</span><span class="special">...</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">iterator</span> erase<span class="special">(</span><span class="identifier">const_iterator</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">size_type</span> erase<span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">iterator</span> erase<span class="special">(</span><span class="identifier">const_iterator</span><span class="special">,</span> <span class="identifier">const_iterator</span><span class="special">)</span><span class="special">;</span>
+ <span class="keyword">void</span> clear<span class="special">(</span><span class="special">)</span><span class="special">;</span>
+ <span class="keyword">void</span> shrink_to_fit<span class="special">(</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">iterator</span> find<span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">const_iterator</span> find<span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">size_type</span> count<span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">iterator</span> lower_bound<span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">const_iterator</span> lower_bound<span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">iterator</span> upper_bound<span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">const_iterator</span> upper_bound<span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span> <span class="identifier">const_iterator</span><span class="special">,</span> <span class="identifier">const_iterator</span> <span class="special">&gt;</span>
+ equal_range<span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span> <span class="identifier">iterator</span><span class="special">,</span> <span class="identifier">iterator</span> <span class="special">&gt;</span> equal_range<span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">size_type</span> capacity<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="keyword">void</span> reserve<span class="special">(</span><span class="identifier">size_type</span><span class="special">)</span><span class="special">;</span>
+<span class="special">}</span><span class="special">;</span></pre></div>
 <div class="refsect1" lang="en">
-<a name="id484643"></a><h2>Description</h2>
+<a name="id770919"></a><h2>Description</h2>
 <p>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.</p>
 <p>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</p>
 <p>Erasing an element of a flat_set invalidates iterators and references pointing to elements that come after (their keys are bigger) the erased element. </p>
 <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(<span class="bold"><strong>const</strong></span> Pred &amp; comp = Pred(),
- <span class="bold"><strong>const</strong></span> allocator_type &amp; a = allocator_type());</pre>
+<pre class="literallayout"><a name="id381452-bb"></a><span class="identifier">flat_set</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">Pred</span> <span class="special">&amp;</span> comp <span class="special">=</span> <span class="identifier">Pred</span><span class="special">(</span><span class="special">)</span><span class="special">,</span>
+ <span class="keyword">const</span> <span class="identifier">allocator_type</span> <span class="special">&amp;</span> a <span class="special">=</span> <span class="identifier">allocator_type</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Constructs an empty flat_map using the specified comparison object and allocator.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>typename</strong></span> InputIterator&gt;
- <a name="id301877-bb"></a>flat_set(InputIterator first, InputIterator last,
- <span class="bold"><strong>const</strong></span> Pred &amp; comp = Pred(),
- <span class="bold"><strong>const</strong></span> allocator_type &amp; a = allocator_type());</pre>
+<pre class="literallayout"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> InputIterator<span class="special">&gt;</span>
+ <a name="id381481-bb"></a><span class="identifier">flat_set</span><span class="special">(</span><span class="identifier">InputIterator</span> first<span class="special">,</span> <span class="identifier">InputIterator</span> last<span class="special">,</span>
+ <span class="keyword">const</span> <span class="identifier">Pred</span> <span class="special">&amp;</span> comp <span class="special">=</span> <span class="identifier">Pred</span><span class="special">(</span><span class="special">)</span><span class="special">,</span>
+ <span class="keyword">const</span> <span class="identifier">allocator_type</span> <span class="special">&amp;</span> a <span class="special">=</span> <span class="identifier">allocator_type</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Constructs an empty map using the specified comparison object and allocator, and inserts elements from the range [first ,last ).</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Linear in N if the range [first ,last ) is already sorted using comp and otherwise N logN, where N is last - first. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>typename</strong></span> InputIterator&gt;
- <a name="id301921-bb"></a>flat_set(ordered_unique_range_t, InputIterator first, InputIterator last,
- <span class="bold"><strong>const</strong></span> Pred &amp; comp = Pred(),
- <span class="bold"><strong>const</strong></span> allocator_type &amp; a = allocator_type());</pre>
+<pre class="literallayout"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> InputIterator<span class="special">&gt;</span>
+ <a name="id381525-bb"></a><span class="identifier">flat_set</span><span class="special">(</span><span class="identifier">ordered_unique_range_t</span><span class="special">,</span> <span class="identifier">InputIterator</span> first<span class="special">,</span> <span class="identifier">InputIterator</span> last<span class="special">,</span>
+ <span class="keyword">const</span> <span class="identifier">Pred</span> <span class="special">&amp;</span> comp <span class="special">=</span> <span class="identifier">Pred</span><span class="special">(</span><span class="special">)</span><span class="special">,</span>
+ <span class="keyword">const</span> <span class="identifier">allocator_type</span> <span class="special">&amp;</span> a <span class="special">=</span> <span class="identifier">allocator_type</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: 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.</p>
 <p><span class="bold"><strong>Requires</strong></span>: [first ,last) must be ordered according to the predicate and must be unique values.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Linear in N. </p>
 </li>
 <li>
-<pre class="literallayout"><a name="id301976-bb"></a>flat_set(<span class="bold"><strong>const</strong></span> flat_set&lt; T, Pred, Alloc &gt; &amp; x);</pre>
+<pre class="literallayout"><a name="id381598-bb"></a><span class="identifier">flat_set</span><span class="special">(</span><span class="keyword">const</span> flat_set<span class="special">&lt;</span> <span class="identifier">T</span><span class="special">,</span> <span class="identifier">Pred</span><span class="special">,</span> <span class="identifier">Alloc</span> <span class="special">&gt;</span> <span class="special">&amp;</span> x<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Copy constructs a map.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Linear in x.size(). </p>
 </li>
 <li>
-<pre class="literallayout"><a name="id301999-bb"></a>flat_set(flat_set &amp;&amp; mx);</pre>
+<pre class="literallayout"><a name="id381621-bb"></a><span class="identifier">flat_set</span><span class="special">(</span>flat_set <span class="special">&amp;&amp;</span> mx<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Move constructs a map. Constructs *this using x's resources.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Construct.</p>
 <p><span class="bold"><strong>Postcondition</strong></span>: x is emptied. </p>
 </li>
 <li>
-<pre class="literallayout">flat_set&amp; <a name="id302028-bb"></a><span class="bold"><strong>operator</strong></span>=(<span class="bold"><strong>const</strong></span> flat_set &amp; x);</pre>
+<pre class="literallayout">flat_set&amp; <a name="id381650-bb"></a><span class="keyword">operator</span><span class="special">=</span><span class="special">(</span><span class="keyword">const</span> flat_set <span class="special">&amp;</span> x<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Makes *this a copy of x.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Linear in x.size(). </p>
 </li>
 <li>
-<pre class="literallayout">flat_set&amp; <a name="id302051-bb"></a><span class="bold"><strong>operator</strong></span>=(flat_set &amp;&amp; mx);</pre>
+<pre class="literallayout">flat_set&amp; <a name="id381672-bb"></a><span class="keyword">operator</span><span class="special">=</span><span class="special">(</span>flat_set <span class="special">&amp;&amp;</span> mx<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Makes *this a copy of x.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Linear in x.size(). </p>
 </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"><span class="type">key_compare</span> <a name="id298654-bb"></a>key_comp() <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">key_compare</span> <a name="id380239-bb"></a><span class="identifier">key_comp</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns the comparison object out of which a was constructed.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">value_compare</span> <a name="id298675-bb"></a>value_comp() <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">value_compare</span> <a name="id380259-bb"></a><span class="identifier">value_comp</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns an object of value_compare constructed out of the comparison object.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">allocator_type</span> <a name="id298694-bb"></a>get_allocator() <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">allocator_type</span> <a name="id380278-bb"></a><span class="identifier">get_allocator</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns a copy of the Allocator that was passed to the object's constructor.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
-<li><pre class="literallayout"><span class="type"><span class="bold"><strong>const</strong></span> stored_allocator_type &amp;</span> <a name="id298713-bb"></a>get_stored_allocator() <span class="bold"><strong>const</strong></span>;</pre></li>
-<li><pre class="literallayout"><span class="type">stored_allocator_type &amp;</span> <a name="id298719-bb"></a>get_stored_allocator() ;</pre></li>
+<li><pre class="literallayout"><span class="keyword">const</span> <span class="identifier">stored_allocator_type</span> <span class="special">&amp;</span> <a name="id380298-bb"></a><span class="identifier">get_stored_allocator</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre></li>
+<li><pre class="literallayout"><span class="identifier">stored_allocator_type</span> <span class="special">&amp;</span> <a name="id380304-bb"></a><span class="identifier">get_stored_allocator</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre></li>
 <li>
-<pre class="literallayout"><span class="type">iterator</span> <a name="id298725-bb"></a>begin() ;</pre>
+<pre class="literallayout"><span class="identifier">iterator</span> <a name="id380310-bb"></a><span class="identifier">begin</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns an iterator to the first element contained in the container.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">const_iterator</span> <a name="id298750-bb"></a>begin() <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">const_iterator</span> <a name="id380335-bb"></a><span class="identifier">begin</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns a const_iterator to the first element contained in the container.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">const_iterator</span> <a name="id298776-bb"></a>cbegin() <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">const_iterator</span> <a name="id380360-bb"></a><span class="identifier">cbegin</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns a const_iterator to the first element contained in the container.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">iterator</span> <a name="id298801-bb"></a>end() ;</pre>
+<pre class="literallayout"><span class="identifier">iterator</span> <a name="id380385-bb"></a><span class="identifier">end</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns an iterator to the end of the container.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">const_iterator</span> <a name="id298826-bb"></a>end() <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">const_iterator</span> <a name="id380410-bb"></a><span class="identifier">end</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns a const_iterator to the end of the container.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">const_iterator</span> <a name="id298851-bb"></a>cend() <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">const_iterator</span> <a name="id380436-bb"></a><span class="identifier">cend</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns a const_iterator to the end of the container.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">reverse_iterator</span> <a name="id298876-bb"></a>rbegin() ;</pre>
+<pre class="literallayout"><span class="identifier">reverse_iterator</span> <a name="id380461-bb"></a><span class="identifier">rbegin</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns a reverse_iterator pointing to the beginning of the reversed container.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">const_reverse_iterator</span> <a name="id298902-bb"></a>rbegin() <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">const_reverse_iterator</span> <a name="id380486-bb"></a><span class="identifier">rbegin</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns a const_reverse_iterator pointing to the beginning of the reversed container.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">const_reverse_iterator</span> <a name="id298927-bb"></a>crbegin() <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">const_reverse_iterator</span> <a name="id380511-bb"></a><span class="identifier">crbegin</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns a const_reverse_iterator pointing to the beginning of the reversed container.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">reverse_iterator</span> <a name="id298952-bb"></a>rend() ;</pre>
+<pre class="literallayout"><span class="identifier">reverse_iterator</span> <a name="id380536-bb"></a><span class="identifier">rend</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns a reverse_iterator pointing to the end of the reversed container.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">const_reverse_iterator</span> <a name="id298977-bb"></a>rend() <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">const_reverse_iterator</span> <a name="id380562-bb"></a><span class="identifier">rend</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns a const_reverse_iterator pointing to the end of the reversed container.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">const_reverse_iterator</span> <a name="id299002-bb"></a>crend() <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">const_reverse_iterator</span> <a name="id380587-bb"></a><span class="identifier">crend</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns a const_reverse_iterator pointing to the end of the reversed container.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type"><span class="bold"><strong>bool</strong></span></span> <a name="id299028-bb"></a>empty() <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="keyword">bool</span> <a name="id380612-bb"></a><span class="identifier">empty</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns true if the container contains no elements.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">size_type</span> <a name="id299053-bb"></a>size() <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">size_type</span> <a name="id380637-bb"></a><span class="identifier">size</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns the number of the elements contained in the container.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">size_type</span> <a name="id299078-bb"></a>max_size() <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">size_type</span> <a name="id380662-bb"></a><span class="identifier">max_size</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Returns the largest possible size of the container.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type"><span class="bold"><strong>void</strong></span></span> <a name="id299103-bb"></a>swap(flat_set &amp; x) ;</pre>
+<pre class="literallayout"><span class="keyword">void</span> <a name="id380688-bb"></a><span class="identifier">swap</span><span class="special">(</span>flat_set <span class="special">&amp;</span> x<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Swaps the contents of *this and x. If this-&gt;allocator_type() != x.allocator_type() allocators are also swapped.</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">std::pair&lt; iterator, <span class="bold"><strong>bool</strong></span> &gt;</span> <a name="id299136-bb"></a>insert(<span class="bold"><strong>const</strong></span> T &amp; x) ;</pre>
+<pre class="literallayout"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span> <span class="identifier">iterator</span><span class="special">,</span> <span class="keyword">bool</span> <span class="special">&gt;</span> <a name="id380720-bb"></a><span class="identifier">insert</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">T</span> <span class="special">&amp;</span> x<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Inserts x if and only if there is no element in the container with key equivalent to the key of x.</p>
 <p><span class="bold"><strong>Returns</strong></span>: 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.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic search time plus linear insertion to the elements with bigger keys than x.</p>
 <p><span class="bold"><strong>Note</strong></span>: If an element it's inserted it might invalidate elements. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">std::pair&lt; iterator, <span class="bold"><strong>bool</strong></span> &gt;</span> <a name="id299173-bb"></a>insert(value_type &amp;&amp; x) ;</pre>
+<pre class="literallayout"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span> <span class="identifier">iterator</span><span class="special">,</span> <span class="keyword">bool</span> <span class="special">&gt;</span> <a name="id380757-bb"></a><span class="identifier">insert</span><span class="special">(</span><span class="identifier">value_type</span> <span class="special">&amp;&amp;</span> x<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: 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.</p>
 <p><span class="bold"><strong>Returns</strong></span>: 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.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic search time plus linear insertion to the elements with bigger keys than x.</p>
 <p><span class="bold"><strong>Note</strong></span>: If an element it's inserted it might invalidate elements. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">iterator</span> <a name="id299210-bb"></a>insert(const_iterator p, <span class="bold"><strong>const</strong></span> T &amp; x) ;</pre>
+<pre class="literallayout"><span class="identifier">iterator</span> <a name="id380794-bb"></a><span class="identifier">insert</span><span class="special">(</span><span class="identifier">const_iterator</span> p<span class="special">,</span> <span class="keyword">const</span> <span class="identifier">T</span> <span class="special">&amp;</span> x<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: 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.</p>
 <p><span class="bold"><strong>Returns</strong></span>: An iterator pointing to the element with key equivalent to the key of x.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic search time (constant if x is inserted right before p) plus insertion linear to the elements with bigger keys than x.</p>
 <p><span class="bold"><strong>Note</strong></span>: If an element it's inserted it might invalidate elements. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">iterator</span> <a name="id301232-bb"></a>insert(const_iterator position, value_type &amp;&amp; x) ;</pre>
+<pre class="literallayout"><span class="identifier">iterator</span> <a name="id380836-bb"></a><span class="identifier">insert</span><span class="special">(</span><span class="identifier">const_iterator</span> position<span class="special">,</span> <span class="identifier">value_type</span> <span class="special">&amp;&amp;</span> x<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Inserts an element move constructed from x in the container. p is a hint pointing to where the insert should start to search.</p>
 <p><span class="bold"><strong>Returns</strong></span>: An iterator pointing to the element with key equivalent to the key of x.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic search time (constant if x is inserted right before p) plus insertion linear to the elements with bigger keys than x.</p>
 <p><span class="bold"><strong>Note</strong></span>: If an element it's inserted it might invalidate elements. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>typename</strong></span> InputIterator&gt;
- <span class="type"><span class="bold"><strong>void</strong></span></span> <a name="id301274-bb"></a>insert(InputIterator first, InputIterator last) ;</pre>
+<pre class="literallayout"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> InputIterator<span class="special">&gt;</span>
+ <span class="keyword">void</span> <a name="id380878-bb"></a><span class="identifier">insert</span><span class="special">(</span><span class="identifier">InputIterator</span> first<span class="special">,</span> <span class="identifier">InputIterator</span> last<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Requires</strong></span>: i, j are not iterators into *this.</p>
 <p><span class="bold"><strong>Effects</strong></span>: 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.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: N log(size()+N) (N is the distance from i to j) search time plus N*size() insertion time.</p>
 <p><span class="bold"><strong>Note</strong></span>: If an element it's inserted it might invalidate elements. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>class</strong></span>... Args&gt; <span class="type">iterator</span> <a name="id301322-bb"></a>emplace(Args &amp;&amp;... args) ;</pre>
+<pre class="literallayout"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span><span class="special">...</span> Args<span class="special">&gt;</span> <span class="identifier">iterator</span> <a name="id380926-bb"></a><span class="identifier">emplace</span><span class="special">(</span><span class="identifier">Args</span> <span class="special">&amp;&amp;</span><span class="special">...</span> args<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Inserts an object of type T constructed with std::forward&lt;Args&gt;(args)... if and only if there is no element in the container with key equivalent to the key of x.</p>
 <p><span class="bold"><strong>Returns</strong></span>: 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.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic search time plus linear insertion to the elements with bigger keys than x.</p>
 <p><span class="bold"><strong>Note</strong></span>: If an element it's inserted it might invalidate elements. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>class</strong></span>... Args&gt;
- <span class="type">iterator</span> <a name="id301368-bb"></a>emplace_hint(const_iterator hint, Args &amp;&amp;... args) ;</pre>
+<pre class="literallayout"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span><span class="special">...</span> Args<span class="special">&gt;</span>
+ <span class="identifier">iterator</span> <a name="id380972-bb"></a><span class="identifier">emplace_hint</span><span class="special">(</span><span class="identifier">const_iterator</span> hint<span class="special">,</span> <span class="identifier">Args</span> <span class="special">&amp;&amp;</span><span class="special">...</span> args<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Inserts an object of type T constructed with std::forward&lt;Args&gt;(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.</p>
 <p><span class="bold"><strong>Returns</strong></span>: An iterator pointing to the element with key equivalent to the key of x.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic search time (constant if x is inserted right before p) plus insertion linear to the elements with bigger keys than x.</p>
 <p><span class="bold"><strong>Note</strong></span>: If an element it's inserted it might invalidate elements. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">iterator</span> <a name="id301418-bb"></a>erase(const_iterator position) ;</pre>
+<pre class="literallayout"><span class="identifier">iterator</span> <a name="id381022-bb"></a><span class="identifier">erase</span><span class="special">(</span><span class="identifier">const_iterator</span> position<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Erases the element pointed to by position.</p>
 <p><span class="bold"><strong>Returns</strong></span>: Returns an iterator pointing to the element immediately following q prior to the element being erased. If no such element exists, returns end().</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Linear to the elements with keys bigger than position</p>
 <p><span class="bold"><strong>Note</strong></span>: Invalidates elements with keys not less than the erased element. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">size_type</span> <a name="id301454-bb"></a>erase(<span class="bold"><strong>const</strong></span> key_type &amp; x) ;</pre>
+<pre class="literallayout"><span class="identifier">size_type</span> <a name="id381058-bb"></a><span class="identifier">erase</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span> x<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Erases all elements in the container with key equivalent to x.</p>
 <p><span class="bold"><strong>Returns</strong></span>: Returns the number of erased elements.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic search time plus erasure time linear to the elements with bigger keys. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">iterator</span> <a name="id301484-bb"></a>erase(const_iterator first, const_iterator last) ;</pre>
+<pre class="literallayout"><span class="identifier">iterator</span> <a name="id381088-bb"></a><span class="identifier">erase</span><span class="special">(</span><span class="identifier">const_iterator</span> first<span class="special">,</span> <span class="identifier">const_iterator</span> last<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Erases all the elements in the range [first, last).</p>
 <p><span class="bold"><strong>Returns</strong></span>: Returns last.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: size()*N where N is the distance from first to last.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic search time plus erasure time linear to the elements with bigger keys. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type"><span class="bold"><strong>void</strong></span></span> <a name="id301525-bb"></a>clear() ;</pre>
+<pre class="literallayout"><span class="keyword">void</span> <a name="id381129-bb"></a><span class="identifier">clear</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: erase(a.begin(),a.end()).</p>
 <p><span class="bold"><strong>Postcondition</strong></span>: size() == 0.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: linear in size(). </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type"><span class="bold"><strong>void</strong></span></span> <a name="id301550-bb"></a>shrink_to_fit() ;</pre>
+<pre class="literallayout"><span class="keyword">void</span> <a name="id381154-bb"></a><span class="identifier">shrink_to_fit</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre>
 <span class="bold"><strong>Effects</strong></span>: Tries to deallocate the excess of memory created <p><span class="bold"><strong>Throws</strong></span>: If memory allocation throws, or T's copy constructor throws.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Linear to size(). </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">iterator</span> <a name="id301577-bb"></a>find(<span class="bold"><strong>const</strong></span> key_type &amp; x) ;</pre>
+<pre class="literallayout"><span class="identifier">iterator</span> <a name="id381181-bb"></a><span class="identifier">find</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span> x<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Returns</strong></span>: An iterator pointing to an element with the key equivalent to x, or end() if such an element is not found.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">const_iterator</span> <a name="id301601-bb"></a>find(<span class="bold"><strong>const</strong></span> key_type &amp; x) <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">const_iterator</span> <a name="id381205-bb"></a><span class="identifier">find</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span> x<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Returns</strong></span>: A const_iterator pointing to an element with the key equivalent to x, or end() if such an element is not found.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic.s </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">size_type</span> <a name="id301625-bb"></a>count(<span class="bold"><strong>const</strong></span> key_type &amp; x) <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">size_type</span> <a name="id381229-bb"></a><span class="identifier">count</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span> x<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Returns</strong></span>: The number of elements with key equivalent to x.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: log(size())+count(k) </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">iterator</span> <a name="id301649-bb"></a>lower_bound(<span class="bold"><strong>const</strong></span> key_type &amp; x) ;</pre>
+<pre class="literallayout"><span class="identifier">iterator</span> <a name="id381253-bb"></a><span class="identifier">lower_bound</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span> x<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Returns</strong></span>: An iterator pointing to the first element with key not less than k, or a.end() if such an element is not found.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">const_iterator</span> <a name="id301673-bb"></a>lower_bound(<span class="bold"><strong>const</strong></span> key_type &amp; x) <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">const_iterator</span> <a name="id381277-bb"></a><span class="identifier">lower_bound</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span> x<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Returns</strong></span>: A const iterator pointing to the first element with key not less than k, or a.end() if such an element is not found.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">iterator</span> <a name="id301697-bb"></a>upper_bound(<span class="bold"><strong>const</strong></span> key_type &amp; x) ;</pre>
+<pre class="literallayout"><span class="identifier">iterator</span> <a name="id381301-bb"></a><span class="identifier">upper_bound</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span> x<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Returns</strong></span>: An iterator pointing to the first element with key not less than x, or end() if such an element is not found.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">const_iterator</span> <a name="id301721-bb"></a>upper_bound(<span class="bold"><strong>const</strong></span> key_type &amp; x) <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">const_iterator</span> <a name="id381325-bb"></a><span class="identifier">upper_bound</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span> x<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Returns</strong></span>: A const iterator pointing to the first element with key not less than x, or end() if such an element is not found.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">std::pair&lt; const_iterator, const_iterator &gt;</span>
-<a name="id301745-bb"></a>equal_range(<span class="bold"><strong>const</strong></span> key_type &amp; x) <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span> <span class="identifier">const_iterator</span><span class="special">,</span> <span class="identifier">const_iterator</span> <span class="special">&gt;</span>
+<a name="id381349-bb"></a><span class="identifier">equal_range</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span> x<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Equivalent to std::make_pair(this-&gt;lower_bound(k), this-&gt;upper_bound(k)).</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">std::pair&lt; iterator, iterator &gt;</span> <a name="id301769-bb"></a>equal_range(<span class="bold"><strong>const</strong></span> key_type &amp; x) ;</pre>
+<pre class="literallayout"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span> <span class="identifier">iterator</span><span class="special">,</span> <span class="identifier">iterator</span> <span class="special">&gt;</span> <a name="id381373-bb"></a><span class="identifier">equal_range</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&amp;</span> x<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Equivalent to std::make_pair(this-&gt;lower_bound(k), this-&gt;upper_bound(k)).</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Logarithmic </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type">size_type</span> <a name="id301793-bb"></a>capacity() <span class="bold"><strong>const</strong></span>;</pre>
+<pre class="literallayout"><span class="identifier">size_type</span> <a name="id381397-bb"></a><span class="identifier">capacity</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: Number of elements for which memory has been allocated. capacity() is always greater than or equal to size().</p>
 <p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
 <p><span class="bold"><strong>Complexity</strong></span>: Constant. </p>
 </li>
 <li>
-<pre class="literallayout"><span class="type"><span class="bold"><strong>void</strong></span></span> <a name="id301818-bb"></a>reserve(size_type count) ;</pre>
+<pre class="literallayout"><span class="keyword">void</span> <a name="id381422-bb"></a><span class="identifier">reserve</span><span class="special">(</span><span class="identifier">size_type</span> count<span class="special">)</span><span class="special">;</span></pre>
 <p><span class="bold"><strong>Effects</strong></span>: 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.</p>
 <p><span class="bold"><strong>Throws</strong></span>: If memory allocation allocation throws or T's copy constructor throws.</p>
 <p><span class="bold"><strong>Note</strong></span>: If capacity() is less than "count", iterators and references to to values might be invalidated. </p>
@@ -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<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2009 -2011 Ion Gaztanaga<p>
         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)
       </p>
@@ -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&#160;1.&#160;Boost.Container">
 <link rel="up" href="../../boost_container_reference.html#header.boost.container.list_hpp" title="Header &lt;boost/container/list.hpp&gt;">
 <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 @@
 <p>boost::container::list &#8212; </p>
 </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"><span class="emphasis"><em>// In header: &lt;boost/container/list.hpp&gt;
+<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis"><span class="comment">// In header: &lt;boost/container/list.hpp&gt;
 
-</em></span><span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>typename</strong></span> T, <span class="bold"><strong>typename</strong></span> A&gt;
-<span class="bold"><strong>class</strong></span> list {
-<span class="bold"><strong>public</strong></span>:
- <span class="emphasis"><em>// types</em></span>
- <span class="bold"><strong>typedef</strong></span> T value_type;
- <span class="bold"><strong>typedef</strong></span> A::pointer <a name="boost.container.list.pointer"></a>pointer; <span class="emphasis"><em>// Pointer to T. </em></span>
- <span class="bold"><strong>typedef</strong></span> A::const_pointer <a name="boost.container.list.const_pointer"></a>const_pointer; <span class="emphasis"><em>// Const pointer to T. </em></span>
- <span class="bold"><strong>typedef</strong></span> A::reference <a name="boost.container.list.reference"></a>reference; <span class="emphasis"><em>// Reference to T. </em></span>
- <span class="bold"><strong>typedef</strong></span> A::const_reference <a name="boost.container.list.const_reference"></a>const_reference; <span class="emphasis"><em>// Const reference to T. </em></span>
- <span class="bold"><strong>typedef</strong></span> A::size_type <a name="boost.container.list.size_type"></a>size_type; <span class="emphasis"><em>// An unsigned integral type. </em></span>
- <span class="bold"><strong>typedef</strong></span> A::difference_type <a name="boost.container.list.difference_type"></a>difference_type; <span class="emphasis"><em>// A signed integral type. </em></span>
- <span class="bold"><strong>typedef</strong></span> A <a name="boost.container.list.allocator_type"></a>allocator_type; <span class="emphasis"><em>// The allocator type. </em></span>
- <span class="bold"><strong>typedef</strong></span> NodeAlloc <a name="boost.container.list.stored_allocator_type"></a>stored_allocator_type; <span class="emphasis"><em>// The stored allocator type. </em></span>
- <span class="bold"><strong>typedef</strong></span> std::reverse_iterator&lt; const_iterator &gt; const_reverse_iterator;
+</span><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> T<span class="special">,</span> <span class="keyword">typename</span> A<span class="special">&gt;</span>
+<span class="keyword">class</span> list <span class="special">{</span>
+<span class="keyword">public</span><span class="special">:</span>
+ <span class="comment">// types</span>
+ <span class="keyword">typedef</span> <span class="identifier">T</span> value_type<span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">A</span><span class="special">::</span><span class="identifier">pointer</span> <a name="boost.container.list.pointer"></a><span class="identifier">pointer</span><span class="special">;</span> <span class="comment">// Pointer to T. </span>
+ <span class="keyword">typedef</span> <span class="identifier">A</span><span class="special">::</span><span class="identifier">const_pointer</span> <a name="boost.container.list.const_pointer"></a><span class="identifier">const_pointer</span><span class="special">;</span> <span class="comment">// Const pointer to T. </span>
+ <span class="keyword">typedef</span> <span class="identifier">A</span><span class="special">::</span><span class="identifier">reference</span> <a name="boost.container.list.reference"></a><span class="identifier">reference</span><span class="special">;</span> <span class="comment">// Reference to T. </span>
+ <span class="keyword">typedef</span> <span class="identifier">A</span><span class="special">::</span><span class="identifier">const_reference</span> <a name="boost.container.list.const_reference"></a><span class="identifier">const_reference</span><span class="special">;</span> <span class="comment">// Const reference to T. </span>
+ <span class="keyword">typedef</span> <span class="identifier">A</span><span class="special">::</span><span class="identifier">size_type</span> <a name="boost.container.list.size_type"></a><span class="identifier">size_type</span><span class="special">;</span> <span class="comment">// An unsigned integral type. </span>
+ <span class="keyword">typedef</span> <span class="identifier">A</span><span class="special">::</span><span class="identifier">difference_type</span> <a name="boost.container.list.difference_type"></a><span class="identifier">difference_type</span><span class="special">;</span> <span class="comment">// A signed integral type. </span>
+ <span class="keyword">typedef</span> <span class="identifier">A</span> <a name="boost.container.list.allocator_type"></a><span class="identifier">allocator_type</span><span class="special">;</span> <span class="comment">// The allocator type. </span>
+ <span class="keyword">typedef</span> <span class="identifier">NodeAlloc</span> <a name="boost.container.list.stored_allocator_type"></a><span class="identifier">stored_allocator_type</span><span class="special">;</span> <span class="comment">// The stored allocator type. </span>
+ <span class="keyword">typedef</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">reverse_iterator</span><span class="special">&lt;</span> <span class="identifier">const_iterator</span> <span class="special">&gt;</span> const_reverse_iterator<span class="special">;</span>
 
- <span class="emphasis"><em>// construct/copy/destruct</em></span>
- list(<span class="bold"><strong>const</strong></span> allocator_type &amp; = A());
- list(size_type);
- list(size_type, <span class="bold"><strong>const</strong></span> T &amp;, <span class="bold"><strong>const</strong></span> A &amp; = A());
- list(<span class="bold"><strong>const</strong></span> list &amp;);
- list(list &amp;&amp;);
- <span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>typename</strong></span> InpIt&gt; list(InpIt, InpIt, <span class="bold"><strong>const</strong></span> A &amp; = A());
- list&amp; operator=(<span class="bold"><strong>const</strong></span> ThisType &amp;);
- list&amp; operator=(ThisType &amp;&amp;);
- ~list();
+ <span class="comment">// construct/copy/destruct</span>
+ list<span class="special">(</span><span class="keyword">const</span> <span class="identifier">allocator_type</span> <span class="special">&amp;</span> <span class="special">=</span> <span class="identifier">A</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span>
+ list<span class="special">(</span><span class="identifier">size_type</span><span class="special">)</span><span class="special">;</span>
+ list<span class="special">(</span><span class="identifier">size_type</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">T</span> <span class="special">&amp;</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">A</span> <span class="special">&amp;</span> <span class="special">=</span> <span class="identifier">A</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span>
+ list<span class="special">(</span><span class="keyword">const</span> list <span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
+ list<span class="special">(</span>list <span class="special">&amp;&amp;</span><span class="special">)</span><span class="special">;</span>
+ <span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> InpIt<span class="special">&gt;</span> list<span class="special">(</span><span class="identifier">InpIt</span><span class="special">,</span> <span class="identifier">InpIt</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">A</span> <span class="special">&amp;</span> <span class="special">=</span> <span class="identifier">A</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span>
+ list&amp; operator=<span class="special">(</span><span class="keyword">const</span> <span class="identifier">ThisType</span> <span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
+ list&amp; operator=<span class="special">(</span><span class="identifier">ThisType</span> <span class="special">&amp;&amp;</span><span class="special">)</span><span class="special">;</span>
+ ~list<span class="special">(</span><span class="special">)</span><span class="special">;</span>
 
- <span class="emphasis"><em>// public member functions</em></span>
- <span class="type">allocator_type</span> get_allocator() <span class="bold"><strong>const</strong></span>;
- <span class="type"><span class="bold"><strong>const</strong></span> stored_allocator_type &amp;</span> get_stored_allocator() <span class="bold"><strong>const</strong></span>;
- <span class="type">stored_allocator_type &amp;</span> get_stored_allocator() ;
- <span class="type"><span class="bold"><strong>void</strong></span></span> clear() ;
- <span class="type">iterator</span> begin() ;
- <span class="type">const_iterator</span> begin() <span class="bold"><strong>const</strong></span>;
- <span class="type">iterator</span> end() ;
- <span class="type">const_iterator</span> end() <span class="bold"><strong>const</strong></span>;
- <span class="type">reverse_iterator</span> rbegin() ;
- <span class="type">const_reverse_iterator</span> rbegin() <span class="bold"><strong>const</strong></span>;
- <span class="type">reverse_iterator</span> rend() ;
- <span class="type">const_reverse_iterator</span> rend() <span class="bold"><strong>const</strong></span>;
- <span class="type">const_iterator</span> cbegin() <span class="bold"><strong>const</strong></span>;
- <span class="type">const_iterator</span> cend() <span class="bold"><strong>const</strong></span>;
- <span class="type">const_reverse_iterator</span> crbegin() <span class="bold"><strong>const</strong></span>;
- <span class="type">const_reverse_iterator</span> crend() <span class="bold"><strong>const</strong></span>;
- <span class="type"><span class="bold"><strong>bool</strong></span></span> empty() <span class="bold"><strong>const</strong></span>;
- <span class="type">size_type</span> size() <span class="bold"><strong>const</strong></span>;
- <span class="type">size_type</span> max_size() <span class="bold"><strong>const</strong></span>;
- <span class="type"><span class="bold"><strong>void</strong></span></span> push_front(<span class="bold"><strong>const</strong></span> T &amp;) ;
- <span class="type"><span class="bold"><strong>void</strong></span></span> push_front(T &amp;&amp;) ;
- <span class="type"><span class="bold"><strong>void</strong></span></span> push_back(<span class="bold"><strong>const</strong></span> T &amp;) ;
- <span class="type"><span class="bold"><strong>void</strong></span></span> push_back(T &amp;&amp;) ;
- <span class="type"><span class="bold"><strong>void</strong></span></span> pop_front() ;
- <span class="type"><span class="bold"><strong>void</strong></span></span> pop_back() ;
- <span class="type">reference</span> front() ;
- <span class="type">const_reference</span> front() <span class="bold"><strong>const</strong></span>;
- <span class="type">reference</span> back() ;
- <span class="type">const_reference</span> back() <span class="bold"><strong>const</strong></span>;
- <span class="type"><span class="bold"><strong>void</strong></span></span> resize(size_type, <span class="bold"><strong>const</strong></span> T &amp;) ;
- <span class="type"><span class="bold"><strong>void</strong></span></span> resize(size_type) ;
- <span class="type"><span class="bold"><strong>void</strong></span></span> swap(ThisType &amp;) ;
- <span class="type"><span class="bold"><strong>void</strong></span></span> insert(const_iterator, size_type, <span class="bold"><strong>const</strong></span> T &amp;) ;
- <span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>typename</strong></span> InpIt&gt; <span class="type"><span class="bold"><strong>void</strong></span></span> insert(const_iterator, InpIt, InpIt) ;
- <span class="type">iterator</span> insert(const_iterator, <span class="bold"><strong>const</strong></span> T &amp;) ;
- <span class="type">iterator</span> insert(const_iterator, T &amp;&amp;) ;
- <span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>class</strong></span>... Args&gt; <span class="type"><span class="bold"><strong>void</strong></span></span> emplace_back(Args &amp;&amp;...) ;
- <span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>class</strong></span>... Args&gt; <span class="type"><span class="bold"><strong>void</strong></span></span> emplace_front(Args &amp;&amp;...) ;
- <span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>class</strong></span>... Args&gt; <span class="type">iterator</span> emplace(const_iterator, Args &amp;&amp;...) ;
- <span class="type">iterator</span> erase(const_iterator) ;
- <span class="type">iterator</span> erase(const_iterator, const_iterator) ;
- <span class="type"><span class="bold"><strong>void</strong></span></span> assign(size_type, <span class="bold"><strong>const</strong></span> T &amp;) ;
- <span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>typename</strong></span> InpIt&gt; <span class="type"><span class="bold"><strong>void</strong></span></span> assign(InpIt, InpIt) ;
- <span class="type"><span class="bold"><strong>void</strong></span></span> splice(iterator, ThisType &amp;) ;
- <span class="type"><span class="bold"><strong>void</strong></span></span> splice(const_iterator, ThisType &amp;, const_iterator) ;
- <span class="type"><span class="bold"><strong>void</strong></span></span> splice(const_iterator, ThisType &amp;, const_iterator, const_iterator) ;
- <span class="type"><span class="bold"><strong>void</strong></span></span> splice(const_iterator, ThisType &amp;, const_iterator, const_iterator,
- size_type) ;
- <span class="type"><span class="bold"><strong>void</strong></span></span> reverse() ;
- <span class="type"><span class="bold"><strong>void</strong></span></span> remove(<span class="bold"><strong>const</strong></span> T &amp;) ;
- <span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>typename</strong></span> Pred&gt; <span class="type"><span class="bold"><strong>void</strong></span></span> remove_if(Pred) ;
- <span class="type"><span class="bold"><strong>void</strong></span></span> unique() ;
- <span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>typename</strong></span> BinaryPredicate&gt; <span class="type"><span class="bold"><strong>void</strong></span></span> unique(BinaryPredicate) ;
- <span class="type"><span class="bold"><strong>void</strong></span></span> merge(list&lt; T, A &gt; &amp;) ;
- <span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>typename</strong></span> StrictWeakOrdering&gt;
- <span class="type"><span class="bold"><strong>void</strong></span></span> merge(list &amp;, StrictWeakOrdering) ;
- <span class="type"><span class="bold"><strong>void</strong></span></span> sort() ;
- <span class="bold"><strong>template</strong></span>&lt;<span class="bold"><strong>typename</strong></span> StrictWeakOrdering&gt; <span class="type"><span class="bold"><strong>void</strong></span></span> sort(StrictWeakOrdering) ;
-};</pre></div>
+ <span class="comment">// public member functions</span>
+ <span class="identifier">allocator_type</span> get_allocator<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="keyword">const</span> <span class="identifier">stored_allocator_type</span> <span class="special">&amp;</span> get_stored_allocator<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">stored_allocator_type</span> <span class="special">&amp;</span> get_stored_allocator<span class="special">(</span><span class="special">)</span><span class="special">;</span>
+ <span class="keyword">void</span> clear<span class="special">(</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">iterator</span> begin<span class="special">(</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">const_iterator</span> begin<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">iterator</span> end<span class="special">(</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">const_iterator</span> end<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">reverse_iterator</span> rbegin<span class="special">(</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">const_reverse_iterator</span> rbegin<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">reverse_iterator</span> rend<span class="special">(</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">const_reverse_iterator</span> rend<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">const_iterator</span> cbegin<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">const_iterator</span> cend<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">const_reverse_iterator</span> crbegin<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">const_reverse_iterator</span> crend<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="keyword">bool</span> empty<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">size_type</span> size<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">size_type</span> max_size<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="keyword">void</span> pop_front<span class="special">(</span><span class="special">)</span><span class="special">;</span>
+ <span class="keyword">void</span> pop_back<span class="special">(</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">reference</span> front<span class="special">(</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">const_reference</span> front<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">reference</span> back<span class="special">(</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">const_reference</span> back<span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="keyword">void</span> resize<span class="special">(</span><span class="identifier">size_type</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">T</span> <span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
+ <span class="keyword">void</span> resize<span class="special">(</span><span class="identifier">size_type</span><span class="special">)</span><span class="special">;</span>
+ <span class="keyword">void</span> swap<span class="special">(</span><span class="identifier">ThisType</span> <span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
+ <span class="keyword">void</span> insert<span class="special">(</span><span class="identifier">const_iterator</span><span class="special">,</span> <span class="identifier">size_type</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">T</span> <span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
+ <span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> InpIt<span class="special">&gt;</span> <span class="keyword">void</span> insert<span class="special">(</span><span class="identifier">const_iterator</span><span class="special">,</span> <span class="identifier">InpIt</span><span class="special">,</span> <span class="identifier">InpIt</span><span class="special">)</span><span class="special">;</span>
+ <span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span><span class="special">...</span> Args<span class="special">&gt;</span> <span class="keyword">void</span> emplace_back<span class="special">