Merged from 1.33.0 release

[SVN r30540]

doc/compiler_specifics.html

@@ -212,7 +212,7 @@ Argument dependent lookup is enabled by adding
 <code>/Qoption,c,--arg_dep_lookup</code> to the project options.
 </p>
 
-<h2><a name="#intel_71_win_stlport_453">
+<h2><a name="intel_71_win_stlport_453">
 Intel C++ Compiler for Windows 32-bit 7.1 + STLport 4.5.3</a></h2>
 
 <p>

doc/performance.html

@@ -91,7 +91,7 @@ STL containers.
 <h2><a name="simulation">Manual simulation of a <code>multi_index_container</code></a></h2>
 
 <p>
-The section of <a href="advanced_topics.html#simulate_std_containers">simulation
+The section on <a href="advanced_topics.html#emulate_std_containers">emulation
 of standard containers with <code>multi_index_container</code></a> shows the equivalence
 between single-index <code>multi_index_container</code>s and some STL containers. Let us now
 concentrate on the problem of simulating a <code>multi_index_container</code> with two

doc/reference/hash_indices.html

@@ -154,7 +154,7 @@ two different forms, according to whether a tag list for the index is provided o
 
 <p>
 If provided, <code>TagList</code> must be an instantiation of the class template
-<a href="#tag"><code>tag</code></a>.
+<a href="indices.html#tag"><code>tag</code></a>.
 The template arguments are used by the corresponding index implementation,
 refer to the <a href="#hash_indices">hashed indices</a> reference section for further
 explanations on their acceptable type values.

doc/reference/ord_indices.html

@@ -159,7 +159,7 @@ two different forms, according to whether a tag list for the index is provided o
 
 <p>
 If provided, <code>TagList</code> must be an instantiation of the class template
-<a href="#tag"><code>tag</code></a>.
+<a href="indices.html#tag"><code>tag</code></a>.
 The template arguments are used by the corresponding index implementation,
 refer to the <a href="#ord_indices">ordered indices</a> reference section for further
 explanations on their acceptable type values.

doc/tutorial.html

@@ -1257,7 +1257,7 @@ is preserved in the face of insertions, even for replace and modify operations.
 Appropriate instantiations of <code>multi_index_container</code> can in fact simulate
 <code>std::set</code>, <code>std::multiset</code> and (with more limitations)
 <code>std::list</code>, as shown in the
-<a href="advanced_topics.html#simulate_std_containers">advanced topics</a>
+<a href="advanced_topics.html#emulate_std_containers">advanced topics</a>
 section. These simulations are as nearly as efficient as the original STL
 containers; consult the <a href="reference/index.html">reference</a> for further
 information on complexity guarantees and the

include/boost/multi_index/ordered_index.hpp

@@ -62,6 +62,7 @@
 #include <utility>
 
 #if !defined(BOOST_MULTI_INDEX_DISABLE_SERIALIZATION)
+#include <boost/archive/archive_exception.hpp>
 #include <boost/bind.hpp>
 #include <boost/multi_index/detail/duplicates_iterator.hpp>
 #include <boost/throw_exception.hpp>