[Boost-commit] svn:boost r74141 - trunk/libs/unordered/doc

Subject: [Boost-commit] svn:boost r74141 - trunk/libs/unordered/doc
From: dnljms_at_[hidden]
Date: 2011-08-29 13:13:28

Author: danieljames
Date: 2011-08-29 13:13:27 EDT (Mon, 29 Aug 2011)
New Revision: 74141
URL: http://svn.boost.org/trac/boost/changeset/74141

Log:
Unordered: Fix boostbook errors.
Text files modified: 
   trunk/libs/unordered/doc/ref.php |     7 ++++---                                 
   trunk/libs/unordered/doc/ref.xml |    28 ++++++++++++++++------------            
   2 files changed, 20 insertions(+), 15 deletions(-)

Modified: trunk/libs/unordered/doc/ref.php
==============================================================================
--- trunk/libs/unordered/doc/ref.php	(original)
+++ trunk/libs/unordered/doc/ref.php	2011-08-29 13:13:27 EDT (Mon, 29 Aug 2011)
@@ -232,7 +232,7 @@
             </parameter>
             <description>
               <para>The copy constructor. Copies the contained elements, hash function, predicate, maximum load factor and allocator.</para>
-              <pora>If <code>Allocator::select_on_container_copy_construction</code>
+              <para>If <code>Allocator::select_on_container_copy_construction</code>
               exists and has the right signature, the allocator will be
               constructed from its result.</para>
             </description>
@@ -457,6 +457,7 @@
                 <para>Since existing `std::pair` implementations don't support
                       <code>std::piecewise_construct</code> this emulates it,
                       but using <code>boost::unordered::piecewise_construct</code>.
+                </para>
               </notes>
             </method>
             <method name="insert">
@@ -663,7 +664,7 @@
                 <para>If the allocators are equal, doesn't throw an exception unless it is thrown by the copy constructor or copy assignment operator of <code>key_equal</code> or <code>hasher</code>.</para>
               </throws>
               <notes>
-                <para><emphasis>TODO</emphasis>: Update swap documentation, no longer correct.
+                <para><emphasis>TODO</emphasis>: Update swap documentation, no longer correct.</para>
                 <para>For a discussion of the behavior when allocators aren't equal see
                   <link linkend="unordered.rationale.swapping_containers_with_unequal_allocators">the implementation details</link>.</para>
               </notes>
@@ -1017,7 +1018,7 @@
                 <para>If the allocators are equal, doesn't throw an exception unless it is thrown by the copy constructor or copy assignment operator of <code>Hash</code> or <code>Pred</code>.</para>
               </throws>
               <notes>
-                <para><emphasis>TODO</emphasis>: Update swap documentation, no longer correct.
+                <para><emphasis>TODO</emphasis>: Update swap documentation, no longer correct.</para>
                 <para>For a discussion of the behavior when allocators aren't equal see
                   <link linkend="unordered.rationale.swapping_containers_with_unequal_allocators">the implementation details</link>.</para>
               </notes>

Modified: trunk/libs/unordered/doc/ref.xml
==============================================================================
--- trunk/libs/unordered/doc/ref.xml	(original)
+++ trunk/libs/unordered/doc/ref.xml	2011-08-29 13:13:27 EDT (Mon, 29 Aug 2011)
@@ -177,7 +177,7 @@
             </parameter>
             <description>
               <para>The copy constructor. Copies the contained elements, hash function, predicate, maximum load factor and allocator.</para>
-              <pora>If <code>Allocator::select_on_container_copy_construction</code>
+              <para>If <code>Allocator::select_on_container_copy_construction</code>
               exists and has the right signature, the allocator will be
               constructed from its result.</para>
             </description>
@@ -388,6 +388,7 @@
                 <para>Since existing `std::pair` implementations don't support
                       <code>std::piecewise_construct</code> this emulates it,
                       but using <code>boost::unordered::piecewise_construct</code>.
+                </para>
               </notes>
             </method>
             <method name="insert">
@@ -579,7 +580,7 @@
                 <para>If the allocators are equal, doesn't throw an exception unless it is thrown by the copy constructor or copy assignment operator of <code>key_equal</code> or <code>hasher</code>.</para>
               </throws>
               <notes>
-                <para><emphasis>TODO</emphasis>: Update swap documentation, no longer correct.
+                <para><emphasis>TODO</emphasis>: Update swap documentation, no longer correct.</para>
                 <para>For a discussion of the behavior when allocators aren't equal see
                   <link linkend="unordered.rationale.swapping_containers_with_unequal_allocators">the implementation details</link>.</para>
               </notes>
@@ -899,7 +900,7 @@
                 <para>If the allocators are equal, doesn't throw an exception unless it is thrown by the copy constructor or copy assignment operator of <code>Hash</code> or <code>Pred</code>.</para>
               </throws>
               <notes>
-                <para><emphasis>TODO</emphasis>: Update swap documentation, no longer correct.
+                <para><emphasis>TODO</emphasis>: Update swap documentation, no longer correct.</para>
                 <para>For a discussion of the behavior when allocators aren't equal see
                   <link linkend="unordered.rationale.swapping_containers_with_unequal_allocators">the implementation details</link>.</para>
               </notes>
@@ -1078,7 +1079,7 @@
             </parameter>
             <description>
               <para>The copy constructor. Copies the contained elements, hash function, predicate, maximum load factor and allocator.</para>
-              <pora>If <code>Allocator::select_on_container_copy_construction</code>
+              <para>If <code>Allocator::select_on_container_copy_construction</code>
               exists and has the right signature, the allocator will be
               constructed from its result.</para>
             </description>
@@ -1288,6 +1289,7 @@
                 <para>Since existing `std::pair` implementations don't support
                       <code>std::piecewise_construct</code> this emulates it,
                       but using <code>boost::unordered::piecewise_construct</code>.
+                </para>
               </notes>
             </method>
             <method name="insert">
@@ -1478,7 +1480,7 @@
                 <para>If the allocators are equal, doesn't throw an exception unless it is thrown by the copy constructor or copy assignment operator of <code>key_equal</code> or <code>hasher</code>.</para>
               </throws>
               <notes>
-                <para><emphasis>TODO</emphasis>: Update swap documentation, no longer correct.
+                <para><emphasis>TODO</emphasis>: Update swap documentation, no longer correct.</para>
                 <para>For a discussion of the behavior when allocators aren't equal see
                   <link linkend="unordered.rationale.swapping_containers_with_unequal_allocators">the implementation details</link>.</para>
               </notes>
@@ -1798,7 +1800,7 @@
                 <para>If the allocators are equal, doesn't throw an exception unless it is thrown by the copy constructor or copy assignment operator of <code>Hash</code> or <code>Pred</code>.</para>
               </throws>
               <notes>
-                <para><emphasis>TODO</emphasis>: Update swap documentation, no longer correct.
+                <para><emphasis>TODO</emphasis>: Update swap documentation, no longer correct.</para>
                 <para>For a discussion of the behavior when allocators aren't equal see
                   <link linkend="unordered.rationale.swapping_containers_with_unequal_allocators">the implementation details</link>.</para>
               </notes>
@@ -1989,7 +1991,7 @@
             </parameter>
             <description>
               <para>The copy constructor. Copies the contained elements, hash function, predicate, maximum load factor and allocator.</para>
-              <pora>If <code>Allocator::select_on_container_copy_construction</code>
+              <para>If <code>Allocator::select_on_container_copy_construction</code>
               exists and has the right signature, the allocator will be
               constructed from its result.</para>
             </description>
@@ -2200,6 +2202,7 @@
                 <para>Since existing `std::pair` implementations don't support
                       <code>std::piecewise_construct</code> this emulates it,
                       but using <code>boost::unordered::piecewise_construct</code>.
+                </para>
               </notes>
             </method>
             <method name="insert">
@@ -2391,7 +2394,7 @@
                 <para>If the allocators are equal, doesn't throw an exception unless it is thrown by the copy constructor or copy assignment operator of <code>key_equal</code> or <code>hasher</code>.</para>
               </throws>
               <notes>
-                <para><emphasis>TODO</emphasis>: Update swap documentation, no longer correct.
+                <para><emphasis>TODO</emphasis>: Update swap documentation, no longer correct.</para>
                 <para>For a discussion of the behavior when allocators aren't equal see
                   <link linkend="unordered.rationale.swapping_containers_with_unequal_allocators">the implementation details</link>.</para>
               </notes>
@@ -2752,7 +2755,7 @@
                 <para>If the allocators are equal, doesn't throw an exception unless it is thrown by the copy constructor or copy assignment operator of <code>Hash</code> or <code>Pred</code>.</para>
               </throws>
               <notes>
-                <para><emphasis>TODO</emphasis>: Update swap documentation, no longer correct.
+                <para><emphasis>TODO</emphasis>: Update swap documentation, no longer correct.</para>
                 <para>For a discussion of the behavior when allocators aren't equal see
                   <link linkend="unordered.rationale.swapping_containers_with_unequal_allocators">the implementation details</link>.</para>
               </notes>
@@ -2939,7 +2942,7 @@
             </parameter>
             <description>
               <para>The copy constructor. Copies the contained elements, hash function, predicate, maximum load factor and allocator.</para>
-              <pora>If <code>Allocator::select_on_container_copy_construction</code>
+              <para>If <code>Allocator::select_on_container_copy_construction</code>
               exists and has the right signature, the allocator will be
               constructed from its result.</para>
             </description>
@@ -3149,6 +3152,7 @@
                 <para>Since existing `std::pair` implementations don't support
                       <code>std::piecewise_construct</code> this emulates it,
                       but using <code>boost::unordered::piecewise_construct</code>.
+                </para>
               </notes>
             </method>
             <method name="insert">
@@ -3339,7 +3343,7 @@
                 <para>If the allocators are equal, doesn't throw an exception unless it is thrown by the copy constructor or copy assignment operator of <code>key_equal</code> or <code>hasher</code>.</para>
               </throws>
               <notes>
-                <para><emphasis>TODO</emphasis>: Update swap documentation, no longer correct.
+                <para><emphasis>TODO</emphasis>: Update swap documentation, no longer correct.</para>
                 <para>For a discussion of the behavior when allocators aren't equal see
                   <link linkend="unordered.rationale.swapping_containers_with_unequal_allocators">the implementation details</link>.</para>
               </notes>
@@ -3665,7 +3669,7 @@
                 <para>If the allocators are equal, doesn't throw an exception unless it is thrown by the copy constructor or copy assignment operator of <code>Hash</code> or <code>Pred</code>.</para>
               </throws>
               <notes>
-                <para><emphasis>TODO</emphasis>: Update swap documentation, no longer correct.
+                <para><emphasis>TODO</emphasis>: Update swap documentation, no longer correct.</para>
                 <para>For a discussion of the behavior when allocators aren't equal see
                   <link linkend="unordered.rationale.swapping_containers_with_unequal_allocators">the implementation details</link>.</para>
               </notes>