From: Jonathan Wakely Date: Fri, 17 May 2019 09:28:13 +0000 (+0100) Subject: Add missing piece of P0777R1 and update C++20 status docs X-Git-Url: https://git.libre-soc.org/?a=commitdiff_plain;h=32a1aa709502e10e219393dced66255cb971fad9;p=gcc.git Add missing piece of P0777R1 and update C++20 status docs * doc/xml/manual/status_cxx2020.xml: Update P0608R3, P0777R1, and P1165R1 entries. * doc/html/*: Regenerate. * include/std/tuple (make_from_tuple): Use remove_reference_t instead of decay_t (P0777R1). From-SVN: r271316 --- diff --git a/libstdc++-v3/ChangeLog b/libstdc++-v3/ChangeLog index 5ba8c2212e3..2c119b563a5 100644 --- a/libstdc++-v3/ChangeLog +++ b/libstdc++-v3/ChangeLog @@ -1,3 +1,11 @@ +2019-05-17 Jonathan Wakely + + * doc/xml/manual/status_cxx2020.xml: Update P0608R3, P0777R1, and + P1165R1 entries. + * doc/html/*: Regenerate. + * include/std/tuple (make_from_tuple): Use remove_reference_t instead + of decay_t (P0777R1). + 2019-05-17 François Dumont Move from state of allocators (LWG2593) diff --git a/libstdc++-v3/doc/html/manual/policy_based_data_structures_test.html b/libstdc++-v3/doc/html/manual/policy_based_data_structures_test.html index 6e454bd7f52..0c2de38ffa7 100644 --- a/libstdc++-v3/doc/html/manual/policy_based_data_structures_test.html +++ b/libstdc++-v3/doc/html/manual/policy_based_data_structures_test.html @@ -989,7 +989,7 @@

Description

This test inserts a number of values with keys from an arbitrary - text ([ wickland96thirty ]) into a container + text ([wickland96thirty]) into a container using insert . It measures the average time for insert as a function of the number of values inserted.

The test checks the effect of different underlying @@ -1207,7 +1207,7 @@

Description

This test inserts a number of values with keys from an - arbitrary text ([ wickland96thirty ]) into + arbitrary text ([wickland96thirty]) into a container, then performs a series of finds using find. It is different than Tree-Based and Trie-Based Text find Find Timing Test in the @@ -1467,7 +1467,7 @@ Description

This test inserts a number of pairs into a container. The first item of each pair is a string from an arbitrary text - [wickland96thirty], and + ([wickland96thirty]), and the second is a uniform i.i.d.integer. The container is a "multimap" - it considers the first member of each pair as a primary key, and the second member of each pair as a secondary @@ -1639,7 +1639,7 @@ Description

This test inserts a number of pairs into a container. The first item of each pair is a string from an arbitrary text - [wickland96thirty], and + ([wickland96thirty]), and the second is a uniform integer. The container is a "multimap" - it considers the first member of each pair as a primary key, and the second member of each pair as a secondary @@ -1811,7 +1811,7 @@ Description

This test inserts a number of pairs into a container. The first item of each pair is a string from an arbitrary text - [wickland96thirty], and + ([wickland96thirty]), and the second is a uniform integer. The container is a "multimap" - it considers the first member of each pair as a primary key, and the second member of each pair as a secondary @@ -1985,7 +1985,7 @@ Description

This test inserts a number of pairs into a container. The first item of each pair is a string from an arbitrary text - [wickland96thirty], and + ([wickland96thirty]), and the second is a uniform integer. The container is a "multimap" - it considers the first member of each pair as a primary key, and the second member of each pair as a secondary @@ -2159,7 +2159,7 @@ Description

This test inserts a number of pairs into a container. The first item of each pair is a string from an arbitrary text - [wickland96thirty], and + ([wickland96thirty]), and the second is a uniform integer. The container is a "multimap" - it considers the first member of each pair as a primary key, and the second member of each pair as a secondary @@ -2328,7 +2328,7 @@ Description

This test inserts a number of pairs into a container. The first item of each pair is a string from an arbitrary text - [wickland96thirty], and + ([wickland96thirty]), and the second is a uniform integer. The container is a "multimap" - it considers the first member of each pair as a primary key, and the second member of each pair as a secondary diff --git a/libstdc++-v3/doc/html/manual/policy_data_structures.html b/libstdc++-v3/doc/html/manual/policy_data_structures.html index 5744ffee37a..02caac0d1d2 100644 --- a/libstdc++-v3/doc/html/manual/policy_data_structures.html +++ b/libstdc++-v3/doc/html/manual/policy_data_structures.html @@ -354,10 +354,7 @@ priority-queues container), there is a possible need for different types of iterators for self-organizing containers: the iterator concept seems overloaded to mean two different - things (in some cases). XXX - "ds_gen.html#find_range">Design::Associative - Containers::Data-Structure Genericity::Point-Type and Range-Type - Methods. + things (in some cases).

Using Point Iterators for Range Operations

Suppose cntnr is some associative container, and say c is an object of 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 611b2e76ee9..ca3c2ae36d9 100644 --- a/libstdc++-v3/doc/html/manual/policy_data_structures_design.html +++ b/libstdc++-v3/doc/html/manual/policy_data_structures_design.html @@ -656,7 +656,9 @@ Αmax, and the hash table maintains the invariant that

Αmin ≤ (number of stored elements) / (hash-table size) ≤ - Αmaxload factor min max

Collision-check policies work in the opposite direction of + Αmax + +

Collision-check policies work in the opposite direction of load-check policies. They focus on keeping the number of collisions moderate and hoping that the size of the table will not grow very large, instead of keeping a moderate load-factor diff --git a/libstdc++-v3/doc/html/manual/status.html b/libstdc++-v3/doc/html/manual/status.html index 97bb38c6674..f6494b5477f 100644 --- a/libstdc++-v3/doc/html/manual/status.html +++ b/libstdc++-v3/doc/html/manual/status.html @@ -1082,11 +1082,11 @@ Feature-testing recommendations for C++. P0768R1 -   Treating Unnecessary decay +   Treating Unnecessary decay P0777R1 -   <span> + 9.1   <span> P0122R7 @@ -1248,11 +1248,11 @@ Feature-testing recommendations for C++. P0602R4 - 8.3   A sane variant converting constructor + 8.3   A sane variant converting constructor P0608R3 -   visit<R>: Explicit Return Type for visit + 10.1   visit<R>: Explicit Return Type for visit P0655R1 @@ -1304,11 +1304,11 @@ Feature-testing recommendations for C++. P1148R0 -   Make stateful allocator propagation more consistent for operator+(basic_string) +   Make stateful allocator propagation more consistent for operator+(basic_string) P1165R1 -   Adopt Consistent Container Erasure from Library Fundamentals 2 for C++20 + 10.1   Adopt Consistent Container Erasure from Library Fundamentals 2 for C++20 P1209R0 @@ -1328,7 +1328,11 @@ Feature-testing recommendations for C++. P1285R0 -   Missing feature test macros +   Well-behaved interpolation for numbers and pointers + + P0811R3 + + 9.1   Missing feature test macros P1353R0 diff --git a/libstdc++-v3/doc/xml/manual/status_cxx2020.xml b/libstdc++-v3/doc/xml/manual/status_cxx2020.xml index 5cdd2227ae0..c7a543f85d9 100644 --- a/libstdc++-v3/doc/xml/manual/status_cxx2020.xml +++ b/libstdc++-v3/doc/xml/manual/status_cxx2020.xml @@ -227,14 +227,13 @@ Feature-testing recommendations for C++. - Treating Unnecessary decay P0777R1 - + 9.1 @@ -702,14 +701,13 @@ Feature-testing recommendations for C++. - A sane variant converting constructor P0608R3 - + 10.1 @@ -863,14 +861,13 @@ Feature-testing recommendations for C++. - Make stateful allocator propagation more consistent for operator+(basic_string) P1165R1 - + 10.1 diff --git a/libstdc++-v3/include/std/tuple b/libstdc++-v3/include/std/tuple index a28111749f0..b81157c097b 100644 --- a/libstdc++-v3/include/std/tuple +++ b/libstdc++-v3/include/std/tuple @@ -1756,7 +1756,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION { return __make_from_tuple_impl<_Tp>( std::forward<_Tuple>(__t), - make_index_sequence>>{}); + make_index_sequence>>{}); } #endif // C++17