[gcc r13-2753] libstdc++: Remove trailing whitespace in documentation sources

[Jonathan Wakely <redi@gcc.gnu.org>]

https://gcc.gnu.org/g:9c23fe08c1fcee524503b24e15321b20df136f6c

commit r13-2753-g9c23fe08c1fcee524503b24e15321b20df136f6c
Author: Jonathan Wakely <jwakely@redhat.com>
Date:   Wed Sep 21 01:18:38 2022 +0100

    libstdc++: Remove trailing whitespace in documentation sources
    
    libstdc++-v3/ChangeLog:
    
            * doc/xml/manual/documentation_hacking.xml: Remove trailing
            whitespace.
            * doc/xml/manual/policy_data_structures.xml: Likewise.

Diff:
---
 libstdc++-v3/doc/xml/manual/documentation_hacking.xml  |  4 ++--
 libstdc++-v3/doc/xml/manual/policy_data_structures.xml | 12 ++++++------
 2 files changed, 8 insertions(+), 8 deletions(-)

diff --git a/libstdc++-v3/doc/xml/manual/documentation_hacking.xml b/libstdc++-v3/doc/xml/manual/documentation_hacking.xml
index 03bf1f184d4..776d5e857b5 100644
--- a/libstdc++-v3/doc/xml/manual/documentation_hacking.xml
+++ b/libstdc++-v3/doc/xml/manual/documentation_hacking.xml
@@ -353,7 +353,7 @@
 	  documentation. Here are some of the obvious errors, and ways
 	  to fix some common issues that may appear quite cryptic.
 	</para>
-	
+
 	<para>
 	  First, if using a rule like <code>make pdf</code>, try to
 	  narrow down the scope of the error to either docbook
@@ -844,7 +844,7 @@ make <literal>XSL_STYLE_DIR="/usr/share/xml/docbook/stylesheet/nwalsh"</literal>
 	  documentation. Here are some of the obvious errors, and ways
 	  to fix some common issues that may appear quite cryptic.
 	</para>
-	
+
 	<para>
 	  First, if using a rule like <code>make pdf</code>, try to
 	  narrow down the scope of the error to either docbook
diff --git a/libstdc++-v3/doc/xml/manual/policy_data_structures.xml b/libstdc++-v3/doc/xml/manual/policy_data_structures.xml
index 3e598105f7e..305257c7404 100644
--- a/libstdc++-v3/doc/xml/manual/policy_data_structures.xml
+++ b/libstdc++-v3/doc/xml/manual/policy_data_structures.xml
@@ -3003,7 +3003,7 @@
 		</textobject>
 	      </mediaobject>
 	    </figure>
-	
+
 	    <para>Let U be a domain (e.g., the integers, or the
 	    strings of 3 characters). A hash-table algorithm needs to map
 	    elements of U "uniformly" into the range [0,..., m -
@@ -3179,7 +3179,7 @@
 		0</subscript><superscript>t - 1</superscript> s<subscript>i</subscript> a<superscript>i</superscript> mod m
 	      </mathphrase>
 	    </equation>
-	
+
 
 	    <para>where a is some non-negative integral value. This is
 	    the standard string-hashing function used in SGI's
@@ -3278,7 +3278,7 @@
 		  </textobject>
 		</mediaobject>
 	      </figure>
-	
+
 	      <para>If <classname>cc_hash_table</classname>'s
 	      hash-functor, <classname>Hash_Fn</classname> is instantiated by <classname>null_type</classname> , then <classname>Comb_Hash_Fn</classname> is taken to be
 	      a ranged-hash function. The graphic below shows an <function>insert</function> sequence
@@ -3298,7 +3298,7 @@
 		  </textobject>
 		</mediaobject>
 	      </figure>
-	
+
 	    </section>
 
 	    <section xml:id="hash_policies.implementation.probe">
@@ -3917,7 +3917,7 @@
 	      </textobject>
 	    </mediaobject>
 	  </figure>
-	
+
 	  <para>Supporting such trees is difficult for a number of
 	  reasons:</para>
 
@@ -4819,7 +4819,7 @@
 	    assert(p.top() == 3);
 	  </programlisting>
 
-	
+
 	  <para>It should be noted that an alternative design could embed an
 	  associative container in a priority queue. Could, but most
 	  probably should not. To begin with, it should be noted that one