From: Jonathan Wakely Date: Wed, 21 Sep 2022 00:18:38 +0000 (+0100) Subject: libstdc++: Remove trailing whitespace in documentation sources X-Git-Tag: basepoints/gcc-14~4454 X-Git-Url: http://git.ipfire.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=9c23fe08c1fcee524503b24e15321b20df136f6c;p=thirdparty%2Fgcc.git 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 --git a/libstdc++-v3/doc/xml/manual/documentation_hacking.xml b/libstdc++-v3/doc/xml/manual/documentation_hacking.xml index 03bf1f184d42..776d5e857b53 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. - + First, if using a rule like make pdf, try to narrow down the scope of the error to either docbook @@ -844,7 +844,7 @@ make XSL_STYLE_DIR="/usr/share/xml/docbook/stylesheet/nwalsh" documentation. Here are some of the obvious errors, and ways to fix some common issues that may appear quite cryptic. - + First, if using a rule like make pdf, 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 3e598105f7e0..305257c7404e 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 @@ - + 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 @@ 0t - 1 si ai mod m - + where a is some non-negative integral value. This is the standard string-hashing function used in SGI's @@ -3278,7 +3278,7 @@ - + If cc_hash_table's hash-functor, Hash_Fn is instantiated by null_type , then Comb_Hash_Fn is taken to be a ranged-hash function. The graphic below shows an insert sequence @@ -3298,7 +3298,7 @@ - +
@@ -3917,7 +3917,7 @@ - + Supporting such trees is difficult for a number of reasons: @@ -4819,7 +4819,7 @@ assert(p.top() == 3); - + 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