diff --git a/doc/buckets.qbk b/doc/buckets.qbk
index 1e0b1315..9e3cec3f 100644
--- a/doc/buckets.qbk
+++ b/doc/buckets.qbk
@@ -73,9 +73,9 @@ initially set to 1.0.
`max_load_factor` tells the container to change the maximum load factor,
using your supplied hint as a suggestion.
-TR1 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`.
+The draft 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`.
It is not specified anywhere how other member functions affect the bucket count.
But most implementations will invalidate the iterators whenever they change
diff --git a/doc/intro.qbk b/doc/intro.qbk
index b9db3ec9..25f1f392 100644
--- a/doc/intro.qbk
+++ b/doc/intro.qbk
@@ -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]]
+[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
hash table]]
[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
and a hash function for the key.
-So the __tr1__ provides the unordered associative containers, which are
-implemented using hash tables. There are four containers to match the existing
+So the __tr1__ introduced the unordered associative containers, which are
+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]>:
template <
diff --git a/doc/rationale.qbk b/doc/rationale.qbk
index 47fd99b5..2d6d8a3c 100644
--- a/doc/rationale.qbk
+++ b/doc/rationale.qbk
@@ -4,9 +4,9 @@
[section:rationale Implementation Rationale]
-From the start the intent of this library was to implement the unordred
-containers in TR1, so the interface was fixed. But there are still some
-implementation desicions to make. The priorities for the library are
+From the start the intent of this library was to implement the unordered
+containers in the draft standard, so the interface was fixed. But there are
+still some implementation desicions to make. The priorities for the library are
conformance to the standard and portability.
[h2 Number of Buckets]
diff --git a/doc/ref.xml b/doc/ref.xml
index 0c72c0da..99f869f6 100644
--- a/doc/ref.xml
+++ b/doc/ref.xml
@@ -27,8 +27,8 @@
An unordered associative container that stores unique values.
- For the normative reference see section 6.3 of
- TR1 [n1836].
+ For the normative reference see chapter 23 of
+ the working draft of the C++ standard [n2009].
@@ -778,8 +778,8 @@
An unordered associative container that stores values. The same key can be stored multiple times.
- For the normative reference see section 6.3 of
- TR1 [n1836].
+ For the normative reference see chapter 23 of
+ the working draft of the C++ standard [n2009].
@@ -1537,8 +1537,8 @@
An unordered associative container that associates unique keys with another value.
- For the normative reference see section 6.3 of
- TR1 [n1836].
+ For the normative reference see chapter 23 of
+ the working draft of the C++ standard [n2009].
@@ -2327,8 +2327,8 @@
An unordered associative container that associates keys with another value. The same key can be stored multiple times.
- For the normative reference see section 6.3 of
- TR1 [n1836].
+ For the normative reference see chapter 23 of
+ the working draft of the C++ standard [n2009].
diff --git a/include/boost/unordered_map.hpp b/include/boost/unordered_map.hpp
index 009e7f9d..55d1a6ff 100644
--- a/include/boost/unordered_map.hpp
+++ b/include/boost/unordered_map.hpp
@@ -24,8 +24,8 @@
namespace boost
{
//! An unordered associative container that associates unique keys with another value.
- /*! For full details see section 6.3.4.4 of the Technical report.
- * http://www.open-std.org/JTC1/SC22/WG21/docs/papers/2005/n1836.pdf
+ /*! For full details see chapter 23 of the draft C++ standard.
+ * http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2006/n2009.pdf
*/
template