From: Jonathan Wakely Date: Wed, 19 Nov 2025 09:43:10 +0000 (+0000) Subject: libstdc++: Remove vertical whitespace from code listings in manual X-Git-Url: http://git.ipfire.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=d0e0f6beb18a0109a481789803a453b438f79e24;p=thirdparty%2Fgcc.git libstdc++: Remove vertical whitespace from code listings in manual This removes unnecessary whitespace following 
 blocks in the HTML
output.

libstdc++-v3/ChangeLog:

	* doc/xml/faq.xml: Remove unwanted whitespace inside
	programlisting elements.
	* doc/xml/manual/allocator.xml: Likewise.
	* doc/xml/manual/auto_ptr.xml: Likewise.
	* doc/xml/manual/backwards_compatibility.xml: Likewise.
	* doc/xml/manual/build_hacking.xml: Likewise.
	* doc/xml/manual/containers.xml: Likewise.
	* doc/xml/manual/diagnostics.xml: Likewise.
	* doc/xml/manual/extensions.xml: Likewise.
	* doc/xml/manual/intro.xml: Likewise.
	* doc/xml/manual/io.xml: Likewise.
	* doc/xml/manual/iterators.xml: Likewise.
	* doc/xml/manual/numerics.xml: Likewise.
	* doc/xml/manual/policy_data_structures.xml: Likewise.
	* doc/xml/manual/strings.xml: Likewise.
	* doc/xml/manual/support.xml: Likewise.
	* doc/xml/manual/test.xml: Likewise.
	* doc/xml/manual/using.xml: Likewise.
	* doc/xml/manual/utilities.xml: Likewise.
	* doc/html/*: Regenerate.
---

diff --git a/libstdc++-v3/doc/html/faq.html b/libstdc++-v3/doc/html/faq.html
index 9bd477f1395..ba887ae2061 100644
--- a/libstdc++-v3/doc/html/faq.html
+++ b/libstdc++-v3/doc/html/faq.html
@@ -597,7 +597,7 @@
     // .
     fs.close();
     fs.open("a_new_file");
-

+

All operations on the re-opened fs would fail, or at least act very strangely, especially if fs reached the EOF state on the previous file. diff --git a/libstdc++-v3/doc/html/manual/appendix_porting.html b/libstdc++-v3/doc/html/manual/appendix_porting.html index 00677461ea1..dc46db3086a 100644 --- a/libstdc++-v3/doc/html/manual/appendix_porting.html +++ b/libstdc++-v3/doc/html/manual/appendix_porting.html @@ -113,13 +113,13 @@ in the build directory starts the build process. The all

+

All the major variable "discovery" is done here. CXX, multilibs, etc. 

     fragments included from elsewhere
-

+

Right now, "fragments" == "the math/linkage bits". 

     GLIBCXX_CHECK_COMPILER_FEATURES
diff --git a/libstdc++-v3/doc/html/manual/associative.html b/libstdc++-v3/doc/html/manual/associative.html
index 23916fb1631..dda188682ba 100644
--- a/libstdc++-v3/doc/html/manual/associative.html
+++ b/libstdc++-v3/doc/html/manual/associative.html
@@ -7,7 +7,7 @@
      function for all of the associative containers (map, set, etc):
    
       a.insert(p,t);
-   

+

where 'p' is an iterator into the container 'a', and 't' is the item to insert. The standard says that “t is inserted as close as possible to the position just prior to @@ -93,7 +93,7 @@ std::bitset<n> bits; .... } -

+

because n must be known at compile time. Your compiler is correct; it is not a bug. That's the way templates work. (Yes, it is a feature.) @@ -181,11 +181,11 @@ constructor expression: 

       std::bitset<5> b ( std::string("10110") );
-

+

instead of 

       std::bitset<5> b ( "10110" );    // invalid
-
Prev Up Next
Chapter 9.  +
Prev Up Next
Chapter 9.  Containers  Home Unordered Associative
\ No newline at end of file diff --git a/libstdc++-v3/doc/html/manual/backwards.html b/libstdc++-v3/doc/html/manual/backwards.html index f52e09d7dc2..a39dce883cb 100644 --- a/libstdc++-v3/doc/html/manual/backwards.html +++ b/libstdc++-v3/doc/html/manual/backwards.html @@ -85,7 +85,7 @@ and <unordered_set> instead. #endif extension::hash_map<int,int> my_map; -

This is a bit cleaner than defining typedefs for all the +

This is a bit cleaner than defining typedefs for all the instantiations you might need.

The following autoconf tests check for working HP/SGI hash containers. 

diff --git a/libstdc++-v3/doc/html/manual/containers_and_c.html b/libstdc++-v3/doc/html/manual/containers_and_c.html
index 7afdab501d4..0dbf533c28f 100644
--- a/libstdc++-v3/doc/html/manual/containers_and_c.html
+++ b/libstdc++-v3/doc/html/manual/containers_and_c.html
@@ -35,7 +35,7 @@
      The result is that if all your algorithm calls look like
    
    std::transform(beginof(foo), endof(foo), beginof(foo), SomeFunction);
-   

+

then the type of foo can change from an array of ints to a vector of ints to a deque of ints and back again, without ever changing any client code. @@ -81,7 +81,7 @@ template<typename T, unsigned int sz> Second, the line 

     inline unsigned int lengthof (T (&)[sz]) { return sz; }
-

+

looks just weird! Hint: unused parameters can be left nameless.

Prev Up Next
Unordered Associative Home Chapter 10.  Iterators diff --git a/libstdc++-v3/doc/html/manual/diagnostics.html b/libstdc++-v3/doc/html/manual/diagnostics.html index 23eb1a8189a..c0c8e24651f 100644 --- a/libstdc++-v3/doc/html/manual/diagnostics.html +++ b/libstdc++-v3/doc/html/manual/diagnostics.html @@ -51,4 +51,4 @@ int e; DBID id; // some user-defined type }; -
Prev Up Next
Termination Home Use of errno by the library
\ No newline at end of file +
Prev Up Next
Termination Home Use of errno by the library
\ No newline at end of file diff --git a/libstdc++-v3/doc/html/manual/dynamic_memory.html b/libstdc++-v3/doc/html/manual/dynamic_memory.html index 9b7a1fc0644..36a5a415ef7 100644 --- a/libstdc++-v3/doc/html/manual/dynamic_memory.html +++ b/libstdc++-v3/doc/html/manual/dynamic_memory.html @@ -111,7 +111,7 @@ else throw bad_alloc{}; } -

+

This means you can influence what happens on allocation failure by writing your own new-handler and then registering it with std::set_new_handler: @@ -138,7 +138,7 @@ old_handler = set_new_handler (&my_new_handler); ... } -

Additional Notes

+

Additional Notes

Remember that it is perfectly okay to delete a null pointer! Nothing happens, by definition. That is not the same thing as deleting a pointer twice. diff --git a/libstdc++-v3/doc/html/manual/ext_containers.html b/libstdc++-v3/doc/html/manual/ext_containers.html index cba81484f5b..660910f1042 100644 --- a/libstdc++-v3/doc/html/manual/ext_containers.html +++ b/libstdc++-v3/doc/html/manual/ext_containers.html @@ -25,7 +25,7 @@ bitset<N>& _Unchecked_reset (size_t pos); bitset<N>& _Unchecked_flip (size_t pos); bool _Unchecked_test (size_t pos); -

Note that these may in fact be removed in the future, although we have +

Note that these may in fact be removed in the future, although we have no present plans to do so (and there doesn't seem to be any immediate reason to).

The member function operator[] on a const bitset returns diff --git a/libstdc++-v3/doc/html/manual/ext_demangling.html b/libstdc++-v3/doc/html/manual/ext_demangling.html index 1eae99a1859..0275830f3ba 100644 --- a/libstdc++-v3/doc/html/manual/ext_demangling.html +++ b/libstdc++-v3/doc/html/manual/ext_demangling.html @@ -45,7 +45,7 @@ int main() std::cout << ti.name() << "\t=> " << realname << "\t: " << status << '\n'; std::free(realname); } -

+

This prints 

    
diff --git a/libstdc++-v3/doc/html/manual/ext_sgi.html b/libstdc++-v3/doc/html/manual/ext_sgi.html
index 2310857804b..5a796e79424 100644
--- a/libstdc++-v3/doc/html/manual/ext_sgi.html
+++ b/libstdc++-v3/doc/html/manual/ext_sgi.html
@@ -11,7 +11,7 @@
      <rope>
      <slist>
      <rb_tree>
-

are all here; +

are all here; <backwards/hash_map> and <backwards/hash_set> are deprecated but available as backwards-compatible extensions, diff --git a/libstdc++-v3/doc/html/manual/generalized_numeric_operations.html b/libstdc++-v3/doc/html/manual/generalized_numeric_operations.html index 8aa676040b5..05539da45fd 100644 --- a/libstdc++-v3/doc/html/manual/generalized_numeric_operations.html +++ b/libstdc++-v3/doc/html/manual/generalized_numeric_operations.html @@ -18,7 +18,7 @@ int sum = std::accumulate(ar,ar+50,0); int sum_stuff = std::accumulate(ar,ar+50,someval); int product = std::accumulate(ar,ar+50,1,std::multiplies<int>()); -

The first call adds all the members of the array, using zero as an +

The first call adds all the members of the array, using zero as an initial value for sum. The second does the same, but uses someval as the starting value (thus, sum_stuff == sum + someval). The final call uses the second of the two signatures, diff --git a/libstdc++-v3/doc/html/manual/io.html b/libstdc++-v3/doc/html/manual/io.html index 75a63f739c8..81c5597c6d4 100644 --- a/libstdc++-v3/doc/html/manual/io.html +++ b/libstdc++-v3/doc/html/manual/io.html @@ -33,7 +33,7 @@ }; extern std::ostream& operator<< (std::ostream&, MyClass&); -

<ios> +

<ios> declares the base classes for the entire I/O stream hierarchy, std::ios_base and std::basic_ios<charT>, the counting types std::streamoff and std::streamsize, @@ -74,7 +74,7 @@ { return os << c.data1() << c.data2(); } -

The std::istream and std::ostream classes +

The std::istream and std::ostream classes are the abstract parents of the various concrete implementations. If you are only using the interfaces, then you only need to use the appropriate interface header. @@ -111,7 +111,7 @@ // this is explained below static ios_base::Init __foo; // not its real name } -

Now, the runtime penalty mentioned previously: the global objects +

Now, the runtime penalty mentioned previously: the global objects must be initialized before any of your own code uses them; this is guaranteed by the standard. Like any other global object, they must be initialized once and only once. This is typically done with a diff --git a/libstdc++-v3/doc/html/manual/io_and_c.html b/libstdc++-v3/doc/html/manual/io_and_c.html index dae1b739e56..753ff1068d6 100644 --- a/libstdc++-v3/doc/html/manual/io_and_c.html +++ b/libstdc++-v3/doc/html/manual/io_and_c.html @@ -20,7 +20,7 @@ std::cout << "Hel"; std::printf ("lo, worl"); std::cout << "d!\n"; -

This must do what you think it does. +

This must do what you think it does.

Alert members of the audience will immediately notice that buffering is going to make a hash of the output unless special steps are taken.

The special steps taken by libstdc++, at least for version 3.0, @@ -40,7 +40,7 @@ #include any of the I/O headers such as ios, iostream, etc std::ios::sync_with_stdio(false); -

You must do this before performing any I/O via the C++ stream objects. +

You must do this before performing any I/O via the C++ stream objects. Once you call this, the C++ streams will operate independently of the (unused) C streams. For GCC 3.x, this means that cout and company will become fully buffered on their own. diff --git a/libstdc++-v3/doc/html/manual/iterators.html b/libstdc++-v3/doc/html/manual/iterators.html index 874de4ad9ac..dce887fa775 100644 --- a/libstdc++-v3/doc/html/manual/iterators.html +++ b/libstdc++-v3/doc/html/manual/iterators.html @@ -90,7 +90,7 @@ classes. | | dereference 'end'. beginning end -

See? Everything between the boundary markers is chapter of the array. +

See? Everything between the boundary markers is chapter of the array. Simple.

Now think back to your junior-high school algebra course, when you were learning how to draw graphs. Remember that a graph terminating diff --git a/libstdc++-v3/doc/html/manual/memory.html b/libstdc++-v3/doc/html/manual/memory.html index e24af81e83b..9dce18db1ea 100644 --- a/libstdc++-v3/doc/html/manual/memory.html +++ b/libstdc++-v3/doc/html/manual/memory.html @@ -37,7 +37,7 @@ 

 	 T*    allocate   (size_type n, const void* hint = 0);
 	 void  deallocate (T* p, size_type n);
-

+

The n arguments in both those functions is a count of the number of T's to allocate space for, not their @@ -192,7 +192,7 @@ Likewise, a debugging form of whichever allocator is currently in use: 

     std::deque <int, __gnu_cxx::debug_allocator<std::allocator<int> > >  debug_deque;
-

Custom Allocators

+

Custom Allocators

Writing a portable C++ allocator would dictate that the interface would look much like the one specified for allocator. Additional member functions, but @@ -336,19 +336,19 @@ function_taking_MyClass_pointer (ap.get()); } -

When an exception gets thrown, the instance of MyClass that's +

When an exception gets thrown, the instance of MyClass that's been created on the heap will be delete'd as the stack is unwound past func().

Changing that code as follows is not AP-friendly: 

 	APMC  ap (new MyClass[22]);
-

You will get the same problems as you would without the use +

You will get the same problems as you would without the use of AP: 

 	char*  array = new char[10];       // array new...
 	...
 	delete array;                      // ...but single-object delete
-

+

AP cannot tell whether the pointer you've passed at creation points to one or many things. If it points to many things, you are about to die. AP is trivial to write, however, so you could write your @@ -363,7 +363,7 @@ { My_Type (My_Type const&); }; -

+

Note the const keyword; the object being copied shouldn't change. The template class auto_ptr (called AP here) does not meet this requirement. Creating a new AP by copying an existing @@ -388,7 +388,7 @@ { std::vector< std::auto_ptr<int> > vec_ap_int; } -

+

Should you try this with the checks enabled, you will see an error.

shared_ptr

The shared_ptr class template stores a pointer, usually obtained via new, diff --git a/libstdc++-v3/doc/html/manual/pairs.html b/libstdc++-v3/doc/html/manual/pairs.html index 06f2ab678c5..e6f987a8916 100644 --- a/libstdc++-v3/doc/html/manual/pairs.html +++ b/libstdc++-v3/doc/html/manual/pairs.html @@ -11,12 +11,12 @@ with its respective default ctor. The other simple ctor, 

     pair (const T1& x, const T2& y);
-

does what you think it does, first getting x +

does what you think it does, first getting x and second getting y.

There is a constructor template for copying pairs of other types: 

     template <class U, class V> pair (const pair<U,V>& p);
-

The compiler will convert as necessary from U to T1 and from +

The compiler will convert as necessary from U to T1 and from V to T2 in order to perform the respective initializations.

The comparison operators are done for you. Equality of two pair<T1,T2>s is defined as both first @@ -30,14 +30,14 @@ 

     x.first  <  y.first  ||
 	( !(y.first  <  x.first)  &&  x.second  <  y.second )
-

The other operators are not defined using the rel_ops +

The other operators are not defined using the rel_ops functions above, but their semantics are the same.

Finally, there is a template function called make_pair that takes two references-to-const objects and returns an instance of a pair instantiated on their respective types: 

     pair<int,MyClass> p = make_pair(4,myobject);
-
Prev Up Next
Chapter 6.  +
Prev Up Next
Chapter 6.  Utilities  Home Memory
\ No newline at end of file diff --git a/libstdc++-v3/doc/html/manual/policy_data_structures_design.html b/libstdc++-v3/doc/html/manual/policy_data_structures_design.html index 2b756663aa1..4e986f3f701 100644 --- a/libstdc++-v3/doc/html/manual/policy_data_structures_design.html +++ b/libstdc++-v3/doc/html/manual/policy_data_structures_design.html @@ -387,7 +387,7 @@ { ... } -

+

then one needs to address the following questions in the body of some_op_sequence:

  • diff --git a/libstdc++-v3/doc/html/manual/setup.html b/libstdc++-v3/doc/html/manual/setup.html index 67bb6c108a1..6d6613ba5f4 100644 --- a/libstdc++-v3/doc/html/manual/setup.html +++ b/libstdc++-v3/doc/html/manual/setup.html @@ -16,7 +16,7 @@ make make check make install -

    +

    Each step is described in more detail in the following sections.

    Prerequisites

    Because libstdc++ is part of GCC, the primary source for diff --git a/libstdc++-v3/doc/html/manual/streambufs.html b/libstdc++-v3/doc/html/manual/streambufs.html index e299d70cb0f..c175054ceff 100644 --- a/libstdc++-v3/doc/html/manual/streambufs.html +++ b/libstdc++-v3/doc/html/manual/streambufs.html @@ -52,7 +52,7 @@ << std::hex << 31 << std::endl; return 0; } -

    Try it yourself! More examples can be found in 3.1.x code, in +

    Try it yourself! More examples can be found in 3.1.x code, in include/ext/*_filebuf.h, and in the article Filtering Streambufs diff --git a/libstdc++-v3/doc/html/manual/strings.html b/libstdc++-v3/doc/html/manual/strings.html index 5344d0e8923..605fce308d4 100644 --- a/libstdc++-v3/doc/html/manual/strings.html +++ b/libstdc++-v3/doc/html/manual/strings.html @@ -47,7 +47,7 @@ capital_s.resize(s.size()); std::transform (s.begin(), s.end(), capital_s.begin(), ToUpper()); } -

    +

    Note that these calls all involve the global C locale through the use of the C functions toupper/tolower. @@ -82,7 +82,7 @@ 

          std::transform (s.begin(), s.end(), capital_s.begin(),
                      [](unsigned char c) { return std::tolower(c); });
-

    Another common operation is trimming off excess whitespace. Much +

    Another common operation is trimming off excess whitespace. Much like transformations, this task is trivial with the use of string's find family. These examples are broken into multiple statements for readability: @@ -273,7 +273,7 @@ stringtok(Container &container, string const &in, to GCC 3.4 the following alternative can be used instead 

           std::string(str.data(), str.size()).swap(str);
-

    This is similar to the idiom for reducing +

    This is similar to the idiom for reducing a vector's memory usage (see this FAQ entry) but the regular copy constructor cannot be used @@ -347,7 +347,7 @@ stringtok(Container &container, string const &in, If you replace CString with string in the above function, the performance is O(n). -

    Joe Buck also pointed out some other things to keep in mind when +

    Joe Buck also pointed out some other things to keep in mind when comparing CString and the Standard string class:

    • CString permits access to its internal representation; coders who exploited that may have problems moving to string. diff --git a/libstdc++-v3/doc/html/manual/support.html b/libstdc++-v3/doc/html/manual/support.html index c7c1cfedcc9..cac1e8fd8df 100644 --- a/libstdc++-v3/doc/html/manual/support.html +++ b/libstdc++-v3/doc/html/manual/support.html @@ -98,7 +98,7 @@ static const bool tinyness_before; static const float_round_style round_style; }; -

    NULL

    +

    NULL

    The only change that might affect people is the type of NULL: while it is required to be a macro, the definition of that macro is not allowed diff --git a/libstdc++-v3/doc/html/manual/termination.html b/libstdc++-v3/doc/html/manual/termination.html index d30f0e0eaea..42a5a594c55 100644 --- a/libstdc++-v3/doc/html/manual/termination.html +++ b/libstdc++-v3/doc/html/manual/termination.html @@ -121,7 +121,7 @@ int main(int argc) <cstdlib>, and call 

          std::set_terminate(std::abort);
-

    +

    After this, all calls to terminate will use abort as the terminate handler.

    diff --git a/libstdc++-v3/doc/html/manual/test.html b/libstdc++-v3/doc/html/manual/test.html index 497ee1ad36e..00cb269e2f7 100644 --- a/libstdc++-v3/doc/html/manual/test.html +++ b/libstdc++-v3/doc/html/manual/test.html @@ -17,7 +17,7 @@ regressions, ABI, and performance. of the C++ standard (ISO 14882) are files within the following directories: - 

    +
         17_intro
     18_support
     19_diagnostics
@@ -32,7 +32,7 @@ regressions, ABI, and performance.
     28_regex
     29_atomics
     30_threads
-   
    
+

    In addition, the following directories include test files: @@ -83,7 +83,7 @@ regressions, ABI, and performance. This test case expects some kind of interactive input in order to finish or pass. At the moment, the interactive tests are not run by default. Instead, they are run by hand, like: - 

    +
     g++ 27_io/objects/char/3_xin.cc
 cat 27_io/objects/char/3_xin.in | a.out
    .in
    
       This file contains the expected input for the corresponding 
@@ -198,7 +198,7 @@ cat 27_io/objects/char/3_xin.in | a.out
    +
         make check-target-libstdc++-v3 RUNTESTFLAGS='--target_board \"unix{-mabi=32,,-mabi=64}\"'
 
    
     
    
@@ -210,9 +210,9 @@ cat 27_io/objects/char/3_xin.in | a.out
    x86_64-pc-linux-gnu, as a few tests still execute the code they build. Here's an example of how to run the testsuite with libstdc++ in freestanding mode: - 

    +
         make check-target-libstdc++-v3 RUNTESTFLAGS='--target_board=unix/-ffreestanding'
-      
    
+

    You can run the tests with a compiler and library that have already been installed. Make sure that the compiler (e.g., diff --git a/libstdc++-v3/doc/html/manual/unordered_associative.html b/libstdc++-v3/doc/html/manual/unordered_associative.html index 8811178f814..d9aa1356d82 100644 --- a/libstdc++-v3/doc/html/manual/unordered_associative.html +++ b/libstdc++-v3/doc/html/manual/unordered_associative.html @@ -90,4 +90,4 @@ struct __is_fast_hash<hasher> : std::false_type { }; } -

Prev Up Next
Associative Home Interacting with C
\ No newline at end of file +
Prev Up Next
Associative Home Interacting with C
\ No newline at end of file diff --git a/libstdc++-v3/doc/html/manual/using_concurrency.html b/libstdc++-v3/doc/html/manual/using_concurrency.html index 98875f3a04c..b0a2d715667 100644 --- a/libstdc++-v3/doc/html/manual/using_concurrency.html +++ b/libstdc++-v3/doc/html/manual/using_concurrency.html @@ -166,7 +166,7 @@ gcc version 4.1.2 20070925 (Red Hat 4.1.2-33) t1.join(); t2.join(); } -

For further details of the C++11 memory model see Hans-J. Boehm's +

For further details of the C++11 memory model see Hans-J. Boehm's Threads and memory model for C++ pages, particularly the introduction and FAQ. diff --git a/libstdc++-v3/doc/xml/faq.xml b/libstdc++-v3/doc/xml/faq.xml index a1d6a2125dc..92b81f2068c 100644 --- a/libstdc++-v3/doc/xml/faq.xml +++ b/libstdc++-v3/doc/xml/faq.xml @@ -813,7 +813,7 @@ Executing a sequence like this would fail: - + #include <fstream> ... std::fstream fs("a_file"); @@ -822,7 +822,7 @@ // . fs.close(); fs.open("a_new_file"); - + All operations on the re-opened fs would fail, or at diff --git a/libstdc++-v3/doc/xml/manual/allocator.xml b/libstdc++-v3/doc/xml/manual/allocator.xml index f9fab499abc..f5a2c7622f4 100644 --- a/libstdc++-v3/doc/xml/manual/allocator.xml +++ b/libstdc++-v3/doc/xml/manual/allocator.xml @@ -52,10 +52,10 @@ typedefs, member functions, etc), but the two which concern us most are: - + T* allocate (size_type n, const void* hint = 0); void deallocate (T* p, size_type n); - + The n arguments in both those @@ -291,14 +291,14 @@ (but non-portable) method of specifying that only malloc or free should be used instead of the default node allocator is: - + std::list <int, __gnu_cxx::malloc_allocator<int> > malloc_list; Likewise, a debugging form of whichever allocator is currently in use: - + std::deque <int, __gnu_cxx::debug_allocator<std::allocator<int> > > debug_deque; - +

Custom Allocators diff --git a/libstdc++-v3/doc/xml/manual/auto_ptr.xml b/libstdc++-v3/doc/xml/manual/auto_ptr.xml index f01e2d491b1..c382141f77f 100644 --- a/libstdc++-v3/doc/xml/manual/auto_ptr.xml +++ b/libstdc++-v3/doc/xml/manual/auto_ptr.xml @@ -36,7 +36,7 @@ presence of exceptions. That's all. This code is AP-friendly: - + // Not a recommend naming scheme, but good for web-based FAQs. typedef std::auto_ptr<MyClass> APMC; @@ -51,24 +51,24 @@ function_taking_MyClass_pointer (ap.get()); } - + When an exception gets thrown, the instance of MyClass that's been created on the heap will be delete'd as the stack is unwound past func(). Changing that code as follows is not AP-friendly: - + APMC ap (new MyClass[22]); - + You will get the same problems as you would without the use of AP: - + char* array = new char[10]; // array new... ... delete array; // ...but single-object delete - + AP cannot tell whether the pointer you've passed at creation points to one or many things. If it points to many things, you are about @@ -87,12 +87,12 @@ described in the standard library require their contained types to have, among other things, a copy constructor like this: - + struct My_Type { My_Type (My_Type const&); }; - + Note the const keyword; the object being copied shouldn't change. The template class auto_ptr (called AP here) does not @@ -113,7 +113,7 @@ in to this implementation will issue an error if you try to compile code like this: - + #include <vector> #include <memory> @@ -121,7 +121,7 @@ { std::vector< std::auto_ptr<int> > vec_ap_int; } - + Should you try this with the checks enabled, you will see an error. diff --git a/libstdc++-v3/doc/xml/manual/backwards_compatibility.xml b/libstdc++-v3/doc/xml/manual/backwards_compatibility.xml index 6a4a5ccedfb..24993aa07d2 100644 --- a/libstdc++-v3/doc/xml/manual/backwards_compatibility.xml +++ b/libstdc++-v3/doc/xml/manual/backwards_compatibility.xml @@ -127,7 +127,7 @@ and <unordered_set> instead. namespace. For maximum portability, consider defining a namespace alias to use to talk about extensions, e.g.: - + #ifdef __GNUC__ #if __GNUC__ < 3 #include <hash_map.h> @@ -145,7 +145,7 @@ and <unordered_set> instead. #endif extension::hash_map<int,int> my_map; - + This is a bit cleaner than defining typedefs for all the instantiations you might need. diff --git a/libstdc++-v3/doc/xml/manual/build_hacking.xml b/libstdc++-v3/doc/xml/manual/build_hacking.xml index 47d9db5e7ba..3b77d217a4e 100644 --- a/libstdc++-v3/doc/xml/manual/build_hacking.xml +++ b/libstdc++-v3/doc/xml/manual/build_hacking.xml @@ -173,19 +173,19 @@ in the build directory starts the build process. The all targ we can arrange the contents however we like. As of this writing, acinclude.m4 is arranged as follows: - + GLIBCXX_CHECK_HOST GLIBCXX_TOPREL_CONFIGURE GLIBCXX_CONFIGURE - + All the major variable "discovery" is done here. CXX, multilibs, etc. - + fragments included from elsewhere - + Right now, "fragments" == "the math/linkage bits". diff --git a/libstdc++-v3/doc/xml/manual/containers.xml b/libstdc++-v3/doc/xml/manual/containers.xml index 1758762b882..f9cfb0583a1 100644 --- a/libstdc++-v3/doc/xml/manual/containers.xml +++ b/libstdc++-v3/doc/xml/manual/containers.xml @@ -86,9 +86,9 @@ Section [23.1.2], Table 69, of the C++ standard lists this function for all of the associative containers (map, set, etc): - + a.insert(p,t); - + where 'p' is an iterator into the container 'a', and 't' is the item to insert. The standard says that t is @@ -196,7 +196,7 @@ No, you cannot write code of the form - + #include <bitset> void foo (size_t n) @@ -204,7 +204,7 @@ std::bitset<n> bits; .... } - + because n must be known at compile time. Your compiler is correct; it is not a bug. That's the way templates @@ -314,17 +314,17 @@ For now you can simply make a temporary string object using the constructor expression: - + std::bitset<5> b ( std::string("10110") ); - + instead of - + std::bitset<5> b ( "10110" ); // invalid - +
@@ -425,7 +425,7 @@ cached. The trait can be specialized for user-defined hash functions like so: - + #include <unordered_set> struct hasher @@ -443,7 +443,7 @@ struct __is_fast_hash<hasher> : std::false_type { }; } - + @@ -492,9 +492,9 @@ The result is that if all your algorithm calls look like - + std::transform(beginof(foo), endof(foo), beginof(foo), SomeFunction); - + then the type of foo can change from an array of ints to a vector of ints to a deque of ints and back again, without ever changing @@ -545,9 +545,9 @@ template<typename T, unsigned int sz> Second, the line - + inline unsigned int lengthof (T (&)[sz]) { return sz; } - + looks just weird! Hint: unused parameters can be left nameless. diff --git a/libstdc++-v3/doc/xml/manual/diagnostics.xml b/libstdc++-v3/doc/xml/manual/diagnostics.xml index 86737cc4d4d..21fe0294ab0 100644 --- a/libstdc++-v3/doc/xml/manual/diagnostics.xml +++ b/libstdc++-v3/doc/xml/manual/diagnostics.xml @@ -64,7 +64,7 @@ place). It's good to remember that you can add your own data to these exceptions when extending the hierarchy: - + struct My_Exception : public std::runtime_error { public: @@ -76,7 +76,7 @@ int e; DBID id; // some user-defined type }; - + diff --git a/libstdc++-v3/doc/xml/manual/extensions.xml b/libstdc++-v3/doc/xml/manual/extensions.xml index a8b7088ff25..81f84002d1c 100644 --- a/libstdc++-v3/doc/xml/manual/extensions.xml +++ b/libstdc++-v3/doc/xml/manual/extensions.xml @@ -161,13 +161,13 @@ extensions, be aware of two things: do no range-checking. If we call them member functions of an instantiation of bitset<N>, then their names and signatures are: - + bitset<N>& _Unchecked_set (size_t pos); bitset<N>& _Unchecked_set (size_t pos, int val); bitset<N>& _Unchecked_reset (size_t pos); bitset<N>& _Unchecked_flip (size_t pos); bool _Unchecked_test (size_t pos); - + Note that these may in fact be removed in the future, although we have no present plans to do so (and there doesn't seem to be any immediate reason to). @@ -181,7 +181,7 @@ extensions, be aware of two things: the index of the first "on" bit, and the index of the first "on" bit that is after prev, respectively: - + size_t _Find_first() const; size_t _Find_next (size_t prev) const; The same caveat given for the _Unchecked_* functions applies here also. @@ -202,13 +202,13 @@ extensions, be aware of two things: The SGI headers - + <hash_map> <hash_set> <rope> <slist> <rb_tree> - + are all here; <backwards/hash_map> and <backwards/hash_set> @@ -346,14 +346,14 @@ get_temporary_buffer(5, (int*)0); additional signatures return void, but take a final parameter by reference to which they assign their results, e.g., - + void count (first, last, value, n); 25.2 (mutating algorithms) is extended with two families of signatures, random_sample and random_sample_n. 25.2.1 (copy) is extended with - + copy_n (_InputIter first, _Size count, _OutputIter result); which copies the first 'count' elements at 'first' into 'result'. @@ -367,7 +367,7 @@ get_temporary_buffer(5, (int*)0); 25.3.8 (lexicographical_compare) is extended with - + lexicographical_compare_3way(_InputIter1 first1, _InputIter1 last1, _InputIter2 first2, _InputIter2 last2) which does... what? @@ -382,7 +382,7 @@ get_temporary_buffer(5, (int*)0); 26.4, the generalized numeric operations such as accumulate, are extended with the following functions: - + power (x, n); power (x, n, monoid_operation); Returns, in FORTRAN syntax, "x ** n" where @@ -399,7 +399,7 @@ get_temporary_buffer(5, (int*)0); That is, it assigns value to *first, value + 1 to *(first + 1) and so on." - + void iota(_ForwardIter first, _ForwardIter last, _Tp value); The iota function is included in the ISO C++ 2011 standard. @@ -523,7 +523,7 @@ get_temporary_buffer(5, (int*)0); Probably the only time you'll be interested in demangling at runtime is when you're seeing typeid strings in RTTI. For example: - + #include <iostream> #include <cstdlib> #include <cxxabi.h> @@ -546,7 +546,7 @@ int main() std::cout << ti.name() << "\t=> " << realname << "\t: " << status << '\n'; std::free(realname); } - + This prints diff --git a/libstdc++-v3/doc/xml/manual/intro.xml b/libstdc++-v3/doc/xml/manual/intro.xml index ed0b90d202b..78e034b532c 100644 --- a/libstdc++-v3/doc/xml/manual/intro.xml +++ b/libstdc++-v3/doc/xml/manual/intro.xml @@ -1336,7 +1336,7 @@ requirements of the license of GCC. The general outline of commands to build GCC is something like: - + get gcc sources extract into gccsrcdir mkdir gccbuilddir @@ -1345,7 +1345,7 @@ requirements of the license of GCC. make make check make install - + Each step is described in more detail in the following sections. diff --git a/libstdc++-v3/doc/xml/manual/io.xml b/libstdc++-v3/doc/xml/manual/io.xml index d6fe2ce841d..adc37cd8488 100644 --- a/libstdc++-v3/doc/xml/manual/io.xml +++ b/libstdc++-v3/doc/xml/manual/io.xml @@ -37,7 +37,7 @@ Look in the <iosfwd> header if you'd like to know why.) For example, - + #include <iosfwd> class MyClass @@ -47,7 +47,7 @@ }; extern std::ostream& operator<< (std::ostream&, MyClass&); - + <ios> declares the base classes for the entire I/O stream hierarchy, std::ios_base and std::basic_ios<charT>, @@ -87,14 +87,14 @@ or any of the other abstract stream formatting functions. For example, - + #include <istream> std::ostream& operator<< (std::ostream& os, MyClass& c) { return os << c.data1() << c.data2(); } - + The std::istream and std::ostream classes are the abstract parents of the various concrete implementations. If you are only using the @@ -123,7 +123,7 @@ <ostream> headers, but nothing else. The contents of this header look like: - + #include <ostream> #include <istream> @@ -136,7 +136,7 @@ // this is explained below static ios_base::Init __foo; // not its real name } - + Now, the runtime penalty mentioned previously: the global objects must be initialized before any of your own code uses them; this is guaranteed by the standard. Like any other global object, they must @@ -201,7 +201,7 @@ assumes many things about the nature of the character type being used (for more information, read the books or the newsgroups): - + #include <iostream> #include <streambuf> #include <locale> @@ -238,7 +238,7 @@ << std::hex << 31 << std::endl; return 0; } - + Try it yourself! More examples can be found in 3.1.x code, in include/ext/*_filebuf.h, and in the article Filtering @@ -270,7 +270,7 @@ out as soon as possible, etc -- but the buffering is largely wasted when doing this to a file: - + output << "a line of text" << endl; output << some_data_variable << endl; output << "another line of text" << endl; @@ -278,7 +278,7 @@ and let the libraries and the system worry about the buffering. If you need a newline, just write a newline: - + output << "a line of text\n" << some_data_variable << '\n' << "another line of text\n"; @@ -290,7 +290,7 @@ endl if you also need a newline, or just flush the buffer yourself: - + output << ...... << flush; // can use std::flush manipulator output.flush(); // or call a member fn On the other hand, there are times when writing to a file should @@ -300,7 +300,7 @@ just to turn off the buffering before any I/O operations at all have been done (note that opening counts as an I/O operation): - + std::ofstream os; std::ifstream is; int i; @@ -403,21 +403,21 @@ completely portably. And since this is C++, you have an open ifstream (call it IN) and an open ofstream (call it OUT): - + #include <fstream> std::ifstream IN ("input_file"); std::ofstream OUT ("output_file"); Here's the easiest way to get it completely wrong: - + OUT << IN; For those of you who don't already know why this doesn't work (probably from having done it before), I invite you to quickly create a simple text file called "input_file" containing the sentence - + The quick brown fox jumped over the lazy dog. surrounded by blank lines. Code it up and try it. The contents of "output_file" may surprise you. @@ -440,7 +440,7 @@ using the rdbuf() member function. Therefore, the easiest way to copy the file is: - + OUT << IN.rdbuf(); So what was happening with OUT<<IN? Undefined behavior, since that particular << isn't defined by the Standard. @@ -619,14 +619,14 @@ Because the C++ library includes the C library, both C-style and C++-style I/O have to work at the same time. For example: - + #include <iostream> #include <cstdio> std::cout << "Hel"; std::printf ("lo, worl"); std::cout << "d!\n"; - + This must do what you think it does. Alert members of the audience will immediately notice that buffering @@ -647,11 +647,11 @@ C++ I/O, then there's no need to sync with the C streams. The right thing to do in this case is to call - + #include any of the I/O headers such as ios, iostream, etc std::ios::sync_with_stdio(false); - + You must do this before performing any I/O via the C++ stream objects. Once you call this, the C++ streams will operate independently of the (unused) C streams. For GCC 3.x, this means that cout and diff --git a/libstdc++-v3/doc/xml/manual/iterators.xml b/libstdc++-v3/doc/xml/manual/iterators.xml index d0b75084e05..d4077a4c766 100644 --- a/libstdc++-v3/doc/xml/manual/iterators.xml +++ b/libstdc++-v3/doc/xml/manual/iterators.xml @@ -111,7 +111,7 @@ classes. of them as indexing 0 through n-1. Think of them as boundary markers: - + beginning end | | @@ -131,7 +131,7 @@ classes. | | dereference 'end'. beginning end - + See? Everything between the boundary markers is chapter of the array. Simple. diff --git a/libstdc++-v3/doc/xml/manual/numerics.xml b/libstdc++-v3/doc/xml/manual/numerics.xml index bb1d45d6b3b..d2ced6fd83d 100644 --- a/libstdc++-v3/doc/xml/manual/numerics.xml +++ b/libstdc++-v3/doc/xml/manual/numerics.xml @@ -70,7 +70,7 @@ Here is a simple example of the two forms of accumulate. - + int ar[50]; int someval = somefunction(); @@ -79,7 +79,7 @@ int sum = std::accumulate(ar,ar+50,0); int sum_stuff = std::accumulate(ar,ar+50,someval); int product = std::accumulate(ar,ar+50,1,std::multiplies<int>()); - + The first call adds all the members of the array, using zero as an initial value for sum. The second does the same, but uses someval as the starting value (thus, sum_stuff == sum + diff --git a/libstdc++-v3/doc/xml/manual/policy_data_structures.xml b/libstdc++-v3/doc/xml/manual/policy_data_structures.xml index 305257c7404..e6e89613769 100644 --- a/libstdc++-v3/doc/xml/manual/policy_data_structures.xml +++ b/libstdc++-v3/doc/xml/manual/policy_data_structures.xml @@ -2735,14 +2735,14 @@ a generic container object, what is the behavior of the object? Suppose one writes - + template<typename Cntnr> void some_op_sequence(Cntnr &r_container) { ... } - + then one needs to address the following questions in the body diff --git a/libstdc++-v3/doc/xml/manual/strings.xml b/libstdc++-v3/doc/xml/manual/strings.xml index 58a78d01d23..c5417759ad9 100644 --- a/libstdc++-v3/doc/xml/manual/strings.xml +++ b/libstdc++-v3/doc/xml/manual/strings.xml @@ -31,7 +31,7 @@ This code will go through some iterations. Here's a simple version: - + #include <string> #include <algorithm> #include <cctype> // old <ctype.h> @@ -62,7 +62,7 @@ capital_s.resize(s.size()); std::transform (s.begin(), s.end(), capital_s.begin(), ToUpper()); } - + Note that these calls all involve the global C locale through the use of the C functions @@ -87,7 +87,7 @@ At minimum, you can write short wrappers like - + char toLower (char c) { // std::tolower(c) is undefined if c < 0 so cast to unsigned char. @@ -100,16 +100,16 @@ which can perform the conversion to unsigned char and also ensure the single-argument form of std::lower is used: - + std::transform (s.begin(), s.end(), capital_s.begin(), [](unsigned char c) { return std::tolower(c); }); - + Another common operation is trimming off excess whitespace. Much like transformations, this task is trivial with the use of string's find family. These examples are broken into multiple statements for readability: - + std::string str (" \t blah blah blah \n "); // trim leading whitespace @@ -138,7 +138,7 @@ case-insensitive in the same way as the (common but nonstandard) C function stricmp(). - + ci_string s( "AbCdE" ); // case insensitive @@ -192,7 +192,7 @@ type parameters, which take default arguments based on the character type (called CharT here): - + template <typename CharT, typename Traits = char_traits<CharT>, typename Alloc = allocator<CharT> > @@ -205,7 +205,7 @@ template is declared but not defined. That means there is only - + template <typename CharT> struct char_traits { @@ -314,7 +314,7 @@ stringtok(Container &container, string const &in, - + std::list<string> ls; stringtok (ls, " this \t is\t\n a test "); for (std::list<string>const_iterator i = ls.begin(); @@ -324,7 +324,7 @@ stringtok(Container &container, string const &in, } You would see this as output: - + :this: :is: :a: @@ -358,9 +358,9 @@ stringtok(Container &container, string const &in, This behaviour is suggested, but not required by the standard. Prior to GCC 3.4 the following alternative can be used instead - + std::string(str.data(), str.size()).swap(str); - + This is similar to the idiom for reducing a vector's memory usage (see this FAQ @@ -411,7 +411,7 @@ stringtok(Container &container, string const &in, streams seamlessly because they inherit from the iostream hierarchy. An quick example: - + #include <iostream> #include <string> #include <sstream> @@ -434,7 +434,7 @@ stringtok(Container &container, string const &in, A serious problem with CString is a design bug in its memory allocation. Specifically, quoting from that same message: - + CString suffers from a common programming error that results in poor performance. Consider the following code: @@ -455,7 +455,7 @@ stringtok(Container &container, string const &in, If you replace CString with string in the above function, the performance is O(n). - + Joe Buck also pointed out some other things to keep in mind when comparing CString and the Standard string class: diff --git a/libstdc++-v3/doc/xml/manual/support.xml b/libstdc++-v3/doc/xml/manual/support.xml index f4b41664f60..b7fb983fa4b 100644 --- a/libstdc++-v3/doc/xml/manual/support.xml +++ b/libstdc++-v3/doc/xml/manual/support.xml @@ -100,7 +100,7 @@ and defined as follows: - + template<typename T> struct class { @@ -139,7 +139,7 @@ static const bool tinyness_before; static const float_round_style round_style; }; - +
NULL @@ -327,7 +327,7 @@ by registering a new-handler, because what operator new actually does is something like: - + while (true) { if (void* p = /* try to allocate memory */) @@ -337,13 +337,13 @@ else throw bad_alloc{}; } - + This means you can influence what happens on allocation failure by writing your own new-handler and then registering it with std::set_new_handler: - + typedef void (*PFV)(); static char* safety; @@ -366,7 +366,7 @@ old_handler = set_new_handler (&my_new_handler); ... } - +
Additional Notes @@ -549,9 +549,9 @@ int main(int argc) <cstdlib>, and call - + std::set_terminate(std::abort); - + After this, all calls to terminate will use diff --git a/libstdc++-v3/doc/xml/manual/test.xml b/libstdc++-v3/doc/xml/manual/test.xml index df49f56b0d0..68b5f8aedb4 100644 --- a/libstdc++-v3/doc/xml/manual/test.xml +++ b/libstdc++-v3/doc/xml/manual/test.xml @@ -39,7 +39,7 @@ regressions, ABI, and performance. of the C++ standard (ISO 14882) are files within the following directories: - + 17_intro 18_support 19_diagnostics @@ -54,7 +54,7 @@ regressions, ABI, and performance. 28_regex 29_atomics 30_threads - + @@ -167,7 +167,7 @@ regressions, ABI, and performance. This test case expects some kind of interactive input in order to finish or pass. At the moment, the interactive tests are not run by default. Instead, they are run by hand, like: - + g++ 27_io/objects/char/3_xin.cc cat 27_io/objects/char/3_xin.in | a.out @@ -343,7 +343,7 @@ cat 27_io/objects/char/3_xin.in | a.out Also, here is an example of how to run the libstdc++ testsuite for a multilibed build directory with different ABI settings: - + make check-target-libstdc++-v3 RUNTESTFLAGS='--target_board \"unix{-mabi=32,,-mabi=64}\"' @@ -357,9 +357,9 @@ cat 27_io/objects/char/3_xin.in | a.out run programs on, e.g. x86_64-pc-linux-gnu, as a few tests still execute the code they build. Here's an example of how to run the testsuite with libstdc++ in freestanding mode: - + make check-target-libstdc++-v3 RUNTESTFLAGS='--target_board=unix/-ffreestanding' - + diff --git a/libstdc++-v3/doc/xml/manual/using.xml b/libstdc++-v3/doc/xml/manual/using.xml index 4b8f53d926c..bec5419d587 100644 --- a/libstdc++-v3/doc/xml/manual/using.xml +++ b/libstdc++-v3/doc/xml/manual/using.xml @@ -2018,7 +2018,7 @@ gcc version 4.1.2 20070925 (Red Hat 4.1.2-33) into great detail, here is an example which requires user-level locks: - + library_class_a shared_object_a; void thread_main () { @@ -2032,7 +2032,7 @@ gcc version 4.1.2 20070925 (Red Hat 4.1.2-33) another thread, here is an example that does not require any user-level locks: - + void thread_main () { library_class_a object_a; library_class_b *object_b = new library_class_b; @@ -2089,7 +2089,7 @@ gcc version 4.1.2 20070925 (Red Hat 4.1.2-33) globally-visible object, the library ensures that the reference count updates are atomic and do not introduce data races: - + std::shared_ptr<int> global_sp; void thread_main() { @@ -2112,7 +2112,7 @@ gcc version 4.1.2 20070925 (Red Hat 4.1.2-33) t1.join(); t2.join(); } - + For further details of the C++11 memory model see Hans-J. Boehm's Threads diff --git a/libstdc++-v3/doc/xml/manual/utilities.xml b/libstdc++-v3/doc/xml/manual/utilities.xml index c2e013e3416..2bcbe28ea7e 100644 --- a/libstdc++-v3/doc/xml/manual/utilities.xml +++ b/libstdc++-v3/doc/xml/manual/utilities.xml @@ -40,17 +40,17 @@ Construction is simple. The default ctor initializes each member with its respective default ctor. The other simple ctor, - + pair (const T1& x, const T2& y); - + does what you think it does, first getting x and second getting y. There is a constructor template for copying pairs of other types: - + template <class U, class V> pair (const pair<U,V>& p); - + The compiler will convert as necessary from U to T1 and from V to T2 in order to perform the respective initializations. @@ -65,10 +65,10 @@ The less-than operator is a bit odd the first time you see it. It is defined as evaluating to: - + x.first < y.first || ( !(y.first < x.first) && x.second < y.second ) - + The other operators are not defined using the rel_ops functions above, but their semantics are the same. @@ -76,9 +76,9 @@ that takes two references-to-const objects and returns an instance of a pair instantiated on their respective types: - + pair<int,MyClass> p = make_pair(4,myobject); - +