FreeChainXenon/gcc
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Small markup changes to PBDS docs

Browse source 
* doc/xml/manual/policy_data_structures.xml: Comment out stray
	<remark> elements. Fix formatting of bibliography references.

From-SVN: r271132
This commit is contained in:
Jonathan Wakely 2019-05-13 21:11:47 +01:00 • committed by Jonathan Wakely
parent f5545ebef2
commit e6e0842944
3 changed files with 18 additions and 11 deletions
Download patch file Download diff file Expand all files Collapse all files

5
libstdc++-v3/ChangeLog
View file

@ -1,3 +1,8 @@
2019-05-13 Jonathan Wakely <jwakely@redhat.com>
* doc/xml/manual/policy_data_structures.xml: Comment out stray
<remark> elements. Fix formatting of bibliography references.
2019-05-13 Edward Smith-Rowland <3dw4rd@verizon.net> 2019-05-13 Edward Smith-Rowland <3dw4rd@verizon.net>
* doc/xml/manual/status_cxx2020.xml: Document P0811R3 status. * doc/xml/manual/status_cxx2020.xml: Document P0811R3 status.

8
libstdc++-v3/doc/xml/manual/policy_data_structures.xml
View file

@ -458,10 +458,10 @@
priority-queues container), there is a possible need for priority-queues container), there is a possible need for
different types of iterators for self-organizing containers: different types of iterators for self-organizing containers:
the iterator concept seems overloaded to mean two different the iterator concept seems overloaded to mean two different
things (in some cases). <remark> XXX things (in some cases). <!-- <remark> XXX
"ds_gen.html#find_range">Design::Associative "ds_gen.html#find_range">Design::Associative
Containers::Data-Structure Genericity::Point-Type and Range-Type Containers::Data-Structure Genericity::Point-Type and Range-Type
Methods</remark>. Methods</remark>. -->
</para> </para>
<section xml:id="associative.iterators.using"> <section xml:id="associative.iterators.using">
@ -3415,7 +3415,9 @@
<para>Α<subscript>min</subscript> ≤ (number of <para>Α<subscript>min</subscript> ≤ (number of
stored elements) / (hash-table size) ≤ stored elements) / (hash-table size) ≤
Α<subscript>max</subscript><remark>load factor min max</remark></para> Α<subscript>max</subscript>
<!-- <remark>load factor min max</remark> -->
</para>
<para>Collision-check policies work in the opposite direction of <para>Collision-check policies work in the opposite direction of
load-check policies. They focus on keeping the number of load-check policies. They focus on keeping the number of

16
libstdc++-v3/doc/xml/manual/test_policy_data_structures.xml
View file

@ -2513,7 +2513,7 @@
<para>This test inserts a number of values with keys from an arbitrary <para>This test inserts a number of values with keys from an arbitrary
text ([ wickland96thirty ]) into a container text ([wickland96thirty]) into a container
using <function>insert</function> . It measures the average time using <function>insert</function> . It measures the average time
for <function>insert</function> as a function of the number of for <function>insert</function> as a function of the number of
values inserted.</para> values inserted.</para>
@ -3156,7 +3156,7 @@
<para>This test inserts a number of values with keys from an <para>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 a container, then performs a series of finds using
<function>find</function>. It is different than Tree-Based and <function>find</function>. It is different than Tree-Based and
Trie-Based Text <function>find</function> Find Timing Test in the Trie-Based Text <function>find</function> Find Timing Test in the
@ -3846,7 +3846,7 @@
<para>This test inserts a number of pairs into a container. The <para>This test inserts a number of pairs into a container. The
first item of each pair is a string from an arbitrary text 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 the second is a uniform i.i.d.integer. The container is a
"multimap" - it considers the first member of each pair as a "multimap" - it considers the first member of each pair as a
primary key, and the second member of each pair as a secondary primary key, and the second member of each pair as a secondary
@ -4310,7 +4310,7 @@
<para>This test inserts a number of pairs into a container. The <para>This test inserts a number of pairs into a container. The
first item of each pair is a string from an arbitrary text 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 the second is a uniform integer. The container is a
"multimap" - it considers the first member of each pair as a "multimap" - it considers the first member of each pair as a
primary key, and the second member of each pair as a secondary primary key, and the second member of each pair as a secondary
@ -4775,7 +4775,7 @@
<para>This test inserts a number of pairs into a container. The <para>This test inserts a number of pairs into a container. The
first item of each pair is a string from an arbitrary text 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 the second is a uniform integer. The container is a
"multimap" - it considers the first member of each pair as a "multimap" - it considers the first member of each pair as a
primary key, and the second member of each pair as a secondary primary key, and the second member of each pair as a secondary
@ -5242,7 +5242,7 @@
<para>This test inserts a number of pairs into a container. The <para>This test inserts a number of pairs into a container. The
first item of each pair is a string from an arbitrary text 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 the second is a uniform integer. The container is a
"multimap" - it considers the first member of each pair as a "multimap" - it considers the first member of each pair as a
primary key, and the second member of each pair as a secondary primary key, and the second member of each pair as a secondary
@ -5708,7 +5708,7 @@
</title></info> </title></info>
<para>This test inserts a number of pairs into a container. The <para>This test inserts a number of pairs into a container. The
first item of each pair is a string from an arbitrary text 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 the second is a uniform integer. The container is a
"multimap" - it considers the first member of each pair as a "multimap" - it considers the first member of each pair as a
primary key, and the second member of each pair as a secondary primary key, and the second member of each pair as a secondary
@ -6168,7 +6168,7 @@
</title></info> </title></info>
<para>This test inserts a number of pairs into a container. The <para>This test inserts a number of pairs into a container. The
first item of each pair is a string from an arbitrary text 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 the second is a uniform integer. The container is a
"multimap" - it considers the first member of each pair as a "multimap" - it considers the first member of each pair as a
primary key, and the second member of each pair as a secondary primary key, and the second member of each pair as a secondary