Change absolute URL's to relative

[SVN r10594]
This commit is contained in:
Beman Dawes 2001-07-12 15:31:15 +00:00
parent 9f3104166f
commit 37f476013d
4 changed files with 60 additions and 14 deletions

View File

@ -85,7 +85,7 @@ Once that is done we can drop Multi-Pass Input Iterator.
<TABLE> <TABLE>
<TR valign=top> <TR valign=top>
<TD nowrap>Copyright &copy 2000</TD><TD> <TD nowrap>Copyright &copy 2000</TD><TD>
<A HREF=http://www.boost.org/people/jeremy_siek.htm>Jeremy Siek</A>, Univ.of Notre Dame (<A HREF="mailto:jsiek@lsc.nd.edu">jsiek@lsc.nd.edu</A>) <A HREF=file:///c:/boost/site/people/jeremy_siek.htm>Jeremy Siek</A>, Univ.of Notre Dame (<A HREF="mailto:jsiek@lsc.nd.edu">jsiek@lsc.nd.edu</A>)
</TD></TR></TABLE> </TD></TR></TABLE>
</BODY> </BODY>

View File

@ -1,8 +1,8 @@
// boost utility.hpp header file -------------------------------------------// // boost utility.hpp header file -------------------------------------------//
// (C) Copyright boost.org 1999. Permission to copy, use, modify, sell // (C) Copyright boost.org 1999-2001. Permission to copy, use, modify, sell
// and distribute this software is granted provided this copyright // and distribute this software is granted provided this copyright
// notice appears in all copies. This software is provided "as is" without // 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 // express or implied warranty, and with no claim as to its suitability for
// any purpose. // any purpose.
@ -11,6 +11,7 @@
// Classes appear in alphabetical order // Classes appear in alphabetical order
// Revision History // Revision History
// 29 May 01 Ron's member idiom base class templates added (Daryle Walker)
// 21 May 01 checked_delete() and checked_array_delete() added (Beman Dawes, // 21 May 01 checked_delete() and checked_array_delete() added (Beman Dawes,
// suggested by Dave Abrahams, generalizing idea from Vladimir Prus) // suggested by Dave Abrahams, generalizing idea from Vladimir Prus)
// 21 May 01 made next() and prior() inline (Beman Dawes) // 21 May 01 made next() and prior() inline (Beman Dawes)
@ -25,10 +26,8 @@
#ifndef BOOST_UTILITY_HPP #ifndef BOOST_UTILITY_HPP
#define BOOST_UTILITY_HPP #define BOOST_UTILITY_HPP
#include <boost/config.hpp> // broken compiler workarounds #include <boost/static_assert.hpp> // for BOOST_STATIC_ASSERT
#include <boost/static_assert.hpp> #include <utility> // for std::pair
#include <cstddef> // for size_t
#include <utility> // for std::pair
namespace boost namespace boost
{ {
@ -87,10 +86,58 @@ namespace boost
const noncopyable& operator=( const noncopyable& ); const noncopyable& operator=( const noncopyable& );
}; // noncopyable }; // noncopyable
// class tied -------------------------------------------------------//
// Ron's member idiom base class templates ---------------------------------//
// Helpers to initialize a base object so a derived class can use this
// object in the initialization of another base class. Used by
// Dietmar Kuehl from ideas by Ron Klatcho to solve the problem of a
// base class needing to be initialized by a member.
// Contributed by Daryle Walker
template < typename MemberType, int UniqueID = 0 >
class nullary_rons_member
{
protected:
nullary_rons_member()
: ron_()
{}
MemberType ron_;
}; // nullary_rons_member
template < typename MemberType, typename InitializerType, int UniqueID = 0 >
class unary_rons_member
{
protected:
explicit unary_rons_member( InitializerType x )
: ron_( x )
{}
MemberType ron_;
}; // unary_rons_member
template < typename MemberType, typename InitializerType1,
typename InitializerType2, int UniqueID = 0 >
class binary_rons_member
{
protected:
binary_rons_member( InitializerType1 x, InitializerType2 y )
: ron_( x, y )
{}
MemberType ron_;
}; // binary_rons_member
// class tied --------------------------------------------------------------//
// A helper for conveniently assigning the two values from a pair // A helper for conveniently assigning the two values from a pair
// into separate variables. The idea for this comes from Jaakko J„rvi's // into separate variables. The idea for this comes from Jaakko JŠrvi's
// Binder/Lambda Library. // Binder/Lambda Library.
// Constributed by Jeremy Siek // Constributed by Jeremy Siek
@ -116,4 +163,3 @@ namespace boost
} // namespace boost } // namespace boost
#endif // BOOST_UTILITY_HPP #endif // BOOST_UTILITY_HPP

View File

@ -93,7 +93,7 @@
<a href="function_output_iterator.htm">Function Output Iterator Adaptor</a> <a href="function_output_iterator.htm">Function Output Iterator Adaptor</a>
</ul> </ul>
<p><b><a href="http://www.boost.org/people/dave_abrahams.htm">Dave <p><b><a href="file:///c:/boost/site/people/dave_abrahams.htm">Dave
Abrahams</a></b> started the library, applying <a href= Abrahams</a></b> started the library, applying <a href=
"../../more/generic_programming.html#policy">policy class</a> technique and "../../more/generic_programming.html#policy">policy class</a> technique and
handling const/non-const iterator interactions. He also contributed the handling const/non-const iterator interactions. He also contributed the
@ -102,7 +102,7 @@
<tt><a href="counting_iterator.htm">counting_iterator_generator</a></tt> to <tt><a href="counting_iterator.htm">counting_iterator_generator</a></tt> to
cover all incrementable types. He edited most of the documentation, cover all incrementable types. He edited most of the documentation,
sometimes heavily.<br> sometimes heavily.<br>
<b><a href="http://www.boost.org/people/jeremy_siek.htm">Jeremy <b><a href="file:///c:/boost/site/people/jeremy_siek.htm">Jeremy
Siek</a></b> contributed the <a href="transform_iterator.htm">transform Siek</a></b> contributed the <a href="transform_iterator.htm">transform
iterator</a> adaptor, the integer-only version of <tt><a href= iterator</a> adaptor, the integer-only version of <tt><a href=
"counting_iterator.htm">counting_iterator_generator</a></tt>, "counting_iterator.htm">counting_iterator_generator</a></tt>,
@ -860,7 +860,7 @@ bool operator==(const iterator_adaptor&lt;B1,P,V1,R1,P1,C,D&gt;&amp;,
<hr> <hr>
<p>Revised <p>Revised
<!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %b %Y" startspan -->19 Mar 2001<!--webbot bot="Timestamp" endspan i-checksum="14895" --> <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %b %Y" startspan -->12 Jul 2001<!--webbot bot="Timestamp" endspan i-checksum="14985" -->
<p>&copy; Copyright Dave Abrahams and Jeremy Siek 2001. Permission to copy, <p>&copy; Copyright Dave Abrahams and Jeremy Siek 2001. Permission to copy,

View File

@ -126,7 +126,7 @@ The output is:
<TABLE> <TABLE>
<TR valign=top> <TR valign=top>
<TD nowrap>Copyright &copy 2000</TD><TD> <TD nowrap>Copyright &copy 2000</TD><TD>
<A HREF=http://www.boost.org/people/jeremy_siek.htm>Jeremy Siek</A>, <A HREF=file:///c:/boost/site/people/jeremy_siek.htm>Jeremy Siek</A>,
Univ.of Notre Dame (<A Univ.of Notre Dame (<A
HREF="mailto:jsiek@lsc.nd.edu">jsiek@lsc.nd.edu</A>)<br> HREF="mailto:jsiek@lsc.nd.edu">jsiek@lsc.nd.edu</A>)<br>
<A HREF=http://www.lsc.nd.edu/~llee1>Lie-Quan Lee</A>, Univ.of Notre Dame (<A HREF="mailto:llee1@lsc.nd.edu">llee1@lsc.nd.edu</A>)<br> <A HREF=http://www.lsc.nd.edu/~llee1>Lie-Quan Lee</A>, Univ.of Notre Dame (<A HREF="mailto:llee1@lsc.nd.edu">llee1@lsc.nd.edu</A>)<br>