|
Boost-Commit : |
Subject: [Boost-commit] svn:boost r51703 - in branches/release/libs: . smart_ptr
From: fmhess_at_[hidden]
Date: 2009-03-11 11:08:14
Author: fmhess
Date: 2009-03-11 11:08:14 EDT (Wed, 11 Mar 2009)
New Revision: 51703
URL: http://svn.boost.org/trac/boost/changeset/51703
Log:
Merged [51699] and [51700] from trunk to release.
Closes #1897
Added:
branches/release/libs/smart_ptr/make_shared.html
- copied unchanged from r51700, /trunk/libs/smart_ptr/make_shared.html
Text files modified:
branches/release/libs/libraries.htm | 2
branches/release/libs/smart_ptr/shared_ptr.htm | 309 ++++++++++++++++++++-------------------
branches/release/libs/smart_ptr/smart_ptr.htm | 159 +++++++++++---------
3 files changed, 243 insertions(+), 227 deletions(-)
Modified: branches/release/libs/libraries.htm
==============================================================================
--- branches/release/libs/libraries.htm (original)
+++ branches/release/libs/libraries.htm 2009-03-11 11:08:14 EDT (Wed, 11 Mar 2009)
@@ -244,7 +244,7 @@
- Serialization for persistence and marshalling, from Robert Ramey</li>
<li>signals - managed signals &
slots callback implementation, from Doug Gregor.</li>
- <li>smart_ptr - Five smart
+ <li>smart_ptr - Six smart
pointer class templates, from Greg Colvin, Beman Dawes,
Peter Dimov, and Darin Adler.</li>
<li>statechart - Arbitrarily
Modified: branches/release/libs/smart_ptr/shared_ptr.htm
==============================================================================
--- branches/release/libs/smart_ptr/shared_ptr.htm (original)
+++ branches/release/libs/smart_ptr/shared_ptr.htm 2009-03-11 11:08:14 EDT (Wed, 11 Mar 2009)
@@ -19,54 +19,54 @@
<A href="smarttests.htm">Smart Pointer Timings</A><br>
<A href="sp_techniques.html">Programming Techniques</A></p>
<h2><a name="Introduction">Introduction</a></h2>
- <p>The <b>shared_ptr</b> class template stores a pointer to a dynamically allocated
- object, typically with a C++ <EM>new-expression</EM>. The object pointed to is
- guaranteed to be deleted when the last <b>shared_ptr</b> pointing to it is
+ <p>The <b>shared_ptr</b> class template stores a pointer to a dynamically allocated
+ object, typically with a C++ <EM>new-expression</EM>. The object pointed to is
+ guaranteed to be deleted when the last <b>shared_ptr</b> pointing to it is
destroyed or reset. See the example.</p>
- <p>Every <b>shared_ptr</b> meets the <b>CopyConstructible</b> and <b>Assignable</b>
- requirements of the C++ Standard Library, and so can be used in standard
- library containers. Comparison operators are supplied so that <b>shared_ptr</b>
+ <p>Every <b>shared_ptr</b> meets the <b>CopyConstructible</b> and <b>Assignable</b>
+ requirements of the C++ Standard Library, and so can be used in standard
+ library containers. Comparison operators are supplied so that <b>shared_ptr</b>
works with the standard library's associative containers.</p>
- <p>Normally, a <b>shared_ptr</b> cannot correctly hold a pointer to a dynamically
- allocated array. See shared_array for
+ <p>Normally, a <b>shared_ptr</b> cannot correctly hold a pointer to a dynamically
+ allocated array. See shared_array for
that usage.</p>
- <p>Because the implementation uses reference counting, cycles of <b>shared_ptr</b> instances
+ <p>Because the implementation uses reference counting, cycles of <b>shared_ptr</b> instances
will not be reclaimed. For example, if <b>main()</b> holds a <b>shared_ptr</b> to
<b>A</b>, which directly or indirectly holds a <b>shared_ptr</b> back to <b>A</b>,
- <b>A</b>'s use count will be 2. Destruction of the original <b>shared_ptr</b> will
+ <b>A</b>'s use count will be 2. Destruction of the original <b>shared_ptr</b> will
leave <b>A</b> dangling with a use count of 1. Use weak_ptr
to "break cycles."</p>
- <p>The class template is parameterized on <b>T</b>, the type of the object pointed
- to. <STRONG>shared_ptr</STRONG> and most of its member functions place no
+ <p>The class template is parameterized on <b>T</b>, the type of the object pointed
+ to. <STRONG>shared_ptr</STRONG> and most of its member functions place no
requirements on <STRONG>T</STRONG>; it is allowed to be an incomplete type, or <STRONG>
void</STRONG>. Member functions that do place additional requirements (constructors,
<A href="#reset">reset</A>) are explicitly documented below.</p>
<P><STRONG>shared_ptr<T></STRONG> can be implicitly converted to <STRONG>shared_ptr<U></STRONG>
- whenever <STRONG>T*</STRONG> can be implicitly converted to <STRONG>U*</STRONG>.
- In particular, <STRONG>shared_ptr<T></STRONG> is implicitly convertible
+ whenever <STRONG>T*</STRONG> can be implicitly converted to <STRONG>U*</STRONG>.
+ In particular, <STRONG>shared_ptr<T></STRONG> is implicitly convertible
to <STRONG>shared_ptr<T const></STRONG>, to <STRONG>shared_ptr<U></STRONG>
where <STRONG>U</STRONG> is an accessible base of <STRONG>T</STRONG>, and to <STRONG>
shared_ptr<void></STRONG>.</P>
- <P><STRONG>shared_ptr</STRONG> is now part of <STRONG>TR1</STRONG>, the first C++
- Library Technical Report. The latest draft of <STRONG>TR1</STRONG> is available
+ <P><STRONG>shared_ptr</STRONG> is now part of <STRONG>TR1</STRONG>, the first C++
+ Library Technical Report. The latest draft of <STRONG>TR1</STRONG> is available
at the following location:</P>
<P>http://www.open-std.org/JTC1/SC22/WG21/docs/papers/2005/n1745.pdf
(1.36Mb PDF)</P>
- <P>This implementation conforms to the TR1 specification, with the only exception
+ <P>This implementation conforms to the TR1 specification, with the only exception
that it resides in namespace <code>boost</code> instead of <code>std::tr1</code>.</P>
<h2><a name="BestPractices">Best Practices</a></h2>
- <P>A simple guideline that nearly eliminates the possibility of memory leaks is:
+ <P>A simple guideline that nearly eliminates the possibility of memory leaks is:
always use a named smart pointer variable to hold the result of <STRONG>new. </STRONG>
- Every occurence of the <STRONG>new</STRONG> keyword in the code should have the
+ Every occurence of the <STRONG>new</STRONG> keyword in the code should have the
form:</P>
<PRE>shared_ptr<T> p(new Y);</PRE>
<P>It is, of course, acceptable to use another smart pointer in place of <STRONG>shared_ptr</STRONG>
- above; having <STRONG>T</STRONG> and <STRONG>Y</STRONG> be the same type, or
+ above; having <STRONG>T</STRONG> and <STRONG>Y</STRONG> be the same type, or
passing arguments to <STRONG>Y</STRONG>'s constructor is also OK.</P>
- <P>If you observe this guideline, it naturally follows that you will have no
- explicit <STRONG>delete</STRONG>s; <STRONG>try/catch</STRONG> constructs will
+ <P>If you observe this guideline, it naturally follows that you will have no
+ explicit <STRONG>delete</STRONG>s; <STRONG>try/catch</STRONG> constructs will
be rare.</P>
- <P>Avoid using unnamed <STRONG>shared_ptr</STRONG> temporaries to save typing; to
+ <P>Avoid using unnamed <STRONG>shared_ptr</STRONG> temporaries to save typing; to
see why this is dangerous, consider this example:</P>
<PRE>void f(shared_ptr<int>, int);
int g();
@@ -83,13 +83,18 @@
}
</PRE>
<P>The function <STRONG>ok</STRONG> follows the guideline to the letter, whereas <STRONG>
- bad</STRONG> constructs the temporary <STRONG>shared_ptr</STRONG> in place,
- admitting the possibility of a memory leak. Since function arguments are
- evaluated in unspecified order, it is possible for <STRONG>new int(2)</STRONG> to
+ bad</STRONG> constructs the temporary <STRONG>shared_ptr</STRONG> in place,
+ admitting the possibility of a memory leak. Since function arguments are
+ evaluated in unspecified order, it is possible for <STRONG>new int(2)</STRONG> to
be evaluated first, <STRONG>g()</STRONG> second, and we may never get to the <STRONG>
- shared_ptr </STRONG>constructor if <STRONG>g</STRONG> throws an exception.
+ shared_ptr </STRONG>constructor if <STRONG>g</STRONG> throws an exception.
See Herb Sutter's treatment (also <A href="http://www.cuj.com/reference/articles/2002/0212/0212_sutter.htm">
here</A>) of the issue for more information.</P>
+ <P>The exception safety problem described above may also be eliminated by using
+ the make_shared
+ or allocate_shared
+ factory functions defined in boost/make_shared.hpp. These factory functions also provide
+ an efficiency benefit by consolidating allocations.<P>
<h2><a name="Synopsis">Synopsis</a></h2>
<pre>namespace boost {
@@ -115,7 +120,7 @@
template<class Y> explicit shared_ptr(weak_ptr<Y> const & r);
template<class Y> explicit shared_ptr(std::auto_ptr<Y> & r);
- shared_ptr & operator=(shared_ptr const & r); // never throws
+ shared_ptr & operator=(shared_ptr const & r); // never throws
template<class Y> shared_ptr & operator=(shared_ptr<Y> const & r); // never throws
template<class Y> shared_ptr & operator=(std::auto_ptr<Y> & r);
@@ -178,32 +183,32 @@
<p><b>Postconditions:</b> <code>use_count() == 0 && get() == 0</code>.</p>
<p><b>Throws:</b> nothing.</p>
</blockquote>
- <P><EM>[The nothrow guarantee is important, since <STRONG>reset()</STRONG> is specified
- in terms of the default constructor; this implies that the constructor must not
+ <P><EM>[The nothrow guarantee is important, since <STRONG>reset()</STRONG> is specified
+ in terms of the default constructor; this implies that the constructor must not
allocate memory.]</EM></P>
<pre>template<class Y> explicit shared_ptr(Y * p);</pre>
<blockquote>
<p><b>Requirements:</b> <b>p</b> must be convertible to <b>T *</b>. <STRONG>Y</STRONG>
- must be a complete type. The expression <code>delete p</code> must be
+ must be a complete type. The expression <code>delete p</code> must be
well-formed, must not invoke undefined behavior, and must not throw exceptions.
</p>
<p><b>Effects:</b> Constructs a <b>shared_ptr</b> that <EM>owns</EM> the pointer <b>p</b>.</p>
<p><b>Postconditions:</b> <code>use_count() == 1 && get() == p</code>.</p>
- <p><b>Throws:</b> <STRONG>std::bad_alloc</STRONG>, or an implementation-defined
+ <p><b>Throws:</b> <STRONG>std::bad_alloc</STRONG>, or an implementation-defined
exception when a resource other than memory could not be obtained.</p>
- <p><b>Exception safety:</b> If an exception is thrown, <code>delete p</code> is
+ <p><b>Exception safety:</b> If an exception is thrown, <code>delete p</code> is
called.</p>
- <P><STRONG>Notes:</STRONG> <B>p</B> must be a pointer to an object that was
+ <P><STRONG>Notes:</STRONG> <B>p</B> must be a pointer to an object that was
allocated via a C++ <B>new</B> expression or be 0. The postcondition that <A href="#use_count">
use count</A> is 1 holds even if <b>p</b> is 0; invoking <STRONG>delete</STRONG>
on a pointer that has a value of 0 is harmless.</P>
</blockquote>
- <P><EM>[This constructor has been changed to a template in order to remember the actual
- pointer type passed. The destructor will call <STRONG>delete</STRONG> with the
- same pointer, complete with its original type, even when <STRONG>T</STRONG> does
+ <P><EM>[This constructor has been changed to a template in order to remember the actual
+ pointer type passed. The destructor will call <STRONG>delete</STRONG> with the
+ same pointer, complete with its original type, even when <STRONG>T</STRONG> does
not have a virtual destructor, or is <STRONG>void</STRONG>.</EM></P>
- <P><EM>The optional intrusive counting support has been dropped as it exposes too much
- implementation details and doesn't interact well with <STRONG>weak_ptr</STRONG>.
+ <P><EM>The optional intrusive counting support has been dropped as it exposes too much
+ implementation details and doesn't interact well with <STRONG>weak_ptr</STRONG>.
The current implementation uses a different mechanism, <A href="enable_shared_from_this.html">
enable_shared_from_this</A>, to solve the "<STRONG>shared_ptr</STRONG> from <STRONG>
this</STRONG>" problem.</EM><EM>]</EM></P>
@@ -212,46 +217,46 @@
template<class Y, class D, class A> shared_ptr(Y * p, D d, A a);</pre>
<blockquote>
<p><b>Requirements:</b> <B>p</B> must be convertible to <B>T *</B>. <STRONG>D</STRONG>
- must be <STRONG>CopyConstructible</STRONG>. The copy constructor and destructor
- of <b>D</b> must not throw. The expression <code>d(p)</code> must be
+ must be <STRONG>CopyConstructible</STRONG>. The copy constructor and destructor
+ of <b>D</b> must not throw. The expression <code>d(p)</code> must be
well-formed, must not invoke undefined behavior, and must not throw exceptions. <STRONG>
- A</STRONG> must be an <EM>Allocator</EM>, as described in section 20.1.5 (<STRONG>Allocator
+ A</STRONG> must be an <EM>Allocator</EM>, as described in section 20.1.5 (<STRONG>Allocator
requirements</STRONG>) of the C++ Standard.
</p>
<p><b>Effects:</b> Constructs a <b>shared_ptr</b> that <EM>owns</EM> the pointer <STRONG>
- p</STRONG> and the deleter <b>d</b>. The second constructor allocates
+ p</STRONG> and the deleter <b>d</b>. The second constructor allocates
memory using a copy of <STRONG>a</STRONG>.</p>
<p><b>Postconditions:</b> <code>use_count() == 1 && get() == p</code>.</p>
- <p><b>Throws:</b> <STRONG>std::bad_alloc</STRONG>, or an implementation-defined
+ <p><b>Throws:</b> <STRONG>std::bad_alloc</STRONG>, or an implementation-defined
exception when a resource other than memory could not be obtained.</p>
<p><b>Exception safety:</b> If an exception is thrown, <code>d(p)</code> is called.</p>
- <p><b>Notes:</b> When the the time comes to delete the object pointed to by <b>p</b>,
+ <p><b>Notes:</b> When the the time comes to delete the object pointed to by <b>p</b>,
the stored copy of <STRONG>d</STRONG> is invoked with the stored copy of <STRONG>p</STRONG>
as an argument.</p>
</blockquote>
<P><EM>[Custom deallocators allow a factory function returning a <STRONG>shared_ptr</STRONG>
- to insulate the user from its memory allocation strategy. Since the deallocator
- is not part of the type, changing the allocation strategy does not break source
- or binary compatibility, and does not require a client recompilation. For
+ to insulate the user from its memory allocation strategy. Since the deallocator
+ is not part of the type, changing the allocation strategy does not break source
+ or binary compatibility, and does not require a client recompilation. For
example, a "no-op" deallocator is useful when returning a <STRONG>shared_ptr</STRONG>
to a statically allocated object, and other variations allow a <STRONG>shared_ptr</STRONG>
to be used as a wrapper for another smart pointer, easing interoperability.</EM></P>
<P><EM>The support for custom deallocators does not impose significant overhead. Other <STRONG>
shared_ptr</STRONG> features still require a deallocator to be kept.</EM></P>
- <P><EM>The requirement that the copy constructor of <b>D</b> does not throw comes from
- the pass by value. If the copy constructor throws, the pointer is leaked.
+ <P><EM>The requirement that the copy constructor of <b>D</b> does not throw comes from
+ the pass by value. If the copy constructor throws, the pointer is leaked.
Removing the requirement requires a pass by (const) reference.</EM></P>
- <P><EM>The main problem with pass by reference lies in its interaction with rvalues. A
- const reference may still cause a copy, and will require a const operator(). A
- non-const reference won't bind to an rvalue at all. A good solution to this
+ <P><EM>The main problem with pass by reference lies in its interaction with rvalues. A
+ const reference may still cause a copy, and will require a const operator(). A
+ non-const reference won't bind to an rvalue at all. A good solution to this
problem is the rvalue reference proposed in <A href="http://std.dkuug.dk/jtc1/sc22/wg21/docs/papers/2002/n1377.htm">
N1377</A>/N1385.]</EM></P>
<pre>shared_ptr(shared_ptr const & r); // never throws
template<class Y> shared_ptr(shared_ptr<Y> const & r); // never throws</pre>
<blockquote>
- <p><b>Effects:</b> If <b>r</b> is <EM>empty</EM>, constructs an <EM>empty</EM> <b>shared_ptr</b>;
+ <p><b>Effects:</b> If <b>r</b> is <EM>empty</EM>, constructs an <EM>empty</EM> <b>shared_ptr</b>;
otherwise, constructs a <b>shared_ptr</b> that <EM>shares ownership</EM> with <b>r</b>.</p>
- <p><b>Postconditions:</b> <code>get() == r.get() && use_count() ==
+ <p><b>Postconditions:</b> <code>get() == r.get() && use_count() ==
r.use_count()</code>.</p>
<p><b>Throws:</b> nothing.</p>
</blockquote>
@@ -268,21 +273,21 @@
<b>r</b> and stores a copy of the pointer stored in <STRONG>r</STRONG>.</p>
<p><b>Postconditions:</b> <code>use_count() == r.use_count()</code>.</p>
<p><b>Throws:</b> <b>bad_weak_ptr</b> when <code>r.use_count() == 0</code>.</p>
- <p><b>Exception safety:</b> If an exception is thrown, the constructor has no
+ <p><b>Exception safety:</b> If an exception is thrown, the constructor has no
effect.</p>
</blockquote>
<pre>template<class Y> shared_ptr(std::auto_ptr<Y> & r);</pre>
<BLOCKQUOTE>
<P><B>Effects:</B> Constructs a <B>shared_ptr</B>, as if by storing a copy of <STRONG>r.release()</STRONG>.</P>
<p><b>Postconditions:</b> <code>use_count() == 1</code>.</p>
- <p><b>Throws:</b> <STRONG>std::bad_alloc</STRONG>, or an implementation-defined
+ <p><b>Throws:</b> <STRONG>std::bad_alloc</STRONG>, or an implementation-defined
exception when a resource other than memory could not be obtained.</p>
- <P><B>Exception safety:</B> If an exception is thrown, the constructor has no
+ <P><B>Exception safety:</B> If an exception is thrown, the constructor has no
effect.</P>
</BLOCKQUOTE>
- <P><EM>[This constructor takes a the source <STRONG>auto_ptr</STRONG> by reference and
- not by value, and cannot accept <STRONG>auto_ptr</STRONG> temporaries. This is
- by design, as the constructor offers the strong guarantee; an rvalue reference
+ <P><EM>[This constructor takes a the source <STRONG>auto_ptr</STRONG> by reference and
+ not by value, and cannot accept <STRONG>auto_ptr</STRONG> temporaries. This is
+ by design, as the constructor offers the strong guarantee; an rvalue reference
would solve this problem, too.]</EM></P>
<h3><a name="destructor">destructor</a></h3>
<pre>~shared_ptr(); // never throws</pre>
@@ -290,15 +295,15 @@
<P><B>Effects:</B></P>
<UL>
<LI>
- If <STRONG>*this</STRONG> is <EM>empty</EM>, or <EM>shares ownership</EM> with
- another <STRONG>shared_ptr</STRONG> instance (<code>use_count() > 1</code>),
+ If <STRONG>*this</STRONG> is <EM>empty</EM>, or <EM>shares ownership</EM> with
+ another <STRONG>shared_ptr</STRONG> instance (<code>use_count() > 1</code>),
there are no side effects.
<LI>
- Otherwise, if <STRONG>*this</STRONG> <EM>owns</EM> a pointer <STRONG>p</STRONG>
+ Otherwise, if <STRONG>*this</STRONG> <EM>owns</EM> a pointer <STRONG>p</STRONG>
and a deleter <STRONG>d</STRONG>, <code>d(p)</code>
is called.
<LI>
- Otherwise, <STRONG>*this</STRONG> <EM>owns</EM> a pointer <STRONG>p</STRONG>,
+ Otherwise, <STRONG>*this</STRONG> <EM>owns</EM> a pointer <STRONG>p</STRONG>,
and <code>delete p</code> is called.</LI></UL>
<P><B>Throws:</B> nothing.</P>
</BLOCKQUOTE>
@@ -309,9 +314,9 @@
<BLOCKQUOTE>
<P><B>Effects:</B> Equivalent to <code>shared_ptr(r).swap(*this)</code>.</P>
<P><B>Returns:</B> <code>*this</code>.</P>
- <P><B>Notes:</B> The use count updates caused by the temporary object construction
- and destruction are not considered observable side effects, and the
- implementation is free to meet the effects (and the implied guarantees) via
+ <P><B>Notes:</B> The use count updates caused by the temporary object construction
+ and destruction are not considered observable side effects, and the
+ implementation is free to meet the effects (and the implied guarantees) via
different means, without creating a temporary. In particular, in the example:</P>
<pre>shared_ptr<int> p(new int);
shared_ptr<void> q(p);
@@ -365,32 +370,32 @@
<blockquote>
<p><b>Returns:</b> <code>use_count() == 1</code>.</p>
<p><b>Throws:</b> nothing.</p>
- <P><B>Notes:</B> <code>unique()</code> may be faster than <code>use_count()</code>.
- If you are using <code>unique()</code> to implement copy on write, do not rely
+ <P><B>Notes:</B> <code>unique()</code> may be faster than <code>use_count()</code>.
+ If you are using <code>unique()</code> to implement copy on write, do not rely
on a specific value when the stored pointer is zero.</P>
</blockquote>
<h3><a name="use_count">use_count</a></h3>
<pre>long use_count() const; // never throws</pre>
<blockquote>
- <p><b>Returns:</b> the number of <b>shared_ptr</b> objects, <STRONG>*this</STRONG> included,
+ <p><b>Returns:</b> the number of <b>shared_ptr</b> objects, <STRONG>*this</STRONG> included,
that <i>share ownership</i> with <b>*this</b>, or 0 when <STRONG>*this</STRONG>
is <EM>empty</EM>.</p>
<p><b>Throws:</b> nothing.</p>
- <P><B>Notes:</B> <code>use_count()</code> is not necessarily efficient. Use only
+ <P><B>Notes:</B> <code>use_count()</code> is not necessarily efficient. Use only
for debugging and testing purposes, not for production code.</P>
</blockquote>
<h3><a name="conversions">conversions</a></h3>
<pre>operator <i>unspecified-bool-type</i> () const; // never throws</pre>
<blockquote>
- <p><b>Returns:</b> an unspecified value that, when used in boolean contexts, is
+ <p><b>Returns:</b> an unspecified value that, when used in boolean contexts, is
equivalent to <code>get() != 0</code>.</p>
<p><b>Throws:</b> nothing.</p>
- <P><B>Notes:</B> This conversion operator allows <b>shared_ptr</b> objects to be
- used in boolean contexts, like <code>if (p && p->valid()) {}</code>.
- The actual target type is typically a pointer to a member function, avoiding
+ <P><B>Notes:</B> This conversion operator allows <b>shared_ptr</b> objects to be
+ used in boolean contexts, like <code>if (p && p->valid()) {}</code>.
+ The actual target type is typically a pointer to a member function, avoiding
many of the implicit conversion pitfalls.</P>
</blockquote>
- <P><EM>[The conversion to bool is not merely syntactic sugar. It allows <STRONG>shared_ptr</STRONG>s
+ <P><EM>[The conversion to bool is not merely syntactic sugar. It allows <STRONG>shared_ptr</STRONG>s
to be declared in conditions when using dynamic_pointer_cast
or weak_ptr::lock.]</EM></P>
<h3><a name="swap">swap</a></h3>
@@ -422,19 +427,19 @@
<b>operator<</b> is a strict weak ordering as described in section 25.3 <code>[lib.alg.sorting]</code>
of the C++ standard;
<LI>
- under the equivalence relation defined by <STRONG>operator<</STRONG>, <code>!(a
- < b) && !(b < a)</code>, two <STRONG>shared_ptr</STRONG> instances
+ under the equivalence relation defined by <STRONG>operator<</STRONG>, <code>!(a
+ < b) && !(b < a)</code>, two <STRONG>shared_ptr</STRONG> instances
are equivalent if and only if they <EM>share ownership</EM> or are both <EM>empty</EM>.</LI></UL>
<p><b>Throws:</b> nothing.</p>
- <P><B>Notes:</B> Allows <STRONG>shared_ptr</STRONG> objects to be used as keys in
+ <P><B>Notes:</B> Allows <STRONG>shared_ptr</STRONG> objects to be used as keys in
associative containers.</P>
</blockquote>
<P><EM>[<STRONG>Operator<</STRONG> has been preferred over a <STRONG>std::less </STRONG>
specialization for consistency and legality reasons, as <STRONG>std::less</STRONG>
- is required to return the results of <STRONG>operator<</STRONG>, and many
+ is required to return the results of <STRONG>operator<</STRONG>, and many
standard algorithms use <STRONG>operator<</STRONG> instead of <STRONG>std::less</STRONG>
- for comparisons when a predicate is not supplied. Composite objects, like <STRONG>std::pair</STRONG>,
- also implement their <STRONG>operator<</STRONG> in terms of their contained
+ for comparisons when a predicate is not supplied. Composite objects, like <STRONG>std::pair</STRONG>,
+ also implement their <STRONG>operator<</STRONG> in terms of their contained
subobjects' <STRONG>operator<</STRONG>.</EM></P>
<P><EM>The rest of the comparison operators are omitted by design.]</EM></P>
<h3><a name="free-swap">swap</a></h3>
@@ -443,11 +448,11 @@
<BLOCKQUOTE>
<P><B>Effects:</B> Equivalent to <code>a.swap(b)</code>.</P>
<P><B>Throws:</B> nothing.</P>
- <P><B>Notes:</B> Matches the interface of <B>std::swap</B>. Provided as an aid to
+ <P><B>Notes:</B> Matches the interface of <B>std::swap</B>. Provided as an aid to
generic programming.</P>
</BLOCKQUOTE>
<P><EM>[<STRONG>swap</STRONG> is defined in the same namespace as <STRONG>shared_ptr</STRONG>
- as this is currently the only legal way to supply a <STRONG>swap</STRONG> function
+ as this is currently the only legal way to supply a <STRONG>swap</STRONG> function
that has a chance to be used by the standard library.]</EM></P>
<h3><a name="get_pointer">get_pointer</a></h3>
<pre>template<class T>
@@ -464,13 +469,13 @@
<BLOCKQUOTE>
<P><STRONG>Requires:</STRONG> The expression <code>static_cast<T*>(r.get())</code>
must be well-formed.</P>
- <P><B>Returns:</B> If <b>r</b> is <i>empty</i>, an <i>empty</i> <b>shared_ptr<T></b>;
+ <P><B>Returns:</B> If <b>r</b> is <i>empty</i>, an <i>empty</i> <b>shared_ptr<T></b>;
otherwise, a <STRONG>shared_ptr<T></STRONG> object that stores a copy of <code>
static_cast<T*>(r.get())</code> and <i>shares ownership</i> with <b>r</b>.</P>
<P><B>Throws:</B> nothing.</P>
<P><B>Notes:</B> the seemingly equivalent expression</P>
<p><code>shared_ptr<T>(static_cast<T*>(r.get()))</code></p>
- <p>will eventually result in undefined behavior, attempting to delete the same
+ <p>will eventually result in undefined behavior, attempting to delete the same
object twice.</p>
</BLOCKQUOTE>
<h3><a name="const_pointer_cast">const_pointer_cast</a></h3>
@@ -479,13 +484,13 @@
<BLOCKQUOTE>
<P><STRONG>Requires:</STRONG> The expression <code>const_cast<T*>(r.get())</code>
must be well-formed.</P>
- <P><B>Returns:</B> If <b>r</b> is <i>empty</i>, an <i>empty</i> <b>shared_ptr<T></b>;
+ <P><B>Returns:</B> If <b>r</b> is <i>empty</i>, an <i>empty</i> <b>shared_ptr<T></b>;
otherwise, a <STRONG>shared_ptr<T></STRONG> object that stores a copy of <code>
const_cast<T*>(r.get())</code> and <i>shares ownership</i> with <b>r</b>.</P>
<P><B>Throws:</B> nothing.</P>
<P><B>Notes:</B> the seemingly equivalent expression</P>
<p><code>shared_ptr<T>(const_cast<T*>(r.get()))</code></p>
- <p>will eventually result in undefined behavior, attempting to delete the same
+ <p>will eventually result in undefined behavior, attempting to delete the same
object twice.</p>
</BLOCKQUOTE>
<h3><a name="dynamic_pointer_cast">dynamic_pointer_cast</a></h3>
@@ -498,14 +503,14 @@
<UL>
<LI>
When <CODE>dynamic_cast<T*>(r.get())</CODE> returns a nonzero value, a <STRONG>
- shared_ptr<T></STRONG> object that stores a copy of it and <i>shares
+ shared_ptr<T></STRONG> object that stores a copy of it and <i>shares
ownership</i> with <STRONG>r</STRONG>;
<LI>
Otherwise, an <i>empty</i> <STRONG>shared_ptr<T></STRONG> object.</LI></UL>
<P><B>Throws:</B> nothing.</P>
<P><B>Notes:</B> the seemingly equivalent expression</P>
<P><CODE>shared_ptr<T>(dynamic_cast<T*>(r.get()))</CODE></P>
- <P>will eventually result in undefined behavior, attempting to delete the same
+ <P>will eventually result in undefined behavior, attempting to delete the same
object twice.</P>
</BLOCKQUOTE>
<h3><a name="insertion-operator">operator<<</a></h3>
@@ -520,41 +525,41 @@
D * get_deleter(shared_ptr<T> const & p);</pre>
<BLOCKQUOTE>
<P><B>Returns:</B> If <STRONG>*this</STRONG> <EM>owns</EM> a deleter <STRONG>d</STRONG>
- of type (cv-unqualified) <STRONG>D</STRONG>, returns <code>&d</code>;
+ of type (cv-unqualified) <STRONG>D</STRONG>, returns <code>&d</code>;
otherwise returns 0.</P>
<P><B>Throws:</B> nothing.</P>
</BLOCKQUOTE>
<h2><a name="example">Example</a></h2>
- <p>See shared_ptr_example.cpp for a
+ <p>See shared_ptr_example.cpp for a
complete example program. The program builds a <b>std::vector</b> and <b>std::set</b>
of <b>shared_ptr</b> objects.</p>
<p>Note that after the containers have been populated, some of the <b>shared_ptr</b>
- objects will have a use count of 1 rather than a use count of 2, since the set
- is a <b>std::set</b> rather than a <b>std::multiset</b>, and thus does not
- contain duplicate entries. Furthermore, the use count may be even higher at
- various times while <b>push_back</b> and <b>insert</b> container operations are
- performed. More complicated yet, the container operations may throw exceptions
- under a variety of circumstances. Getting the memory management and exception
+ objects will have a use count of 1 rather than a use count of 2, since the set
+ is a <b>std::set</b> rather than a <b>std::multiset</b>, and thus does not
+ contain duplicate entries. Furthermore, the use count may be even higher at
+ various times while <b>push_back</b> and <b>insert</b> container operations are
+ performed. More complicated yet, the container operations may throw exceptions
+ under a variety of circumstances. Getting the memory management and exception
handling in this example right without a smart pointer would be a nightmare.</p>
<h2><a name="Handle/Body">Handle/Body</a> Idiom</h2>
- <p>One common usage of <b>shared_ptr</b> is to implement a handle/body (also called
- pimpl) idiom which avoids exposing the body (implementation) in the header
+ <p>One common usage of <b>shared_ptr</b> is to implement a handle/body (also called
+ pimpl) idiom which avoids exposing the body (implementation) in the header
file.</p>
<p>The shared_ptr_example2_test.cpp
- sample program includes a header file, shared_ptr_example2.hpp,
- which uses a <b>shared_ptr<></b> to an incomplete type to hide the
- implementation. The instantiation of member functions which require a complete
+ sample program includes a header file, shared_ptr_example2.hpp,
+ which uses a <b>shared_ptr<></b> to an incomplete type to hide the
+ implementation. The instantiation of member functions which require a complete
type occurs in the shared_ptr_example2.cpp
- implementation file. Note that there is no need for an explicit destructor.
- Unlike ~scoped_ptr, ~shared_ptr does not require that <b>T</b> be a complete
+ implementation file. Note that there is no need for an explicit destructor.
+ Unlike ~scoped_ptr, ~shared_ptr does not require that <b>T</b> be a complete
type.</p>
<h2><a name="ThreadSafety">Thread Safety</a></h2>
- <p><STRONG>shared_ptr</STRONG> objects offer the same level of thread safety as
- built-in types. A <STRONG>shared_ptr</STRONG> instance can be "read" (accessed
+ <p><STRONG>shared_ptr</STRONG> objects offer the same level of thread safety as
+ built-in types. A <STRONG>shared_ptr</STRONG> instance can be "read" (accessed
using only const operations) simultaneously by multiple threads. Different <STRONG>shared_ptr</STRONG>
instances can be "written to" (accessed using mutable operations such as <STRONG>operator=
- </STRONG>or <STRONG>reset</STRONG>) simultaneosly by multiple threads (even
- when these instances are copies, and share the same reference count
+ </STRONG>or <STRONG>reset</STRONG>) simultaneosly by multiple threads (even
+ when these instances are copies, and share the same reference count
underneath.)</p>
<P>Any other simultaneous accesses result in undefined behavior.</P>
<P>Examples:</P>
@@ -601,7 +606,7 @@
p3.reset(new int(2)); // undefined, multiple writes
</pre>
<p> </p>
- <P>Starting with Boost release 1.33.0, <STRONG>shared_ptr</STRONG> uses a lock-free
+ <P>Starting with Boost release 1.33.0, <STRONG>shared_ptr</STRONG> uses a lock-free
implementation on the following platforms:</P>
<UL>
<LI>
@@ -614,75 +619,75 @@
GNU GCC on PowerPC;
<LI>
Windows.</LI></UL>
- <P>If your program is single-threaded and does not link to any libraries that might
+ <P>If your program is single-threaded and does not link to any libraries that might
have used <STRONG>shared_ptr</STRONG> in its default configuration, you can <STRONG>
- #define</STRONG> the macro <STRONG>BOOST_SP_DISABLE_THREADS</STRONG> on a
+ #define</STRONG> the macro <STRONG>BOOST_SP_DISABLE_THREADS</STRONG> on a
project-wide basis to switch to ordinary non-atomic reference count updates.</P>
- <P>(Defining <STRONG>BOOST_SP_DISABLE_THREADS</STRONG> in some, but not all,
- translation units is technically a violation of the One Definition Rule and
- undefined behavior. Nevertheless, the implementation attempts to do its best to
- accommodate the request to use non-atomic updates in those translation units.
+ <P>(Defining <STRONG>BOOST_SP_DISABLE_THREADS</STRONG> in some, but not all,
+ translation units is technically a violation of the One Definition Rule and
+ undefined behavior. Nevertheless, the implementation attempts to do its best to
+ accommodate the request to use non-atomic updates in those translation units.
No guarantees, though.)</P>
- <P>You can define the macro <STRONG>BOOST_SP_USE_PTHREADS</STRONG> to turn off the
- lock-free platform-specific implementation and fall back to the generic <STRONG>pthread_mutex_t</STRONG>-based
+ <P>You can define the macro <STRONG>BOOST_SP_USE_PTHREADS</STRONG> to turn off the
+ lock-free platform-specific implementation and fall back to the generic <STRONG>pthread_mutex_t</STRONG>-based
code.</P>
<h2><a name="FAQ">Frequently Asked Questions</a></h2>
- <P><B>Q.</B> There are several variations of shared pointers, with different
- tradeoffs; why does the smart pointer library supply only a single
- implementation? It would be useful to be able to experiment with each type so
+ <P><B>Q.</B> There are several variations of shared pointers, with different
+ tradeoffs; why does the smart pointer library supply only a single
+ implementation? It would be useful to be able to experiment with each type so
as to find the most suitable for the job at hand?</P>
<P>
- <b>A.</b> An important goal of <STRONG>shared_ptr</STRONG> is to provide a
- standard shared-ownership pointer. Having a single pointer type is important
- for stable library interfaces, since different shared pointers typically cannot
- interoperate, i.e. a reference counted pointer (used by library A) cannot share
+ <b>A.</b> An important goal of <STRONG>shared_ptr</STRONG> is to provide a
+ standard shared-ownership pointer. Having a single pointer type is important
+ for stable library interfaces, since different shared pointers typically cannot
+ interoperate, i.e. a reference counted pointer (used by library A) cannot share
ownership with a linked pointer (used by library B.)<BR>
</P>
- <P><B>Q.</B> Why doesn't <B>shared_ptr</B> have template parameters supplying
+ <P><B>Q.</B> Why doesn't <B>shared_ptr</B> have template parameters supplying
traits or policies to allow extensive user customization?</P>
<P>
- <B>A.</B> Parameterization discourages users. The <B>shared_ptr</B> template is
- carefully crafted to meet common needs without extensive parameterization. Some
- day a highly configurable smart pointer may be invented that is also very easy
- to use and very hard to misuse. Until then, <B>shared_ptr</B> is the smart
- pointer of choice for a wide range of applications. (Those interested in policy
+ <B>A.</B> Parameterization discourages users. The <B>shared_ptr</B> template is
+ carefully crafted to meet common needs without extensive parameterization. Some
+ day a highly configurable smart pointer may be invented that is also very easy
+ to use and very hard to misuse. Until then, <B>shared_ptr</B> is the smart
+ pointer of choice for a wide range of applications. (Those interested in policy
based smart pointers should read <A href="http://www.awprofessional.com/bookstore/product.asp?isbn=0201704315&rl=1">
Modern C++ Design</A> by Andrei Alexandrescu.)<BR>
</P>
- <P><B>Q.</B> I am not convinced. Default parameters can be used where appropriate
+ <P><B>Q.</B> I am not convinced. Default parameters can be used where appropriate
to hide the complexity. Again, why not policies?</P>
<P>
- <B>A.</B> Template parameters affect the type. See the answer to the first
+ <B>A.</B> Template parameters affect the type. See the answer to the first
question above.<BR>
</P>
<P><B>Q.</B> Why doesn't <b>shared_ptr</b> use a linked list implementation?</P>
<P>
- <b>A.</b> A linked list implementation does not offer enough advantages to
+ <b>A.</b> A linked list implementation does not offer enough advantages to
offset the added cost of an extra pointer. See timings
- page. In addition, it is expensive to make a linked list implementation thread
+ page. In addition, it is expensive to make a linked list implementation thread
safe.<BR>
</P>
- <P><b>Q.</b> Why doesn't <b>shared_ptr</b> (or any of the other Boost smart
+ <P><b>Q.</b> Why doesn't <b>shared_ptr</b> (or any of the other Boost smart
pointers) supply an automatic conversion to <b>T*</b>?</P>
<P>
<b>A.</b> Automatic conversion is believed to be too error prone.<BR>
</P>
<P><B>Q.</B> Why does <b>shared_ptr</b> supply use_count()?</P>
<P>
- <b>A.</b> As an aid to writing test cases and debugging displays. One of the
- progenitors had use_count(), and it was useful in tracking down bugs in a
+ <b>A.</b> As an aid to writing test cases and debugging displays. One of the
+ progenitors had use_count(), and it was useful in tracking down bugs in a
complex project that turned out to have cyclic-dependencies.<BR>
</P>
<P><B>Q.</B> Why doesn't <b>shared_ptr</b> specify complexity requirements?</P>
<P>
- <b>A.</b> Because complexity requirements limit implementors and complicate the
- specification without apparent benefit to <b>shared_ptr</b> users. For example,
- error-checking implementations might become non-conforming if they had to meet
+ <b>A.</b> Because complexity requirements limit implementors and complicate the
+ specification without apparent benefit to <b>shared_ptr</b> users. For example,
+ error-checking implementations might become non-conforming if they had to meet
stringent complexity requirements.<BR>
</P>
<P><b>Q.</b> Why doesn't <b>shared_ptr</b> provide a release() function?</P>
<P>
- <b>A.</b> <b>shared_ptr</b> cannot give away ownership unless it's unique()
+ <b>A.</b> <b>shared_ptr</b> cannot give away ownership unless it's unique()
because the other copy will still destroy the object.</P>
<p>Consider:</p>
<blockquote><pre>shared_ptr<int> a(new int);
@@ -692,25 +697,25 @@
// Who owns p now? b will still call delete on it in its destructor.</pre>
</blockquote>
- <p>Furthermore, the pointer returned by <code>release()</code> would be difficult
- to deallocate reliably, as the source <b>shared_ptr</b> could have been created
+ <p>Furthermore, the pointer returned by <code>release()</code> would be difficult
+ to deallocate reliably, as the source <b>shared_ptr</b> could have been created
with a custom deleter.<BR>
</p>
- <P><b>Q.</b> Why is <code>operator->()</code> const, but its return value is a
+ <P><b>Q.</b> Why is <code>operator->()</code> const, but its return value is a
non-const pointer to the element type?</P>
<P>
- <b>A.</b> Shallow copy pointers, including raw pointers, typically don't
- propagate constness. It makes little sense for them to do so, as you can always
- obtain a non-const pointer from a const one and then proceed to modify the
- object through it.<b>shared_ptr</b> is "as close to raw pointers as possible
+ <b>A.</b> Shallow copy pointers, including raw pointers, typically don't
+ propagate constness. It makes little sense for them to do so, as you can always
+ obtain a non-const pointer from a const one and then proceed to modify the
+ object through it.<b>shared_ptr</b> is "as close to raw pointers as possible
but no closer".<BR>
<BR>
</P>
<hr>
<p>
$Date$</p>
- <p><small>Copyright 1999 Greg Colvin and Beman Dawes. Copyright 2002 Darin Adler.
- Copyright 2002-2005 Peter Dimov. Distributed under the Boost Software License,
+ <p><small>Copyright 1999 Greg Colvin and Beman Dawes. Copyright 2002 Darin Adler.
+ Copyright 2002-2005 Peter Dimov. 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.</small></p>
</body>
Modified: branches/release/libs/smart_ptr/smart_ptr.htm
==============================================================================
--- branches/release/libs/smart_ptr/smart_ptr.htm (original)
+++ branches/release/libs/smart_ptr/smart_ptr.htm 2009-03-11 11:08:14 EDT (Wed, 11 Mar 2009)
@@ -14,15 +14,15 @@
<a href="#History">History and Acknowledgements</a><br>
<a href="#References">References</a></p>
<h2><a name="Introduction">Introduction</a></h2>
- <p>Smart pointers are objects which store pointers to dynamically allocated (heap)
- objects. They behave much like built-in C++ pointers except that they
- automatically delete the object pointed to at the appropriate time. Smart
- pointers are particularly useful in the face of exceptions as they ensure
- proper destruction of dynamically allocated objects. They can also be used to
+ <p>Smart pointers are objects which store pointers to dynamically allocated (heap)
+ objects. They behave much like built-in C++ pointers except that they
+ automatically delete the object pointed to at the appropriate time. Smart
+ pointers are particularly useful in the face of exceptions as they ensure
+ proper destruction of dynamically allocated objects. They can also be used to
keep track of dynamically allocated objects shared by multiple owners.</p>
- <p>Conceptually, smart pointers are seen as owning the object pointed to, and thus
+ <p>Conceptually, smart pointers are seen as owning the object pointed to, and thus
responsible for deletion of the object when it is no longer needed.</p>
- <p>The smart pointer library provides five smart pointer class templates:</p>
+ <p>The smart pointer library provides six smart pointer class templates:</p>
<div align="left">
<table border="1" cellpadding="4" cellspacing="0">
<tr>
@@ -38,7 +38,7 @@
<tr>
<td>shared_ptr</td>
<td><boost/shared_ptr.hpp></td>
- <td>Object ownership shared among multiple pointers</td>
+ <td>Object ownership shared among multiple pointers.</td>
</tr>
<tr>
<td>shared_array</td>
@@ -58,126 +58,137 @@
</table>
</div>
<p>These templates are designed to complement the <b>std::auto_ptr</b> template.</p>
- <p>They are examples of the "resource acquisition is initialization" idiom
- described in Bjarne Stroustrup's "The C++ Programming Language", 3rd edition,
+ <p>They are examples of the "resource acquisition is initialization" idiom
+ described in Bjarne Stroustrup's "The C++ Programming Language", 3rd edition,
Section 14.4, Resource Management.</p>
- <p>A test program, smart_ptr_test.cpp, is
+ <p>Additionally, the smart pointer library provides efficient factory functions
+ for creating <code>shared_ptr</code> objects:</p>
+ <div align="left">
+ <table border="1" cellpadding="4" cellspacing="0">
+ <tr>
+ <td>make_shared and allocate_shared</td>
+ <td><boost/make_shared.hpp></td>
+ <td>Efficient creation of <code>shared_ptr</code> objects.</td>
+ </tr>
+ </table>
+ </div>
+ <p>A test program, smart_ptr_test.cpp, is
provided to verify correct operation.</p>
- <p>A page on compatibility with older versions of
- the Boost smart pointer library describes some of the changes since earlier
+ <p>A page on compatibility with older versions of
+ the Boost smart pointer library describes some of the changes since earlier
versions of the smart pointer implementation.</p>
- <p>A page on smart pointer timings will be of interest
+ <p>A page on smart pointer timings will be of interest
to those curious about performance issues.</p>
- <P>A page on smart pointer programming techniques lists
+ <P>A page on smart pointer programming techniques lists
some advanced applications of <code>shared_ptr</code> and <code>weak_ptr</code>.</P>
<h2><a name="common_requirements">Common Requirements</a></h2>
- <p>These smart pointer class templates have a template parameter, <b>T</b>, which
- specifies the type of the object pointed to by the smart pointer. The behavior
+ <p>These smart pointer class templates have a template parameter, <b>T</b>, which
+ specifies the type of the object pointed to by the smart pointer. The behavior
of the smart pointer templates is undefined if the destructor or <b>operator delete</b>
for objects of type <b>T</b> throw exceptions.</p>
- <p><b>T</b> may be an incomplete type at the point of smart pointer declaration.
- Unless otherwise specified, it is required that <b>T</b> be a complete type at
- points of smart pointer instantiation. Implementations are required to diagnose
- (treat as an error) all violations of this requirement, including deletion of
+ <p><b>T</b> may be an incomplete type at the point of smart pointer declaration.
+ Unless otherwise specified, it is required that <b>T</b> be a complete type at
+ points of smart pointer instantiation. Implementations are required to diagnose
+ (treat as an error) all violations of this requirement, including deletion of
an incomplete type. See the description of the <a href="../utility/utility.htm#checked_delete">
<b>checked_delete</b></a> function template.</p>
- <P>Note that <STRONG>shared_ptr</STRONG> does not have this restriction, as most of
+ <P>Note that <STRONG>shared_ptr</STRONG> does not have this restriction, as most of
its member functions do not require <STRONG>T</STRONG> to be a complete type.</P>
<h3>Rationale</h3>
- <p>The requirements on <b>T</b> are carefully crafted to maximize safety yet allow
- handle-body (also called pimpl) and similar idioms. In these idioms a smart
- pointer may appear in translation units where <b>T</b> is an incomplete type.
- This separates interface from implementation and hides implementation from
- translation units which merely use the interface. Examples described in the
- documentation for specific smart pointers illustrate use of smart pointers in
+ <p>The requirements on <b>T</b> are carefully crafted to maximize safety yet allow
+ handle-body (also called pimpl) and similar idioms. In these idioms a smart
+ pointer may appear in translation units where <b>T</b> is an incomplete type.
+ This separates interface from implementation and hides implementation from
+ translation units which merely use the interface. Examples described in the
+ documentation for specific smart pointers illustrate use of smart pointers in
these idioms.</p>
- <p>Note that <b>scoped_ptr</b> requires that <b>T</b> be a complete type at
+ <p>Note that <b>scoped_ptr</b> requires that <b>T</b> be a complete type at
destruction time, but <b>shared_ptr</b> does not.</p>
<h2><a name="Exception_Safety">Exception Safety</a></h2>
- <p>Several functions in these smart pointer classes are specified as having "no
- effect" or "no effect except such-and-such" if an exception is thrown. This
- means that when an exception is thrown by an object of one of these classes,
- the entire program state remains the same as it was prior to the function call
- which resulted in the exception being thrown. This amounts to a guarantee that
- there are no detectable side effects. Other functions never throw exceptions.
- The only exception ever thrown by functions which do throw (assuming <b>T</b> meets
- the common requirements) is <b>std::bad_alloc</b>,
- and that is thrown only by functions which are explicitly documented as
+ <p>Several functions in these smart pointer classes are specified as having "no
+ effect" or "no effect except such-and-such" if an exception is thrown. This
+ means that when an exception is thrown by an object of one of these classes,
+ the entire program state remains the same as it was prior to the function call
+ which resulted in the exception being thrown. This amounts to a guarantee that
+ there are no detectable side effects. Other functions never throw exceptions.
+ The only exception ever thrown by functions which do throw (assuming <b>T</b> meets
+ the common requirements) is <b>std::bad_alloc</b>,
+ and that is thrown only by functions which are explicitly documented as
possibly throwing <b>std::bad_alloc</b>.</p>
<h2><a name="Exception-specifications">Exception-specifications</a></h2>
<p>Exception-specifications are not used; see <a href="http://www.boost.org/more/lib_guide.htm#Exception-specification">
exception-specification rationale</a>.</p>
- <p>All the smart pointer templates contain member functions which can never throw
- exceptions, because they neither throw exceptions themselves nor call other
+ <p>All the smart pointer templates contain member functions which can never throw
+ exceptions, because they neither throw exceptions themselves nor call other
functions which may throw exceptions. These members are indicated by a comment: <code>
// never throws</code>.
</p>
- <p>Functions which destroy objects of the pointed to type are prohibited from
+ <p>Functions which destroy objects of the pointed to type are prohibited from
throwing exceptions by the common requirements.</p>
<h2><a name="History">History</a> and Acknowledgements</h2>
- <p>January 2002. Peter Dimov reworked all four classes, adding features, fixing
- bugs, and splitting them into four separate headers, and added <b>weak_ptr</b>.
- See the compatibility page for a summary of the
+ <p>January 2002. Peter Dimov reworked all four classes, adding features, fixing
+ bugs, and splitting them into four separate headers, and added <b>weak_ptr</b>.
+ See the compatibility page for a summary of the
changes.</p>
- <p>May 2001. Vladimir Prus suggested requiring a complete type on destruction.
- Refinement evolved in discussions including Dave Abrahams, Greg Colvin, Beman
- Dawes, Rainer Deyke, Peter Dimov, John Maddock, Vladimir Prus, Shankar Sai, and
+ <p>May 2001. Vladimir Prus suggested requiring a complete type on destruction.
+ Refinement evolved in discussions including Dave Abrahams, Greg Colvin, Beman
+ Dawes, Rainer Deyke, Peter Dimov, John Maddock, Vladimir Prus, Shankar Sai, and
others.</p>
<p>November 1999. Darin Adler provided <b>operator ==</b>, <b>operator !=</b>, and <b>std::swap</b>
and <b>std::less</b> specializations for shared types.</p>
<p>September 1999. Luis Coelho provided <b>shared_ptr::swap</b> and <b>shared_array::swap</b></p>
- <p>May 1999. In April and May, 1999, Valentin Bonnard and David Abrahams made a
+ <p>May 1999. In April and May, 1999, Valentin Bonnard and David Abrahams made a
number of suggestions resulting in numerous improvements.</p>
- <p>October 1998. Beman Dawes proposed reviving the original semantics under the
- names <b>safe_ptr</b> and <b>counted_ptr</b>, meeting of Per Andersson, Matt
- Austern, Greg Colvin, Sean Corfield, Pete Becker, Nico Josuttis, Dietmar Kühl,
- Nathan Myers, Chichiang Wan and Judy Ward. During the discussion, the four new
- class names were finalized, it was decided that there was no need to exactly
- follow the <b>std::auto_ptr</b> interface, and various function signatures and
+ <p>October 1998. Beman Dawes proposed reviving the original semantics under the
+ names <b>safe_ptr</b> and <b>counted_ptr</b>, meeting of Per Andersson, Matt
+ Austern, Greg Colvin, Sean Corfield, Pete Becker, Nico Josuttis, Dietmar Kühl,
+ Nathan Myers, Chichiang Wan and Judy Ward. During the discussion, the four new
+ class names were finalized, it was decided that there was no need to exactly
+ follow the <b>std::auto_ptr</b> interface, and various function signatures and
semantics were finalized.</p>
- <p>Over the next three months, several implementations were considered for <b>shared_ptr</b>,
- and discussed on the boost.org mailing list.
- The implementation questions revolved around the reference count which must be
- kept, either attached to the pointed to object, or detached elsewhere. Each of
+ <p>Over the next three months, several implementations were considered for <b>shared_ptr</b>,
+ and discussed on the boost.org mailing list.
+ The implementation questions revolved around the reference count which must be
+ kept, either attached to the pointed to object, or detached elsewhere. Each of
those variants have themselves two major variants:
<ul>
<li>
- Direct detached: the shared_ptr contains a pointer to the object, and a pointer
+ Direct detached: the shared_ptr contains a pointer to the object, and a pointer
to the count.
<li>
- Indirect detached: the shared_ptr contains a pointer to a helper object, which
+ Indirect detached: the shared_ptr contains a pointer to a helper object, which
in turn contains a pointer to the object and the count.
<li>
Embedded attached: the count is a member of the object pointed to.
<li>
Placement attached: the count is attached via operator new manipulations.</li>
</ul>
- <p>Each implementation technique has advantages and disadvantages. We went so far
- as to run various timings of the direct and indirect approaches, and found that
- at least on Intel Pentium chips there was very little measurable difference.
- Kevlin Henney provided a paper he wrote on "Counted Body Techniques." Dietmar
- Kühl suggested an elegant partial template specialization technique to allow
- users to choose which implementation they preferred, and that was also
+ <p>Each implementation technique has advantages and disadvantages. We went so far
+ as to run various timings of the direct and indirect approaches, and found that
+ at least on Intel Pentium chips there was very little measurable difference.
+ Kevlin Henney provided a paper he wrote on "Counted Body Techniques." Dietmar
+ Kühl suggested an elegant partial template specialization technique to allow
+ users to choose which implementation they preferred, and that was also
experimented with.</p>
- <p>But Greg Colvin and Jerry Schwarz argued that "parameterization will discourage
+ <p>But Greg Colvin and Jerry Schwarz argued that "parameterization will discourage
users", and in the end we choose to supply only the direct implementation.</p>
<p>Summer, 1994. Greg Colvin proposed to the C++ Standards Committee classes named <b>auto_ptr</b>
and <b>counted_ptr</b> which were very similar to what we now call <b>scoped_ptr</b>
- and <b>shared_ptr</b>. [Col-94] In one of the very few
- cases where the Library Working Group's recommendations were not followed by
- the full committee, <b>counted_ptr</b> was rejected and surprising
+ and <b>shared_ptr</b>. [Col-94] In one of the very few
+ cases where the Library Working Group's recommendations were not followed by
+ the full committee, <b>counted_ptr</b> was rejected and surprising
transfer-of-ownership semantics were added to <b>auto_ptr</b>.</p>
<h2><a name="References">References</a></h2>
<p>[<a name="Col-94">Col-94</a>] Gregory Colvin, <a href="http://std.dkuug.dk/jtc1/sc22/wg21/docs/papers/1994/N0555.pdf">
- Exception Safe Smart Pointers</a>, C++ committee document 94-168/N0555,
+ Exception Safe Smart Pointers</a>, C++ committee document 94-168/N0555,
July, 1994.</p>
<p>[<a name="E&D-94">E&D-94</a>] John R. Ellis & David L. Detlefs, <a href="http://www.usenix.org/publications/library/proceedings/c++94/full_papers/ellis.a">
- Safe, Efficient Garbage Collection for C++</a>, Usenix Proceedings,
- February, 1994. This paper includes an extensive discussion of weak pointers
+ Safe, Efficient Garbage Collection for C++</a>, Usenix Proceedings,
+ February, 1994. This paper includes an extensive discussion of weak pointers
and an extensive bibliography.</p>
<hr>
<p>$Date$</p>
- <p><small>Copyright 1999 Greg Colvin and Beman Dawes. Copyright 2002 Darin Adler.
+ <p><small>Copyright 1999 Greg Colvin and Beman Dawes. Copyright 2002 Darin Adler.
Distributed under the Boost Software License, Version 1.0. See accompanying
file LICENSE_1_0.txt or copy at
<A href="http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt>.</small></p>
Boost-Commit list run by bdawes at acm.org, david.abrahams at rcn.com, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk