Index: boost/type_traits/is_abstract.hpp =================================================================== --- boost/type_traits/is_abstract.hpp (revision 86295) +++ boost/type_traits/is_abstract.hpp (working copy) @@ -19,7 +19,7 @@ // Compile type discovery whether given type is abstract class or not. // // Requires DR 337 to be supported by compiler -// (http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/cwg_active.html#337). +// (http://www.open-std.org/jtc1/sc22/wg21/docs/cwg_active.html#337). // // // Believed (Jan 2004) to work on: Index: boost/ptr_container/detail/static_move_ptr.hpp =================================================================== --- boost/ptr_container/detail/static_move_ptr.hpp (revision 86295) +++ boost/ptr_container/detail/static_move_ptr.hpp (working copy) @@ -5,7 +5,7 @@ // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt.) // Implementation of the move_ptr from the "Move Proposal" -// (http://std.dkuug.dk/jtc1/sc22/wg21/docs/papers/2002/n1377.htm) +// (http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2002/n1377.htm) // enhanced to support custom deleters and safe boolean conversions. // // The implementation is based on an implementation by Daniel Wallin, at Index: boost/multi_index/detail/auto_space.hpp =================================================================== --- boost/multi_index/detail/auto_space.hpp (revision 86295) +++ boost/multi_index/detail/auto_space.hpp (working copy) @@ -40,7 +40,7 @@ * "of zero length", http://gcc.gnu.org/bugzilla/show_bug.cgi?id=14176 * C++ Standard Library Defect Report List (Revision 28), issue 199 * "What does allocate(0) return?", - * http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/lwg-defects.html#199 + * http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#199 */ template > Index: boost/program_options/options_description.hpp =================================================================== --- boost/program_options/options_description.hpp (revision 86295) +++ boost/program_options/options_description.hpp (working copy) @@ -61,8 +61,8 @@ Alas, derived->base conversion for auto_ptr does not really work, see - http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/papers/2000/n1232.pdf - http://std.dkuug.dk/jtc1/sc22/wg21/docs/cwg_defects.html#84 + http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2000/n1232.pdf + http://www.open-std.org/jtc1/sc22/wg21/docs/cwg_defects.html#84 So, we have to use plain old pointers. Besides, users are not expected to use the constructor directly. Index: libs/multi_array/doc/iterator_categories.html =================================================================== --- libs/multi_array/doc/iterator_categories.html (revision 86295) +++ libs/multi_array/doc/iterator_categories.html (working copy) @@ -50,7 +50,7 @@ *i is convertible to T Forward Iterator - *i is T& (or const T& once issue + *i is T& (or const T& once issue 200 is resolved) Random Access Iterator @@ -61,7 +61,7 @@

Because of the mixing of iterator traversal and dereference return type, many useful iterators can not be appropriately categorized. For example, vector<bool>::iterator is almost a random access iterator, but -the return type is not bool& (see issue +the return type is not bool& (see issue 96 and Herb Sutter's paper J16/99-0008 = WG21 N1185). Therefore, the iterators only meet the requirements of input iterator and output iterator. This is so nonintuitive that at least one implementation erroneously assigns @@ -74,7 +74,7 @@ There are two ways to implement this iterator, 1) make the reference type be a true reference (a reference to an integer data member of the counting iterator) or 2) make the reference type be the same as the -value_type. Option 1) runs into the problems discussed in Issue +value_type. Option 1) runs into the problems discussed in Issue 198, the reference will not be valid after the iterator is destroyed. Option 2) is therefore a better choice, but then we have a counting iterator that cannot be a random access iterator. Index: libs/fusion/doc/fusion.qbk =================================================================== --- libs/fusion/doc/fusion.qbk (revision 86295) +++ libs/fusion/doc/fusion.qbk (working copy) @@ -30,7 +30,7 @@ [def __mpl__ [@http://www.boost.org/libs/mpl/index.html MPL]] [def __stl__ [@http://en.wikipedia.org/wiki/Standard_Template_Library STL]] [def __tuple__ [@http://www.boost.org/libs/tuple/doc/tuple_users_guide.html Boost.Tuple]] -[def __tr1__tuple__ [@http://std.dkuug.dk/jtc1/sc22/wg21/docs/papers/2002/n1403.pdf TR1 Tuple]] +[def __tr1__tuple__ [@http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2002/n1403.pdf TR1 Tuple]] [def __boost_tools__ [@http://www.boost.org/tools/index.html Boost Tools]] [def __spirit_list__ [@https://lists.sourceforge.net/lists/listinfo/spirit-general Spirit Mailing List]] [def __spirit_general__ [@news://news.gmane.org/gmane.comp.spirit.general Spirit General NNTP news portal]] Index: libs/utility/value_init.htm =================================================================== --- libs/utility/value_init.htm (revision 86295) +++ libs/utility/value_init.htm (working copy) @@ -159,10 +159,10 @@

value-initialization

The first Technical + href="http://www.open-std.org/JTC1/SC22/WG21/docs/cwg_defects.html">Technical Corrigendum for the C++ Standard (TC1), whose draft was released to the public in November 2001, introduced Core + href="http://www.open-std.org/JTC1/SC22/WG21/docs/cwg_defects.html#178">Core Issue 178 (among many other issues, of course).

That issue introduced the new concept of value-initialization Index: libs/utility/utility.htm =================================================================== --- libs/utility/utility.htm (revision 86295) +++ libs/utility/utility.htm (working copy) @@ -313,7 +313,7 @@ Technical Report, N1836, or, for motivation and design rationale, - the result_of proposal.

+ the result_of proposal.

Usage guidelines for boost::result_of

Index: libs/iterator/doc/ref_problem.rst =================================================================== --- libs/iterator/doc/ref_problem.rst (revision 86295) +++ libs/iterator/doc/ref_problem.rst (working copy) @@ -3,7 +3,7 @@ ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ .. _N1550: http://www.boost-consulting.com/writing/n1550.html -.. _N1530: http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/papers/2003/n1530.html +.. _N1530: http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2003/n1530.html :Author: David Abrahams and Jeremy Siek :Contact: dave@boost-consulting.com, jsiek@osl.iu.edu Index: libs/iterator/doc/iterator_facade.html =================================================================== --- libs/iterator/doc/iterator_facade.html (revision 86295) +++ libs/iterator/doc/iterator_facade.html (working copy) @@ -242,8 +242,8 @@ into the temporary iterator p+n, which is destroyed when operator[] returns.

Writable iterators built with iterator_facade implement the -semantics required by the preferred resolution to issue 299 and -adopted by proposal n1550: the result of p[n] is an object +semantics required by the preferred resolution to issue 299 and +adopted by proposal n1550: the result of p[n] is an object convertible to the iterator's value_type, and p[n] = x is equivalent to *(p + n) = x (Note: This result object may be implemented as a proxy containing a copy of p+n). This approach Index: libs/iterator/doc/new-iter-concepts.html =================================================================== --- libs/iterator/doc/new-iter-concepts.html (revision 86295) +++ libs/iterator/doc/new-iter-concepts.html (working copy) @@ -27,10 +27,10 @@ Lab, Zephyr Associates, Inc. Date: 2006-09-11 -Number:This is a revised version of n1550=03-0133, which was +Number:This is a revised version of n1550=03-0133, which was accepted for Technical Report 1 by the C++ standard committee's library working group. This proposal is a -revision of paper n1297, n1477, and n1531. +revision of paper n1297, n1477, and n1531. Copyright: Copyright David Abrahams, Jeremy Siek, and Thomas Witt @@ -127,12 +127,12 @@ *i is convertible to T Forward Iterator -*i is T& (or const T& once issue 200 +*i is T& (or const T& once issue 200 is resolved) Random Access Iterator i[n] is convertible to T (also i[n] = t -is required for mutable iterators once issue 299 +is required for mutable iterators once issue 299 is resolved) @@ -141,7 +141,7 @@ single hierarchy, many useful iterators can not be appropriately categorized. For example, vector<bool>::iterator is almost a random access iterator, but the return type is not bool& (see -issue 96 and Herb Sutter's paper J16/99-0008 = WG21 +issue 96 and Herb Sutter's paper J16/99-0008 = WG21 N1185). Therefore, the iterators of vector<bool> only meet the requirements of input iterator and output iterator. This is so nonintuitive that the C++ standard contradicts itself on this point. @@ -344,7 +344,7 @@ direction would mean that an iterator satisfying the old Random Access Iterator requirements would not necessarily be a model of Readable or Writable Lvalue Iterator. Instead we have chosen a design that -matches the preferred resolution of issue 299: operator[] is +matches the preferred resolution of issue 299: operator[] is only required to return something convertible to the value_type (for a Readable Iterator), and is required to support assignment i[n] = t (for a Writable Iterator).

@@ -976,7 +976,7 @@

Addition to [lib.iterator.traits]

The is_readable_iterator class -template satisfies the UnaryTypeTrait requirements.

+template satisfies the UnaryTypeTrait requirements.

Given an iterator type X, is_readable_iterator<X>::value yields true if, for an object a of type X, *a is convertible to iterator_traits<X>::value_type, and false @@ -1007,7 +1007,7 @@

Footnotes

-

The UnaryTypeTrait concept is defined in n1519; the LWG is +

The UnaryTypeTrait concept is defined in n1519; the LWG is considering adding the requirement that specializations are derived from their nested ::type.

-

Note that because of the forwarding problem, parameter::parameters::operator() +

Note that because of the forwarding problem, parameter::parameters::operator() can't accept non-const rvalues.

Index: libs/parameter/doc/index.rst =================================================================== --- libs/parameter/doc/index.rst (revision 86295) +++ libs/parameter/doc/index.rst (working copy) @@ -783,7 +783,7 @@ isolate ``depth_first_search`` in a namespace containing no types [#using]_, but suppose we *want* it to found via ADL? -__ http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/lwg-defects.html#225 +__ http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#225 It's usually a good idea to prevent functions from being considered for overload resolution when the passed argument types aren't @@ -1767,7 +1767,7 @@ Note that because of the `forwarding problem`_, ``parameter::parameters::operator()`` can't accept non-const rvalues. -.. _`forwarding problem`: http://std.dkuug.dk/jtc1/sc22/wg21/docs/papers/2002/n1385.htm +.. _`forwarding problem`: http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2002/n1385.htm Extracting Parameter Types ========================== Index: libs/bimap/doc/bimap.qbk =================================================================== --- libs/bimap/doc/bimap.qbk (revision 86295) +++ libs/bimap/doc/bimap.qbk (working copy) @@ -121,7 +121,7 @@ [def __ORDER_STATISTICS_TREE__ [@http://pine.cs.yale.edu/pinewiki/OrderStatisticsTree ['order-statistics trees]]] [def __GENERIC_PROGRAMMING_MOVE_CONSTRUCTORS__ [@http://www.ddj.com/dept/cpp/184403855 "Generic: Move Constructors]] -[def __CLARIFICATION_OF_INITIALIZATION__ [@http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/papers/2004/n1610.html "Clarification of Initialization of Class Objects by rvalues"]] +[def __CLARIFICATION_OF_INITIALIZATION__ [@http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2004/n1610.html "Clarification of Initialization of Class Objects by rvalues"]] [/ Code snippets ] Index: libs/range/doc/boost_range.qbk =================================================================== --- libs/range/doc/boost_range.qbk (revision 86295) +++ libs/range/doc/boost_range.qbk (working copy) @@ -171,7 +171,7 @@ [def __metafunctions__ [@boost:/libs/mpl/doc/refmanual/metafunction.html metafunctions]] [def __concept_check__ [@boost:/libs/concept_check/index.html Boost Concept Check library]] [def __boost_array__ [@boost:/libs/array/index.html boost::array]] -[def __the_forwarding_problem__ [@http://std.dkuug.dk/jtc1/sc22/wg21/docs/papers/2002/n1385.htm The Forwarding Problem]] +[def __the_forwarding_problem__ [@http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2002/n1385.htm The Forwarding Problem]] [def __sgi_inner_product__ [@http://www.sgi.com/tech/stl/inner_product.html inner_product]] [def __sgi_partial_sum__ [@http://www.sgi.com/tech/stl/partial_sum.html partial_sum]] Index: libs/smart_ptr/smart_ptr.htm =================================================================== --- libs/smart_ptr/smart_ptr.htm (revision 86295) +++ libs/smart_ptr/smart_ptr.htm (working copy) @@ -190,7 +190,7 @@ the full committee, counted_ptr was rejected and surprising transfer-of-ownership semantics were added to auto_ptr.

References

-

[Col-94] Gregory Colvin, +

[Col-94] Gregory Colvin, Exception Safe Smart Pointers, C++ committee document 94-168/N0555, July, 1994.

[E&D-94] John R. Ellis & David L. Detlefs, Index: libs/bind/bind.html =================================================================== --- libs/bind/bind.html (revision 86295) +++ libs/bind/bind.html (working copy) @@ -390,7 +390,7 @@

As a general rule, the function objects generated by bind take their arguments by reference and cannot, therefore, accept non-const temporaries or literal constants. This is an inherent limitation of the C++ language in its - current (2003) incarnation, known as + current (2003) incarnation, known as the forwarding problem. (It will be fixed in the next standard, usually called C++0x.)

The library uses signatures of the form Index: libs/assign/doc/index.html =================================================================== --- libs/assign/doc/index.html (revision 86295) +++ libs/assign/doc/index.html (working copy) @@ -1407,7 +1407,7 @@

  • http://www.oonumerics.org/blitz/
  • Gabriel Dos Reis and Bjarne Stroustrup, - "Generalized Initializer + "Generalized Initializer Lists", 2003

    Index: libs/iostreams/doc/bibliography.html =================================================================== --- libs/iostreams/doc/bibliography.html (revision 86295) +++ libs/iostreams/doc/bibliography.html (working copy) @@ -45,7 +45,7 @@ [Dimov] - Dimov, P., Hinnant, H. and Abrahams, A. The Forwarding Problem: Arguments. C++ standards committe document N1385=02-0043, September, 2002. See http://std.dkuug.dk/jtc1/sc22/wg21/docs/papers/2002/n1385.htm. + Dimov, P., Hinnant, H. and Abrahams, A. The Forwarding Problem: Arguments. C++ standards committe document N1385=02-0043, September, 2002. See http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2002/n1385.htm. [Egorushkin] Index: libs/ptr_container/doc/ptr_container.rst =================================================================== --- libs/ptr_container/doc/ptr_container.rst (revision 86295) +++ libs/ptr_container/doc/ptr_container.rst (working copy) @@ -320,7 +320,7 @@ .. [8] C++ Standard Library Closed Issues List (Revision 27), Item 218, `Algorithms do not use binary predicate objects for default comparisons`__. -__ http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/lwg-closed.html#218 +__ http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-closed.html#218 .. [9] C++ Standard Library Active Issues List (Revision 27), Item 226, `User supplied specializations or overloads of namespace std function templates`__. Index: libs/ptr_container/doc/ptr_container.html =================================================================== --- libs/ptr_container/doc/ptr_container.html (revision 86295) +++ libs/ptr_container/doc/ptr_container.html (working copy) @@ -595,7 +595,7 @@ [8]C++ Standard Library Closed Issues List (Revision 27), -Item 218, Algorithms do not use binary predicate objects for default comparisons. +Item 218, Algorithms do not use binary predicate objects for default comparisons. Index: libs/array/doc/array.xml =================================================================== --- libs/array/doc/array.xml (revision 86295) +++ libs/array/doc/array.xml (working copy) @@ -68,7 +68,7 @@ Note that this class is suggested to be part of the next Technical Report, which will extend the C++ Standard (see - http://std.dkuug.dk/jtc1/sc22/wg21/docs/papers/2003/n1548.htm). + http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2003/n1548.htm).Update: std::array is (as of C++11) part of the C++ standard. The differences between boost::array and std::array are minimal. Index: tools/boostbook/test/more/tests/libs/array.gold =================================================================== --- tools/boostbook/test/more/tests/libs/array.gold (revision 86295) +++ tools/boostbook/test/more/tests/libs/array.gold (working copy) @@ -54,7 +54,7 @@ Note that this class is suggested to be part of the next Technical Report, which will extend the C++ Standard (see - http://std.dkuug.dk/jtc1/sc22/wg21/docs/papers/2003/n1548.htm). + http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2003/n1548.htm).Class array fulfills most but not all of the requirements of "reversible containers" (see Index: tools/boostbook/test/more/tests/libs/array.xml =================================================================== --- tools/boostbook/test/more/tests/libs/array.xml (revision 86295) +++ tools/boostbook/test/more/tests/libs/array.xml (working copy) @@ -75,7 +75,7 @@ Note that this class is suggested to be part of the next Technical Report, which will extend the C++ Standard (see - http://std.dkuug.dk/jtc1/sc22/wg21/docs/papers/2003/n1548.htm). + http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2003/n1548.htm).Class array fulfills most but not all of the requirements of "reversible containers" (see Index: doc/test/gold/document_to_test_formatting/array.html =================================================================== --- doc/test/gold/document_to_test_formatting/array.html (revision 86295) +++ doc/test/gold/document_to_test_formatting/array.html (working copy) @@ -63,7 +63,7 @@ class simply array.

    Note that this class is suggested to be part of the next Technical Report, which will extend the C++ Standard (see - http://std.dkuug.dk/jtc1/sc22/wg21/docs/papers/2003/n1548.htm).

    + http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2003/n1548.htm).

    Class array fulfills most but not all of the requirements of "reversible containers" (see Section 23.1, [lib.container.requirements] of the C++ Index: doc/test/array.xml =================================================================== --- doc/test/array.xml (revision 86295) +++ doc/test/array.xml (working copy) @@ -36,7 +36,7 @@ Note that this class is suggested to be part of the next Technical Report, which will extend the C++ Standard (see - http://std.dkuug.dk/jtc1/sc22/wg21/docs/papers/2003/n1548.htm). + http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2003/n1548.htm). Class array fulfills most but not all of the requirements of "reversible containers" (see