This commit was manufactured by cvs2svn to create tag

'Version_1_33_1'. [SVN r31916]
Clean up a whole lot of bad links
2025-10-13 17:15:19 +02:00 · 2005-12-05 14:04:06 +00:00 · 2005-12-01 04:52:04 +00:00 · 2005-11-25 22:21:44 +00:00 · 2005-09-20 23:33:28 +00:00 · 2005-08-03 21:42:39 +00:00
84 changed files with 1472 additions and 1810 deletions
--- a/Assignable.html
+++ b/Assignable.html
@@ -15,7 +15,7 @@
 </HEAD>
 <BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
        ALINK="#ff0000"> 
-<IMG SRC="../../c++boost.gif" 
+<IMG SRC="../../boost.png" 
     ALT="C++ Boost" width="277" height="86"> 
 <!--end header-->
 <BR Clear>
--- a/Collection.html
+++ b/Collection.html
@@ -17,7 +17,7 @@
 <BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
 	ALINK="#ff0000"> 
 <h1>
-   <img src="../../c++boost.gif" alt="boost logo"
+   <img src="../../boost.png" alt="boost logo"
    width="277" align="middle" height="86">
   <br>Collection
 </h1>
--- a/CopyConstructible.html
+++ b/CopyConstructible.html
@@ -15,7 +15,7 @@
 </HEAD>
 <BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
        ALINK="#ff0000"> 
-<IMG SRC="../../c++boost.gif" 
+<IMG SRC="../../boost.png" 
     ALT="C++ Boost" width="277" height="86"> 
 <!--end header-->
 <BR Clear>
--- a/LessThanComparable.html
+++ b/LessThanComparable.html
@@ -39,7 +39,7 @@
 </Head>
 <BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
        ALINK="#ff0000"> 
-<IMG SRC="../../c++boost.gif" 
+<IMG SRC="../../boost.png" 
     ALT="C++ Boost" width="277" height="86"> 
 <!--end header-->
 <BR Clear>
--- a/MultiPassInputIterator.html
+++ b/MultiPassInputIterator.html
@@ -14,7 +14,7 @@
 <Title>MultiPassInputIterator</Title>
 <BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
 	ALINK="#ff0000"> 
-<IMG SRC="../../c++boost.gif" 
+<IMG SRC="../../boost.png" 
     ALT="C++ Boost" width="277" height="86"> 
 <BR Clear>
@@ -30,9 +30,9 @@ adding the requirements that the iterator can be used to make multiple
 passes through a range, and that if <TT>it1 == it2</TT> and
 <TT>it1</TT> is dereferenceable then <TT>++it1 == ++it2</TT>. The
 Multi-Pass Input Iterator is very similar to the <a
-href="http://www.sgi.com/tech/stl/ForwardIterator.hmtl">Forward Iterator</a>. The
+href="http://www.sgi.com/tech/stl/ForwardIterator.html">Forward Iterator</a>. The
 only difference is that a <a
-href="http://www.sgi.com/tech/stl/ForwardIterator.hmtl">Forward Iterator</a>
+href="http://www.sgi.com/tech/stl/ForwardIterator.html">Forward Iterator</a>
 requires the <TT>reference</TT> type to be <TT>value_type&amp;</TT>, whereas
 MultiPassInputIterator is like <a
 href="http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a>
--- a/OptionalPointee.html
+++ b/OptionalPointee.html
@@ -4,7 +4,7 @@
 </HEAD>
 <BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
        ALINK="#ff0000"> 
-<IMG SRC="../../c++boost.gif" 
+<IMG SRC="../../boost.png" 
     ALT="C++ Boost" width="277" height="86"> 
 <!--end header-->
 <BR Clear>
--- a/addressof_test.cpp
+++ b/addressof_test.cpp
@@ -1,46 +1,94 @@
 // Copyright (C) 2002 Brad King (brad.king@kitware.com) 
-//                    Doug Gregor (gregod@cs.rpi.edu)
+//                    Douglas Gregor (gregod@cs.rpi.edu)
 //
-// Permission to copy, use, sell and distribute this software is granted
+// Distributed under the Boost Software License, Version 1.0. (See
-// provided this copyright notice appears in all copies.
+// accompanying file LICENSE_1_0.txt or copy at
-// Permission to modify the code and to distribute modified code is granted
+// http://www.boost.org/LICENSE_1_0.txt)
 // provided this copyright notice appears in all copies, and a notice
 // that the code was modified is included with the copyright notice.
 //
 // This software is provided "as is" without express or implied warranty,
 // and with no claim as to its suitability for any purpose.
 // For more information, see http://www.boost.org
-#define BOOST_INCLUDE_MAIN
+
-#include <boost/test/test_tools.hpp>
+#include <boost/utility/addressof.hpp>
-#include <boost/utility.hpp>
+
 #if defined(BOOST_MSVC) && (BOOST_MSVC < 1300)
 #pragma warning(push, 3)
 #endif
 #include <iostream>
 #if defined(BOOST_MSVC) && (BOOST_MSVC < 1300)
 #pragma warning(pop)
 #endif
 #include <boost/detail/lightweight_test.hpp>
 template<class T> void scalar_test( T * = 0 )
 {
    T* px = new T();
    T& x = *px;
    BOOST_TEST( boost::addressof(x) == px );
    const T& cx = *px;
    const T* pcx = boost::addressof(cx);
    BOOST_TEST( pcx == px );
    volatile T& vx = *px;
    volatile T* pvx = boost::addressof(vx);
    BOOST_TEST( pvx == px );
    const volatile T& cvx = *px;
    const volatile T* pcvx = boost::addressof(cvx);
    BOOST_TEST( pcvx == px );
    delete px;
 }
 template<class T> void array_test( T * = 0 )
 {
    T nrg[3] = {1,2,3};
    T (*pnrg)[3] = &nrg;
    BOOST_TEST( boost::addressof(nrg) == pnrg );
    T const cnrg[3] = {1,2,3};
    T const (*pcnrg)[3] = &cnrg;
    BOOST_TEST( boost::addressof(cnrg) == pcnrg );
 }
 struct addressable
 {
    addressable( int = 0 )
    {
    }
 };
 struct useless_type {};
 class nonaddressable {
 public:
-  void dummy(); // Silence GCC warning: all member of class are private
+
    nonaddressable( int = 0 )
    {
    }
    void dummy(); // Silence GCC warning: all member of class are private
 private:
-  useless_type operator&() const;
+
    useless_type operator&() const;
 };
-int test_main(int, char*[])
+int main()
 {
-  nonaddressable* px = new nonaddressable();
+    scalar_test<char>();
    scalar_test<int>();
    scalar_test<addressable>();
    scalar_test<nonaddressable>();
-  nonaddressable& x = *px;
+    array_test<char>();
-  BOOST_TEST(boost::addressof(x) == px);
+    array_test<int>();
    array_test<addressable>();
    array_test<nonaddressable>();
-  const nonaddressable& cx = *px;
+    return boost::report_errors();
  BOOST_TEST(boost::addressof(cx) == static_cast<const nonaddressable*>(px));
  volatile nonaddressable& vx = *px;
  BOOST_TEST(boost::addressof(vx) == static_cast<volatile nonaddressable*>(px));
  const volatile nonaddressable& cvx = *px;
  BOOST_TEST(boost::addressof(cvx) == static_cast<const volatile nonaddressable*>(px));
  return 0;
 }
--- a/assert.html
+++ b/assert.html
@@ -8,7 +8,7 @@
 		<table border="0" width="100%">
 			<tr>
 				<td width="277">
-					<img src="../../c++boost.gif" alt="c++boost.gif (8819 bytes)" width="277" height="86">
+					<img src="../../boost.png" alt="boost.png (6897 bytes)" width="277" height="86">
 				</td>
 				<td align="middle">
 					<h1>assert.hpp</h1>
--- a/assert_test.cpp
+++ b/assert_test.cpp
@@ -3,10 +3,9 @@
 //
 //  Copyright (c) 2002 Peter Dimov and Multi Media Ltd.
 //
-//  Permission to copy, use, modify, sell and distribute this software
+// Distributed under the Boost Software License, Version 1.0. (See
-//  is granted provided this copyright notice appears in all copies.
+// accompanying file LICENSE_1_0.txt or copy at
-//  This software is provided "as is" without express or implied
+// http://www.boost.org/LICENSE_1_0.txt)
 //  warranty, and with no claim as to its suitability for any purpose.
 //
 #include <boost/detail/lightweight_test.hpp>
@@ -52,13 +51,18 @@ void test_disabled()
 #define BOOST_ENABLE_ASSERT_HANDLER
 #include <boost/assert.hpp>
 #include <boost/config.hpp>
 #include <cstdio>
 int handler_invoked = 0;
 void boost::assertion_failed(char const * expr, char const * function, char const * file, long line)
 {
-    std::printf("Expression: %s\nFunction: %s\nFile: %s\nLine: %ld\n\n", expr, function, file, line);
+#if !defined(BOOST_NO_STDC_NAMESPACE)
    using std::printf;
 #endif
    printf("Expression: %s\nFunction: %s\nFile: %s\nLine: %ld\n\n", expr, function, file, line);
    ++handler_invoked;
 }
--- a/base_from_member.html
+++ b/base_from_member.html
@@ -5,15 +5,14 @@
 </head>
 <body bgcolor="white" link="blue" text="black" vlink="purple" alink="red"> 
-<h1><img src="../../c++boost.gif" alt="C++ Boost" align="middle"
+<h1><img src="../../boost.png" alt="C++ Boost" align="middle"
 width="277" height="86">Base-from-Member Idiom</h1>
 <p>The class template <code>boost::base_from_member</code> provides
 a workaround for a class that needs to initialize a base class with a
 member.  The class template is in <cite><a
 href="../../boost/utility/base_from_member.hpp">boost/utility/base_from_member.hpp</a></cite>
-which is included in <i><a href="../../boost/utility.hpp">boost/utility.hpp</a></i>.
+which is included in <i><a href="../../boost/utility.hpp">boost/utility.hpp</a></i>.</p>
 The class template is forward declared in <i><a href="../../boost/utility_fwd.hpp">boost/utility_fwd.hpp</a></i>.</p>
 <p>There is test/example code in <cite><a
 href="base_from_member_test.cpp">base_from_member_test.cpp</a></cite>.</p>
@@ -130,6 +129,10 @@ particular member type does not need to concern itself with the integer.</p>
 <h2><a name="synopsis">Synopsis</a></h2>
 <blockquote><pre>
 #ifndef BOOST_BASE_FROM_MEMBER_MAX_ARITY
 #define BOOST_BASE_FROM_MEMBER_MAX_ARITY  10
 #endif
 template &lt; typename MemberType, int UniqueID = 0 &gt;
 class boost::base_from_member
 {
@@ -171,6 +174,14 @@ the template parameters of a templated constructor, make sure that
 the arguments are already close as possible to the actual type used in
 the data member's desired constructor.</p>
 <p>The <var>BOOST_BASE_FROM_MEMBER_MAX_ARITY</var> macro constant specifies
 the maximum argument length for the constructor templates.  The constant
 may be overridden if more (or less) argument configurations are needed.  The
 constant may be read for code that is expandable like the class template and
 needs to maintain the same maximum size.  (Example code would be a class that
 uses this class template as a base class for a member with a flexible set of
 constructors.)</p>
 <h2><a name="usage">Usage</a></h2>
 <p>With the starting example, the <code>fdoutbuf</code> sub-object needs
@@ -337,6 +348,11 @@ with the exact pointer type used in <code>switcher</code>'s constructor.</p>
 		<a href="http://www.informatik.uni-konstanz.de/~kuehl/c++/iostream/">IOStream
 		example classes</a>.
 	<dt>Jonathan Turkanis
 	<dd>Supplied an implementation of generating the constructor templates that
 		can be controlled and automated with macros.  The implementation uses
 		the <a href="../preprocessor/index.html">Preprocessor library</a>.
 	<dt><a href="../../people/daryle_walker.html">Daryle Walker</a>
 	<dd>Started the library.  Contributed the test file <cite><a
 		href="base_from_member_test.cpp">base_from_member_test.cpp</a></cite>.
@@ -344,9 +360,9 @@ with the exact pointer type used in <code>switcher</code>'s constructor.</p>
 <hr>
-<p>Revised: 14 June 2003</p>
+<p>Revised: 28 August 2004</p>
-<p>Copyright 2001, 2003 Daryle Walker.  Use, modification, and distribution
+<p>Copyright 2001, 2003, 2004 Daryle Walker.  Use, modification, and distribution
 are subject to the Boost Software License, Version 1.0.  (See accompanying
 file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or a copy at &lt;<a
 href="http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>&gt;.)</p>
--- a/binary_search_test.cpp
+++ b/binary_search_test.cpp
@@ -1,8 +1,7 @@
-// (C) Copyright David Abrahams 2000. Permission to copy, use, modify,
+// (C) Copyright David Abrahams 2000.
-// sell and distribute this software is granted provided this
+// Distributed under the Boost Software License, Version 1.0. (See
-// copyright notice appears in all copies. This software is provided
+// accompanying file LICENSE_1_0.txt or copy at
-// "as is" without express or implied warranty, and with no claim as
+// http://www.boost.org/LICENSE_1_0.txt)
 // to its suitability for any purpose.
 #include <vector>
 #include <string>
@@ -15,6 +14,7 @@
 #include <algorithm>
 #include <boost/detail/binary_search.hpp>
 #include <boost/detail/workaround.hpp>
 #include <cstddef>
 #if defined(__SGI_STL_PORT) ? defined(__SGI_STL_OWN_IOSTREAMS) : (!defined(__GNUC__) || __GNUC__ > 2)
 # define USE_SSTREAM
--- a/call_traits.htm
+++ b/call_traits.htm
@@ -12,7 +12,7 @@ content="C:\PROGRAM FILES\MICROSOFT OFFICE\OFFICE\html.dot">
 <body bgcolor="#FFFFFF" text="#000000" link="#0000FF"
 vlink="#800080">
-<h1><img src="../../c++boost.gif" width="276" height="86">Header
+<h1><img src="../../boost.png" width="276" height="86">Header
 &lt;<a href="../../boost/detail/call_traits.hpp">boost/call_traits.hpp</a>&gt;</h1>
 <p>All of the contents of &lt;boost/call_traits.hpp&gt; are
--- a/call_traits_test.cpp
+++ b/call_traits_test.cpp
@@ -19,7 +19,42 @@
 #include <typeinfo>
 #include <boost/call_traits.hpp>
-#include <boost/type_traits/type_traits_test.hpp>
+#include <libs/type_traits/test/test.hpp>
 #include <libs/type_traits/test/check_type.hpp>
 //
 // define tests here
 unsigned failures = 0;
 unsigned test_count = 0;
 //
 // This must get defined within the test file.
 // All compilers have bugs, set this to the number of
 // regressions *expected* from a given compiler,
 // if there are no workarounds for the bugs, *and*
 // the regressions have been investigated.
 //
 extern unsigned int expected_failures;
 //
 // proc check_result()
 // Checks that there were no regressions:
 //
 int check_result(int argc, char** argv)
 {
   std::cout << test_count << " tests completed, "
      << failures << " failures found, "
      << expected_failures << " failures expected from this compiler." << std::endl;
   if((argc == 2) 
      && (argv[1][0] == '-')
      && (argv[1][1] == 'a')
      && (argv[1][2] == 0))
   {
      std::cout << "Press any key to continue...";
      std::cin.get();
   }
   return (failures == expected_failures)
       ? 0
       : (failures != 0) ? static_cast<int>(failures) : -1;
 }
 // a way prevent warnings for unused variables
 template<class T> inline void unused_variable(const T&) {}
@@ -231,51 +266,51 @@ int main(int argc, char *argv[ ])
   typedef int& r_type;
   typedef const r_type cr_type;
-   type_test(comparible_UDT, boost::call_traits<comparible_UDT>::value_type)
+   BOOST_CHECK_TYPE(comparible_UDT, boost::call_traits<comparible_UDT>::value_type);
-   type_test(comparible_UDT&, boost::call_traits<comparible_UDT>::reference)
+   BOOST_CHECK_TYPE(comparible_UDT&, boost::call_traits<comparible_UDT>::reference);
-   type_test(const comparible_UDT&, boost::call_traits<comparible_UDT>::const_reference)
+   BOOST_CHECK_TYPE(const comparible_UDT&, boost::call_traits<comparible_UDT>::const_reference);
-   type_test(const comparible_UDT&, boost::call_traits<comparible_UDT>::param_type)
+   BOOST_CHECK_TYPE(const comparible_UDT&, boost::call_traits<comparible_UDT>::param_type);
-   type_test(int, boost::call_traits<int>::value_type)
+   BOOST_CHECK_TYPE(int, boost::call_traits<int>::value_type);
-   type_test(int&, boost::call_traits<int>::reference)
+   BOOST_CHECK_TYPE(int&, boost::call_traits<int>::reference);
-   type_test(const int&, boost::call_traits<int>::const_reference)
+   BOOST_CHECK_TYPE(const int&, boost::call_traits<int>::const_reference);
-   type_test(const int, boost::call_traits<int>::param_type)
+   BOOST_CHECK_TYPE(const int, boost::call_traits<int>::param_type);
-   type_test(int*, boost::call_traits<int*>::value_type)
+   BOOST_CHECK_TYPE(int*, boost::call_traits<int*>::value_type);
-   type_test(int*&, boost::call_traits<int*>::reference)
+   BOOST_CHECK_TYPE(int*&, boost::call_traits<int*>::reference);
-   type_test(int*const&, boost::call_traits<int*>::const_reference)
+   BOOST_CHECK_TYPE(int*const&, boost::call_traits<int*>::const_reference);
-   type_test(int*const, boost::call_traits<int*>::param_type)
+   BOOST_CHECK_TYPE(int*const, boost::call_traits<int*>::param_type);
 #if defined(BOOST_MSVC6_MEMBER_TEMPLATES)
-   type_test(int&, boost::call_traits<int&>::value_type)
+   BOOST_CHECK_TYPE(int&, boost::call_traits<int&>::value_type);
-   type_test(int&, boost::call_traits<int&>::reference)
+   BOOST_CHECK_TYPE(int&, boost::call_traits<int&>::reference);
-   type_test(const int&, boost::call_traits<int&>::const_reference)
+   BOOST_CHECK_TYPE(const int&, boost::call_traits<int&>::const_reference);
-   type_test(int&, boost::call_traits<int&>::param_type)
+   BOOST_CHECK_TYPE(int&, boost::call_traits<int&>::param_type);
 #if !(defined(__GNUC__) && ((__GNUC__ < 3) || (__GNUC__ == 3) && (__GNUC_MINOR__ < 1)))
-   type_test(int&, boost::call_traits<cr_type>::value_type)
+   BOOST_CHECK_TYPE(int&, boost::call_traits<cr_type>::value_type);
-   type_test(int&, boost::call_traits<cr_type>::reference)
+   BOOST_CHECK_TYPE(int&, boost::call_traits<cr_type>::reference);
-   type_test(const int&, boost::call_traits<cr_type>::const_reference)
+   BOOST_CHECK_TYPE(const int&, boost::call_traits<cr_type>::const_reference);
-   type_test(int&, boost::call_traits<cr_type>::param_type)
+   BOOST_CHECK_TYPE(int&, boost::call_traits<cr_type>::param_type);
 #else
   std::cout << "Your compiler cannot instantiate call_traits<int&const>, skipping four tests (4 errors)" << std::endl;
   failures += 4;
   test_count += 4;
 #endif
-   type_test(const int&, boost::call_traits<const int&>::value_type)
+   BOOST_CHECK_TYPE(const int&, boost::call_traits<const int&>::value_type);
-   type_test(const int&, boost::call_traits<const int&>::reference)
+   BOOST_CHECK_TYPE(const int&, boost::call_traits<const int&>::reference);
-   type_test(const int&, boost::call_traits<const int&>::const_reference)
+   BOOST_CHECK_TYPE(const int&, boost::call_traits<const int&>::const_reference);
-   type_test(const int&, boost::call_traits<const int&>::param_type)
+   BOOST_CHECK_TYPE(const int&, boost::call_traits<const int&>::param_type);
 #ifndef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
-   type_test(const int*, boost::call_traits<int[3]>::value_type)
+   BOOST_CHECK_TYPE(const int*, boost::call_traits<int[3]>::value_type);
-   type_test(int(&)[3], boost::call_traits<int[3]>::reference)
+   BOOST_CHECK_TYPE(int(&)[3], boost::call_traits<int[3]>::reference);
-   type_test(const int(&)[3], boost::call_traits<int[3]>::const_reference)
+   BOOST_CHECK_TYPE(const int(&)[3], boost::call_traits<int[3]>::const_reference);
-   type_test(const int*const, boost::call_traits<int[3]>::param_type)
+   BOOST_CHECK_TYPE(const int*const, boost::call_traits<int[3]>::param_type);
-   type_test(const int*, boost::call_traits<const int[3]>::value_type)
+   BOOST_CHECK_TYPE(const int*, boost::call_traits<const int[3]>::value_type);
-   type_test(const int(&)[3], boost::call_traits<const int[3]>::reference)
+   BOOST_CHECK_TYPE(const int(&)[3], boost::call_traits<const int[3]>::reference);
-   type_test(const int(&)[3], boost::call_traits<const int[3]>::const_reference)
+   BOOST_CHECK_TYPE(const int(&)[3], boost::call_traits<const int[3]>::const_reference);
-   type_test(const int*const, boost::call_traits<const int[3]>::param_type)
+   BOOST_CHECK_TYPE(const int*const, boost::call_traits<const int[3]>::param_type);
   // test with abstract base class:
-   type_test(test_abc1, boost::call_traits<test_abc1>::value_type)
+   BOOST_CHECK_TYPE(test_abc1, boost::call_traits<test_abc1>::value_type);
-   type_test(test_abc1&, boost::call_traits<test_abc1>::reference)
+   BOOST_CHECK_TYPE(test_abc1&, boost::call_traits<test_abc1>::reference);
-   type_test(const test_abc1&, boost::call_traits<test_abc1>::const_reference)
+   BOOST_CHECK_TYPE(const test_abc1&, boost::call_traits<test_abc1>::const_reference);
-   type_test(const test_abc1&, boost::call_traits<test_abc1>::param_type)
+   BOOST_CHECK_TYPE(const test_abc1&, boost::call_traits<test_abc1>::param_type);
 #else
   std::cout << "You're compiler does not support partial template specialiation, skipping 8 tests (8 errors)" << std::endl;
   failures += 12;
@@ -287,10 +322,10 @@ int main(int argc, char *argv[ ])
   test_count += 24;
 #endif
   // test with an incomplete type:
-   type_test(incomplete_type, boost::call_traits<incomplete_type>::value_type)
+   BOOST_CHECK_TYPE(incomplete_type, boost::call_traits<incomplete_type>::value_type);
-   type_test(incomplete_type&, boost::call_traits<incomplete_type>::reference)
+   BOOST_CHECK_TYPE(incomplete_type&, boost::call_traits<incomplete_type>::reference);
-   type_test(const incomplete_type&, boost::call_traits<incomplete_type>::const_reference)
+   BOOST_CHECK_TYPE(const incomplete_type&, boost::call_traits<incomplete_type>::const_reference);
-   type_test(const incomplete_type&, boost::call_traits<incomplete_type>::param_type)
+   BOOST_CHECK_TYPE(const incomplete_type&, boost::call_traits<incomplete_type>::param_type);
   return check_result(argc, argv);
 }
@@ -410,7 +445,7 @@ template struct call_traits_test<int[2], true>;
 #endif
 #if defined(BOOST_MSVC) && _MSC_VER <= 1300
-unsigned int expected_failures = 14;
+unsigned int expected_failures = 12;
 #elif defined(__SUNPRO_CC)
 #if(__SUNPRO_CC <= 0x520)
 unsigned int expected_failures = 18;
--- a/checked_delete.html
+++ b/checked_delete.html
@@ -8,7 +8,7 @@
 		<table border="0" width="100%">
 			<tr>
 				<td width="277">
-					<img src="../../c++boost.gif" alt="c++boost.gif (8819 bytes)" width="277" height="86">
+					<img src="../../boost.png" alt="boost.png (6897 bytes)" width="277" height="86">
 				</td>
 				<td align="middle">
 					<h1>checked_delete.hpp</h1>
--- a/checked_delete_test.cpp
+++ b/checked_delete_test.cpp
@@ -1,7 +1,8 @@
 //  Boost checked_delete test program  ---------------------------------------//
-//  Copyright Beman Dawes 2001.
+//  Copyright Beman Dawes 2001.  Distributed under the Boost
-//  See accompanying license for terms and conditions of use.
+//  Software License, Version 1.0. (See accompanying file
 //  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //  See http://www.boost.org/libs/utility for documentation.
--- a/compressed_pair.htm
+++ b/compressed_pair.htm
@@ -1,30 +1,19 @@
 <html>
-
+   <head>
-<head>
+      <title>Header </title>
-<meta http-equiv="Content-Type"
+      <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
-content="text/html; charset=iso-8859-1">
+      <meta name="Template" content="C:\PROGRAM FILES\MICROSOFT OFFICE\OFFICE\html.dot">
-<meta name="Template"
+      <meta name="GENERATOR" content="Microsoft FrontPage Express 2.0">
-content="C:\PROGRAM FILES\MICROSOFT OFFICE\OFFICE\html.dot">
+      <boostcompressed_pair.hpp>
-<meta name="GENERATOR" content="Microsoft FrontPage Express 2.0">
+   </head>
-<title>Header </title>
+   <body bgcolor="#ffffff" text="#000000" link="#0000ff" vlink="#800080">
-<boost/compressed_pair.hpp>
+      <h2><img src="../../boost.png" width="276" height="86">Header &lt;<a href="../../boost/detail/compressed_pair.hpp">boost/compressed_pair.hpp</a>&gt;</h2>
-</head>
+      <p>All of the contents of &lt;boost/compressed_pair.hpp&gt; are defined inside 
-
+         namespace boost.</p>
-<body bgcolor="#FFFFFF" text="#000000" link="#0000FF"
+      <p>The class compressed pair is very similar to std::pair, but if either of the 
-vlink="#800080">
+         template arguments are empty classes, then the "empty base-class optimisation" 
-
+         is applied to compress the size of the pair.</p>
-<h2><img src="../../c++boost.gif" width="276" height="86">Header
+      <pre>template &lt;class T1, class T2&gt;
 &lt;<a href="../../boost/detail/compressed_pair.hpp">boost/compressed_pair.hpp</a>&gt;</h2>
 <p>All of the contents of &lt;boost/compressed_pair.hpp&gt; are
 defined inside namespace boost.</p>
 <p>The class compressed pair is very similar to std::pair, but if
 either of the template arguments are empty classes, then the
 &quot;empty base-class optimisation&quot; is applied to compress
 the size of the pair.</p>
 <pre>template &lt;class T1, class T2&gt;
 class compressed_pair
 {
 public:
@@ -52,47 +41,35 @@ public:
 	void swap(compressed_pair&amp; y);
 };</pre>
-
+      <p>The two members of the pair can be accessed using the member functions first() 
-<p>The two members of the pair can be accessed using the member
+         and second(). Note that not all member functions can be instantiated for all 
-functions first() and second(). Note that not all member
+         template parameter types. In particular compressed_pair can be instantiated for 
-functions can be instantiated for all template parameter types.
+         reference and array types, however in these cases the range of constructors 
-In particular compressed_pair can be instantiated for reference
+         that can be used are limited. If types T1 and T2 are the same type, then there 
-and array types, however in these cases the range of constructors
+         is only one version of the single-argument constructor, and this constructor 
-that can be used are limited. If types T1 and T2 are the same
+         initialises both values in the pair to the passed value.</p>
-type, then there is only one version of the single-argument
+      <P>Note that if either member is a POD type, then that member is not 
-constructor, and this constructor initialises both values in the
+         zero-initialized by the compressed_pair default constructor: it's up to you to 
-pair to the passed value.</p>
+         supply an initial value for these types if you want them to have a default 
-
+         value.</P>
-<p>Note that compressed_pair can not be instantiated if either of
+      <p>Note that compressed_pair can not be instantiated if either of the template 
-the template arguments is a union type, unless there is compiler
+         arguments is a union type, unless there is compiler support for 
-support for boost::is_union, or if boost::is_union is specialised
+         boost::is_union, or if boost::is_union is specialised for the union type.</p>
-for the union type.</p>
+      <p>Finally, a word of caution for Visual C++ 6 users: if either argument is an 
-
+         empty type, then assigning to that member will produce memory corruption, 
-<p>Finally, a word of caution for Visual C++ 6 users: if either
+         unless the empty type has a "do nothing" assignment operator defined. This is 
-argument is an empty type, then assigning to that member will
+         due to a bug in the way VC6 generates implicit assignment operators.</p>
-produce memory corruption, unless the empty type has a &quot;do
+      <hr>
-nothing&quot; assignment operator defined. This is due to a bug
+      <p>Revised 08 May 2001</p>
-in the way VC6 generates implicit assignment operators.</p>
+      <p><EFBFBD> Copyright boost.org 2000. Permission to copy, use, modify, sell and 
-
+         distribute this document is granted provided this copyright notice appears in 
-<hr>
+         all copies. This document is provided "as is" without express or implied 
-
+         warranty, and with no claim as to its suitability for any purpose.</p>
-<p>Revised 08 May 2001</p>
+      <p>Based on contributions by Steve Cleary, Beman Dawes, Howard Hinnant and John 
-
+         Maddock.</p>
-<p><EFBFBD> Copyright boost.org 2000. Permission to copy, use, modify,
+      <p>Maintained by <a href="mailto:john@johnmaddock.co.uk">John Maddock</a>, the 
-sell and distribute this document is granted provided this
+         latest version of this file can be found at <a href="http://www.boost.org">www.boost.org</a>, 
-copyright notice appears in all copies. This document is provided
+         and the boost discussion list at <a href="http://www.yahoogroups.com/list/boost">www.yahoogroups.com/list/boost</a>.</p>
-&quot;as is&quot; without express or implied warranty, and with
+      <p>&nbsp;</p>
-no claim as to its suitability for any purpose.</p>
+   </body>
 <p>Based on contributions by Steve Cleary, Beman Dawes, Howard
 Hinnant and John Maddock.</p>
 <p>Maintained by <a href="mailto:john@johnmaddock.co.uk">John
 Maddock</a>, the latest version of this file can be found at <a
 href="http://www.boost.org">www.boost.org</a>, and the boost
 discussion list at <a
 href="http://www.yahoogroups.com/list/boost">www.yahoogroups.com/list/boost</a>.</p>
 <p>&nbsp;</p>
 </body>
 </html>
--- a/compressed_pair_test.cpp
+++ b/compressed_pair_test.cpp
@@ -14,29 +14,23 @@
 #include <cassert>
 #include <boost/compressed_pair.hpp>
 #include <boost/type_traits/type_traits_test.hpp>
 #define BOOST_INCLUDE_MAIN
 #include <boost/test/test_tools.hpp>
 using namespace boost;
-namespace boost {
+struct empty_UDT
-#ifndef BOOST_NO_INCLASS_MEMBER_INITIALIZATION
+{
-template <> struct is_empty<empty_UDT>
+   ~empty_UDT(){};
-{ static const bool value = true; };
+   empty_UDT& operator=(const empty_UDT&){ return *this; }
-template <> struct is_empty<empty_POD_UDT>
+   bool operator==(const empty_UDT&)const
-{ static const bool value = true; };
+   { return true; }
-template <> struct is_POD<empty_POD_UDT>
+};
-{ static const bool value = true; };
+struct empty_POD_UDT
-#else
+{
-template <> struct is_empty<empty_UDT>
+   empty_POD_UDT& operator=(const empty_POD_UDT&){ return *this; }
-{ enum{ value = true }; };
+   bool operator==(const empty_POD_UDT&)const
-template <> struct is_empty<empty_POD_UDT>
+   { return true; }
-{ enum{ value = true }; };
+};
 template <> struct is_POD<empty_POD_UDT>
 { enum{ value = true }; };
 #endif
 }
 struct non_empty1
 { 
@@ -85,47 +79,47 @@ void compressed_pair_tester<T1, T2>::test(first_param_type p1, second_param_type
   // first param construct:
   boost::compressed_pair<T1,T2> cp2(p1);
   cp2.second() = p2;
-   BOOST_TEST(cp2.first() == p1);
+   BOOST_CHECK(cp2.first() == p1);
-   BOOST_TEST(cp2.second() == p2);
+   BOOST_CHECK(cp2.second() == p2);
   // second param construct:
   boost::compressed_pair<T1,T2> cp3(p2);
   cp3.first() = p1;
-   BOOST_TEST(cp3.second() == p2);
+   BOOST_CHECK(cp3.second() == p2);
-   BOOST_TEST(cp3.first() == p1);
+   BOOST_CHECK(cp3.first() == p1);
   // both param construct:
   boost::compressed_pair<T1,T2> cp4(p1, p2);
-   BOOST_TEST(cp4.first() == p1);
+   BOOST_CHECK(cp4.first() == p1);
-   BOOST_TEST(cp4.second() == p2);
+   BOOST_CHECK(cp4.second() == p2);
   boost::compressed_pair<T1,T2> cp5(p3, p4);
-   BOOST_TEST(cp5.first() == p3);
+   BOOST_CHECK(cp5.first() == p3);
-   BOOST_TEST(cp5.second() == p4);
+   BOOST_CHECK(cp5.second() == p4);
   // check const members:
   const boost::compressed_pair<T1,T2>& cpr1 = cp4;
-   BOOST_TEST(cpr1.first() == p1);
+   BOOST_CHECK(cpr1.first() == p1);
-   BOOST_TEST(cpr1.second() == p2);
+   BOOST_CHECK(cpr1.second() == p2);
   // copy construct:
   boost::compressed_pair<T1,T2> cp6(cp4);
-   BOOST_TEST(cp6.first() == p1);
+   BOOST_CHECK(cp6.first() == p1);
-   BOOST_TEST(cp6.second() == p2);
+   BOOST_CHECK(cp6.second() == p2);
   // assignment:
   cp1 = cp4;
-   BOOST_TEST(cp1.first() == p1);
+   BOOST_CHECK(cp1.first() == p1);
-   BOOST_TEST(cp1.second() == p2);
+   BOOST_CHECK(cp1.second() == p2);
   cp1 = cp5;
-   BOOST_TEST(cp1.first() == p3);
+   BOOST_CHECK(cp1.first() == p3);
-   BOOST_TEST(cp1.second() == p4);
+   BOOST_CHECK(cp1.second() == p4);
   // swap:
   cp4.swap(cp5);
-   BOOST_TEST(cp4.first() == p3);
+   BOOST_CHECK(cp4.first() == p3);
-   BOOST_TEST(cp4.second() == p4);
+   BOOST_CHECK(cp4.second() == p4);
-   BOOST_TEST(cp5.first() == p1);
+   BOOST_CHECK(cp5.first() == p1);
-   BOOST_TEST(cp5.second() == p2);
+   BOOST_CHECK(cp5.second() == p2);
   swap(cp4,cp5);
-   BOOST_TEST(cp4.first() == p1);
+   BOOST_CHECK(cp4.first() == p1);
-   BOOST_TEST(cp4.second() == p2);
+   BOOST_CHECK(cp4.second() == p2);
-   BOOST_TEST(cp5.first() == p3);
+   BOOST_CHECK(cp5.first() == p3);
-   BOOST_TEST(cp5.second() == p4);
+   BOOST_CHECK(cp5.second() == p4);
 }
 //
@@ -154,20 +148,20 @@ void compressed_pair_reference_tester<T1, T2>::test(first_param_type p1, second_
 #endif
   // both param construct:
   boost::compressed_pair<T1,T2> cp4(p1, p2);
-   BOOST_TEST(cp4.first() == p1);
+   BOOST_CHECK(cp4.first() == p1);
-   BOOST_TEST(cp4.second() == p2);
+   BOOST_CHECK(cp4.second() == p2);
   boost::compressed_pair<T1,T2> cp5(p3, p4);
-   BOOST_TEST(cp5.first() == p3);
+   BOOST_CHECK(cp5.first() == p3);
-   BOOST_TEST(cp5.second() == p4);
+   BOOST_CHECK(cp5.second() == p4);
   // check const members:
   const boost::compressed_pair<T1,T2>& cpr1 = cp4;
-   BOOST_TEST(cpr1.first() == p1);
+   BOOST_CHECK(cpr1.first() == p1);
-   BOOST_TEST(cpr1.second() == p2);
+   BOOST_CHECK(cpr1.second() == p2);
   // copy construct:
   boost::compressed_pair<T1,T2> cp6(cp4);
-   BOOST_TEST(cp6.first() == p1);
+   BOOST_CHECK(cp6.first() == p1);
-   BOOST_TEST(cp6.second() == p2);
+   BOOST_CHECK(cp6.second() == p2);
   // assignment:
   // VC6 bug:
   // When second() is an empty class, VC6 performs the
@@ -180,8 +174,8 @@ void compressed_pair_reference_tester<T1, T2>::test(first_param_type p1, second_
   // settings - some generate the problem others do not.
   cp4.first() = p3;
   cp4.second() = p4;
-   BOOST_TEST(cp4.first() == p3);
+   BOOST_CHECK(cp4.first() == p3);
-   BOOST_TEST(cp4.second() == p4);
+   BOOST_CHECK(cp4.second() == p4);
 }
 //
 // supplimentary tests for case where first arg only is a reference type:
@@ -205,8 +199,8 @@ void compressed_pair_reference1_tester<T1, T2>::test(first_param_type p1, second
   // first param construct:
   boost::compressed_pair<T1,T2> cp2(p1);
   cp2.second() = p2;
-   BOOST_TEST(cp2.first() == p1);
+   BOOST_CHECK(cp2.first() == p1);
-   BOOST_TEST(cp2.second() == p2);
+   BOOST_CHECK(cp2.second() == p2);
 #endif
 }
 //
@@ -231,8 +225,8 @@ void compressed_pair_reference2_tester<T1, T2>::test(first_param_type p1, second
   // second param construct:
   boost::compressed_pair<T1,T2> cp3(p2);
   cp3.first() = p1;
-   BOOST_TEST(cp3.second() == p2);
+   BOOST_CHECK(cp3.second() == p2);
-   BOOST_TEST(cp3.first() == p1);
+   BOOST_CHECK(cp3.first() == p1);
 #endif
 }
@@ -259,14 +253,14 @@ void compressed_pair_array1_tester<T1, T2>::test(first_param_type p1, second_par
   // second param construct:
   boost::compressed_pair<T1,T2> cp3(p2);
   cp3.first()[0] = p1[0];
-   BOOST_TEST(cp3.second() == p2);
+   BOOST_CHECK(cp3.second() == p2);
-   BOOST_TEST(cp3.first()[0] == p1[0]);
+   BOOST_CHECK(cp3.first()[0] == p1[0]);
   // check const members:
   const boost::compressed_pair<T1,T2>& cpr1 = cp3;
-   BOOST_TEST(cpr1.first()[0] == p1[0]);
+   BOOST_CHECK(cpr1.first()[0] == p1[0]);
-   BOOST_TEST(cpr1.second() == p2);
+   BOOST_CHECK(cpr1.second() == p2);
-   BOOST_TEST(sizeof(T1) == sizeof(cp1.first()));
+   BOOST_CHECK(sizeof(T1) == sizeof(cp1.first()));
 }
 template <class T1, class T2>
@@ -289,14 +283,14 @@ void compressed_pair_array2_tester<T1, T2>::test(first_param_type p1, second_par
   // first param construct:
   boost::compressed_pair<T1,T2> cp2(p1);
   cp2.second()[0] = p2[0];
-   BOOST_TEST(cp2.first() == p1);
+   BOOST_CHECK(cp2.first() == p1);
-   BOOST_TEST(cp2.second()[0] == p2[0]);
+   BOOST_CHECK(cp2.second()[0] == p2[0]);
   // check const members:
   const boost::compressed_pair<T1,T2>& cpr1 = cp2;
-   BOOST_TEST(cpr1.first() == p1);
+   BOOST_CHECK(cpr1.first() == p1);
-   BOOST_TEST(cpr1.second()[0] == p2[0]);
+   BOOST_CHECK(cpr1.second()[0] == p2[0]);
-   BOOST_TEST(sizeof(T2) == sizeof(cp1.second()));
+   BOOST_CHECK(sizeof(T2) == sizeof(cp1.second()));
 }
 template <class T1, class T2>
@@ -318,15 +312,15 @@ void compressed_pair_array_tester<T1, T2>::test(first_param_type p1, second_para
   boost::compressed_pair<T1,T2> cp1;
   cp1.first()[0] = p1[0];
   cp1.second()[0] = p2[0];
-   BOOST_TEST(cp1.first()[0] == p1[0]);
+   BOOST_CHECK(cp1.first()[0] == p1[0]);
-   BOOST_TEST(cp1.second()[0] == p2[0]);
+   BOOST_CHECK(cp1.second()[0] == p2[0]);
   // check const members:
   const boost::compressed_pair<T1,T2>& cpr1 = cp1;
-   BOOST_TEST(cpr1.first()[0] == p1[0]);
+   BOOST_CHECK(cpr1.first()[0] == p1[0]);
-   BOOST_TEST(cpr1.second()[0] == p2[0]);
+   BOOST_CHECK(cpr1.second()[0] == p2[0]);
-   BOOST_TEST(sizeof(T1) == sizeof(cp1.first()));
+   BOOST_CHECK(sizeof(T1) == sizeof(cp1.first()));
-   BOOST_TEST(sizeof(T2) == sizeof(cp1.second()));
+   BOOST_CHECK(sizeof(T2) == sizeof(cp1.second()));
 }
 int test_main(int, char *[])
--- a/counting_iterator_example.cpp
+++ b/counting_iterator_example.cpp
@@ -1,60 +0,0 @@
 // (C) Copyright Jeremy Siek 2000. Permission to copy, use, modify, sell and
 // distribute this software is granted provided this copyright notice appears
 // in all copies. This software is provided "as is" without express or implied
 // warranty, and with no claim as to its suitability for any purpose.
 #include <boost/config.hpp>
 #include <algorithm>
 #include <iostream>
 #include <iterator>
 #include <vector>
 #include <boost/iterator/counting_iterator.hpp>
 #include <boost/iterator/indirect_iterator.hpp>
 int main(int, char*[])
 {
  // Example of using counting_iterator_generator
  std::cout << "counting from 0 to 4:" << std::endl;
  boost::counting_iterator<int> first(0), last(4);
  std::copy(first, last, std::ostream_iterator<int>(std::cout, " "));
  std::cout << std::endl;
  // Example of using make_counting_iterator()
  std::cout << "counting from -5 to 4:" << std::endl;
  std::copy(boost::make_counting_iterator(-5),
            boost::make_counting_iterator(5),
            std::ostream_iterator<int>(std::cout, " "));
  std::cout << std::endl;
  // Example of using counting iterator to create an array of pointers.
 #if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x551))
  const
 #endif 
      int N = 7;
  std::vector<int> numbers;
  // Fill "numbers" array with [0,N)
  std::copy(
      boost::make_counting_iterator(0)
      , boost::make_counting_iterator(N)
      , std::back_inserter(numbers));
  std::vector<std::vector<int>::iterator> pointers;
  // Use counting iterator to fill in the array of pointers.
  // causes an ICE with MSVC6
  std::copy(boost::make_counting_iterator(numbers.begin()),
            boost::make_counting_iterator(numbers.end()),
            std::back_inserter(pointers));
  // Use indirect iterator to print out numbers by accessing
  // them through the array of pointers.
  std::cout << "indirectly printing out the numbers from 0 to " 
            << N << std::endl;
  std::copy(boost::make_indirect_iterator(pointers.begin()),
            boost::make_indirect_iterator(pointers.end()),
            std::ostream_iterator<int>(std::cout, " "));
  std::cout << std::endl;
  return 0;
 }
--- a/current_function.html
+++ b/current_function.html
@@ -8,7 +8,7 @@
 		<table border="0" width="100%">
 			<tr>
 				<td width="277">
-					<img src="../../c++boost.gif" alt="c++boost.gif (8819 bytes)" width="277" height="86">
+					<img src="../../boost.png" alt="boost.png (6897 bytes)" width="277" height="86">
 				</td>
 				<td align="middle">
 					<h1>current_function.hpp</h1>
--- a/current_function_test.cpp
+++ b/current_function_test.cpp
@@ -12,18 +12,22 @@
 //
 //  Copyright (c) 2002 Peter Dimov and Multi Media Ltd.
 //
-//  Permission to copy, use, modify, sell and distribute this software
+// Distributed under the Boost Software License, Version 1.0. (See
-//  is granted provided this copyright notice appears in all copies.
+// accompanying file LICENSE_1_0.txt or copy at
-//  This software is provided "as is" without express or implied
+// http://www.boost.org/LICENSE_1_0.txt)
 //  warranty, and with no claim as to its suitability for any purpose.
 //
 #include <boost/current_function.hpp>
 #include <boost/config.hpp>
 #include <cstdio>
 void message(char const * file, long line, char const * func, char const * msg)
 {
-    std::printf("%s(%ld): %s in function '%s'\n", file, line, msg, func);
+#if !defined(BOOST_NO_STDC_NAMESPACE)
    using std::printf;
 #endif
    printf("%s(%ld): %s in function '%s'\n", file, line, msg, func);
 }
 #define MESSAGE(msg) message(__FILE__, __LINE__, BOOST_CURRENT_FUNCTION, msg)
@@ -31,4 +35,6 @@ void message(char const * file, long line, char const * func, char const * msg)
 int main()
 {
    MESSAGE("assertion failed");
    return 0;
 }
--- a/enable_if.html
+++ b/enable_if.html
@@ -17,7 +17,7 @@
 <h1>
-<img border="0" src="../../c++boost.gif" align="center" width="277" height="86">enable_if</h1>
+<img border="0" src="../../boost.png" align="center" width="277" height="86">enable_if</h1>
 <BR>
 <BR>
 Copyright 2003 Jaakko J&auml;rvi, Jeremiah Willcock, Andrew Lumsdaine.<BR>
@@ -128,7 +128,7 @@ When valid, <TT>enable_if_c&lt;B, T&gt;::type</TT> equals <TT>T</TT>.
 The <TT>enable_if_c</TT> template can thus be used for controlling when functions are considered for
 overload resolution and when they are not. 
 For example, the following function is defined for all arithmetic types (according to the
-classification of the <A HREF="http://www.boost.org/libs/type_traits">Boost type_traits library</A>):
+classification of the <A HREF="../type_traits/index.html">Boost type_traits library</A>):
 <PRE>template &lt;class T&gt;
 typename enable_if_c&lt;boost::is_arithmetic&lt;T&gt;::value, T&gt;::type 
 foo(T t) { return t; }
--- a/enable_if/test/Jamfile
+++ b/enable_if/test/Jamfile
@@ -0,0 +1,33 @@
 # Copyright David Abrahams 2003.
 # Distributed under the Boost Software License, Version 1.0. 
 # (See accompanying file LICENSE_1_0.txt or copy at 
 # http://www.boost.org/LICENSE_1_0.txt)
 # For more information, see http://www.boost.org/
 subproject libs/utility/enable_if/test ;
 # bring in rules for testing
 import testing ;
 # Make tests run by default.
 DEPENDS all : test ;
 {
    local test_monitor = <lib>@boost/libs/test/build/boost_test_exec_monitor ;
    # look in BOOST_ROOT for sources first, just in this Jamfile
    local SEARCH_SOURCE = $(BOOST_ROOT) $(SEARCH_SOURCE) ;
    test-suite utility/enable_if
        :
        [ run libs/utility/enable_if/test/constructors.cpp $(test_monitor) ]
        [ run libs/utility/enable_if/test/dummy_arg_disambiguation.cpp $(test_monitor) ]
        [ run libs/utility/enable_if/test/lazy.cpp $(test_monitor) ]
        [ run libs/utility/enable_if/test/lazy_test.cpp $(test_monitor) ]
        [ run libs/utility/enable_if/test/member_templates.cpp $(test_monitor) ]
        [ run libs/utility/enable_if/test/namespace_disambiguation.cpp $(test_monitor) ]
        [ run libs/utility/enable_if/test/no_disambiguation.cpp $(test_monitor) ]
        [ run libs/utility/enable_if/test/partial_specializations.cpp $(test_monitor) ]
    ;
 }
--- a/enable_if/test/Jamfile.v2
+++ b/enable_if/test/Jamfile.v2
@@ -0,0 +1,23 @@
 # Copyright David Abrahams 2003.
 # Distributed under the Boost Software License, Version 1.0. 
 # (See accompanying file LICENSE_1_0.txt or copy at 
 # http://www.boost.org/LICENSE_1_0.txt)
 # For more information, see http://www.boost.org/
 project
    : requirements <library>/boost/test//boost_test_exec_monitor
    ;
 test-suite utility/enable_if
        :
        [ run constructors.cpp ]
        [ run dummy_arg_disambiguation.cpp ]
        [ run lazy.cpp ]
        [ run lazy_test.cpp ]
        [ run member_templates.cpp ]
        [ run namespace_disambiguation.cpp ]
        [ run no_disambiguation.cpp ]
        [ run partial_specializations.cpp ]
    ;
--- a/enable_if/test/constructors.cpp
+++ b/enable_if/test/constructors.cpp
--- a/enable_if/test/dummy_arg_disambiguation.cpp
+++ b/enable_if/test/dummy_arg_disambiguation.cpp
--- a/enable_if/test/lazy.cpp
+++ b/enable_if/test/lazy.cpp
--- a/enable_if/test/lazy_test.cpp
+++ b/enable_if/test/lazy_test.cpp
--- a/enable_if/test/member_templates.cpp
+++ b/enable_if/test/member_templates.cpp
--- a/enable_if/test/namespace_disambiguation.cpp
+++ b/enable_if/test/namespace_disambiguation.cpp
--- a/enable_if/test/no_disambiguation.cpp
+++ b/enable_if/test/no_disambiguation.cpp
--- a/enable_if/test/partial_specializations.cpp
+++ b/enable_if/test/partial_specializations.cpp
--- a/filter_iterator_example.cpp
+++ b/filter_iterator_example.cpp
@@ -1,62 +0,0 @@
 // Example of using the filter iterator adaptor from
 // boost/iterator_adaptors.hpp.
 //  (C) Copyright Jeremy Siek 1999. Permission to copy, use, modify,
 //  sell and distribute this software is granted provided this
 //  copyright notice appears in all copies. This software is provided
 //  "as is" without express or implied warranty, and with no claim as
 //  to its suitability for any purpose.
 #include <boost/config.hpp>
 #include <algorithm>
 #include <functional>
 #include <iostream>
 #include <boost/iterator/filter_iterator.hpp>
 struct is_positive_number {
  bool operator()(int x) { return 0 < x; }
 };
 int main()
 {
  int numbers_[] = { 0, -1, 4, -3, 5, 8, -2 };
  const int N = sizeof(numbers_)/sizeof(int);
  typedef int* base_iterator;
  base_iterator numbers(numbers_);
  // Example using make_filter_iterator()
  std::copy(boost::make_filter_iterator<is_positive_number>(numbers, numbers + N),
            boost::make_filter_iterator<is_positive_number>(numbers + N, numbers + N),
            std::ostream_iterator<int>(std::cout, " "));
  std::cout << std::endl;
  // Example using filter_iterator
  typedef boost::filter_iterator<is_positive_number, base_iterator>
    FilterIter;
  is_positive_number predicate;
  FilterIter filter_iter_first(predicate, numbers, numbers + N);
  FilterIter filter_iter_last(predicate, numbers + N, numbers + N);
  std::copy(filter_iter_first, filter_iter_last, std::ostream_iterator<int>(std::cout, " "));
  std::cout << std::endl;
  // Another example using make_filter_iterator()
  std::copy(
      boost::make_filter_iterator(
          std::bind2nd(std::greater<int>(), -2)
        , numbers, numbers + N)
    , boost::make_filter_iterator(
          std::bind2nd(std::greater<int>(), -2)
        , numbers + N, numbers + N)
    , std::ostream_iterator<int>(std::cout, " ")
  );
  std::cout << std::endl;
  return 0;
 }
--- a/fun_out_iter_example.cpp
+++ b/fun_out_iter_example.cpp
@@ -1,47 +0,0 @@
 // (C) Copyright Jeremy Siek 2001. Permission to copy, use, modify,
 // sell and distribute this software is granted provided this
 // copyright notice appears in all copies. This software is provided
 // "as is" without express or implied warranty, and with no claim as
 // to its suitability for any purpose.
 // Revision History:
 // 27 Feb 2001   Jeremy Siek
 //      Initial checkin.
 #include <iostream>
 #include <string>
 #include <vector>
 #include <boost/function_output_iterator.hpp>
 struct string_appender
 {
    string_appender(std::string& s)
        : m_str(&s)
    {}
    void operator()(const std::string& x) const
    {
        *m_str += x;
    }
    std::string* m_str;
 };
 int main(int, char*[])
 {
  std::vector<std::string> x;
  x.push_back("hello");
  x.push_back(" ");
  x.push_back("world");
  x.push_back("!");
  std::string s = "";
  std::copy(x.begin(), x.end(), 
            boost::make_function_output_iterator(string_appender(s)));
  std::cout << s << std::endl;
  return 0;
 }
--- a/generator_iterator.htm
+++ b/generator_iterator.htm
@@ -7,7 +7,7 @@
 <body bgcolor="#FFFFFF" text="#000000">
-<img src="../../c++boost.gif" alt="c++boost.gif (8819 bytes)" align="center" width="277" height="86"> 
+<img src="../../boost.png" alt="boost.png (6897 bytes)" align="center" width="277" height="86"> 
 <h1>Generator Iterator Adaptor</h1>
 Defined in header <a href="../../boost/generator_iterator.hpp">boost/generator_iterator.hpp</a> 
@@ -58,7 +58,7 @@ template &lt;class Generator>
 class generator_iterator_generator
 {
 public:
-  typedef <a href="iterator_adaptors.htm#iterator_adaptor">iterator_adaptor</a>&lt...&gt; type; // the resulting generator iterator type 
+  typedef <i>unspecified</i> type; // the resulting generator iterator type 
 }
 </pre>
--- a/half_open_range_test.cpp
+++ b/half_open_range_test.cpp
@@ -1,366 +0,0 @@
 // (C) Copyright David Abrahams 2001. Permission to copy, use, modify, sell and
 // distribute this software is granted provided this copyright notice appears in
 // all copies. This software is provided "as is" without express or implied
 // warranty, and with no claim as to its suitability for any purpose.
 //
 //  See http://www.boost.org for most recent version including documentation.
 //
 // Revision History
 // 11 Feb 2001  Compile with Borland, re-enable failing tests (David Abrahams)
 // 29 Jan 2001  Initial revision (David Abrahams)
 #include <boost/half_open_range.hpp>
 #include <boost/utility.hpp>
 #include <iterator>
 #include <stdlib.h>
 #include <vector>
 #include <list>
 #include <cassert>
 #include <stdexcept>
 #ifndef BOOST_NO_LIMITS
 # include <limits>
 #endif
 #ifndef BOOST_NO_SLIST
 # include <slist>
 #endif
 inline unsigned unsigned_random(unsigned max)
 {
    return (max > 0) ? (unsigned)rand() % max : 0;
 }
 // Special tests for ranges supporting random access
 template <class T>
 void category_test_1(
    const boost::half_open_range<T>& r, std::random_access_iterator_tag)
 {
    typedef boost::half_open_range<T> range;
    typedef typename range::size_type size_type;
    size_type size = r.size();
    // pick a random offset
    size_type offset = unsigned_random(size);
    typename range::value_type x = *(r.begin() + offset);
    // test contains(value_type)
    assert(r.contains(r.start()) == !r.empty());
    assert(!r.contains(r.finish()));
    assert(r.contains(x) == (offset != size));
    range::const_iterator p = r.find(x);
    assert((p == r.end()) == (x == r.finish()));
    assert(r.find(r.finish()) == r.end());
    if (offset != size)
    {
        assert(x == r[offset]);
        assert(x == r.at(offset));
    }
    bool caught_out_of_range = false;
    try {
        bool never_initialized = x == r.at(size);
        (void)never_initialized;
    }
    catch(std::out_of_range&)
    {
        caught_out_of_range = true;
    }
    catch(...)
    {
    }
    assert(caught_out_of_range);
 }
 // Those tests must be skipped for other ranges
 template <class T>
 void category_test_1(
    const boost::half_open_range<T>&, std::forward_iterator_tag)
 {
 }
 unsigned indices[][2] = { {0,0},{0,1},{0,2},{0,3},
                                {1,1},{1,2},{1,3},
                                      {2,2},{2,3},
                                            {3,3}};
 template <class Range>
 void category_test_2(
    const std::vector<Range>& ranges, unsigned i, unsigned j, std::random_access_iterator_tag)
 {
    typedef Range range;
    const range& ri = ranges[i];
    const range& rj = ranges[j];
    if (indices[i][0] <= indices[j][0] && indices[i][1] >= indices[j][1])
        assert(ri.contains(rj));
    if (ri.contains(rj))
        assert((ri & rj) == rj);
    assert(boost::intersects(ri, rj) == !(ri & rj).empty());
    range t1(ri);
    t1 &= rj;
    assert(t1 == range(indices[i][0] > indices[j][0] ? ri.start() : rj.start(),
                       indices[i][1] < indices[j][1] ? ri.finish() : rj.finish()));
    assert(t1 == (ri & rj));
    range t2(ri);
    t2 |= rj;
    if (ri.empty())
        assert(t2 == rj);
    else if (rj.empty())
        assert(t2 == ri);
    else
        assert(t2 == range(indices[i][0] < indices[j][0] ? ri.start() : rj.start(),
                           indices[i][1] > indices[j][1] ? ri.finish() : rj.finish()));
    assert(t2 == (ri | rj));
    if (i == j)
        assert(ri == rj);
    if (ri.empty() || rj.empty())
        assert((ri == rj) == (ri.empty() && rj.empty()));
    else
        assert((ri == rj) == (ri.start() == rj.start() && ri.finish() == rj.finish()));
    assert((ri == rj) == !(ri != rj));
    bool same = ri == rj;
    bool one_empty = ri.empty() != rj.empty();
    std::less<range> less;
    std::less_equal<range> less_equal;
    std::greater<range> greater;
    std::greater_equal<range> greater_equal;
    if (same)
    {
        assert(greater_equal(ri,rj));
        assert(less_equal(ri,rj));
        assert(!greater(ri,rj));
        assert(!less(ri,rj));
    }
    else if (one_empty)
    {
        const range& empty = ri.empty() ? ri : rj;
        const range& non_empty = rj.empty() ? ri : rj;
        assert(less(empty,non_empty));
        assert(less_equal(empty,non_empty));
        assert(!greater(empty,non_empty));
        assert(!greater_equal(empty,non_empty));
        assert(!less(non_empty,empty));
        assert(!less_equal(non_empty,empty));
        assert(greater(non_empty,empty));
        assert(greater_equal(non_empty,empty));
    }
    else {
        if (indices[i][0] < indices[j][0] ||
            indices[i][0] == indices[j][0] && indices[i][1] < indices[j][1])
        {
            assert(!greater_equal(ri,rj));
            assert(less(ri,rj));
        }
        if (indices[i][0] < indices[j][0] ||
            indices[i][0] == indices[j][0] && indices[i][1] <= indices[j][1])
        {
            assert(!greater(ri,rj));
            assert(less_equal(ri,rj));
        }
        if (indices[i][0] > indices[j][0] ||
            indices[i][0] == indices[j][0] && indices[i][1] > indices[j][1])
        {
            assert(!less_equal(ri,rj));
            assert(greater(ri,rj));
        }
        if (indices[i][0] > indices[j][0] ||
            indices[i][0] == indices[j][0] && indices[i][1] >= indices[j][1])
        {
            assert(!less(ri,rj));
            assert(greater_equal(ri,rj));
        }
    }
 }
 template <class Range>
 void category_test_2(
    const std::vector<Range>&, unsigned, unsigned, std::forward_iterator_tag)
 {
 }
 template <class T>
 void category_test_2(
    const std::vector<boost::half_open_range<T> >&, unsigned, unsigned, std::bidirectional_iterator_tag)
 {
 }
 template <class Range>
 void test_back(Range& x, std::bidirectional_iterator_tag)
 {
    assert(x.back() == boost::prior(x.finish()));
 }
 template <class Range>
 void test_back(Range& x, std::forward_iterator_tag)
 {
 }
 template <class T>
 boost::half_open_range<T> range_identity(const boost::half_open_range<T>& x)
 {
    return x;
 }
 template <class T>
 void test(T x0, T x1, T x2, T x3)
 {
    std::vector<boost::half_open_range<T> > ranges;
    typedef boost::half_open_range<T> range;
    T bounds[4] = { x0, x1, x2, x3 };
    const std::size_t num_ranges = sizeof(indices)/sizeof(*indices);
    // test construction
    for (std::size_t n = 0; n < num_ranges;++n)
    {
        T start = bounds[indices[n][0]];
        T finish = bounds[indices[n][1]];
        boost::half_open_range<T> r(start, finish);
        ranges.push_back(r);
    }
    // test implicit conversion from std::pair<T,T>
    range converted = std::pair<T,T>(x0,x0);
    (void)converted;
    // test assignment, equality and inequality
    range r00 = range(x0, x0);
    assert(r00 == range(x0,x0));
    assert(r00 == range(x1,x1)); // empty ranges are all equal
    if (x3 != x0)
        assert(r00 != range(x0, x3));
    r00 = range(x0, x3);
    assert(r00 == range(x0, x3));
    if (x3 != x0)
        assert(r00 != range(x0, x0));
    typedef typename range::iterator iterator;
    typedef typename iterator::iterator_category category;
    for (unsigned i = 0; i < num_ranges; ++i)
    {
        const range& r = ranges[i];
        // test begin(), end(), basic iteration.
        unsigned count = 0;
        for (range::const_iterator p = r.begin(), finish = r.end();
             p != finish;
             ++p, ++count)
        {
            assert(count < 2100);
        }
        // test size(), empty(), front(), back()
        assert((unsigned)r.size() == count);
        if (indices[i][0] == indices[i][1])
            assert(r.empty());
        if (r.empty())
            assert(r.size() == 0);
        if (!r.empty())
        {
            assert(r.front() == r.start());
            test_back(r, category());
        }
            // test swap
        range r1(r);
        range r2(x0,x3);
        const bool same = r1 == r2;
        r1.swap(r2);
        assert(r1 == range(x0,x3));
        assert(r2 == r);
        if (!same) {
            assert(r1 != r);
            assert(r2 != range(x0,x3));
        }
        // do individual tests for random-access iterators
        category_test_1(r, category());
    }
    for (unsigned j = 0; j < num_ranges; ++j) {
        for (unsigned k = 0; k < num_ranges; ++k) {
            category_test_2(ranges, j, k, category());
        }
    }
 }
 template <class Integer>
 void test_integer(Integer* = 0) // default arg works around MSVC bug
 {
    Integer a = 0;
    Integer b = a + unsigned_random(128 - a);
    Integer c = b + unsigned_random(128 - b);
    Integer d = c + unsigned_random(128 - c);
    test(a, b, c, d);
 }
 template <class Container>
 void test_container(Container* = 0)  // default arg works around MSVC bug
 {
    Container c(unsigned_random(1673));
    const typename Container::size_type offset1 = unsigned_random(c.size());
    const typename Container::size_type offset2 = unsigned_random(c.size() - offset1);
    typename Container::iterator internal1 = c.begin();
    std::advance(internal1, offset1);
    typename Container::iterator internal2 = internal1;
    std::advance(internal2, offset2);
    test(c.begin(), internal1, internal2, c.end());
    typedef typename Container::const_iterator const_iterator;
    test(const_iterator(c.begin()),
         const_iterator(internal1),
         const_iterator(internal2),
         const_iterator(c.end()));
 }
 int main()
 {
    // Test the built-in integer types.
    test_integer<char>();
    test_integer<unsigned char>();
    test_integer<signed char>();
    test_integer<wchar_t>();
    test_integer<short>();
    test_integer<unsigned short>();
    test_integer<int>();
    test_integer<unsigned int>();
    test_integer<long>();
    test_integer<unsigned long>();
 #if defined(BOOST_HAS_LONG_LONG)
    test_integer<long long>();
    test_integer<unsigned long long>();
 #endif
    // Some tests on container iterators, to prove we handle a few different categories
    test_container<std::vector<int> >();
    test_container<std::list<int> >();
 #ifndef BOOST_NO_SLIST
    test_container<BOOST_STD_EXTENSION_NAMESPACE::slist<int> >();
 #endif
    // Also prove that we can handle raw pointers.
    int array[2000];
    const std::size_t a = 0;
    const std::size_t b = a + unsigned_random(2000 - a);
    const std::size_t c = b + unsigned_random(2000 - b);
    test(array, array+b, array+c, array+2000);
    return 0;
 }
--- a/in_place_factories.html
+++ b/in_place_factories.html
@@ -0,0 +1,297 @@
 <!DOCTYPE HTML PUBLIC "-//SoftQuad Software//DTD HoTMetaL PRO 5.0::19981217::extensions to HTML 4.0//EN" "hmpro5.dtd">
 <HTML>
 <HEAD>
 <META HTTP-EQUIV="Content-Type" CONTENT="text/html; charset=iso-8859-1">
 <LINK REL="stylesheet" TYPE="text/css" HREF="../../boost.css">
 <TITLE>Header </TITLE>
 </HEAD>
 <BODY BGCOLOR="#FFFFFF" TEXT="#000000" LINK="#0000FF" VLINK="#800080">
 <H2 align="left"><IMG SRC="../../boost.png" WIDTH="276" HEIGHT="86"></H2>
 <blockquote>
  <blockquote>
    <blockquote>
      <blockquote>
        <blockquote>
          <blockquote>
 <H2 align="left">Header &lt;<A
 HREF="../../boost/utility/in_place_factory.hpp">boost/utility/in_place_factory.hpp</A>&gt; </H2>
 <H2 align="left">Header &lt;<A
 HREF="../../boost/utility/typed_in_place_factory.hpp">boost/utility/typed_in_place_factory.hpp</A>&gt; </H2>
          </blockquote>
        </blockquote>
      </blockquote>
    </blockquote>
  </blockquote>
 </blockquote>
 <p>&nbsp;</p>
 <H2>Contents</H2>
 <DL CLASS="page-index">
  <DT><A HREF="#mot">Motivation</A></DT>
  <DT><A HREF="#framework">Framework</A></DT>
  <DT><A HREF="#specification">Specification</A></DT>
  <DT><A HREF="#container-usage">Container-side Usage</A></DT>
  <DT><A HREF="#user-usage">User-side Usage</A></DT>
 </DL>
 <HR>
 <H2><A NAME="mot"></A>Motivation</H2>
 <p>Suppose we have a class</p>
 <pre>struct X
 {
  X ( int, std:::string ) ;
 } ;</pre>
 <p>And a container for it which supports an empty state (that is, which can contain zero objects):</p>
 <pre>struct C
 {
   C() : contained_(0) {}
  ~C() { delete contained_ ; }
  X* contained_ ;
 } ;</pre>
 <p>A container designed to support an empty state typically doesn't require the contained type to be DefaultConstructible,
 but it typically requires it to be CopyConstructible as a mechanism to
 initialize the object to store:</p>
 <pre>struct C
 {
   C() : contained_(0) {}
   C ( X const& v ) : contained_ ( new X(v) ) {}
  ~C() { delete contained_ ; }
  X* contained_ ;
 } ;</pre>
 <p>There is a subtle problem with this: since the mechanism used to initialize the stored object is copy construction,
 there must exist a previously constructed source object to copy from. This
 object is likely to be temporary and serve no purpose besides being the source</p>
 <pre>void foo()
 {
  // Temporary object created.
  C c( X(123,"hello") ) ;
 }
 </pre>
 <p>A solution to this problem is to support direct construction of the contained
 object right in the container's storage.<br>
 In this shceme, the user supplies the arguments for the X constructor
 directly to the container:</p>
 <pre>struct C
 {
   C() : contained_(0) {}
   C ( X const& v ) : contained_ ( new X(v) ) {}
   C ( int a0, std::string a1 ) : contained_ ( new X(a0,a1) ) {}
  ~C() { delete contained_ ; }
  X* contained_ ;
 } ;</pre>
 <pre>void foo()
 {
  // Wrapped object constructed in-place
  // No temporary created.
  C c(123,"hello") ;
 }
 </pre>
 <p>Clearly, this solution doesn't scale well since the container must duplicate all the constructor overloads from the contained type
 (at least all those which are to be supported directly in the container).</p>
 <H2><A NAME="framework"></A>Framework</H2>
 <p>
 This library proposes a framework to allow some containers to directly contruct contained objects in-place without requiring
 the entire set of constructor overloads ftom the contained type. It also allows the container to remove the CopyConstuctible
 requirement from the contained type since objects can be directly constructed in-place without need of a copy.<br>
 The only requirement on the container is that it must provide proper storage (that is, correctly aligned and sized).
 Naturally, the container will typically support uninitialized storage to avoid the in-place construction to override
 a fully-constructed object (as this would defeat the purpose of in-place construction)
 </p>
 <p>For this purpose, the framework provides two families of classes collectively called: InPlaceFactories and TypedInPlaceFactories.<br>
 Essentially, these classes hold a sequence of actual parameters and a method to contruct an object in place using these parameters.
 Each member of the family differs only in the number (and type) of the parameter list. The first family
 takes the type of the object to construct directly in method provided for that
 purpose, whereas the second family incorporates that type in the factory class
 itself..</p>
 <p>From the container POV, using the framework amounts to calling the factory's method to contruct the object in place.
 From the user POV, it amounts to creating the right factory object to hold the parameters and pass it to the container.<br>
 The following simplified example shows the basic idea. A complete example follows the formal specification of the framework:</p>
 <pre>struct C
 {
   template&lt;class InPlaceFactory&gt;
   C ( InPlaceFactory const& aFactoty )
    :
    contained_ ( uninitialized_storage() )
   {
     aFactory.template apply&lt;X&gt;(contained_);
   }
  ~C() 
  { 
    contained_ -> X::~X();
    delete[] contained_ ; 
  }
  char* uninitialized_storage() { return new char[sizeof(X)] ; }
  char* contained_ ;
 } ;
 void foo()
 {
  C c( in_place(123,"hello" ) ;
 }
 </pre>
 <HR>
 <H2><A NAME="specification">Specification</A></H2>
 <p>The following is the first member of the family of 'in_place_factory' classes, along with its corresponding helper template function.
 The rest of the family varies only in the number and type of template (and constructor) parameters.</p>
 <PRE>namespace boost {
 struct in_place_factory_base {} ;
 template&lt;class A0&gt;
 class in_place_factory : public in_place_factory_base
 {
  public:</PRE>
 <PRE>    in_place_factory ( A0 const& a0 ) : m_a0(a0) {}
    template&lt; class T &gt;
    void apply ( void* address ) const
    {
      new (address) T(m_a0);
    }
  private:</PRE>
 <PRE>    A0 const& m_a0 ;
 } ;
 template&lt;class A0&gt;
 in_place_factory&lt;A0&gt; in_place ( A0 const& a0 )
 {
  return in_place_factory&lt;A0&gt;(a0);
 }
 </PRE>
 <p>Similarly, the following is the first member of the family of 'typed_in_place_factory' classes, along with its corresponding
 helper template function. The rest of the family varies only in the number and type of template (and constructor) parameters.</p>
 <PRE>namespace boost {
 struct typed_in_place_factory_base {} ;
 template&lt;class T, class A0&gt;
 class typed_in_place_factory : public typed_in_place_factory_base
 {
  public:</PRE>
 <PRE>    typed_in_place_factory ( A0 const& a0 ) : m_a0(a0) {}
    void apply ( void* address ) const
    {
      new (address) T(m_a0);
    }
  private:</PRE>
 <PRE>    A0 const& m_a0 ;
 } ;
 template&lt;class T, class A0&gt;
 typed_in_place_factory&lt;A0&gt; in_place ( A0 const& a0 )
 {
  return typed_in_place_factory&lt;T,A0&gt;(a0);
 }</PRE>
 <PRE>}
 </PRE>
 <p>As you can see, the 'in_place_factory' and 'typed_in_place_factory' template classes varies only in the way they specify
 the target type: in the first family, the type is given as a template argument to the apply member function while in the
 second it is given directly as part of the factory class.<br>
 When the container holds a unique non-polymorphic type (such as the case of Boost.Optional), it knows the exact dynamic-type
 of the contained object and can pass it to the apply() method of a (non-typed) factory.
 In this case, end users can use an 'in_place_factory' instance which can be constructed without the type of the object to construct.<br>
 However, if the container holds heterogeneous or polymorphic objects (such as the case of Boost.Variant), the dynamic-type
 of the object to be constructed must be known by the factory itslef. In this case, end users must use a 'typed_in_place_factory'
 instead.</p>
 <HR>
 <h2><A NAME="container-usage">Container-side Usage</a></h2>
 <p>As shown in the introductory simplified example, the container class must
 contain methods that accept an instance of
 these factories and pass the object's storage to the factory's apply method.<br>
 However, the type of the factory class cannot be completly specified in the container class because that would
 defeat the whole purpose of the factories which is to allow the container to accept a variadic argument list
 for the constructor of its contained object.<br>
 The correct function overload must be based on the only distinctive and common
 characteristic of all the classes in each family, the base class.<br>
 Depending on the container class, you can use 'enable_if' to generate the right overload, or use the following
 dispatch technique (used in the Boost.Optional class):
 </p>
 <pre>struct C
 {
   C() : contained_(0) {}
   C ( X const& v ) : contained_ ( new X(v) ) {}
   template&lt;class Expr&gt
   C ( Expr const& expr )
    :
    contained_ ( uninitialized_storage() )
   {
    construct(expr,&expr)
   }
  ~C() { delete contained_ ; }
  template&lt;class InPlaceFactory&gt;
  void construct ( InPlaceFactory const& aFactory, boost::in_place_factory_base* )
  {
    aFactory.template apply&lt;X&gt;(contained_);
  }
  template&lt;class TypedInPlaceFactory&gt;
  void construct ( TypedInPlaceFactory const& aFactory, boost::typed_in_place_factory_base* )
  {
    aFactory.apply(contained_);
  }
  X* uninitialized_storage() { return static_cast&lt;X*&gt;(new char[sizeof(X)]) ; }
  X* contained_ ;
 } ;
 </pre>
 <hr>
 <h2><A NAME="user-usage">User-side Usage</a></h2>
 <p>End users pass to the container an instance of a factory object holding the actual parameters needed to construct the
 contained object directly within the container. For this, the helper template function 'in_place' is used.<br>
 The call 'in_place(a0,a1,a2,...,an)' constructs a (non-typed) 'in_place_factory' instance with the given argument list.<br>
 The call 'in_place&lt;T&gt;(a0,a1,a2,...,an)' constructs a 'typed_in_place_factory' instance with the given argument list for the
 type 'T'.</p>
 <pre>void foo()
 {
  C a( in_place(123,"hello") ) ;    // in_place_factory passed
  C b( in_place&lt;X&gt;(456,"world") ) ; // typed_in_place_factory passed
 }
 </pre>
 <P>Revised September 17, 2004</P>
 <p><EFBFBD> Copyright Fernando Luis Cacciola Carballal, 2004</p>
 <p> Use, modification, and distribution are subject to the Boost Software
 License, Version 1.0. (See accompanying file <a href="../../LICENSE_1_0.txt">
 LICENSE_1_0.txt</a> or copy at <a href="http://www.boost.org/LICENSE_1_0.txt">
 www.boost.org/LICENSE_1_0.txt</a>)</p>
 <P>Developed by <A HREF="mailto:fernando_cacciola@hotmail.com">Fernando Cacciola</A>,
 the latest version of this file can be found at <A
 HREF="http://www.boost.org">www.boost.org</A>, and the boost
 <A HREF="http://www.boost.org/more/mailing_lists.htm#main">discussion lists</A></P>
 </BODY>
 </HTML>
--- a/include/boost/assert.hpp
+++ b/include/boost/assert.hpp
@@ -3,10 +3,9 @@
 //
 //  Copyright (c) 2001, 2002 Peter Dimov and Multi Media Ltd.
 //
-//  Permission to copy, use, modify, sell and distribute this software
+// Distributed under the Boost Software License, Version 1.0. (See
-//  is granted provided this copyright notice appears in all copies.
+// accompanying file LICENSE_1_0.txt or copy at
-//  This software is provided "as is" without express or implied
+// http://www.boost.org/LICENSE_1_0.txt)
 //  warranty, and with no claim as to its suitability for any purpose.
 //
 //  Note: There are no include guards. This is intentional.
 //
@@ -33,6 +32,6 @@ void assertion_failed(char const * expr, char const * function, char const * fil
 #define BOOST_ASSERT(expr) ((expr)? ((void)0): ::boost::assertion_failed(#expr, BOOST_CURRENT_FUNCTION, __FILE__, __LINE__))
 #else
-# include <assert.h>
+# include <assert.h> // .h to support old libraries w/o <cassert> - effect is the same
 # define BOOST_ASSERT(expr) assert(expr)
 #endif
--- a/include/boost/checked_delete.hpp
+++ b/include/boost/checked_delete.hpp
@@ -10,15 +10,13 @@
 //
 //  boost/checked_delete.hpp
 //
 //  Copyright (c) 1999, 2000, 2001, 2002 boost.org
 //  Copyright (c) 2002, 2003 Peter Dimov
 //  Copyright (c) 2003 Daniel Frey
 //  Copyright (c) 2003 Howard Hinnant
 //
-//  Permission to copy, use, modify, sell and distribute this software
+//  Distributed under the Boost Software License, Version 1.0. (See
-//  is granted provided this copyright notice appears in all copies.
+//  accompanying file LICENSE_1_0.txt or copy at
-//  This software is provided "as is" without express or implied
+//  http://www.boost.org/LICENSE_1_0.txt)
 //  warranty, and with no claim as to its suitability for any purpose.
 //
 //  See http://www.boost.org/libs/utility/checked_delete.html for documentation.
 //
--- a/include/boost/current_function.hpp
+++ b/include/boost/current_function.hpp
@@ -12,10 +12,9 @@
 //
 //  Copyright (c) 2002 Peter Dimov and Multi Media Ltd.
 //
-//  Permission to copy, use, modify, sell and distribute this software
+// Distributed under the Boost Software License, Version 1.0. (See
-//  is granted provided this copyright notice appears in all copies.
+// accompanying file LICENSE_1_0.txt or copy at
-//  This software is provided "as is" without express or implied
+// http://www.boost.org/LICENSE_1_0.txt)
 //  warranty, and with no claim as to its suitability for any purpose.
 //
 //  http://www.boost.org/libs/utility/current_function.html
 //
--- a/include/boost/detail/call_traits.hpp
+++ b/include/boost/detail/call_traits.hpp
@@ -25,6 +25,7 @@
 #include <boost/type_traits/is_arithmetic.hpp>
 #include <boost/type_traits/is_pointer.hpp>
 #include <boost/detail/workaround.hpp>
 namespace boost{
@@ -91,7 +92,7 @@ struct call_traits<T&>
   typedef T& param_type;  // hh removed const
 };
-#if defined(__BORLANDC__) && (__BORLANDC__ <= 0x560)
+#if BOOST_WORKAROUND( __BORLANDC__,  BOOST_TESTED_AT( 0x570 ) )
 // these are illegal specialisations; cv-qualifies applied to
 // references have no effect according to [8.3.2p1],
 // C++ Builder requires them though as it treats cv-qualified
--- a/include/boost/detail/compressed_pair.hpp
+++ b/include/boost/detail/compressed_pair.hpp
@@ -132,7 +132,7 @@ namespace details
   template <class T1, class T2>
   class compressed_pair_imp<T1, T2, 1>
-      : private T1
+      : private ::boost::remove_cv<T1>::type
   {
   public:
      typedef T1                                                 first_type;
@@ -174,7 +174,7 @@ namespace details
   template <class T1, class T2>
   class compressed_pair_imp<T1, T2, 2>
-      : private T2
+      : private ::boost::remove_cv<T2>::type
   {
   public:
      typedef T1                                                 first_type;
@@ -217,8 +217,8 @@ namespace details
   template <class T1, class T2>
   class compressed_pair_imp<T1, T2, 3>
-      : private T1,
+      : private ::boost::remove_cv<T1>::type,
-        private T2
+        private ::boost::remove_cv<T2>::type
   {
   public:
      typedef T1                                                 first_type;
@@ -257,7 +257,7 @@ namespace details
   //      but reuses T1 base class for both first() and second().
   template <class T1, class T2>
   class compressed_pair_imp<T1, T2, 4>
-      : private T1
+      : private ::boost::remove_cv<T1>::type
   {
   public:
      typedef T1                                                 first_type;
@@ -430,5 +430,3 @@ swap(compressed_pair<T1, T2>& x, compressed_pair<T1, T2>& y)
 #endif // BOOST_DETAIL_COMPRESSED_PAIR_HPP
--- a/include/boost/generator_iterator.hpp
+++ b/include/boost/generator_iterator.hpp
@@ -1,8 +1,7 @@
-// (C) Copyright Jens Maurer 2001. Permission to copy, use,
+// (C) Copyright Jens Maurer 2001.
-// modify, sell and distribute this software is granted provided this
+// Distributed under the Boost Software License, Version 1.0. (See
-// copyright notice appears in all copies. This software is provided
+// accompanying file LICENSE_1_0.txt or copy at
-// "as is" without express or implied warranty, and with no claim as
+// http://www.boost.org/LICENSE_1_0.txt)
 // to its suitability for any purpose.
 //
 // Revision History:
--- a/include/boost/next_prior.hpp
+++ b/include/boost/next_prior.hpp
@@ -1,10 +1,8 @@
 //  Boost next_prior.hpp header file  ---------------------------------------//
-//  (C) Copyright Boost.org 1999-2003. Permission to copy, use, modify, sell
+//  (C) Copyright Dave Abrahams and Daniel Walker 1999-2003. Distributed under the Boost
-//  and distribute this software is granted provided this copyright
+//  Software License, Version 1.0. (See accompanying file
-//  notice appears in all copies. This software is provided "as is" without
+//  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //  express or implied warranty, and with no claim as to its suitability for
 //  any purpose.
 //  See http://www.boost.org/libs/utility for documentation.
--- a/include/boost/noncopyable.hpp
+++ b/include/boost/noncopyable.hpp
@@ -1,10 +1,8 @@
 //  Boost noncopyable.hpp header file  --------------------------------------//
-//  (C) Copyright Boost.org 1999-2003. Permission to copy, use, modify, sell
+//  (C) Copyright Beman Dawes 1999-2003. Distributed under the Boost
-//  and distribute this software is granted provided this copyright
+//  Software License, Version 1.0. (See accompanying file
-//  notice appears in all copies. This software is provided "as is" without
+//  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //  express or implied warranty, and with no claim as to its suitability for
 //  any purpose.
 //  See http://www.boost.org/libs/utility for documentation.
@@ -18,15 +16,20 @@ namespace boost {
 //  Contributed by Dave Abrahams
-class noncopyable
+namespace noncopyable_  // protection from unintended ADL
 {
- protected:
+  class noncopyable
-    noncopyable() {}
+  {
-    ~noncopyable() {}
+   protected:
- private:  // emphasize the following members are private
+      noncopyable() {}
-    noncopyable( const noncopyable& );
+      ~noncopyable() {}
-    const noncopyable& operator=( const noncopyable& );
+   private:  // emphasize the following members are private
-};
+      noncopyable( const noncopyable& );
      const noncopyable& operator=( const noncopyable& );
  };
 }
 typedef noncopyable_::noncopyable noncopyable;
 } // namespace boost
--- a/include/boost/operators.hpp
+++ b/include/boost/operators.hpp
@@ -1,10 +1,9 @@
 //  Boost operators.hpp header file  ----------------------------------------//
-//  (C) Copyright David Abrahams, Jeremy Siek, and Daryle Walker 1999-2001.
+//  (C) Copyright David Abrahams, Jeremy Siek, Daryle Walker 1999-2001.
-//  Permission to copy, use, modify, sell and distribute this software is
+//  Distributed under the Boost Software License, Version 1.0. (See
-//  granted provided this copyright notice appears in all copies.  This
+//  accompanying file LICENSE_1_0.txt or copy at
-//  software is provided "as is" without express or implied warranty, and
+//  http://www.boost.org/LICENSE_1_0.txt)
 //  with no claim as to its suitability for any purpose.
 //  See http://www.boost.org/libs/utility/operators.htm for documentation.
@@ -675,7 +674,7 @@ struct random_access_iteratable
 // Here's where we put it all together, defining the xxxx forms of the templates
 // in namespace boost. We also define specializations of is_chained_base<> for
 // the xxxx, xxxx1, and xxxx2 templates, importing them into boost:: as
-// neccessary.
+// necessary.
 //
 #ifndef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
@@ -700,7 +699,7 @@ template<class T> struct is_chained_base {
 } // namespace boost
-// Import a 4-type-argument operator template into boost (if neccessary) and
+// Import a 4-type-argument operator template into boost (if necessary) and
 // provide a specialization of 'is_chained_base<>' for it.
 # define BOOST_OPERATOR_TEMPLATE4(template_name4)                     \
  BOOST_IMPORT_TEMPLATE4(template_name4)                              \
@@ -709,7 +708,7 @@ template<class T> struct is_chained_base {
    typedef ::boost::detail::true_t value;                            \
  };
-// Import a 3-type-argument operator template into boost (if neccessary) and
+// Import a 3-type-argument operator template into boost (if necessary) and
 // provide a specialization of 'is_chained_base<>' for it.
 # define BOOST_OPERATOR_TEMPLATE3(template_name3)                     \
  BOOST_IMPORT_TEMPLATE3(template_name3)                              \
@@ -718,7 +717,7 @@ template<class T> struct is_chained_base {
    typedef ::boost::detail::true_t value;                            \
  };
-// Import a 2-type-argument operator template into boost (if neccessary) and
+// Import a 2-type-argument operator template into boost (if necessary) and
 // provide a specialization of 'is_chained_base<>' for it.
 # define BOOST_OPERATOR_TEMPLATE2(template_name2)                  \
  BOOST_IMPORT_TEMPLATE2(template_name2)                           \
@@ -727,7 +726,7 @@ template<class T> struct is_chained_base {
    typedef ::boost::detail::true_t value;                         \
  };
-// Import a 1-type-argument operator template into boost (if neccessary) and
+// Import a 1-type-argument operator template into boost (if necessary) and
 // provide a specialization of 'is_chained_base<>' for it.
 # define BOOST_OPERATOR_TEMPLATE1(template_name1)                  \
  BOOST_IMPORT_TEMPLATE1(template_name1)                           \
--- a/include/boost/ref.hpp
+++ b/include/boost/ref.hpp
@@ -18,10 +18,9 @@
 //  Copyright (C) 2001, 2002 Peter Dimov
 //  Copyright (C) 2002 David Abrahams
 //
-//  Permission to copy, use, modify, sell and distribute this software
+// Distributed under the Boost Software License, Version 1.0. (See
-//  is granted provided this copyright notice appears in all copies.
+// accompanying file LICENSE_1_0.txt or copy at
-//  This software is provided "as is" without express or implied
+// http://www.boost.org/LICENSE_1_0.txt)
 //  warranty, and with no claim as to its suitability for any purpose.
 //
 //  See http://www.boost.org/libs/bind/ref.html for documentation.
 //
@@ -74,18 +73,13 @@ template<class T> inline reference_wrapper<T const> BOOST_REF_CONST cref(T const
 # undef BOOST_REF_CONST
 # ifndef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
 template<typename T>
 class is_reference_wrapper
    : public mpl::false_
 {
 };
 template<typename T>
 class is_reference_wrapper<reference_wrapper<T> >
    : public mpl::true_
 {
 };
 template<typename T>
 class unwrap_reference
 {
@@ -93,12 +87,30 @@ class unwrap_reference
    typedef T type;
 };
-template<typename T>
+#  define AUX_REFERENCE_WRAPPER_METAFUNCTIONS_DEF(X) \
-class unwrap_reference<reference_wrapper<T> >
+template<typename T> \
-{
+class is_reference_wrapper< X > \
- public:
+    : public mpl::true_ \
-    typedef T type;
+{ \
-};
+}; \
 \
 template<typename T> \
 class unwrap_reference< X > \
 { \
 public: \
    typedef T type; \
 }; \
 /**/
 AUX_REFERENCE_WRAPPER_METAFUNCTIONS_DEF(reference_wrapper<T>)
 #if !defined(BOOST_NO_CV_SPECIALIZATIONS)
 AUX_REFERENCE_WRAPPER_METAFUNCTIONS_DEF(reference_wrapper<T> const)
 AUX_REFERENCE_WRAPPER_METAFUNCTIONS_DEF(reference_wrapper<T> volatile)
 AUX_REFERENCE_WRAPPER_METAFUNCTIONS_DEF(reference_wrapper<T> const volatile)
 #endif
 #  undef AUX_REFERENCE_WRAPPER_METAFUNCTIONS_DEF
 # else // no partial specialization
 } // namespace boost
--- a/include/boost/utility.hpp
+++ b/include/boost/utility.hpp
@@ -1,6 +1,6 @@
 //  Boost utility.hpp header file  -------------------------------------------//
-//  Copyright 1999-2003 Boost.org.  Use, modification, and distribution are
+//  Copyright 1999-2003 Aleksey Gurtovoy.  Use, modification, and distribution are
 //  subject to the Boost Software License, Version 1.0.  (See accompanying file
 //  LICENSE_1_0.txt or a copy at <http://www.boost.org/LICENSE_1_0.txt>.)
--- a/include/boost/utility/addressof.hpp
+++ b/include/boost/utility/addressof.hpp
@@ -1,15 +1,10 @@
 // Copyright (C) 2002 Brad King (brad.king@kitware.com) 
-//                    Doug Gregor (gregod@cs.rpi.edu)
+//                    Douglas Gregor (gregod@cs.rpi.edu)
 //                    Peter Dimov
 //
-// Permission to copy, use, sell and distribute this software is granted
+// Distributed under the Boost Software License, Version 1.0. (See
-// provided this copyright notice appears in all copies.
+// accompanying file LICENSE_1_0.txt or copy at
-// Permission to modify the code and to distribute modified code is granted
+// http://www.boost.org/LICENSE_1_0.txt)
 // provided this copyright notice appears in all copies, and a notice
 // that the code was modified is included with the copyright notice.
 //
 // This software is provided "as is" without express or implied warranty,
 // and with no claim as to its suitability for any purpose.
 // For more information, see http://www.boost.org
@@ -18,9 +13,6 @@
 # include <boost/config.hpp>
 # include <boost/detail/workaround.hpp>
 # if BOOST_WORKAROUND(BOOST_MSVC, == 1300)
 #  include <boost/type_traits/add_pointer.hpp>
 # endif
 namespace boost {
@@ -28,7 +20,14 @@ namespace boost {
 // VC7 strips const from nested classes unless we add indirection here
 # if BOOST_WORKAROUND(BOOST_MSVC, == 1300)
-template <typename T> typename add_pointer<T>::type
+
 template<class T> struct _addp
 {
    typedef T * type;
 };
 template <typename T> typename _addp<T>::type
 # else
 template <typename T> T*
 # endif
@@ -38,6 +37,22 @@ addressof(T& v)
       &const_cast<char&>(reinterpret_cast<const volatile char &>(v)));
 }
 // Borland doesn't like casting an array reference to a char reference
 // but these overloads work around the problem.
 # if BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))
 template<typename T,std::size_t N>
 T (*addressof(T (&t)[N]))[N]
 {
   return reinterpret_cast<T(*)[N]>(&t);
 }
 template<typename T,std::size_t N>
 const T (*addressof(const T (&t)[N]))[N]
 {
   return reinterpret_cast<const T(*)[N]>(&t);
 }
 # endif
 }
 #endif // BOOST_UTILITY_ADDRESSOF_HPP
--- a/include/boost/utility/base_from_member.hpp
+++ b/include/boost/utility/base_from_member.hpp
@@ -1,15 +1,53 @@
 //  boost utility/base_from_member.hpp header file  --------------------------//
-//  Copyright 2001, 2003 Daryle Walker.  Use, modification, and distribution are
+//  Copyright 2001, 2003, 2004 Daryle Walker.  Use, modification, and
-//  subject to the Boost Software License, Version 1.0.  (See accompanying file
+//  distribution are subject to the Boost Software License, Version 1.0.  (See
-//  LICENSE_1_0.txt or a copy at <http://www.boost.org/LICENSE_1_0.txt>.)
+//  accompanying file LICENSE_1_0.txt or a copy at
 //  <http://www.boost.org/LICENSE_1_0.txt>.)
 //  See <http://www.boost.org/libs/utility/> for the library's home page.
 #ifndef BOOST_UTILITY_BASE_FROM_MEMBER_HPP
 #define BOOST_UTILITY_BASE_FROM_MEMBER_HPP
-#include <boost/utility_fwd.hpp>  // required for parameter defaults
+#include <boost/preprocessor/arithmetic/inc.hpp>
 #include <boost/preprocessor/repetition/enum_binary_params.hpp>
 #include <boost/preprocessor/repetition/enum_params.hpp>
 #include <boost/preprocessor/repetition/repeat_from_to.hpp>
 //  Base-from-member arity configuration macro  ------------------------------//
 // The following macro determines how many arguments will be in the largest
 // constructor template of base_from_member.  Constructor templates will be
 // generated from one argument to this maximum.  Code from other files can read
 // this number if they need to always match the exact maximum base_from_member
 // uses.  The maximum constructor length can be changed by overriding the
 // #defined constant.  Make sure to apply the override, if any, for all source
 // files during project compiling for consistency.
 // Contributed by Jonathan Turkanis
 #ifndef BOOST_BASE_FROM_MEMBER_MAX_ARITY
 #define BOOST_BASE_FROM_MEMBER_MAX_ARITY  10
 #endif
 //  An iteration of a constructor template for base_from_member  -------------//
 // A macro that should expand to:
 //     template < typename T1, ..., typename Tn >
 //     base_from_member( T1 x1, ..., Tn xn )
 //         : member( x1, ..., xn )
 //         {}
 // This macro should only persist within this file.
 #define BOOST_PRIVATE_CTR_DEF( z, n, data )                            \
    template < BOOST_PP_ENUM_PARAMS(n, typename T) >                   \
    explicit base_from_member( BOOST_PP_ENUM_BINARY_PARAMS(n, T, x) )  \
        : member( BOOST_PP_ENUM_PARAMS(n, x) )                         \
        {}                                                             \
    /**/
 namespace boost
@@ -24,7 +62,7 @@ namespace boost
 // Contributed by Daryle Walker
-template < typename MemberType, int UniqueID >
+template < typename MemberType, int UniqueID = 0 >
 class base_from_member
 {
 protected:
@@ -34,66 +72,16 @@ protected:
        : member()
        {}
-    template< typename T1 >
+    BOOST_PP_REPEAT_FROM_TO( 1, BOOST_PP_INC(BOOST_BASE_FROM_MEMBER_MAX_ARITY),
-    explicit base_from_member( T1 x1 )
+     BOOST_PRIVATE_CTR_DEF, _ )
        : member( x1 )
        {}
    template< typename T1, typename T2 >
    base_from_member( T1 x1, T2 x2 )
        : member( x1, x2 )
        {}
    template< typename T1, typename T2, typename T3 >
    base_from_member( T1 x1, T2 x2, T3 x3 )
        : member( x1, x2, x3 ) 
        {}
    template< typename T1, typename T2, typename T3, typename T4 >
    base_from_member( T1 x1, T2 x2, T3 x3, T4 x4 )
        : member( x1, x2, x3, x4 ) 
        {}
    template< typename T1, typename T2, typename T3, typename T4, typename T5 >
    base_from_member( T1 x1, T2 x2, T3 x3, T4 x4, T5 x5 )
        : member( x1, x2, x3, x4, x5 ) 
        {}
    template< typename T1, typename T2, typename T3, typename T4, typename T5,
     typename T6 >
    base_from_member( T1 x1, T2 x2, T3 x3, T4 x4, T5 x5, T6 x6 )
        : member( x1, x2, x3, x4, x5, x6 ) 
        {}
    template< typename T1, typename T2, typename T3, typename T4, typename T5,
     typename T6, typename T7 >
    base_from_member( T1 x1, T2 x2, T3 x3, T4 x4, T5 x5, T6 x6, T7 x7 )
        : member( x1, x2, x3, x4, x5, x6, x7 ) 
        {}
    template< typename T1, typename T2, typename T3, typename T4, typename T5,
     typename T6, typename T7, typename T8 >
    base_from_member( T1 x1, T2 x2, T3 x3, T4 x4, T5 x5, T6 x6, T7 x7, T8 x8 )
        : member( x1, x2, x3, x4, x5, x6, x7, x8 ) 
        {}
    template< typename T1, typename T2, typename T3, typename T4, typename T5,
     typename T6, typename T7, typename T8, typename T9 >
    base_from_member( T1 x1, T2 x2, T3 x3, T4 x4, T5 x5, T6 x6, T7 x7, T8 x8,
     T9 x9 )
        : member( x1, x2, x3, x4, x5, x6, x7, x8, x9 ) 
        {}
    template< typename T1, typename T2, typename T3, typename T4, typename T5,
     typename T6, typename T7, typename T8, typename T9, typename T10 >
    base_from_member( T1 x1, T2 x2, T3 x3, T4 x4, T5 x5, T6 x6, T7 x7, T8 x8,
     T9 x9, T10 x10 )
        : member( x1, x2, x3, x4, x5, x6, x7, x8, x9, x10 ) 
        {}
 };  // boost::base_from_member
 }  // namespace boost
 // Undo any private macros
 #undef BOOST_PRIVATE_CTR_DEF
 #endif  // BOOST_UTILITY_BASE_FROM_MEMBER_HPP
--- a/include/boost/utility/detail/in_place_factory_prefix.hpp
+++ b/include/boost/utility/detail/in_place_factory_prefix.hpp
@@ -0,0 +1,33 @@
 // Copyright (C) 2003, Fernando Luis Cacciola Carballal.
 //
 // Use, modification, and distribution is subject to the Boost Software
 // License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
 // http://www.boost.org/LICENSE_1_0.txt)
 //
 // See http://www.boost.org/lib/optional for documentation.
 //
 // You are welcome to contact the author at:
 //  fernando_cacciola@hotmail.com
 //
 #ifndef BOOST_UTILITY_DETAIL_INPLACE_FACTORY_PREFIX_25AGO2003_HPP
 #define BOOST_UTILITY_DETAIL_INPLACE_FACTORY_PREFIX_25AGO2003_HPP
 #include <boost/config.hpp>
 #include <boost/preprocessor/repetition/enum.hpp>
 #include <boost/preprocessor/repetition/enum_params.hpp>
 #include <boost/preprocessor/repetition/enum_binary_params.hpp>
 #include <boost/preprocessor/cat.hpp>
 #include <boost/preprocessor/arithmetic/inc.hpp>
 #include <boost/preprocessor/punctuation/paren.hpp>
 #include <boost/preprocessor/facilities/empty.hpp>
 #define BOOST_DEFINE_INPLACE_FACTORY_CLASS_MEMBER_INIT(z,n,_) BOOST_PP_CAT(m_a,n) BOOST_PP_LPAREN() BOOST_PP_CAT(a,n) BOOST_PP_RPAREN()
 #define BOOST_DEFINE_INPLACE_FACTORY_CLASS_MEMBER_DECL(z,n,_) BOOST_PP_CAT(A,n) const& BOOST_PP_CAT(m_a,n);
 #define BOOST_DEFINE_INPLACE_FACTORY_CLASS_MEMBER_ARG(z,n,_)  BOOST_PP_CAT(m_a,n)
 #define BOOST_MAX_INPLACE_FACTORY_ARITY 10
 #undef BOOST_UTILITY_DETAIL_INPLACE_FACTORY_SUFFIX_25AGO2003_HPP
 #endif
--- a/include/boost/utility/detail/in_place_factory_suffix.hpp
+++ b/include/boost/utility/detail/in_place_factory_suffix.hpp
@@ -0,0 +1,23 @@
 // Copyright (C) 2003, Fernando Luis Cacciola Carballal.
 //
 // Use, modification, and distribution is subject to the Boost Software
 // License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
 // http://www.boost.org/LICENSE_1_0.txt)
 //
 // See http://www.boost.org/lib/optional for documentation.
 //
 // You are welcome to contact the author at:
 //  fernando_cacciola@hotmail.com
 //
 #ifndef BOOST_UTILITY_DETAIL_INPLACE_FACTORY_SUFFIX_25AGO2003_HPP
 #define BOOST_UTILITY_DETAIL_INPLACE_FACTORY_SUFFIX_25AGO2003_HPP
 #undef BOOST_DEFINE_INPLACE_FACTORY_CLASS_MEMBER_INIT
 #undef BOOST_DEFINE_INPLACE_FACTORY_CLASS_MEMBER_DECL
 #undef BOOST_DEFINE_INPLACE_FACTORY_CLASS_MEMBER_ARG
 #undef BOOST_MAX_INPLACE_FACTORY_ARITY
 #undef BOOST_UTILITY_DETAIL_INPLACE_FACTORY_PREFIX_25AGO2003_HPP
 #endif
--- a/include/boost/utility/detail/result_of_iterate.hpp
+++ b/include/boost/utility/detail/result_of_iterate.hpp
@@ -1,3 +1,11 @@
 // Boost result_of library
 //  Copyright Douglas Gregor 2004. Use, modification and
 //  distribution is subject to the Boost Software License, Version
 //  1.0. (See accompanying file LICENSE_1_0.txt or copy at
 //  http://www.boost.org/LICENSE_1_0.txt)
 // For more information, see http://www.boost.org/libs/utility
 #if !defined(BOOST_PP_IS_ITERATING)
 # error Boost result_of - do not include this file!
 #endif
--- a/include/boost/utility/in_place_factory.hpp
+++ b/include/boost/utility/in_place_factory.hpp
@@ -0,0 +1,58 @@
 // Copyright (C) 2003, Fernando Luis Cacciola Carballal.
 //
 // Use, modification, and distribution is subject to the Boost Software
 // License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
 // http://www.boost.org/LICENSE_1_0.txt)
 //
 // See http://www.boost.org/lib/optional for documentation.
 //
 // You are welcome to contact the author at:
 //  fernando_cacciola@hotmail.com
 //
 #ifndef BOOST_UTILITY_INPLACE_FACTORY_25AGO2003_HPP
 #define BOOST_UTILITY_INPLACE_FACTORY_25AGO2003_HPP
 #include <boost/utility/detail/in_place_factory_prefix.hpp>
 #include <boost/type.hpp>
 namespace boost {
 class in_place_factory_base {} ;
 #define BOOST_DEFINE_INPLACE_FACTORY_CLASS(z,n,_) \
 template< BOOST_PP_ENUM_PARAMS(BOOST_PP_INC(n),class A) > \
 class BOOST_PP_CAT(in_place_factory, BOOST_PP_INC(n) ) : public in_place_factory_base \
 { \
 public: \
 \
  BOOST_PP_CAT(in_place_factory, BOOST_PP_INC(n) ) ( BOOST_PP_ENUM_BINARY_PARAMS(BOOST_PP_INC(n),A,const& a) ) \
    : \
    BOOST_PP_ENUM( BOOST_PP_INC(n), BOOST_DEFINE_INPLACE_FACTORY_CLASS_MEMBER_INIT, _ ) \
  {} \
 \
  template<class T> \
  void apply ( void* address BOOST_APPEND_EXPLICIT_TEMPLATE_TYPE(T) ) const \
  { \
    new ( address ) T ( BOOST_PP_ENUM_PARAMS( BOOST_PP_INC(n), m_a ) ) ; \
  } \
 \
  BOOST_PP_REPEAT( BOOST_PP_INC(n), BOOST_DEFINE_INPLACE_FACTORY_CLASS_MEMBER_DECL, _) \
 } ; \
 \
 template< BOOST_PP_ENUM_PARAMS(BOOST_PP_INC(n),class A) > \
 BOOST_PP_CAT(in_place_factory, BOOST_PP_INC(n) ) < BOOST_PP_ENUM_PARAMS( BOOST_PP_INC(n), A ) > \
 in_place ( BOOST_PP_ENUM_BINARY_PARAMS(BOOST_PP_INC(n),A, const& a) ) \
 { \
  return BOOST_PP_CAT(in_place_factory, BOOST_PP_INC(n) ) < BOOST_PP_ENUM_PARAMS( BOOST_PP_INC(n), A ) > \
           ( BOOST_PP_ENUM_PARAMS( BOOST_PP_INC(n), a ) ) ; \
 } ; \
 BOOST_PP_REPEAT( BOOST_MAX_INPLACE_FACTORY_ARITY, BOOST_DEFINE_INPLACE_FACTORY_CLASS, BOOST_PP_EMPTY() )
 } // namespace boost
 #include <boost/utility/detail/in_place_factory_suffix.hpp>
 #endif
--- a/include/boost/utility/result_of.hpp
+++ b/include/boost/utility/result_of.hpp
@@ -1,6 +1,6 @@
 // Boost result_of library
-//  Copyright Doug Gregor 2004. Use, modification and
+//  Copyright Douglas Gregor 2004. Use, modification and
 //  distribution is subject to the Boost Software License, Version
 //  1.0. (See accompanying file LICENSE_1_0.txt or copy at
 //  http://www.boost.org/LICENSE_1_0.txt)
@@ -14,7 +14,7 @@
 #include <boost/type.hpp>
 #include <boost/preprocessor.hpp>
 #include <boost/detail/workaround.hpp>
-#include <boost/mpl/aux_/has_xxx.hpp>
+#include <boost/mpl/has_xxx.hpp>
 #ifndef BOOST_RESULT_OF_NUM_ARGS
 #  define BOOST_RESULT_OF_NUM_ARGS 10
@@ -57,9 +57,10 @@ struct result_of : get_result_of<F, FArgs, (has_result_type<F>::value)> {};
 #define BOOST_PP_ITERATION_PARAMS_1 (3,(0,BOOST_RESULT_OF_NUM_ARGS,<boost/utility/detail/result_of_iterate.hpp>))
 #include BOOST_PP_ITERATE()
 }
 #else
-#  error Your compiler cannot support class template result_of
+#  define BOOST_NO_RESULT_OF 1
 #endif
 }
 #endif // BOOST_RESULT_OF_HPP
--- a/include/boost/utility/typed_in_place_factory.hpp
+++ b/include/boost/utility/typed_in_place_factory.hpp
@@ -0,0 +1,57 @@
 // Copyright (C) 2003, Fernando Luis Cacciola Carballal.
 //
 // Use, modification, and distribution is subject to the Boost Software
 // License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
 // http://www.boost.org/LICENSE_1_0.txt)
 //
 // See http://www.boost.org/lib/optional for documentation.
 //
 // You are welcome to contact the author at:
 //  fernando_cacciola@hotmail.com
 //
 #ifndef BOOST_UTILITY_TYPED_INPLACE_FACTORY_25AGO2003_HPP
 #define BOOST_UTILITY_TYPED_INPLACE_FACTORY_25AGO2003_HPP
 #include <boost/utility/detail/in_place_factory_prefix.hpp>
 namespace boost {
 class typed_in_place_factory_base {} ;
 #define BOOST_DEFINE_TYPED_INPLACE_FACTORY_CLASS(z,n,_) \
 template< class T, BOOST_PP_ENUM_PARAMS(BOOST_PP_INC(n),class A) > \
 class BOOST_PP_CAT(typed_in_place_factory, BOOST_PP_INC(n) ) : public typed_in_place_factory_base \
 { \
 public: \
 \
  typedef T value_type ; \
 \
  BOOST_PP_CAT(typed_in_place_factory, BOOST_PP_INC(n) ) ( BOOST_PP_ENUM_BINARY_PARAMS(BOOST_PP_INC(n),A,const& a) ) \
    : \
    BOOST_PP_ENUM( BOOST_PP_INC(n), BOOST_DEFINE_INPLACE_FACTORY_CLASS_MEMBER_INIT, _ ) \
  {} \
 \
  void apply ( void* address ) const \
  { \
    new ( address ) T ( BOOST_PP_ENUM_PARAMS( BOOST_PP_INC(n), m_a ) ) ; \
  } \
 \
  BOOST_PP_REPEAT( BOOST_PP_INC(n), BOOST_DEFINE_INPLACE_FACTORY_CLASS_MEMBER_DECL, _) \
 } ; \
 \
 template< class T, BOOST_PP_ENUM_PARAMS(BOOST_PP_INC(n),class A) > \
 BOOST_PP_CAT(typed_in_place_factory, BOOST_PP_INC(n) ) < T , BOOST_PP_ENUM_PARAMS( BOOST_PP_INC(n), A ) > \
 in_place ( BOOST_PP_ENUM_BINARY_PARAMS(BOOST_PP_INC(n),A, const& a) ) \
 { \
  return BOOST_PP_CAT(typed_in_place_factory, BOOST_PP_INC(n) ) < T, BOOST_PP_ENUM_PARAMS( BOOST_PP_INC(n), A ) > \
           ( BOOST_PP_ENUM_PARAMS( BOOST_PP_INC(n), a ) ) ; \
 } ; \
 BOOST_PP_REPEAT( BOOST_MAX_INPLACE_FACTORY_ARITY, BOOST_DEFINE_TYPED_INPLACE_FACTORY_CLASS, BOOST_PP_EMPTY() )
 } // namespace boost
 #include <boost/utility/detail/in_place_factory_suffix.hpp>
 #endif
--- a/include/boost/utility/value_init.hpp
+++ b/include/boost/utility/value_init.hpp
@@ -1,13 +1,8 @@
 // (C) 2002, Fernando Luis Cacciola Carballal.
 //
-// This material is provided "as is", with absolutely no warranty expressed
+// Distributed under the Boost Software License, Version 1.0. (See
-// or implied. Any use is at your own risk.
+// accompanying file LICENSE_1_0.txt or copy at
-//
+// http://www.boost.org/LICENSE_1_0.txt)
 // Permission to use or copy this software for any purpose is hereby granted
 // without fee, provided the above notices are retained on all copies.
 // Permission to modify the code and to distribute modified code is granted,
 // provided the above notices are retained, and a notice that the code was
 // modified is included with the above copyright notice.
 //
 // 21 Ago 2002 (Created) Fernando Cacciola
 //
--- a/include/boost/utility_fwd.hpp
+++ b/include/boost/utility_fwd.hpp
@@ -1,33 +0,0 @@
 //  Boost utility_fwd.hpp header file  ---------------------------------------//
 //  Copyright 2001, 2003 Boost.org.  Use, modification, and distribution are
 //  subject to the Boost Software License, Version 1.0.  (See accompanying file
 //  LICENSE_1_0.txt or a copy at <http://www.boost.org/LICENSE_1_0.txt>.)
 //  See <http://www.boost.org/libs/utility/> for the library's home page.
 #ifndef BOOST_UTILITY_FWD_HPP
 #define BOOST_UTILITY_FWD_HPP
 namespace boost
 {
 //  From <boost/utility/base_from_member.hpp>  -------------------------------//
 template < typename MemberType, int UniqueID = 0 >
    class base_from_member;
 //  From <boost/noncopyable.hpp>  --------------------------------------------//
 class noncopyable;
 // Also has a few function templates
 }  // namespace boost
 #endif  // BOOST_UTILITY_FWD_HPP
--- a/index.html
+++ b/index.html
@@ -7,7 +7,7 @@
 		<title>Boost Utility Library</title>
 	</head>
 	<body bgcolor="#FFFFFF">
-		<h1><IMG SRC="../../c++boost.gif" WIDTH="276" HEIGHT="86" align="center">Boost 
+		<h1><IMG SRC="../../boost.png" WIDTH="276" HEIGHT="86" align="center">Boost 
 			Utility Library</h1>
 		<p>The Boost Utility Library isn't really a single library at all. It is just a 
 			collection for components too small to be called libraries in their own right.</p>
--- a/indirect_iterator_example.cpp
+++ b/indirect_iterator_example.cpp
@@ -1,59 +0,0 @@
 // (C) Copyright Jeremy Siek 2000. Permission to copy, use, modify, sell and
 // distribute this software is granted provided this copyright notice appears
 // in all copies. This software is provided "as is" without express or implied
 // warranty, and with no claim as to its suitability for any purpose.
 #include <boost/config.hpp>
 #include <vector>
 #include <iostream>
 #include <iterator>
 #include <functional>
 #include <algorithm>
 #include <boost/iterator/indirect_iterator.hpp>
 int main(int, char*[])
 {
  char characters[] = "abcdefg";
  const int N = sizeof(characters)/sizeof(char) - 1; // -1 since characters has a null char
  char* pointers_to_chars[N];                        // at the end.
  for (int i = 0; i < N; ++i)
    pointers_to_chars[i] = &characters[i];
  // Example of using indirect_iterator_generator
  boost::indirect_iterator<char**, char>
    indirect_first(pointers_to_chars), indirect_last(pointers_to_chars + N);
  std::copy(indirect_first, indirect_last, std::ostream_iterator<char>(std::cout, ","));
  std::cout << std::endl;
  // Example of using indirect_iterator_pair_generator
  char mutable_characters[N];
  char* pointers_to_mutable_chars[N];
  for (int j = 0; j < N; ++j)
    pointers_to_mutable_chars[j] = &mutable_characters[j];
  boost::indirect_iterator<char* const*> mutable_indirect_first(pointers_to_mutable_chars),
    mutable_indirect_last(pointers_to_mutable_chars + N);
  boost::indirect_iterator<char* const*, char const> const_indirect_first(pointers_to_chars),
    const_indirect_last(pointers_to_chars + N);
  std::transform(const_indirect_first, const_indirect_last,
                 mutable_indirect_first, std::bind1st(std::plus<char>(), 1));
  std::copy(mutable_indirect_first, mutable_indirect_last,
            std::ostream_iterator<char>(std::cout, ","));
  std::cout << std::endl;
  // Example of using make_indirect_iterator()
  std::copy(boost::make_indirect_iterator(pointers_to_chars), 
            boost::make_indirect_iterator(pointers_to_chars + N),
            std::ostream_iterator<char>(std::cout, ","));
  std::cout << std::endl;
  return 0;
 }
--- a/iterator_adaptor_examples.cpp
+++ b/iterator_adaptor_examples.cpp
@@ -1,46 +0,0 @@
 // (C) Copyright Jeremy Siek 2000. Permission to copy, use, modify, sell and
 // distribute this software is granted provided this copyright notice appears
 // in all copies. This software is provided "as is" without express or implied
 // warranty, and with no claim as to its suitability for any purpose.
 #include <functional>
 #include <algorithm>
 #include <iostream>
 #include <boost/iterator/transform_iterator.hpp>
 #include <boost/pending/integer_range.hpp>
 int
 main(int, char*[])
 {
  // This is a simple example of using the transform_iterators class to
  // generate iterators that multiply the value returned by dereferencing
  // the iterator. In this case we are multiplying by 2.
  // Would be cooler to use lambda library in this example.
  int x[] = { 1, 2, 3, 4, 5, 6, 7, 8 };
  typedef std::binder1st< std::multiplies<int> > Function;
  typedef boost::transform_iterator<Function, int*> doubling_iterator;
  doubling_iterator i(x, std::bind1st(std::multiplies<int>(), 2)),
    i_end(x + sizeof(x)/sizeof(int), std::bind1st(std::multiplies<int>(), 2));
  std::cout << "multiplying the array by 2:" << std::endl;
  while (i != i_end)
    std::cout << *i++ << " ";
  std::cout << std::endl;
  // Here is an example of counting from 0 to 5 using the integer_range class.
  boost::integer_range<int> r(0,5);
  std::cout << "counting to from 0 to 4:" << std::endl;
  std::copy(r.begin(), r.end(), std::ostream_iterator<int>(std::cout, " "));
  std::cout << std::endl;
  return 0;
 }
--- a/iterator_adaptors.htm
+++ b/iterator_adaptors.htm
@@ -0,0 +1,11 @@
 <!-- Copyright David Abrahams 2004. Distributed under the Boost -->
 <!-- Software License, Version 1.0. (See accompanying -->
 <!-- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -->
 <html>
 <head>
 <meta http-equiv="refresh" content="0; URL=../iterator/doc/index.html">
 </head>
 <body>
 This documentation moved to <a href="../iterator/doc/index.html">../iterator/doc/index.html</a>.
 </body>
 </html>
--- a/iterator_traits_test.cpp
+++ b/iterator_traits_test.cpp
@@ -1,215 +0,0 @@
 //  (C) Copyright David Abrahams 2002. Permission to copy, use, modify,
 //  sell and distribute this software is granted provided this
 //  copyright notice appears in all copies. This software is provided
 //  "as is" without express or implied warranty, and with no claim as
 //  to its suitability for any purpose.
 //  See http://www.boost.org for most recent version including documentation.
 //  Revision History
 //  04 Mar 2001 Patches for Intel C++ (Dave Abrahams)
 //  19 Feb 2001 Take advantage of improved iterator_traits to do more tests
 //              on MSVC. Reordered some #ifdefs for coherency.
 //              (David Abrahams)
 //  13 Feb 2001 Test new VC6 workarounds (David Abrahams)
 //  11 Feb 2001 Final fixes for Borland (David Abrahams)
 //  11 Feb 2001 Some fixes for Borland get it closer on that compiler
 //              (David Abrahams)
 //  07 Feb 2001 More comprehensive testing; factored out static tests for
 //              better reuse (David Abrahams)
 //  21 Jan 2001 Quick fix to my_iterator, which wasn't returning a
 //              reference type from operator* (David Abrahams)
 //  19 Jan 2001 Initial version with iterator operators (David Abrahams)
 #include <boost/detail/iterator.hpp>
 #include <boost/type_traits/is_same.hpp>
 #include <boost/operators.hpp>
 #include <boost/static_assert.hpp>
 #include <iterator>
 #include <vector>
 #include <list>
 #include <cassert>
 #include <iostream>
 // A UDT for which we can specialize std::iterator_traits<element*> on
 // compilers which don't support partial specialization. There's no
 // other reasonable way to test pointers on those compilers.
 struct element {};
 // An iterator for which we can get traits.
 struct my_iterator1
    : boost::forward_iterator_helper<my_iterator1, char, long, const char*, const char&>
 {
    my_iterator1(const char* p) : m_p(p) {}
    bool operator==(const my_iterator1& rhs) const
        { return this->m_p == rhs.m_p; }
    my_iterator1& operator++() { ++this->m_p; return *this; }
    const char& operator*() { return *m_p; }
 private:
    const char* m_p;
 };
 // Used to prove that we don't require std::iterator<> in the hierarchy under
 // MSVC6, and that we can compute all the traits for a standard-conforming UDT
 // iterator.
 struct my_iterator2
    : boost::equality_comparable<my_iterator2
    , boost::incrementable<my_iterator2
    , boost::dereferenceable<my_iterator2,const char*> > >
 {
    typedef char value_type;
    typedef long difference_type;
    typedef const char* pointer;
    typedef const char& reference;
    typedef std::forward_iterator_tag iterator_category;
    my_iterator2(const char* p) : m_p(p) {}
    bool operator==(const my_iterator2& rhs) const
        { return this->m_p == rhs.m_p; }
    my_iterator2& operator++() { ++this->m_p; return *this; }
    const char& operator*() { return *m_p; }
 private:
    const char* m_p;
 };
 // Used to prove that we're not overly confused by the existence of
 // std::iterator<> in the hierarchy under MSVC6 - we should find that
 // boost::detail::iterator_traits<my_iterator3>::difference_type is int.
 struct my_iterator3 : my_iterator1
 {
    typedef int difference_type;
    my_iterator3(const char* p)
        : my_iterator1(p) {}
 };
 //
 // Assertion tools.  Used instead of BOOST_STATIC_ASSERT because that
 // doesn't give us a nice stack backtrace
 //
 template <bool = false> struct assertion;
 template <> struct assertion<true>
 {
    typedef char type;
 };
 template <class T, class U>
 struct assert_same
    : assertion<(::boost::is_same<T,U>::value)>
 {
 };
 // Iterator tests
 template <class Iterator,
    class value_type, class difference_type, class pointer, class reference, class category>
 struct non_portable_tests
 {
    typedef typename boost::detail::iterator_traits<Iterator>::pointer test_pt;
    typedef typename boost::detail::iterator_traits<Iterator>::reference test_rt;
    typedef typename assert_same<test_pt, pointer>::type a1;
    typedef typename assert_same<test_rt, reference>::type a2;
 };
 template <class Iterator,
    class value_type, class difference_type, class pointer, class reference, class category>
 struct portable_tests
 {
    typedef typename boost::detail::iterator_traits<Iterator>::difference_type test_dt;
    typedef typename boost::detail::iterator_traits<Iterator>::iterator_category test_cat;
    typedef typename assert_same<test_dt, difference_type>::type a1;
    typedef typename assert_same<test_cat, category>::type a2;
 };
 // Test iterator_traits
 template <class Iterator,
    class value_type, class difference_type, class pointer, class reference, class category>
 struct input_iterator_test
    : portable_tests<Iterator,value_type,difference_type,pointer,reference,category>
 {
    typedef typename boost::detail::iterator_traits<Iterator>::value_type test_vt;
    typedef typename assert_same<test_vt, value_type>::type a1;
 };
 template <class Iterator,
    class value_type, class difference_type, class pointer, class reference, class category>
 struct non_pointer_test
    : input_iterator_test<Iterator,value_type,difference_type,pointer,reference,category>
      , non_portable_tests<Iterator,value_type,difference_type,pointer,reference,category>
 {
 };
 template <class Iterator,
    class value_type, class difference_type, class pointer, class reference, class category>
 struct maybe_pointer_test
    : portable_tests<Iterator,value_type,difference_type,pointer,reference,category>
      , non_portable_tests<Iterator,value_type,difference_type,pointer,reference,category>
 {
 };
 input_iterator_test<std::istream_iterator<int>, int, std::ptrdiff_t, int*, int&, std::input_iterator_tag>
        istream_iterator_test;
 #if defined(__BORLANDC__) && !defined(__SGI_STL_PORT)
 typedef ::std::char_traits<char>::off_type distance;
 non_pointer_test<std::ostream_iterator<int>,int,
    distance,int*,int&,std::output_iterator_tag> ostream_iterator_test;
 #elif defined(BOOST_MSVC_STD_ITERATOR)
 non_pointer_test<std::ostream_iterator<int>,
    int, void, int*, int&, std::output_iterator_tag>
        ostream_iterator_test;
 #else
 non_pointer_test<std::ostream_iterator<int>,
    void, void, void, void, std::output_iterator_tag>
        ostream_iterator_test;
 #endif
 #ifdef __KCC
  typedef long std_list_diff_type;
 #else
  typedef std::ptrdiff_t std_list_diff_type;
 #endif
 non_pointer_test<std::list<int>::iterator, int, std_list_diff_type, int*, int&, std::bidirectional_iterator_tag>
        list_iterator_test;
 maybe_pointer_test<std::vector<int>::iterator, int, std::ptrdiff_t, int*, int&, std::random_access_iterator_tag>
        vector_iterator_test;
 maybe_pointer_test<int*, int, std::ptrdiff_t, int*, int&, std::random_access_iterator_tag>
        int_pointer_test;
 non_pointer_test<my_iterator1, char, long, const char*, const char&, std::forward_iterator_tag>
       my_iterator1_test;
 non_pointer_test<my_iterator2, char, long, const char*, const char&, std::forward_iterator_tag>
       my_iterator2_test;
 non_pointer_test<my_iterator3, char, int, const char*, const char&, std::forward_iterator_tag>
       my_iterator3_test;
 int main()
 {
    char chars[100];
    int ints[100];
    for (int length = 3; length < 100; length += length / 3)
    {
        std::list<int> l(length);
        assert(boost::detail::distance(l.begin(), l.end()) == length);
        std::vector<int> v(length);
        assert(boost::detail::distance(v.begin(), v.end()) == length);
        assert(boost::detail::distance(&ints[0], ints + length) == length);
        assert(boost::detail::distance(my_iterator1(chars), my_iterator1(chars + length)) == length);
        assert(boost::detail::distance(my_iterator2(chars), my_iterator2(chars + length)) == length);
        assert(boost::detail::distance(my_iterator3(chars), my_iterator3(chars + length)) == length);
    }
    return 0;
 }
--- a/iterators_test.cpp
+++ b/iterators_test.cpp
@@ -1,10 +1,9 @@
 //  Demonstrate and test boost/operators.hpp on std::iterators  --------------//
-//  (C) Copyright Jeremy Siek 1999. Permission to copy, use, modify,
+//  (C) Copyright Jeremy Siek 1999.
-//  sell and distribute this software is granted provided this
+// Distributed under the Boost Software License, Version 1.0. (See
-//  copyright notice appears in all copies. This software is provided
+// accompanying file LICENSE_1_0.txt or copy at
-//  "as is" without express or implied warranty, and with no claim as
+// http://www.boost.org/LICENSE_1_0.txt)
 //  to its suitability for any purpose.
 //  See http://www.boost.org for most recent version including documentation.
@@ -175,7 +174,7 @@ test_opr<T, R, P>::post_increment_test
        oss << *i++ << ' ';
    }
-    BOOST_TEST( oss.str() == "apple orange pear peach grape plum ");
+    BOOST_CHECK( oss.str() == "apple orange pear peach grape plum ");
 }
 // Test post-decrement
@@ -194,7 +193,7 @@ test_opr<T, R, P>::post_decrement_test
        oss << *i << ' ';
    }
-    BOOST_TEST( oss.str() == "plum grape peach pear orange apple ");
+    BOOST_CHECK( oss.str() == "plum grape peach pear orange apple ");
 }
 // Test indirect structure referral
@@ -212,7 +211,7 @@ test_opr<T, R, P>::indirect_referral_test
        oss << i->size() << ' ';
    }
-    BOOST_TEST( oss.str() == "5 6 4 5 5 4 ");
+    BOOST_CHECK( oss.str() == "5 6 4 5 5 4 ");
 }
 // Test offset addition
@@ -231,7 +230,7 @@ test_opr<T, R, P>::offset_addition_test
        oss << *i << ' ';
    }
-    BOOST_TEST( oss.str() == "apple pear grape ");
+    BOOST_CHECK( oss.str() == "apple pear grape ");
 }
 // Test offset addition, in reverse order
@@ -250,7 +249,7 @@ test_opr<T, R, P>::reverse_offset_addition_test
        oss << *i << ' ';
    }
-    BOOST_TEST( oss.str() == "apple pear grape ");
+    BOOST_CHECK( oss.str() == "apple pear grape ");
 }
 // Test offset subtraction
@@ -273,7 +272,7 @@ test_opr<T, R, P>::offset_subtraction_test
        }
    }
-    BOOST_TEST( oss.str() == "grape pear apple ");
+    BOOST_CHECK( oss.str() == "grape pear apple ");
 }
 // Test comparisons
@@ -297,10 +296,10 @@ test_opr<T, R, P>::comparison_test
        {
            ptrdiff_t const  j_offset = j - fruit_begin;
-            BOOST_TEST( (i != j) == (i_offset != j_offset) );
+            BOOST_CHECK( (i != j) == (i_offset != j_offset) );
-            BOOST_TEST( (i > j) == (i_offset > j_offset) );
+            BOOST_CHECK( (i > j) == (i_offset > j_offset) );
-            BOOST_TEST( (i <= j) == (i_offset <= j_offset) );
+            BOOST_CHECK( (i <= j) == (i_offset <= j_offset) );
-            BOOST_TEST( (i >= j) == (i_offset >= j_offset) );
+            BOOST_CHECK( (i >= j) == (i_offset >= j_offset) );
        }
    }
    cout << std::endl;
@@ -321,5 +320,5 @@ test_opr<T, R, P>::indexing_test
        oss << fruit_begin[ k ] << ' ';
    }
-    BOOST_TEST( oss.str() == "apple orange pear peach grape plum ");
+    BOOST_CHECK( oss.str() == "apple orange pear peach grape plum ");
 }
--- a/noncopyable_test.cpp
+++ b/noncopyable_test.cpp
@@ -1,10 +1,8 @@
 //  boost class noncopyable test program  ------------------------------------//
-//  (C) Copyright boost.org 1999. Permission to copy, use, modify, sell
+//  (C) Copyright Beman Dawes 1999. Distributed under the Boost
-//  and distribute this software is granted provided this copyright
+//  Software License, Version 1.0. (See accompanying file
-//  notice appears in all copies. This software is provided "as is" without
+//  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //  express or implied warranty, and with no claim as to its suitability for
 //  any purpose.
 //  See http://www.boost.org for most recent version including documentation.
--- a/numeric_traits_test.cpp
+++ b/numeric_traits_test.cpp
@@ -1,8 +1,7 @@
-//  (C) Copyright David Abrahams 2001. Permission to copy, use, modify,
+//  (C) Copyright David Abrahams 2001.
-//  sell and distribute this software is granted provided this
+// Distributed under the Boost Software License, Version 1.0. (See
-//  copyright notice appears in all copies. This software is provided
+// accompanying file LICENSE_1_0.txt or copy at
-//  "as is" without express or implied warranty, and with no claim as
+// http://www.boost.org/LICENSE_1_0.txt)
 //  to its suitability for any purpose.
 //  See http://www.boost.org for most recent version including documentation.
@@ -58,14 +57,22 @@ struct complement
    struct traits
    {
     private:
-        // indirection through complement_traits_aux neccessary to keep MSVC happy
+        // indirection through complement_traits_aux necessary to keep MSVC happy
        typedef complement_traits_aux<Number, size - 1> prev;
     public:
 #if defined(__GNUC__) && __GNUC__ == 4 && __GNUC_MINOR__ == 0 && __GNUC_PATCHLEVEL__ == 2
      // GCC 4.0.2 ICEs on these C-style casts
        BOOST_STATIC_CONSTANT(Number, max =
                            Number((prev::max) << CHAR_BIT)
                            + Number(UCHAR_MAX));
        BOOST_STATIC_CONSTANT(Number, min = Number((prev::min) << CHAR_BIT));
 #else
        BOOST_STATIC_CONSTANT(Number, max =
                            Number(Number(prev::max) << CHAR_BIT)
                            + Number(UCHAR_MAX));
        BOOST_STATIC_CONSTANT(Number, min = Number(Number(prev::min) << CHAR_BIT));
 #endif
    };
 };
@@ -222,10 +229,16 @@ void test_aux(unsigned_tag, Number*)
        (sizeof(Number) < sizeof(boost::intmax_t))
        | (boost::is_same<difference_type, boost::intmax_t>::value));
 #if defined(__GNUC__) && __GNUC__ == 4 && __GNUC_MINOR__ == 0 && __GNUC_PATCHLEVEL__ == 2
    // GCC 4.0.2 ICEs on this C-style cases
    BOOST_STATIC_ASSERT((complement_traits<Number>::max) > Number(0));
    BOOST_STATIC_ASSERT((complement_traits<Number>::min) == Number(0));
 #else
    // Force casting to Number here to work around the fact that it's an enum on MSVC
    BOOST_STATIC_ASSERT(Number(complement_traits<Number>::max) > Number(0));
    BOOST_STATIC_ASSERT(Number(complement_traits<Number>::min) == Number(0));
-    
+#endif
    const Number max = complement_traits<Number>::max;
    const Number min = complement_traits<Number>::min;
@@ -309,10 +322,15 @@ void test_aux(signed_tag, Number*)
        (sizeof(Number) < sizeof(boost::intmax_t))
        | (boost::is_same<difference_type, Number>::value));
 #if defined(__GNUC__) && __GNUC__ == 4 && __GNUC_MINOR__ == 0 && __GNUC_PATCHLEVEL__ == 2
    // GCC 4.0.2 ICEs on this cast
    BOOST_STATIC_ASSERT((complement_traits<Number>::max) > Number(0));
    BOOST_STATIC_ASSERT((complement_traits<Number>::min) < Number(0));
 #else
    // Force casting to Number here to work around the fact that it's an enum on MSVC
    BOOST_STATIC_ASSERT(Number(complement_traits<Number>::max) > Number(0));
    BOOST_STATIC_ASSERT(Number(complement_traits<Number>::min) < Number(0));
-    
+#endif    
    const Number max = complement_traits<Number>::max;
    const Number min = complement_traits<Number>::min;
@@ -375,8 +393,8 @@ int main()
    test<long>();
    test<unsigned long>();
 #if defined(BOOST_HAS_LONG_LONG) && !defined(BOOST_NO_INTEGRAL_INT64_T)
-    test<long long>();
+    test< ::boost::long_long_type>();
-    test<unsigned long long>();
+    test< ::boost::ulong_long_type>();
 #elif defined(BOOST_MSVC)
    // The problem of not having compile-time static class constants other than
    // enums prevents this from working, since values get truncated.
--- a/operators.htm
+++ b/operators.htm
@@ -10,7 +10,7 @@
  </head>
  <body text="black" bgcolor="white" link="blue" vlink="purple" alink="red">
-    <h1><img src="../../c++boost.gif" alt="c++boost.gif (8819 bytes)" align=
+    <h1><img src="../../boost.png" alt="boost.png (6897 bytes)" align=
    "middle" width="277" height="86">Header <cite>&lt;<a href=
    "../../boost/operators.hpp">boost/operators.hpp</a>&gt;</cite></h1>
@@ -1955,7 +1955,7 @@ T operator+( T lhs, const T&amp; rhs )
    output iterator to writing just two member functions - an appropriate
    constructor and a copy-assignment operator. For example, here is a
    possible implementation of <code><a href=
-    "function_output_iterator.htm">boost::function_output_iterator</a></code>
+    "../iterator/doc/function_output_iterator.html">boost::function_output_iterator</a></code>
    adaptor:</p>
 <pre>
 template&lt;class UnaryFunction&gt;
@@ -2119,10 +2119,10 @@ public:
    backward-compatible.</p>
    <hr>
-    <p>Revised: 03 Dec 2003</p>
+    <p>Revised: 29 Oct 2004</p>
    <p>Copyright &copy; Beman Dawes, David Abrahams, 1999-2001.</p>
-    <p>Copyright &copy; Daniel Frey, 2002-2003.</p>
+    <p>Copyright &copy; Daniel Frey, 2002-2004.</p>
    <p>Use, modification, and distribution is subject to the Boost Software 
    License, Version 1.0. (See accompanying file
    <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy at
--- a/operators_test.cpp
+++ b/operators_test.cpp
@@ -1,7 +1,8 @@
 //  Demonstrate and test boost/operators.hpp  -------------------------------//
-//  Copyright Beman Dawes 1999.
+//  Copyright Beman Dawes 1999.  Distributed under the Boost
-//  See accompanying license for terms and conditions of use.
+//  Software License, Version 1.0. (See accompanying file
 //  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 //  See http://www.boost.org/libs/utility for documentation.
@@ -268,17 +269,17 @@ namespace
    template <class X1, class Y1, class X2, class Y2>
    void sanity_check(X1 x1, Y1 y1, X2 x2, Y2 y2)
    {
-        BOOST_TEST( true_value(y1) == true_value(y2) );
+        BOOST_CHECK( true_value(y1) == true_value(y2) );
-        BOOST_TEST( true_value(x1) == true_value(x2) );
+        BOOST_CHECK( true_value(x1) == true_value(x2) );
    }
    template <class X1, class Y1, class X2, class Y2>
    void test_less_than_comparable_aux(X1 x1, Y1 y1, X2 x2, Y2 y2)
    {
-        BOOST_TEST( (x1 < y1) == (x2 < y2) );
+        BOOST_CHECK( (x1 < y1) == (x2 < y2) );
-        BOOST_TEST( (x1 <= y1) == (x2 <= y2) );
+        BOOST_CHECK( (x1 <= y1) == (x2 <= y2) );
-        BOOST_TEST( (x1 >= y1) == (x2 >= y2) );
+        BOOST_CHECK( (x1 >= y1) == (x2 >= y2) );
-        BOOST_TEST( (x1 > y1) == (x2 > y2) );
+        BOOST_CHECK( (x1 > y1) == (x2 > y2) );
    }
    template <class X1, class Y1, class X2, class Y2>
@@ -292,8 +293,8 @@ namespace
    template <class X1, class Y1, class X2, class Y2>
    void test_equality_comparable_aux(X1 x1, Y1 y1, X2 x2, Y2 y2)
    {
-        BOOST_TEST( (x1 == y1) == (x2 == y2) );
+        BOOST_CHECK( (x1 == y1) == (x2 == y2) );
-        BOOST_TEST( (x1 != y1) == (x2 != y2) );
+        BOOST_CHECK( (x1 != y1) == (x2 != y2) );
    }
    template <class X1, class Y1, class X2, class Y2>
@@ -307,7 +308,7 @@ namespace
    template <class X1, class Y1, class X2, class Y2>
    void test_multipliable_aux(X1 x1, Y1 y1, X2 x2, Y2 y2)
    {
-        BOOST_TEST( (x1 * y1).value() == (x2 * y2) );
+        BOOST_CHECK( (x1 * y1).value() == (x2 * y2) );
    }
    template <class X1, class Y1, class X2, class Y2>
@@ -321,7 +322,7 @@ namespace
  template <class A, class B>
  void test_value_equality(A a, B b)
  {
-      BOOST_TEST(a.value() == b);
+      BOOST_CHECK(a.value() == b);
  }
 #define TEST_OP_R(op) test_value_equality(x1 op y1, x2 op y2)
@@ -447,16 +448,16 @@ namespace
    void test_incrementable(X1 x1, X2 x2)
    {
        sanity_check( x1, x1, x2, x2 );
-        BOOST_TEST( (x1++).value() == x2++ );
+        BOOST_CHECK( (x1++).value() == x2++ );
-        BOOST_TEST( x1.value() == x2 );
+        BOOST_CHECK( x1.value() == x2 );
    }
    template <class X1, class X2>
    void test_decrementable(X1 x1, X2 x2)
    {
        sanity_check( x1, x1, x2, x2 );
-        BOOST_TEST( (x1--).value() == x2-- );
+        BOOST_CHECK( (x1--).value() == x2-- );
-        BOOST_TEST( x1.value() == x2 );
+        BOOST_CHECK( x1.value() == x2 );
    }
    template <class X1, class Y1, class X2, class Y2>
@@ -560,7 +561,7 @@ template Wrapped6<unsigned long, unsigned char>;
 template Wrapped6<unsigned int, unsigned char>;
 #endif
-#define PRIVATE_EXPR_TEST(e, t)  BOOST_TEST( ((e), (t)) )
+#define PRIVATE_EXPR_TEST(e, t)  BOOST_CHECK( ((e), (t)) )
 int
 test_main( int , char * [] )
@@ -605,22 +606,22 @@ test_main( int , char * [] )
    MyInt i2(2);
    MyInt i;
-    BOOST_TEST( i1.value() == 1 );
+    BOOST_CHECK( i1.value() == 1 );
-    BOOST_TEST( i2.value() == 2 );
+    BOOST_CHECK( i2.value() == 2 );
-    BOOST_TEST( i.value() == 0 );
+    BOOST_CHECK( i.value() == 0 );
    cout << "Created MyInt objects.\n";
    PRIVATE_EXPR_TEST( (i = i2), (i.value() == 2) );
-    BOOST_TEST( i2 == i );
+    BOOST_CHECK( i2 == i );
-    BOOST_TEST( i1 != i2 );
+    BOOST_CHECK( i1 != i2 );
-    BOOST_TEST( i1 <  i2 );
+    BOOST_CHECK( i1 <  i2 );
-    BOOST_TEST( i1 <= i2 );
+    BOOST_CHECK( i1 <= i2 );
-    BOOST_TEST( i <= i2 );
+    BOOST_CHECK( i <= i2 );
-    BOOST_TEST( i2 >  i1 );
+    BOOST_CHECK( i2 >  i1 );
-    BOOST_TEST( i2 >= i1 );
+    BOOST_CHECK( i2 >= i1 );
-    BOOST_TEST( i2 >= i );
+    BOOST_CHECK( i2 >= i );
    PRIVATE_EXPR_TEST( (i = i1 + i2), (i.value() == 3) );
    PRIVATE_EXPR_TEST( (i = i + i2), (i.value() == 5) );
@@ -644,86 +645,86 @@ test_main( int , char * [] )
    MyLong j2(2);
    MyLong j;
-    BOOST_TEST( j1.value() == 1 );
+    BOOST_CHECK( j1.value() == 1 );
-    BOOST_TEST( j2.value() == 2 );
+    BOOST_CHECK( j2.value() == 2 );
-    BOOST_TEST( j.value() == 0 );
+    BOOST_CHECK( j.value() == 0 );
    cout << "Created MyLong objects.\n";
    PRIVATE_EXPR_TEST( (j = j2), (j.value() == 2) );
-    BOOST_TEST( j2 == j );
+    BOOST_CHECK( j2 == j );
-    BOOST_TEST( 2 == j );
+    BOOST_CHECK( 2 == j );
-    BOOST_TEST( j2 == 2 );    
+    BOOST_CHECK( j2 == 2 );    
-    BOOST_TEST( j == j2 );
+    BOOST_CHECK( j == j2 );
-    BOOST_TEST( j1 != j2 );
+    BOOST_CHECK( j1 != j2 );
-    BOOST_TEST( j1 != 2 );
+    BOOST_CHECK( j1 != 2 );
-    BOOST_TEST( 1 != j2 );
+    BOOST_CHECK( 1 != j2 );
-    BOOST_TEST( j1 <  j2 );
+    BOOST_CHECK( j1 <  j2 );
-    BOOST_TEST( 1 <  j2 );
+    BOOST_CHECK( 1 <  j2 );
-    BOOST_TEST( j1 <  2 );
+    BOOST_CHECK( j1 <  2 );
-    BOOST_TEST( j1 <= j2 );
+    BOOST_CHECK( j1 <= j2 );
-    BOOST_TEST( 1 <= j2 );
+    BOOST_CHECK( 1 <= j2 );
-    BOOST_TEST( j1 <= j );
+    BOOST_CHECK( j1 <= j );
-    BOOST_TEST( j <= j2 );
+    BOOST_CHECK( j <= j2 );
-    BOOST_TEST( 2 <= j2 );
+    BOOST_CHECK( 2 <= j2 );
-    BOOST_TEST( j <= 2 );
+    BOOST_CHECK( j <= 2 );
-    BOOST_TEST( j2 >  j1 );
+    BOOST_CHECK( j2 >  j1 );
-    BOOST_TEST( 2 >  j1 );
+    BOOST_CHECK( 2 >  j1 );
-    BOOST_TEST( j2 >  1 );
+    BOOST_CHECK( j2 >  1 );
-    BOOST_TEST( j2 >= j1 );
+    BOOST_CHECK( j2 >= j1 );
-    BOOST_TEST( 2 >= j1 );
+    BOOST_CHECK( 2 >= j1 );
-    BOOST_TEST( j2 >= 1 );
+    BOOST_CHECK( j2 >= 1 );
-    BOOST_TEST( j2 >= j );
+    BOOST_CHECK( j2 >= j );
-    BOOST_TEST( 2 >= j );
+    BOOST_CHECK( 2 >= j );
-    BOOST_TEST( j2 >= 2 );
+    BOOST_CHECK( j2 >= 2 );
-    BOOST_TEST( (j1 + 2) == 3 );
+    BOOST_CHECK( (j1 + 2) == 3 );
-    BOOST_TEST( (1 + j2) == 3 );
+    BOOST_CHECK( (1 + j2) == 3 );
    PRIVATE_EXPR_TEST( (j = j1 + j2), (j.value() == 3) );
-    BOOST_TEST( (j + 2) == 5 );
+    BOOST_CHECK( (j + 2) == 5 );
-    BOOST_TEST( (3 + j2) == 5 );
+    BOOST_CHECK( (3 + j2) == 5 );
    PRIVATE_EXPR_TEST( (j = j + j2), (j.value() == 5) );
-    BOOST_TEST( (j - 1) == 4 );
+    BOOST_CHECK( (j - 1) == 4 );
    PRIVATE_EXPR_TEST( (j = j - j1), (j.value() == 4) );
-    BOOST_TEST( (j * 2) == 8 );
+    BOOST_CHECK( (j * 2) == 8 );
-    BOOST_TEST( (4 * j2) == 8 );
+    BOOST_CHECK( (4 * j2) == 8 );
    PRIVATE_EXPR_TEST( (j = j * j2), (j.value() == 8) );
-    BOOST_TEST( (j / 2) == 4 );
+    BOOST_CHECK( (j / 2) == 4 );
    PRIVATE_EXPR_TEST( (j = j / j2), (j.value() == 4) );
-    BOOST_TEST( (j % 3) == 1 );
+    BOOST_CHECK( (j % 3) == 1 );
    PRIVATE_EXPR_TEST( (j = j % ( j - j1 )), (j.value() == 1) );
    PRIVATE_EXPR_TEST( (j = j2 + j2), (j.value() == 4) );
-    BOOST_TEST( (1 | j2 | j) == 7 );
+    BOOST_CHECK( (1 | j2 | j) == 7 );
-    BOOST_TEST( (j1 | 2 | j) == 7 );
+    BOOST_CHECK( (j1 | 2 | j) == 7 );
-    BOOST_TEST( (j1 | j2 | 4) == 7 );
+    BOOST_CHECK( (j1 | j2 | 4) == 7 );
    PRIVATE_EXPR_TEST( (j = j1 | j2 | j), (j.value() == 7) );
-    BOOST_TEST( (7 & j2) == 2 );
+    BOOST_CHECK( (7 & j2) == 2 );
-    BOOST_TEST( (j & 2) == 2 );
+    BOOST_CHECK( (j & 2) == 2 );
    PRIVATE_EXPR_TEST( (j = j & j2), (j.value() == 2) );
    PRIVATE_EXPR_TEST( (j = j | j1), (j.value() == 3) );
-    BOOST_TEST( (3 ^ j1) == 2 );
+    BOOST_CHECK( (3 ^ j1) == 2 );
-    BOOST_TEST( (j ^ 1) == 2 );
+    BOOST_CHECK( (j ^ 1) == 2 );
    PRIVATE_EXPR_TEST( (j = j ^ j1), (j.value() == 2) );
    PRIVATE_EXPR_TEST( (j = ( j + j1 ) * ( j2 | j1 )), (j.value() == 9) );
-    BOOST_TEST( (j1 << 2) == 4 );
+    BOOST_CHECK( (j1 << 2) == 4 );
-    BOOST_TEST( (j2 << 1) == 4 );
+    BOOST_CHECK( (j2 << 1) == 4 );
    PRIVATE_EXPR_TEST( (j = j1 << j2), (j.value() == 4) );
-    BOOST_TEST( (j >> 2) == 1 );
+    BOOST_CHECK( (j >> 2) == 1 );
-    BOOST_TEST( (j2 >> 1) == 1 );
+    BOOST_CHECK( (j2 >> 1) == 1 );
    PRIVATE_EXPR_TEST( (j = j2 >> j1), (j.value() == 1) );
    cout << "Performed tests on MyLong objects.\n";
@@ -732,22 +733,22 @@ test_main( int , char * [] )
    MyChar k2(2);
    MyChar k;
-    BOOST_TEST( k1.value() == 1 );
+    BOOST_CHECK( k1.value() == 1 );
-    BOOST_TEST( k2.value() == 2 );
+    BOOST_CHECK( k2.value() == 2 );
-    BOOST_TEST( k.value() == 0 );
+    BOOST_CHECK( k.value() == 0 );
    cout << "Created MyChar objects.\n";
    PRIVATE_EXPR_TEST( (k = k2), (k.value() == 2) );
-    BOOST_TEST( k2 == k );
+    BOOST_CHECK( k2 == k );
-    BOOST_TEST( k1 != k2 );
+    BOOST_CHECK( k1 != k2 );
-    BOOST_TEST( k1 <  k2 );
+    BOOST_CHECK( k1 <  k2 );
-    BOOST_TEST( k1 <= k2 );
+    BOOST_CHECK( k1 <= k2 );
-    BOOST_TEST( k <= k2 );
+    BOOST_CHECK( k <= k2 );
-    BOOST_TEST( k2 >  k1 );
+    BOOST_CHECK( k2 >  k1 );
-    BOOST_TEST( k2 >= k1 );
+    BOOST_CHECK( k2 >= k1 );
-    BOOST_TEST( k2 >= k );
+    BOOST_CHECK( k2 >= k );
    cout << "Performed tests on MyChar objects.\n";
@@ -755,39 +756,39 @@ test_main( int , char * [] )
    MyShort l2(2);
    MyShort l;
-    BOOST_TEST( l1.value() == 1 );
+    BOOST_CHECK( l1.value() == 1 );
-    BOOST_TEST( l2.value() == 2 );
+    BOOST_CHECK( l2.value() == 2 );
-    BOOST_TEST( l.value() == 0 );
+    BOOST_CHECK( l.value() == 0 );
    cout << "Created MyShort objects.\n";
    PRIVATE_EXPR_TEST( (l = l2), (l.value() == 2) );
-    BOOST_TEST( l2 == l );
+    BOOST_CHECK( l2 == l );
-    BOOST_TEST( 2 == l );
+    BOOST_CHECK( 2 == l );
-    BOOST_TEST( l2 == 2 );    
+    BOOST_CHECK( l2 == 2 );    
-    BOOST_TEST( l == l2 );
+    BOOST_CHECK( l == l2 );
-    BOOST_TEST( l1 != l2 );
+    BOOST_CHECK( l1 != l2 );
-    BOOST_TEST( l1 != 2 );
+    BOOST_CHECK( l1 != 2 );
-    BOOST_TEST( 1 != l2 );
+    BOOST_CHECK( 1 != l2 );
-    BOOST_TEST( l1 <  l2 );
+    BOOST_CHECK( l1 <  l2 );
-    BOOST_TEST( 1 <  l2 );
+    BOOST_CHECK( 1 <  l2 );
-    BOOST_TEST( l1 <  2 );
+    BOOST_CHECK( l1 <  2 );
-    BOOST_TEST( l1 <= l2 );
+    BOOST_CHECK( l1 <= l2 );
-    BOOST_TEST( 1 <= l2 );
+    BOOST_CHECK( 1 <= l2 );
-    BOOST_TEST( l1 <= l );
+    BOOST_CHECK( l1 <= l );
-    BOOST_TEST( l <= l2 );
+    BOOST_CHECK( l <= l2 );
-    BOOST_TEST( 2 <= l2 );
+    BOOST_CHECK( 2 <= l2 );
-    BOOST_TEST( l <= 2 );
+    BOOST_CHECK( l <= 2 );
-    BOOST_TEST( l2 >  l1 );
+    BOOST_CHECK( l2 >  l1 );
-    BOOST_TEST( 2 >  l1 );
+    BOOST_CHECK( 2 >  l1 );
-    BOOST_TEST( l2 >  1 );
+    BOOST_CHECK( l2 >  1 );
-    BOOST_TEST( l2 >= l1 );
+    BOOST_CHECK( l2 >= l1 );
-    BOOST_TEST( 2 >= l1 );
+    BOOST_CHECK( 2 >= l1 );
-    BOOST_TEST( l2 >= 1 );
+    BOOST_CHECK( l2 >= 1 );
-    BOOST_TEST( l2 >= l );
+    BOOST_CHECK( l2 >= l );
-    BOOST_TEST( 2 >= l );
+    BOOST_CHECK( 2 >= l );
-    BOOST_TEST( l2 >= 2 );
+    BOOST_CHECK( l2 >= 2 );
    cout << "Performed tests on MyShort objects.\n";
@@ -797,44 +798,44 @@ test_main( int , char * [] )
    MyDoubleInt di;
    MyDoubleInt tmp;
-    BOOST_TEST( di1.value() == 1 );
+    BOOST_CHECK( di1.value() == 1 );
-    BOOST_TEST( di2.value() == 2 );
+    BOOST_CHECK( di2.value() == 2 );
-    BOOST_TEST( di2.value() == 2 );
+    BOOST_CHECK( di2.value() == 2 );
-    BOOST_TEST( di.value() == 0 );
+    BOOST_CHECK( di.value() == 0 );
    cout << "Created MyDoubleInt objects.\n";
    PRIVATE_EXPR_TEST( (di = di2), (di.value() == 2) );
-    BOOST_TEST( di2 == di );
+    BOOST_CHECK( di2 == di );
-    BOOST_TEST( 2 == di );
+    BOOST_CHECK( 2 == di );
-    BOOST_TEST( di == 2 );
+    BOOST_CHECK( di == 2 );
-    BOOST_TEST( di1 < di2 );
+    BOOST_CHECK( di1 < di2 );
-    BOOST_TEST( 1 < di2 );
+    BOOST_CHECK( 1 < di2 );
-    BOOST_TEST( di1 <= di2 );
+    BOOST_CHECK( di1 <= di2 );
-    BOOST_TEST( 1 <= di2 );
+    BOOST_CHECK( 1 <= di2 );
-    BOOST_TEST( di2 > di1 );
+    BOOST_CHECK( di2 > di1 );
-    BOOST_TEST( di2 > 1 );
+    BOOST_CHECK( di2 > 1 );
-    BOOST_TEST( di2 >= di1 );
+    BOOST_CHECK( di2 >= di1 );
-    BOOST_TEST( di2 >= 1 );
+    BOOST_CHECK( di2 >= 1 );
-    BOOST_TEST( di1 / di2 == half );
+    BOOST_CHECK( di1 / di2 == half );
-    BOOST_TEST( di1 / 2 == half );
+    BOOST_CHECK( di1 / 2 == half );
-    BOOST_TEST( 1 / di2 == half );
+    BOOST_CHECK( 1 / di2 == half );
    PRIVATE_EXPR_TEST( (tmp=di1), ((tmp/=2) == half) );
    PRIVATE_EXPR_TEST( (tmp=di1), ((tmp/=di2) == half) );
-    BOOST_TEST( di1 * di2 == di2 );
+    BOOST_CHECK( di1 * di2 == di2 );
-    BOOST_TEST( di1 * 2 == di2 );
+    BOOST_CHECK( di1 * 2 == di2 );
-    BOOST_TEST( 1 * di2 == di2 );
+    BOOST_CHECK( 1 * di2 == di2 );
    PRIVATE_EXPR_TEST( (tmp=di1), ((tmp*=2) == di2) );
    PRIVATE_EXPR_TEST( (tmp=di1), ((tmp*=di2) == di2) );
-    BOOST_TEST( di2 - di1 == di1 );
+    BOOST_CHECK( di2 - di1 == di1 );
-    BOOST_TEST( di2 - 1 == di1 );
+    BOOST_CHECK( di2 - 1 == di1 );
-    BOOST_TEST( 2 - di1 == di1 );
+    BOOST_CHECK( 2 - di1 == di1 );
    PRIVATE_EXPR_TEST( (tmp=di2), ((tmp-=1) == di1) );
    PRIVATE_EXPR_TEST( (tmp=di2), ((tmp-=di1) == di1) );
-    BOOST_TEST( di1 + di1 == di2 );
+    BOOST_CHECK( di1 + di1 == di2 );
-    BOOST_TEST( di1 + 1 == di2 );
+    BOOST_CHECK( di1 + 1 == di2 );
-    BOOST_TEST( 1 + di1 == di2 );
+    BOOST_CHECK( 1 + di1 == di2 );
    PRIVATE_EXPR_TEST( (tmp=di1), ((tmp+=1) == di2) );
    PRIVATE_EXPR_TEST( (tmp=di1), ((tmp+=di1) == di2) );
@@ -845,48 +846,48 @@ test_main( int , char * [] )
    MyLongInt li;
    MyLongInt tmp2;
-    BOOST_TEST( li1.value() == 1 );
+    BOOST_CHECK( li1.value() == 1 );
-    BOOST_TEST( li2.value() == 2 );
+    BOOST_CHECK( li2.value() == 2 );
-    BOOST_TEST( li.value() == 0 );
+    BOOST_CHECK( li.value() == 0 );
    cout << "Created MyLongInt objects.\n";
    PRIVATE_EXPR_TEST( (li = li2), (li.value() == 2) );
-    BOOST_TEST( li2 == li );
+    BOOST_CHECK( li2 == li );
-    BOOST_TEST( 2 == li );
+    BOOST_CHECK( 2 == li );
-    BOOST_TEST( li == 2 );
+    BOOST_CHECK( li == 2 );
-    BOOST_TEST( li1 < li2 );
+    BOOST_CHECK( li1 < li2 );
-    BOOST_TEST( 1 < li2 );
+    BOOST_CHECK( 1 < li2 );
-    BOOST_TEST( li1 <= li2 );
+    BOOST_CHECK( li1 <= li2 );
-    BOOST_TEST( 1 <= li2 );
+    BOOST_CHECK( 1 <= li2 );
-    BOOST_TEST( li2 > li1 );
+    BOOST_CHECK( li2 > li1 );
-    BOOST_TEST( li2 > 1 );
+    BOOST_CHECK( li2 > 1 );
-    BOOST_TEST( li2 >= li1 );
+    BOOST_CHECK( li2 >= li1 );
-    BOOST_TEST( li2 >= 1 );
+    BOOST_CHECK( li2 >= 1 );
-    BOOST_TEST( li1 % li2 == li1 );
+    BOOST_CHECK( li1 % li2 == li1 );
-    BOOST_TEST( li1 % 2 == li1 );
+    BOOST_CHECK( li1 % 2 == li1 );
-    BOOST_TEST( 1 % li2 == li1 );
+    BOOST_CHECK( 1 % li2 == li1 );
    PRIVATE_EXPR_TEST( (tmp2=li1), ((tmp2%=2) == li1) );
    PRIVATE_EXPR_TEST( (tmp2=li1), ((tmp2%=li2) == li1) );
-    BOOST_TEST( li1 / li2 == 0 );
+    BOOST_CHECK( li1 / li2 == 0 );
-    BOOST_TEST( li1 / 2 == 0 );
+    BOOST_CHECK( li1 / 2 == 0 );
-    BOOST_TEST( 1 / li2 == 0 );
+    BOOST_CHECK( 1 / li2 == 0 );
    PRIVATE_EXPR_TEST( (tmp2=li1), ((tmp2/=2) == 0) );
    PRIVATE_EXPR_TEST( (tmp2=li1), ((tmp2/=li2) == 0) );
-    BOOST_TEST( li1 * li2 == li2 );
+    BOOST_CHECK( li1 * li2 == li2 );
-    BOOST_TEST( li1 * 2 == li2 );
+    BOOST_CHECK( li1 * 2 == li2 );
-    BOOST_TEST( 1 * li2 == li2 );
+    BOOST_CHECK( 1 * li2 == li2 );
    PRIVATE_EXPR_TEST( (tmp2=li1), ((tmp2*=2) == li2) );
    PRIVATE_EXPR_TEST( (tmp2=li1), ((tmp2*=li2) == li2) );
-    BOOST_TEST( li2 - li1 == li1 );
+    BOOST_CHECK( li2 - li1 == li1 );
-    BOOST_TEST( li2 - 1 == li1 );
+    BOOST_CHECK( li2 - 1 == li1 );
-    BOOST_TEST( 2 - li1 == li1 );
+    BOOST_CHECK( 2 - li1 == li1 );
    PRIVATE_EXPR_TEST( (tmp2=li2), ((tmp2-=1) == li1) );
    PRIVATE_EXPR_TEST( (tmp2=li2), ((tmp2-=li1) == li1) );
-    BOOST_TEST( li1 + li1 == li2 );
+    BOOST_CHECK( li1 + li1 == li2 );
-    BOOST_TEST( li1 + 1 == li2 );
+    BOOST_CHECK( li1 + 1 == li2 );
-    BOOST_TEST( 1 + li1 == li2 );
+    BOOST_CHECK( 1 + li1 == li2 );
    PRIVATE_EXPR_TEST( (tmp2=li1), ((tmp2+=1) == li2) );
    PRIVATE_EXPR_TEST( (tmp2=li1), ((tmp2+=li1) == li2) );
--- a/projection_iterator_example.cpp
+++ b/projection_iterator_example.cpp
@@ -1,103 +0,0 @@
 // (C) Copyright Jeremy Siek 2000. Permission to copy, use, modify, sell and
 // distribute this software is granted provided this copyright notice appears
 // in all copies. This software is provided "as is" without express or implied
 // warranty, and with no claim as to its suitability for any purpose.
 #include <boost/config.hpp>
 #include <list>
 #include <iostream>
 #include <iterator>
 #include <algorithm>
 #include <string>
 #include <boost/iterator/transform_iterator.hpp>
 struct personnel_record {
  personnel_record(std::string n, int id) : m_name(n), m_ID(id) { }
  std::string m_name;
  int m_ID;
 };
 struct select_name {
  typedef personnel_record argument_type;
  typedef std::string const& result_type;
  const std::string& operator()(const personnel_record& r) const {
    return r.m_name;
  }
  std::string& operator()(personnel_record& r) const {
    return r.m_name;
  }
 };
 struct select_ID {
  typedef personnel_record argument_type;
  typedef int& result_type;
  const int& operator()(const personnel_record& r) const {
    return r.m_ID;
  }
  int& operator()(personnel_record& r) const {
    return r.m_ID;
  }
 };
 int main(int, char*[])
 {
  std::list<personnel_record> personnel_list;
  personnel_list.push_back(personnel_record("Barney", 13423));
  personnel_list.push_back(personnel_record("Fred", 12343));
  personnel_list.push_back(personnel_record("Wilma", 62454));
  personnel_list.push_back(personnel_record("Betty", 20490));
  // Example of using transform_iterator to print out the names in the
  // personnel list using a projection.
  boost::transform_iterator<
      select_name
    , std::list<personnel_record>::iterator
 #ifdef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
    , std::string
 #endif 
  >
    personnel_first(personnel_list.begin()),
    personnel_last(personnel_list.end());
  std::copy(personnel_first, personnel_last,
            std::ostream_iterator<std::string>(std::cout, "\n"));
  std::cout << std::endl;
  // Example of using transform_iterator with const_iterators to
  // assign new ID numbers to the personnel.
  boost::transform_iterator<
      select_ID, std::list<personnel_record>::iterator
 > ID_first(personnel_list.begin()),
    ID_last(personnel_list.end());
  int new_id = 0;
  while (ID_first != ID_last) {
    *ID_first = new_id++;
    ++ID_first;
  }
    boost::transform_iterator<
      select_ID, std::list<personnel_record>::const_iterator, int const&
    >
    const_ID_first(personnel_list.begin()),
    const_ID_last(personnel_list.end());
  std::copy(const_ID_first, const_ID_last,
            std::ostream_iterator<int>(std::cout, " "));
  std::cout << std::endl;
  std::cout << std::endl;
 #ifndef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
  // Example of using make_const_projection_iterator()
  // to print out the names in the personnel list again.
  std::copy(
      boost::make_transform_iterator<select_name>(personnel_list.begin())
    , boost::make_transform_iterator<select_name>(personnel_list.end())
    , std::ostream_iterator<std::string>(std::cout, "\n"));
 #endif
  return 0;
 }
--- a/ref_ct_test.cpp
+++ b/ref_ct_test.cpp
@@ -1,9 +1,18 @@
 // Copyright David Abrahams and Aleksey Gurtovoy
 // 2002-2004. Distributed under the Boost Software License, Version
 // 1.0. (See accompanying file LICENSE_1_0.txt or copy at
 // http://www.boost.org/LICENSE_1_0.txt)
 // compile-time test for "boost/ref.hpp" header content
 // see 'ref_test.cpp' for run-time part
 #include <boost/ref.hpp>
-#include <boost/type_traits/same_traits.hpp>
+#include <boost/type_traits/is_same.hpp>
 #include <boost/type_traits/remove_const.hpp>
 #include <boost/static_assert.hpp>
 #include <boost/detail/workaround.hpp>
 #include <boost/mpl/assert.hpp>
 namespace {
@@ -30,13 +39,23 @@ void is_reference_wrapper_test(T)
 template< typename R, typename Ref >
 void cxx_reference_test(Ref)
 {
 #if BOOST_WORKAROUND(__BORLANDC__, < 0x600)
    typedef typename boost::remove_const<Ref>::type ref;
    BOOST_STATIC_ASSERT((boost::is_same<R,ref>::value));
 #else
    BOOST_STATIC_ASSERT((boost::is_same<R,Ref>::value));
 #endif
 }
 template< typename R, typename Ref >
 void unwrap_reference_test(Ref)
 {
 #if BOOST_WORKAROUND(__BORLANDC__, < 0x600)
    typedef typename boost::remove_const<Ref>::type ref;
    typedef typename boost::unwrap_reference<ref>::type type;
 #else
    typedef typename boost::unwrap_reference<Ref>::type type;
 #endif
    BOOST_STATIC_ASSERT((boost::is_same<R,type>::value));
 }
--- a/ref_test.cpp
+++ b/ref_test.cpp
@@ -1,3 +1,7 @@
 // Copyright David Abrahams and Aleksey Gurtovoy
 // 2002-2004. Distributed under the Boost Software License, Version
 // 1.0. (See accompanying file LICENSE_1_0.txt or copy at
 // http://www.boost.org/LICENSE_1_0.txt)
 // run-time test for "boost/ref.hpp" header content
 // see 'ref_ct_test.cpp' for compile-time part
@@ -56,11 +60,11 @@ struct ref_wrapper
    static void test(T x)
    {
-        BOOST_TEST(passthru(ref(x)) == &x);
+        BOOST_CHECK(passthru(ref(x)) == &x);
-        BOOST_TEST(&ref(x).get() == &x);
+        BOOST_CHECK(&ref(x).get() == &x);
-        BOOST_TEST(cref_passthru(cref(x)) == &x);
+        BOOST_CHECK(cref_passthru(cref(x)) == &x);
-        BOOST_TEST(&cref(x).get() == &x);
+        BOOST_CHECK(&cref(x).get() == &x);
    }
 };
--- a/reverse_iterator_example.cpp
+++ b/reverse_iterator_example.cpp
@@ -1,47 +0,0 @@
 // (C) Copyright Jeremy Siek 2000. Permission to copy, use, modify, sell and
 // distribute this software is granted provided this copyright notice appears
 // in all copies. This software is provided "as is" without express or implied
 // warranty, and with no claim as to its suitability for any purpose.
 #include <boost/config.hpp>
 #include <iostream>
 #include <algorithm>
 #include <boost/iterator/reverse_iterator.hpp>
 #include <boost/detail/iterator.hpp>
 //boost::detail::iterator_traits
 int main(int, char*[])
 {
  char letters_[] = "hello world!";
  const int N = sizeof(letters_)/sizeof(char) - 1;
  typedef char* base_iterator;
  base_iterator letters(letters_);
  std::cout << "original sequence of letters:\t"
            << letters_ << std::endl;
  std::sort(letters, letters + N);
  // Use reverse_iterator_generator to print a sequence
  // of letters in reverse order.
  boost::reverse_iterator<base_iterator>
    reverse_letters_first(letters + N),
    reverse_letters_last(letters);
  std::cout << "letters in descending order:\t";
  std::copy(reverse_letters_first, reverse_letters_last,
            std::ostream_iterator<char>(std::cout));
  std::cout << std::endl;
  // Use make_reverse_iterator() to print the sequence
  // of letters in reverse-reverse order.
  std::cout << "letters in ascending order:\t";
  std::copy(boost::make_reverse_iterator(reverse_letters_last),
            boost::make_reverse_iterator(reverse_letters_first),
            std::ostream_iterator<char>(std::cout));
  std::cout << std::endl;
  return 0;
 }
--- a/shared_container_iterator.html
+++ b/shared_container_iterator.html
@@ -9,7 +9,7 @@
 <body bgcolor="#FFFFFF" text="#000000">
-<img src="../../c++boost.gif" alt="c++boost.gif (8819 bytes)"
+<img src="../../boost.png" alt="boost.png (6897 bytes)"
 align="center" width="277" height="86">
 <h1>Shared Container Iterator</h1>
--- a/1
+++ b/1
@@ -0,0 +1 @@
 The existance of this file tells the regression reporting programs that the directory contains sub-directories which are libraries.
--- a/test/Jamfile
+++ b/test/Jamfile
@@ -6,8 +6,6 @@
 # For more information, see http://www.boost.org/
 # Testing Jamfile autogenerated from XML source
 subproject libs/utility/test ;
 # bring in rules for testing
@@ -18,27 +16,28 @@ DEPENDS all : test ;
 local test_monitor = <lib>@boost/libs/test/build/boost_test_exec_monitor ;
 # Please keep the tests ordered by filename
 test-suite utility
-    : 
+    :
-        [ run ../iterator_traits_test.cpp ]
+        [ run ../addressof_test.cpp ]
-        [ run ../iterators_test.cpp $(test_monitor) ]
+        [ run ../assert_test.cpp ]
-        [ compile-fail ../noncopyable_test.cpp ]
+        [ run ../base_from_member_test.cpp ]
        [ run ../numeric_traits_test.cpp ]
        [ run ../operators_test.cpp $(test_monitor) ]
        [ run ../binary_search_test.cpp ]
        [ run ../call_traits_test.cpp : -u ]
        [ compile-fail ../checked_delete_test.cpp ]
        [ run ../compressed_pair_test.cpp $(test_monitor) : -u ]
-        [ run ../addressof_test.cpp $(test_monitor) ]
+        [ run ../current_function_test.cpp : : : <test-info>always_show_run_output ]
        [ run ../iterators_test.cpp $(test_monitor) ]
        [ run next_prior_test.cpp $(test_monitor) ]
        [ compile-fail ../noncopyable_test.cpp ]
        [ run ../numeric_traits_test.cpp ]
        [ run ../operators_test.cpp $(test_monitor) ]
        [ compile ../ref_ct_test.cpp  ]
        [ run ../ref_test.cpp $(test_monitor) ]
-        [ run ../enable_if_constructors.cpp $(test_monitor) ]
+        [ compile result_of_test.cpp ]
-        [ run ../enable_if_dummy_arg_disambiguation.cpp $(test_monitor) ]
+        [ run ../shared_iterator_test.cpp ]
-        [ run ../enable_if_lazy.cpp $(test_monitor) ]
+        [ run ../value_init_test.cpp ]
-        [ run ../enable_if_lazy_test.cpp $(test_monitor) ]
+        [ compile-fail ../value_init_test_fail1.cpp ]
-        [ run ../enable_if_member_templates.cpp $(test_monitor) ]
+        [ compile-fail ../value_init_test_fail2.cpp ]
-        [ run ../enable_if_namespace_disambiguation.cpp $(test_monitor) ]
+        [ compile-fail ../value_init_test_fail3.cpp ]
        [ run ../enable_if_no_disambiguation.cpp $(test_monitor) ]
        [ run ../enable_if_partial_specializations.cpp $(test_monitor) ]
        [ run next_prior_test.cpp $(test_monitor) ]       
        [ compile result_of_test.cpp ]   
    ;
--- a/test/Jamfile.v2
+++ b/test/Jamfile.v2
@@ -9,27 +9,28 @@
 # bring in rules for testing
 import testing ;
 # Please keep the tests ordered by filename
 test-suite utility
-    : 
+    :
-        [ run ../iterator_traits_test.cpp ]
+        [ run ../addressof_test.cpp ]
-        [ run ../iterators_test.cpp ../../test/build//boost_test_exec_monitor ]
+        [ run ../assert_test.cpp ]
-        [ compile-fail ../noncopyable_test.cpp ]
+        [ run ../base_from_member_test.cpp ]
        [ run ../numeric_traits_test.cpp ]
        [ run ../operators_test.cpp ../../test/build//boost_test_exec_monitor ]
        [ run ../binary_search_test.cpp ]
        [ run ../call_traits_test.cpp : -u ]
        [ compile-fail ../checked_delete_test.cpp ]
        [ run ../compressed_pair_test.cpp ../../test/build//boost_test_exec_monitor : -u ]
-        [ run ../addressof_test.cpp ../../test/build//boost_test_exec_monitor ]
+        [ run ../current_function_test.cpp : : : <test-info>always_show_run_output ]
        [ run ../iterators_test.cpp ../../test/build//boost_test_exec_monitor ]
        [ run next_prior_test.cpp ../../test/build//boost_test_exec_monitor ]
        [ compile-fail ../noncopyable_test.cpp ]
        [ run ../numeric_traits_test.cpp ]
        [ run ../operators_test.cpp ../../test/build//boost_test_exec_monitor ]
        [ compile ../ref_ct_test.cpp  ]
        [ run ../ref_test.cpp ../../test/build//boost_test_exec_monitor ]
        [ run ../enable_if_constructors.cpp ../../test/build//boost_test_exec_monitor ]
        [ run ../enable_if_dummy_arg_disambiguation.cpp ../../test/build//boost_test_exec_monitor ]
        [ run ../enable_if_lazy.cpp ../../test/build//boost_test_exec_monitor ]
        [ run ../enable_if_lazy_test.cpp ../../test/build//boost_test_exec_monitor ]
        [ run ../enable_if_member_templates.cpp ../../test/build//boost_test_exec_monitor ]
        [ run ../enable_if_namespace_disambiguation.cpp ../../test/build//boost_test_exec_monitor ]
        [ run ../enable_if_no_disambiguation.cpp ../../test/build//boost_test_exec_monitor ]
        [ run ../enable_if_partial_specializations.cpp ../../test/build//boost_test_exec_monitor ]
 	[ run next_prior_test.cpp ../../test/build//boost_test_exec_monitor ]	
        [ compile result_of_test.cpp ]
        [ run ../shared_iterator_test.cpp ]
        [ run ../value_init_test.cpp ]
        [ compile-fail ../value_init_test_fail1.cpp ]
        [ compile-fail ../value_init_test_fail2.cpp ]
        [ compile-fail ../value_init_test_fail3.cpp ]
    ;
--- a/test/result_of_test.cpp
+++ b/test/result_of_test.cpp
@@ -1,3 +1,11 @@
 // Boost result_of library
 //  Copyright Douglas Gregor 2003-2004. Use, modification and
 //  distribution is subject to the Boost Software License, Version
 //  1.0. (See accompanying file LICENSE_1_0.txt or copy at
 //  http://www.boost.org/LICENSE_1_0.txt)
 // For more information, see http://www.boost.org/libs/utility
 #include <boost/utility/result_of.hpp>
 #include <utility>
 #include <boost/static_assert.hpp>
--- a/throw_exception.html
+++ b/throw_exception.html
@@ -8,7 +8,7 @@
 		<table border="0" width="100%">
 			<tr>
 				<td width="277">
-					<img src="../../c++boost.gif" alt="c++boost.gif (8819 bytes)" width="277" height="86">
+					<img src="../../boost.png" alt="boost.png (6897 bytes)" width="277" height="86">
 				</td>
 				<td align="middle">
 					<h1>throw_exception.hpp</h1>
--- a/transform_iterator_example.cpp
+++ b/transform_iterator_example.cpp
@@ -1,76 +0,0 @@
 // (C) Copyright Jeremy Siek 2000. Permission to copy, use, modify, sell and
 // distribute this software is granted provided this copyright notice appears
 // in all copies. This software is provided "as is" without express or implied
 // warranty, and with no claim as to its suitability for any purpose.
 #include <functional>
 #include <algorithm>
 #include <iostream>
 #include <boost/iterator/transform_iterator.hpp>
 // What a bummer. We can't use std::binder1st with transform iterator
 // because it does not have a default constructor. Here's a version
 // that does.
 namespace boost {
  template <class Operation> 
  class binder1st
    : public std::unary_function<typename Operation::second_argument_type,
                                 typename Operation::result_type> {
  protected:
    Operation op;
    typename Operation::first_argument_type value;
  public:
    binder1st() { } // this had to be added!
    binder1st(const Operation& x,
              const typename Operation::first_argument_type& y)
        : op(x), value(y) {}
    typename Operation::result_type
    operator()(const typename Operation::second_argument_type& x) const {
      return op(value, x); 
    }
  };
  template <class Operation, class T>
  inline binder1st<Operation> bind1st(const Operation& op, const T& x) {
    typedef typename Operation::first_argument_type arg1_type;
    return binder1st<Operation>(op, arg1_type(x));
  }
 } // namespace boost
 int
 main(int, char*[])
 {
  // This is a simple example of using the transform_iterators class to
  // generate iterators that multiply the value returned by dereferencing
  // the iterator. In this case we are multiplying by 2.
  // Would be cooler to use lambda library in this example.
  int x[] = { 1, 2, 3, 4, 5, 6, 7, 8 };
  const int N = sizeof(x)/sizeof(int);
  typedef boost::binder1st< std::multiplies<int> > Function;
  typedef boost::transform_iterator<Function, int*> doubling_iterator;
  doubling_iterator i(x, boost::bind1st(std::multiplies<int>(), 2)),
    i_end(x + N, boost::bind1st(std::multiplies<int>(), 2));
  std::cout << "multiplying the array by 2:" << std::endl;
  while (i != i_end)
    std::cout << *i++ << " ";
  std::cout << std::endl;
  std::cout << "adding 4 to each element in the array:" << std::endl;
  std::copy(boost::make_transform_iterator(x, boost::bind1st(std::plus<int>(), 4)),
            boost::make_transform_iterator(x + N, boost::bind1st(std::plus<int>(), 4)),
            std::ostream_iterator<int>(std::cout, " "));
  std::cout << std::endl;
  return 0;
 }
--- a/utility.htm
+++ b/utility.htm
@@ -4,7 +4,7 @@
 		<title>Header boost/utility.hpp Documentation</title>
 	</head>
 	<body bgcolor="#FFFFFF" text="#000000">
-		<h1><img src="../../c++boost.gif" alt="c++boost.gif (8819 bytes)" align="center" WIDTH="277" HEIGHT="86">Header
+		<h1><img src="../../boost.png" alt="boost.png (6897 bytes)" align="center" WIDTH="277" HEIGHT="86">Header
 			<a href="../../boost/utility.hpp">boost/utility.hpp</a></h1>
 		<p>The entire contents of the header <code><a href="../../boost/utility.hpp">&lt;boost/utility.hpp&gt;</a></code>
 			are in <code>namespace boost</code>.</p>
@@ -175,7 +175,8 @@ void f() {
                <code>BOOST_RESULT_OF_NUM_ARGS</code> to the maximum
                value for <em>N</em>.</p>
-                <p>This implementation of <code>result_of</code> requires class template partial specialization, the ability to parse function types properly, and support for SFINAE. Contributed by Doug Gregor.</p>
+                <a name="BOOST_NO_RESULT_OF"></a>
                <p>This implementation of <code>result_of</code> requires class template partial specialization, the ability to parse function types properly, and support for SFINAE. If <code>result_of</code> is not supported by your compiler, including the header <code>boost/utility/result_of.hpp</code> will define the macro <code>BOOST_NO_RESULT_OF</code>. Contributed by Doug Gregor.</p>
 		<h2>Class templates for the Base-from-Member Idiom</h2>
 		<p>See <a href="base_from_member.html">separate documentation</a>.</p>
--- a/value_init.htm
+++ b/value_init.htm
@@ -8,15 +8,15 @@
 </head>
  <body vlink="#800080" link="#0000ff" text="#000000" bgcolor="#ffffff">
-<h2><img src="../../c++boost.gif" width="276" height="86">
+<h2><img src="../../boost.png" width="276" height="86">
         Header &lt;<a href="../../boost/utility/value_init.hpp">boost/utility/value_init.hpp</a>&gt;
     </h2>
 <h2>Contents</h2>
 <dl>
-  <dt><a href="#intro">Rationale</a></dt>
+  <dt><a href="#rationale">Rationale</a></dt>
-  <dt><a href="#rationale">Introduction</a></dt>
+  <dt><a href="#intro">Introduction</a></dt>
 </dl>
 <ul>
@@ -49,7 +49,7 @@ a solution   with consistent syntax for value   initialization of scalar,
 union and class   types. <br>
  </p>
-<h2><a name="into"></a>Introduction</h2>
+<h2><a name="intro"></a>Introduction</h2>
 <p>The C++ standard [<a href="#references">1</a>] contains the definitions 
    of <code>zero-initialization</code> and <code>default-initialization</code>.
@@ -131,7 +131,7 @@ data member:</p>
 <h2><a name="val_init"><code>template class value_initialized&lt;T&gt;</code></a></h2>
-<pre>namespace boost {<br><br>template&lt;class T&gt;<br>class value_initialized<br>{<br>  public :<br>    value_initialized() : x() {}<br>    operator T&amp;() const { return x ; }<br>    T&amp; data() const { return x ; }<br><br>  private :<br>    <i>impll-defined</i> x ;<br>} ;<br><br>template&lt;class T&gt;<br>T const&amp; get ( value_initialized&lt;T&gt; const&amp; x )<br>{<br>  return x.data() ;<br>}<br><br>template&lt;class T&gt;<br>T&amp; get ( value_initialized&lt;T&gt;&amp; x )<br>{<br>  return x.data() ;<br>}<br><br>} // namespace boost<br></pre>
+<pre>namespace boost {<br><br>template&lt;class T&gt;<br>class value_initialized<br>{<br>  public :<br>    value_initialized() : x() {}<br>    operator T&amp;() const { return x ; }<br>    T&amp; data() const { return x ; }<br><br>  private :<br>    <i>unspecified</i> x ;<br>} ;<br><br>template&lt;class T&gt;<br>T const&amp; get ( value_initialized&lt;T&gt; const&amp; x )<br>{<br>  return x.data() ;<br>}<br><br>template&lt;class T&gt;<br>T&amp; get ( value_initialized&lt;T&gt;&amp; x )<br>{<br>  return x.data() ;<br>}<br><br>} // namespace boost<br></pre>
 <p>An object of this template class is a <code>T</code>-wrapper convertible 
    to <code>'T&amp;'</code> whose wrapped object (data member of type <code>T</code>) 
--- a/value_init_test.cpp
+++ b/value_init_test.cpp
@@ -1,13 +1,8 @@
 // (C) 2002, Fernando Luis Cacciola Carballal.
 //
-// This material is provided "as is", with absolutely no warranty expressed
+// Distributed under the Boost Software License, Version 1.0. (See
-// or implied. Any use is at your own risk.
+// accompanying file LICENSE_1_0.txt or copy at
-//
+// http://www.boost.org/LICENSE_1_0.txt)
 // Permission to use or copy this software for any purpose is hereby granted
 // without fee, provided the above notices are retained on all copies.
 // Permission to modify the code and to distribute modified code is granted,
 // provided the above notices are retained, and a notice that the code was
 // modified is included with the above copyright notice.
 //
 // Test program for "boost/utility/value_init.hpp"
 //
@@ -22,8 +17,7 @@
 #pragma hdrstop
 #endif
-#define BOOST_INCLUDE_MAIN
+#include "boost/test/minimal.hpp"
 #include "boost/test/test_tools.hpp"
 //
 // Sample POD type
@@ -70,34 +64,28 @@ template<class T>
 void test ( T const& y, T const& z )
 {
  boost::value_initialized<T> x ;
-  BOOST_TEST ( y == x ) ;
+  BOOST_CHECK ( y == x ) ;
-  BOOST_TEST ( y == get(x) ) ;
+  BOOST_CHECK ( y == boost::get(x) ) ;
  static_cast<T&>(x) = z ;
-  get(x) = z ;
+  boost::get(x) = z ;
-  BOOST_TEST ( x == z ) ;
+  BOOST_CHECK ( x == z ) ;
  boost::value_initialized<T> const x_c ;
-  BOOST_TEST ( y == x_c ) ;
+  BOOST_CHECK ( y == x_c ) ;
-  BOOST_TEST ( y == get(x_c) ) ;
+  BOOST_CHECK ( y == boost::get(x_c) ) ;
-  static_cast<T&>(x_c) = z ;
+  T& x_c_ref = x_c ;
-  BOOST_TEST ( x_c == z ) ;
+  x_c_ref = z ;
-  #ifdef PRODUCE_ERROR_1
+  BOOST_CHECK ( x_c == z ) ;
  get(x_c) = z ; // this should produce an ERROR
  #endif
 #if !BOOST_WORKAROUND(BOOST_MSVC, < 1300)
  boost::value_initialized<T const> cx ;
-  BOOST_TEST ( y == cx ) ;
+  BOOST_CHECK ( y == cx ) ;
-  BOOST_TEST ( y == get(cx) ) ;
+  BOOST_CHECK ( y == boost::get(cx) ) ;
  #ifdef PRODUCE_ERROR_2
  get(cx) = z ; // this should produce an ERROR
  #endif
  boost::value_initialized<T const> const cx_c ;
-  BOOST_TEST ( y == cx_c ) ;
+  BOOST_CHECK ( y == cx_c ) ;
-  BOOST_TEST ( y == get(cx_c) ) ;
+  BOOST_CHECK ( y == boost::get(cx_c) ) ;
-  #ifdef PRODUCE_ERROR_3
+#endif
  get(cx_c) = z ; // this should produce an ERROR
  #endif
 }
 int test_main(int, char **)
--- a/value_init_test_fail1.cpp
+++ b/value_init_test_fail1.cpp
@@ -0,0 +1,37 @@
 // (C) 2002, Fernando Luis Cacciola Carballal.
 //
 // Distributed under the Boost Software License, Version 1.0. (See
 // accompanying file LICENSE_1_0.txt or copy at
 // http://www.boost.org/LICENSE_1_0.txt)
 //
 // Test program for "boost/utility/value_init.hpp"
 //
 // Initial: 21 Agu 2002
 #include <iostream>
 #include <string>
 #include "boost/utility/value_init.hpp"
 #ifdef __BORLANDC__
 #pragma hdrstop
 #endif
 #include "boost/test/minimal.hpp"
 int test_main(int, char **)
 {
  boost::value_initialized<int> const x_c ;
  get(x_c) = 1234 ; // this should produce an ERROR
  return 0;
 }
 unsigned int expected_failures = 0;
--- a/value_init_test_fail2.cpp
+++ b/value_init_test_fail2.cpp
@@ -0,0 +1,36 @@
 // (C) 2002, Fernando Luis Cacciola Carballal.
 //
 // Distributed under the Boost Software License, Version 1.0. (See
 // accompanying file LICENSE_1_0.txt or copy at
 // http://www.boost.org/LICENSE_1_0.txt)
 //
 // Test program for "boost/utility/value_init.hpp"
 //
 // Initial: 21 Agu 2002
 #include <iostream>
 #include <string>
 #include "boost/utility/value_init.hpp"
 #ifdef __BORLANDC__
 #pragma hdrstop
 #endif
 #include "boost/test/minimal.hpp"
 int test_main(int, char **)
 {
  boost::value_initialized<int const> cx ;
  get(cx) = 1234 ; // this should produce an ERROR
  return 0;
 }
 unsigned int expected_failures = 0;
--- a/value_init_test_fail3.cpp
+++ b/value_init_test_fail3.cpp
@@ -0,0 +1,37 @@
 // (C) 2002, Fernando Luis Cacciola Carballal.
 //
 // Distributed under the Boost Software License, Version 1.0. (See
 // accompanying file LICENSE_1_0.txt or copy at
 // http://www.boost.org/LICENSE_1_0.txt)
 //
 // Test program for "boost/utility/value_init.hpp"
 //
 // Initial: 21 Agu 2002
 #include <iostream>
 #include <string>
 #include "boost/utility/value_init.hpp"
 #ifdef __BORLANDC__
 #pragma hdrstop
 #endif
 #include "boost/test/minimal.hpp"
 int test_main(int, char **)
 {
  boost::value_initialized<int const> const cx_c ;
  get(cx_c) = 1234 ; // this should produce an ERROR
  return 0;
 }
 unsigned int expected_failures = 0;
Author	SHA1	Message	Date
nobody	efce512ea4	This commit was manufactured by cvs2svn to create tag 'Version_1_33_1'. [SVN r31916]	2005-12-05 14:04:06 +00:00
Douglas Gregor	59f15390a9	Clean up a whole lot of bad links [SVN r31851]	2005-12-01 04:52:04 +00:00
Douglas Gregor	dd80a4f8ec	Work around weird GCC 4.0.2 ICEs [SVN r31780]	2005-11-25 22:21:44 +00:00
Douglas Gregor	2a50eba072	Try to make enable_if tests appear [SVN r31065]	2005-09-20 23:33:28 +00:00
Jonathan Turkanis	1770e47f97	fixed broken links [SVN r30431]	2005-08-03 21:42:39 +00:00
Dave Abrahams	d4f4893ee1	merged from trunk [SVN r30404]	2005-08-03 13:03:27 +00:00
Dave Abrahams	23ec8fc788	merged from trunk [SVN r30402]	2005-08-03 12:26:12 +00:00
nobody	3ab8d14a59	This commit was manufactured by cvs2svn to create branch 'RC_1_33_0'. [SVN r30300]	2005-07-28 18:22:24 +00:00
Dave Abrahams	9f10fc03ce	More Parameter library reference edits [SVN r30276]	2005-07-28 04:19:28 +00:00
Dave Abrahams	84fbb3c896	Fix mis-nested namespace scope/#ifdef [SVN r30159]	2005-07-18 18:50:47 +00:00
Douglas Gregor	865c707756	BOOST_NO_RESULT_OF support [SVN r30040]	2005-07-13 12:35:37 +00:00
Markus Schöpflin	871f3a6779	Don't use the self contained include files for boost.test as this test is linked with the boost.test library. We end up with multiple defined symbols, otherwise. [SVN r29559]	2005-06-14 13:46:20 +00:00
John Maddock	aaca5ca871	Updated Borland workaround. [SVN r29462]	2005-06-07 09:44:19 +00:00
Dave Abrahams	5a4e19989f	Workaround for nonconformance to CWG issue 298, checked in on behalf of John Maddock [SVN r29415]	2005-06-03 19:11:54 +00:00
John Maddock	6ea398c446	Make it clear that POD's are not zero initialised. [SVN r29254]	2005-05-28 11:51:04 +00:00
Douglas Gregor	1bd83d43e8	Improvements in type_traits have gotten MSVC 7.0 and prior down to 12 failures here [SVN r29170]	2005-05-24 14:53:49 +00:00
Fernando Cacciola	5ca5b4102b	Optional's Assignment fixed [SVN r28412]	2005-04-22 13:28:34 +00:00
Vladimir Prus	aca7699046	Add V2 Jamfile [SVN r28246]	2005-04-14 13:15:46 +00:00
John Maddock	e702a944ca	Fixes to get the tests working with the latest type traits and Boost.Test versions. [SVN r27864]	2005-03-29 11:21:53 +00:00
John Maddock	a157c345ee	Updated is_convertible test cases to check polymorphic-type conversions. Added more test types to testing header. Changed utility code to use new test header. [SVN r27807]	2005-03-24 18:20:18 +00:00
Peter Dimov	dcb2dd4736	Removed type_traits include, added more tests [SVN r27712]	2005-03-16 22:02:22 +00:00
Eric Niebler	ae19cd6236	work-around for Borland addressof(array) bug and associated tests [SVN r27656]	2005-03-14 23:03:42 +00:00
Rene Rivera	3ab4d38931	Apply typo fixes from Julio M. Merino Vidal [SVN r27513]	2005-02-27 17:28:24 +00:00
Fernando Cacciola	18c7fb72b5	ADL problem (with VC7.1) fixed [SVN r27495]	2005-02-24 16:04:49 +00:00
Beman Dawes	6bb092a9b1	Add comment explaining use of assert.h [SVN r27473]	2005-02-21 12:32:20 +00:00
Stefan Slapeta	f721b8b28c	replaced BOOST_TEST [SVN r27054]	2005-02-03 13:48:49 +00:00
Aleksey Gurtovoy	e5ba34472d	merge RC_1_32_0 fixes [SVN r26333]	2004-11-28 04:44:21 +00:00
Aleksey Gurtovoy	082ae17eaf	merge RC_1_32_0 fixes [SVN r26328]	2004-11-28 03:35:12 +00:00
Aleksey Gurtovoy	dd86e09ab4	merge RC_1_32_0 tab fixes [SVN r26327]	2004-11-28 03:27:25 +00:00
Daniel Frey	baff23116e	Fixed link to function_output_iterator [SVN r25949]	2004-10-29 19:19:20 +00:00
Aleksey Gurtovoy	e549baf93a	move enable_if tests into their own subdirectory [SVN r25649]	2004-10-10 16:15:58 +00:00
Fernando Cacciola	30d46adcb7	bad links fixed added myself to people [SVN r25610]	2004-10-07 16:01:24 +00:00
Aleksey Gurtovoy	e854726be0	c++boost.gif -> boost.png replacement [SVN r25573]	2004-10-05 15:45:52 +00:00
Joaquín M. López Muñoz	d198bd9d96	added explicit return to main [SVN r25387]	2004-09-24 06:17:26 +00:00
Fernando Cacciola	5eb23cecd0	In-place factories moved from /detail to /utility New value_initalized tests added [SVN r25377]	2004-09-23 17:03:54 +00:00
Joaquín M. López Muñoz	eff2c75bba	taken care of BOOST_NO_STDC_NAMESPACE [SVN r25345]	2004-09-22 17:18:06 +00:00
Fernando Cacciola	325bd73df7	In-place factories moved from /detail to /utility New value_initalized tests added [SVN r25313]	2004-09-21 14:54:32 +00:00
Fernando Cacciola	0fcc554abd	Initial commit [SVN r25178]	2004-09-17 16:53:57 +00:00
John Maddock	b685784155	Added new types boost::long_long_type and boost::ulong_long_type in boost/config.hpp and applied these types in place of "long long" throughout. As a result, almost all of boost now compiles cleanly with -ansi -pedantic with gcc. Changes tested with gcc 3.3, 2.95, VC7.1 and Intel 8. [SVN r24899]	2004-09-04 10:34:49 +00:00
Aleksey Gurtovoy	ac90fdc611	merge new MPL version from 'mplbook' branch [SVN r24874]	2004-09-02 15:41:37 +00:00
Fernando Cacciola	51077e49f5	Fixed CW problems and refactored fail cases [SVN r24870]	2004-09-02 13:19:50 +00:00
Fernando Cacciola	0c3199f72d	Added my long name [SVN r24869]	2004-09-02 12:59:42 +00:00
Dave Abrahams	62675a3bcd	added copyright/license [SVN r24814]	2004-08-30 01:31:40 +00:00
Daryle Walker	c26dbaa620	Updated copyright year list, since the interface changed [SVN r24801]	2004-08-28 20:51:19 +00:00
Daryle Walker	8201624959	Moved a template argument default for base_from_member to primary header; removed forwarding header as it's not needed anymore [SVN r24800]	2004-08-28 20:46:17 +00:00
Daryle Walker	f2116413d6	Changed constructor templates to be generated with the Preprocessor library; added a control macro for the maximum constructor argument length [SVN r24799]	2004-08-28 20:24:17 +00:00
Dave Abrahams	b0baebeb0a	fix noncopyable, finally [SVN r24618]	2004-08-20 17:17:06 +00:00
Douglas Gregor	fb943b77d5	License updates [SVN r24597]	2004-08-19 15:19:17 +00:00
Dave Abrahams	b4b39510fc	ADL protection [SVN r24595]	2004-08-19 13:12:35 +00:00
Aleksey Gurtovoy	6f0f05ba12	remove forward declaration for noncopyable [SVN r24578]	2004-08-19 02:31:29 +00:00
Dave Abrahams	f0b64b6229	ADL protection [SVN r24564]	2004-08-18 17:01:11 +00:00
Dave Abrahams	4229488989	Added redirection to fix old links. [SVN r24558]	2004-08-18 13:55:35 +00:00
John Maddock	acd2e6ef2b	Added Daryle Walker's copyrights as requested. [SVN r24481]	2004-08-15 10:13:49 +00:00
Douglas Gregor	c26aaed71f	Moved to BSL [SVN r24446]	2004-08-12 17:13:07 +00:00
John Maddock	326d7ad4d7	Removed boost.org copyright assignments, and reverted to orginal author (as based on cvs history). [SVN r24402]	2004-08-11 10:59:33 +00:00
Douglas Gregor	c76a2f4aab	Add my license info [SVN r24373]	2004-08-10 13:57:30 +00:00
John Maddock	d8b0ff2d7e	Removed Boost.org copyrights and replaced with originating authors copyright instead. [SVN r24372]	2004-08-10 12:53:34 +00:00
John Maddock	996ce2d307	Updated Beman Dawes' licence statement to use the new prefered form of words. [SVN r24370]	2004-08-10 10:34:20 +00:00
Douglas Gregor	167fa4154f	Eliminated unreviewed, unused, noncompiling code [SVN r24314]	2004-08-05 18:57:39 +00:00
Stefan Slapeta	0c7e7c3c39	half_open_range_test removed [SVN r24313]	2004-08-05 18:46:55 +00:00
Stefan Slapeta	9d8f8f41dc	Include for test library fixed [SVN r24299]	2004-08-05 09:23:05 +00:00
Aleksey Gurtovoy	39c4445b39	add missing tests, reorder tests by filename [SVN r24216]	2004-08-01 05:40:21 +00:00
Douglas Gregor	7819b022ad	License update [SVN r24180]	2004-07-30 04:46:56 +00:00
Douglas Gregor	65d27e7f86	License update [SVN r24175]	2004-07-30 01:47:08 +00:00
Douglas Gregor	212a70bf77	Remove "and" from copyright [SVN r24167]	2004-07-29 15:50:36 +00:00
Douglas Gregor	6b5dc18a46	Converted to Boost Software License, Version 1.0 [SVN r24096]	2004-07-27 03:43:34 +00:00
Douglas Gregor	0917f83b9c	Converted to Boost Software License, Version 1.0 [SVN r24055]	2004-07-26 00:32:12 +00:00
Douglas Gregor	7322bd3903	License update [SVN r24048]	2004-07-25 19:13:06 +00:00
Douglas Gregor	e998010184	Add license [SVN r24021]	2004-07-25 03:57:20 +00:00
Douglas Gregor	918a1c93e4	Doug Gregor -> Douglas Gregor [SVN r24016]	2004-07-25 02:29:29 +00:00
Douglas Gregor	14c87853c2	Needed to include cstddef to get std::size_t [SVN r24000]	2004-07-23 18:42:30 +00:00
		`@@ -0,0 +1 @@`
							`The existance of this file tells the regression reporting programs that the directory contains sub-directories which are libraries.`