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

From: daniel_james_at_[hidden]
Date: 2008-01-06 13:54:12

Author: danieljames
Date: 2008-01-06 13:54:12 EST (Sun, 06 Jan 2008)
New Revision: 42545
URL: http://svn.boost.org/trac/boost/changeset/42545

Log:
Spell check the documentation.
Text files modified: 
   branches/unordered/trunk/libs/unordered/doc/buckets.qbk |     4 ++--                                    
   branches/unordered/trunk/libs/unordered/doc/ref.xml     |    16 ++++++++--------                        
   2 files changed, 10 insertions(+), 10 deletions(-)

Modified: branches/unordered/trunk/libs/unordered/doc/buckets.qbk
==============================================================================
--- branches/unordered/trunk/libs/unordered/doc/buckets.qbk	(original)
+++ branches/unordered/trunk/libs/unordered/doc/buckets.qbk	2008-01-06 13:54:12 EST (Sun, 06 Jan 2008)
@@ -20,7 +20,7 @@
 then the number of buckets, so that container applies another transformation to
 that value to choose a bucket to place the element in.
 
-Retreiving the elements for a given key is simple. The same process is applied
+Retrieving the elements for a given key is simple. The same process is applied
 to the key to find the correct bucket. Then the key is compared with the
 elements in the bucket to find any elements that match (using the equality
 predicate `Pred`).  If the hash function has worked well the elements will be
@@ -75,7 +75,7 @@
 You can also tell the container to change the bucket count (if required) by
 calling `rehash`.
 
-The standard leaves a lot of freedom to the implementor to decide how the
+The standard leaves a lot of freedom to the implementer to decide how the
 number of buckets are chosen, but it does make some requirements based on the
 container's 'load factor', the average number of elements per bucket.
 Containers also have a 'maximum load factor' which they should try to keep the

Modified: branches/unordered/trunk/libs/unordered/doc/ref.xml
==============================================================================
--- branches/unordered/trunk/libs/unordered/doc/ref.xml	(original)
+++ branches/unordered/trunk/libs/unordered/doc/ref.xml	2008-01-06 13:54:12 EST (Sun, 06 Jan 2008)
@@ -391,7 +391,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>For a discussion of the behaviour when allocators aren't equal see 
+                <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>
             </method>
@@ -620,7 +620,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>For a discussion of the behaviour when allocators aren't equal see 
+                <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>
             </function>
@@ -1005,7 +1005,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>For a discussion of the behaviour when allocators aren't equal see 
+                <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>
             </method>
@@ -1234,7 +1234,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>For a discussion of the behaviour when allocators aren't equal see 
+                <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>
             </function>
@@ -1636,7 +1636,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>For a discussion of the behaviour when allocators aren't equal see 
+                <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>
             </method>
@@ -1902,7 +1902,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>For a discussion of the behaviour when allocators aren't equal see 
+                <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>
             </function>
@@ -2295,7 +2295,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>For a discussion of the behaviour when allocators aren't equal see 
+                <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>
             </method>
@@ -2526,7 +2526,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>For a discussion of the behaviour when allocators aren't equal see 
+                <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>
             </function>