Update docs to refer to the "draft standard" simply as the "standard"

This commit is contained in:
Christian Mazakas
2022-02-07 09:15:01 -08:00
parent cb4b417f76
commit 3062759ca8
3 changed files with 4 additions and 4 deletions

View File

@ -86,7 +86,7 @@ influence it:
* Suggest a maximum load factor by calling `max_load_factor`.
`max_load_factor` doesn't let you set the maximum load factor yourself, it just
lets you give a _hint_. And even then, the draft standard doesn't actually
lets you give a _hint_. And even then, the standard doesn't actually
require the container to pay much attention to this value. The only time the
load factor is _required_ to be less than the maximum is following a call to
`rehash`. But most implementations will try to keep the number of elements

View File

@ -131,7 +131,7 @@ boost::unordered_multiset<point> points;
```
See the link:../../../container_hash/index.html[Boost.Hash documentation^] for more detail on how to
do this. Remember that it relies on extensions to the draft standard - so it
do this. Remember that it relies on extensions to the standard - so it
won't work for other implementations of the unordered associative containers,
you'll need to explicitly use Boost.Hash.

View File

@ -5,7 +5,7 @@
= Implementation Rationale
The intent of this library is to implement the unordered
containers in the draft standard, so the interface was fixed. But there are
containers in the standard, so the interface was fixed. But there are
still some implementation decisions to make. The priorities are
conformance to the standard and portability.
@ -21,7 +21,7 @@ It would be conceivable to write a hash table that uses another method. For
example, it could use open addressing, and use the lookup chain to act as a
bucket but there are some serious problems with this:
* The draft standard requires that pointers to elements aren't invalidated, so
* The standard requires that pointers to elements aren't invalidated, so
the elements can't be stored in one array, but will need a layer of
indirection instead - losing the efficiency and most of the memory gain,
the main advantages of open addressing.