boostorg/unordered
1
0
Fork 1
mirror of https://github.com/boostorg/unordered.git synced 2025-07-30 19:37:14 +02:00
Code Issues Packages Projects Releases Wiki Activity

Update unordered container links to the new draft standard.

Browse Source 
[SVN r2948]
This commit is contained in:
Daniel James
2006-04-30 15:00:11 +00:00
parent b082192870
commit 13f2fbaf00
6 changed files with 29 additions and 25 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
doc/buckets.qbk
View File

@ -73,9 +73,9 @@ initially set to 1.0.
`max_load_factor` tells the container to change the maximum load factor, `max_load_factor` tells the container to change the maximum load factor,
using your supplied hint as a suggestion. using your supplied hint as a suggestion.
TR1 doesn't actually require the container to pay much attention to this The draft standard doesn't actually require the container to pay much attention
value. The only time the load factor is required to be less than the maximum to this value. The only time the load factor is required to be less than the
is following a call to `rehash`. maximum is following a call to `rehash`.
It is not specified anywhere how other member functions affect the bucket count. It is not specified anywhere how other member functions affect the bucket count.
But most implementations will invalidate the iterators whenever they change But most implementations will invalidate the iterators whenever they change

10
doc/intro.qbk
View File

@ -1,5 +1,8 @@
[def __tr1__ [@http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2005/n1745.pdf [def __tr1__ [@http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2006/n2009.pdf
C++ Standard Library Technical Report]] C++ Standard Library Technical Report]]
[def __draft__
[@http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2006/n2009.pdf
Working Draft of the C++ Standard]]
[def __hash-table__ [@http://en.wikipedia.org/wiki/Hash_table [def __hash-table__ [@http://en.wikipedia.org/wiki/Hash_table
hash table]] hash table]]
[def __hash-function__ [@http://en.wikipedia.org/wiki/Hash_function [def __hash-function__ [@http://en.wikipedia.org/wiki/Hash_function
@ -21,8 +24,9 @@ It might be slow to calculate, or even impossible. On the other hand, in a hash
table, then elements aren't ordered - but you need an equality function table, then elements aren't ordered - but you need an equality function
and a hash function for the key. and a hash function for the key.
So the __tr1__ provides the unordered associative containers, which are So the __tr1__ introduced the unordered associative containers, which are
implemented using hash tables. There are four containers to match the existing implemented using hash tables, and they have now been added to the __draft__.
There are four containers to match the existing
associate containers. In the header <[headerref boost/unordered_set.hpp]>: associate containers. In the header <[headerref boost/unordered_set.hpp]>:
template < template <

6
doc/rationale.qbk
View File

@ -4,9 +4,9 @@
[section:rationale Implementation Rationale] [section:rationale Implementation Rationale]
From the start the intent of this library was to implement the unordred From the start the intent of this library was to implement the unordered
containers in TR1, so the interface was fixed. But there are still some containers in the draft standard, so the interface was fixed. But there are
implementation desicions to make. The priorities for the library are still some implementation desicions to make. The priorities for the library are
conformance to the standard and portability. conformance to the standard and portability.
[h2 Number of Buckets] [h2 Number of Buckets]

16
doc/ref.xml
View File

@ -27,8 +27,8 @@
<purpose>An unordered associative container that stores unique values. <purpose>An unordered associative container that stores unique values.
</purpose> </purpose>
<description> <description>
<para>For the normative reference see section 6.3 of <para>For the normative reference see chapter 23 of
<ulink url="http://www.open-std.org/JTC1/SC22/WG21/docs/papers/2005/n1836.pdf">TR1 [n1836]. <ulink url="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2006/n2009.pdf">the working draft of the C++ standard [n2009].
</ulink> </ulink>
</para> </para>
<para> <para>
@ -778,8 +778,8 @@
<purpose>An unordered associative container that stores values. The same key can be stored multiple times. <purpose>An unordered associative container that stores values. The same key can be stored multiple times.
</purpose> </purpose>
<description> <description>
<para>For the normative reference see section 6.3 of <para>For the normative reference see chapter 23 of
<ulink url="http://www.open-std.org/JTC1/SC22/WG21/docs/papers/2005/n1836.pdf">TR1 [n1836]. <ulink url="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2006/n2009.pdf">the working draft of the C++ standard [n2009].
</ulink> </ulink>
</para> </para>
<para> <para>
@ -1537,8 +1537,8 @@
<purpose>An unordered associative container that associates unique keys with another value. <purpose>An unordered associative container that associates unique keys with another value.
</purpose> </purpose>
<description> <description>
<para>For the normative reference see section 6.3 of <para>For the normative reference see chapter 23 of
<ulink url="http://www.open-std.org/JTC1/SC22/WG21/docs/papers/2005/n1836.pdf">TR1 [n1836]. <ulink url="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2006/n2009.pdf">the working draft of the C++ standard [n2009].
</ulink> </ulink>
</para> </para>
<para> <para>
@ -2327,8 +2327,8 @@
<purpose>An unordered associative container that associates keys with another value. The same key can be stored multiple times. <purpose>An unordered associative container that associates keys with another value. The same key can be stored multiple times.
</purpose> </purpose>
<description> <description>
<para>For the normative reference see section 6.3 of <para>For the normative reference see chapter 23 of
<ulink url="http://www.open-std.org/JTC1/SC22/WG21/docs/papers/2005/n1836.pdf">TR1 [n1836]. <ulink url="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2006/n2009.pdf">the working draft of the C++ standard [n2009].
</ulink> </ulink>
</para> </para>
<para> <para>

8
include/boost/unordered_map.hpp
View File

@ -24,8 +24,8 @@
namespace boost namespace boost
{ {
//! An unordered associative container that associates unique keys with another value. //! An unordered associative container that associates unique keys with another value.
/*! For full details see section 6.3.4.4 of the Technical report. /*! For full details see chapter 23 of the draft C++ standard.
* http://www.open-std.org/JTC1/SC22/WG21/docs/papers/2005/n1836.pdf * http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2006/n2009.pdf
*/ */
template <class Key, template <class Key,
@ -374,8 +374,8 @@ namespace boost
} }
//! An unordered associative container that associates equivalent keys with another value. //! An unordered associative container that associates equivalent keys with another value.
/*! For full details see section 6.3.4.6 of the Technical report. /*! For full details see chapter 23 of the draft C++ standard.
* http://www.open-std.org/JTC1/SC22/WG21/docs/papers/2005/n1836.pdf * http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2006/n2009.pdf
*/ */
template <class Key, template <class Key,

8
include/boost/unordered_set.hpp
View File

@ -24,8 +24,8 @@
namespace boost namespace boost
{ {
//! An unordered associative container that stores unique values. //! An unordered associative container that stores unique values.
/*! For full details see section 6.3.4.3 of the Technical report. /*! For full details see chapter 23 of the draft C++ standard.
* http://www.open-std.org/JTC1/SC22/WG21/docs/papers/2005/n1836.pdf * http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2006/n2009.pdf
*/ */
template <class Value, template <class Value,
@ -314,8 +314,8 @@ namespace boost
} }
//! An unordered associative container that stores equivalent values. //! An unordered associative container that stores equivalent values.
/*! For full details see section 6.3.4.5 of the Technical report. /*! For full details see chapter 23 of the draft C++ standard.
* http://www.open-std.org/JTC1/SC22/WG21/docs/papers/2005/n1836.pdf * http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2006/n2009.pdf
*/ */
template <class Value, template <class Value,