* doc/xml/manual/bitmap_allocator.xml: Fix typos.

git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@173879 138bc75d-0d04-0410-961f-82ee72b054a4

diff --git a/libstdc++-v3/ChangeLog b/libstdc++-v3/ChangeLog
index 55fd465..e399b2b 100644 (file)
--- a/libstdc++-v3/ChangeLog
+++ b/libstdc++-v3/ChangeLog
@@ -1,3 +1,7 @@
+2011-05-18  Jonathan Wakely  <jwakely.gcc@gmail.com>
+
+       * doc/xml/manual/bitmap_allocator.xml: Fix typos.
+

 2011-05-18  Paolo Carlini  <paolo.carlini@oracle.com>
 
        * libsupc++/initializer_list: Use noexcept specifier.
 2011-05-18  Paolo Carlini  <paolo.carlini@oracle.com>
 
        * libsupc++/initializer_list: Use noexcept specifier.

diff --git a/libstdc++-v3/doc/xml/manual/bitmap_allocator.xml b/libstdc++-v3/doc/xml/manual/bitmap_allocator.xml
index 19b1906..300cbab 100644 (file)
--- a/libstdc++-v3/doc/xml/manual/bitmap_allocator.xml
+++ b/libstdc++-v3/doc/xml/manual/bitmap_allocator.xml
@@ -23,7 +23,7 @@
 
   <para>
     As this name suggests, this allocator uses a bit-map to keep track
 
   <para>
     As this name suggests, this allocator uses a bit-map to keep track

-    of the used and unused memory locations for it's book-keeping
+    of the used and unused memory locations for its book-keeping

     purposes.
   </para>
   <para>
     purposes.
   </para>
   <para>


@@ -84,7 +84,7 @@
     free list if it exists.
   </para>
   <para>
     free list if it exists.
   </para>
   <para>

-    Suppose the free list size has reached it's threshold, then the
+    Suppose the free list size has reached its threshold, then the

     largest block from among those in the list and the new block will
     be selected and given back to the OS. This is done because it
     reduces external fragmentation, and allows the OS to use the
     largest block from among those in the list and the new block will
     be selected and given back to the OS. This is done because it
     reduces external fragmentation, and allows the OS to use the


@@ -509,7 +509,7 @@ Block a bitmap as well?
 
   <orderedlist>
   <listitem><para>Constant time access for the bitmap themselves, since no kind of
 
   <orderedlist>
   <listitem><para>Constant time access for the bitmap themselves, since no kind of

-look up will be needed to find the correct bitmap list or it's
+look up will be needed to find the correct bitmap list or its

 equivalent.</para></listitem>
   <listitem><para>And also this would preserve the cache as far as possible.</para></listitem>
   </orderedlist>
 equivalent.</para></listitem>
   <listitem><para>And also this would preserve the cache as far as possible.</para></listitem>
   </orderedlist>