Boost-Commit :

Date view	Thread view	Subject view	Author view

Subject: [Boost-commit] svn:boost r51699 - in trunk/libs: . smart_ptr
From: fmhess_at_[hidden]
Date: 2009-03-11 09:48:51

Next message: fmhess_at_[hidden]: "[Boost-commit] svn:boost r51700 - trunk/libs/smart_ptr"
Previous message: john_at_[hidden]: "[Boost-commit] svn:boost r51698 - sandbox/tools/auto_index/src"

Author: fmhess
Date: 2009-03-11 09:48:51 EDT (Wed, 11 Mar 2009)
New Revision: 51699
URL: http://svn.boost.org/trac/boost/changeset/51699

Log:
Adding documentation for make_shared and allocate_shared to smart_ptr docs.
It is adopted from n2351 "Improving shared_ptr for C++0x, Revision 2".
Also includes some minor corrections.
Refs #1897

Added:
   trunk/libs/smart_ptr/make_shared.html (contents, props changed)
Text files modified:
   trunk/libs/libraries.htm | 2
   trunk/libs/smart_ptr/shared_ptr.htm | 309 ++++++++++++++++++++-------------------
   trunk/libs/smart_ptr/smart_ptr.htm | 159 +++++++++++---------
   3 files changed, 243 insertions(+), 227 deletions(-)

Modified: trunk/libs/libraries.htm
==============================================================================
--- trunk/libs/libraries.htm (original)
+++ trunk/libs/libraries.htm 2009-03-11 09:48:51 EDT (Wed, 11 Mar 2009)
@@ -246,7 +246,7 @@
 slots callback implementation, from Doug Gregor.</li>
 <li>signals2 - managed signals &
 slots callback implementation (thread-safe version 2), from Frank Mori Hess.</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

Added: trunk/libs/smart_ptr/make_shared.html
==============================================================================
--- (empty file)
+++ trunk/libs/smart_ptr/make_shared.html 2009-03-11 09:48:51 EDT (Wed, 11 Mar 2009)
@@ -0,0 +1,119 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<html>
+ <head>
+ <title>make_shared and allocate_shared</title>
+ <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
+ </head>
+ <body text="#000000" bgColor="#ffffff">
+ <h1><A href="../../index.htm"><IMG height="86" alt="boost.png (6897 bytes)" src="../../boost.png" width="277" align="middle"
+ border="0"></A>make_shared and allocate_shared function templates</h1>
+ Introduction 
+ Synopsis 
+ Free Functions 
+ Example 
+ <h2><a name="Introduction">Introduction</a></h2>
+ Consistent use of shared_ptr
+ can eliminate the need to use an explicit <code>delete</code>,
+ but alone it provides no support in avoiding explicit <code>new</code>.
+ There have been repeated requests from users for a factory function that creates
+ an object of a given type and returns a <code>shared_ptr</code> to it.
+ Besides convenience and style, such a function is also exception safe and
+ considerably faster because it can use a single allocation for both the object
+ and its corresponding control block, eliminating a significant portion of
+ <code>shared_ptr</code>'s construction overhead.
+ This eliminates one of the major efficiency complaints about <code>shared_ptr</code>.
+ 
+ The header file <boost/make_shared.hpp> provides a family of overloaded function templates,
+ <code>make_shared</code> and <code>allocate_shared</code>, to address this need.
+ <code>make_shared</code> uses the global operator <code>new</code> to allocate memory,
+ whereas <code>allocate_shared</code> uses an user-supplied allocator, allowing finer control.
+ 
+ The rationale for choosing the name <code>make_shared</code> is that the expression
+ <code>make_shared<Widget>()</code> can be read aloud and conveys the intended meaning.
+ <h2><a name="Synopsis">Synopsis</a></h2>
+ <pre>namespace boost {
+
+ template<typename T> class shared_ptr;
+
+ template<typename T>
+ shared_ptr<T> make_shared();
+
+ template<typename T, typename A>
+ shared_ptr<T> allocate_shared( A const & );
+
+#if defined( BOOST_HAS_VARIADIC_TMPL ) && defined( BOOST_HAS_RVALUE_REFS ) // C++0x prototypes
+
+ template<typename T, typename... Args>
+ shared_ptr<T> make_shared( Args && ... args );
+
+ template<typename T, typename A, typename... Args>
+ shared_ptr<T> allocate_shared( A const & a, Args && ... args );
+
+#else // no C++0X support
+
+ template<typename T, typename Arg1 >
+ shared_ptr<T> make_shared( Arg1 const & arg1 );
+ template<typename T, typename Arg1, typename Arg2 >
+ shared_ptr<T> make_shared( Arg1 const & arg1, Arg2 const & arg2 );
+// ...
+ template<typename T, typename Arg1, typename Arg2, ..., typename ArgN >
+ shared_ptr<T> make_shared( Arg1 const & arg1, Arg2 const & arg2, ..., ArgN const & argN );
+
+ template<typename T, typename A, typename Arg1 >
+ shared_ptr<T> allocate_shared( A const & a, Arg1 const & arg1 );
+ template<typename T, typename A, typename Arg1, typename Arg2 >
+ shared_ptr<T> allocate_shared( Arg1 const & arg1, Arg2 const & arg2 );
+// ...
+ template<typename T, typename A, typename Arg1, typename Arg2, ..., typename ArgN >
+ shared_ptr<T> allocate_shared( A const & a, Arg1 const & arg1, Arg2 const & arg2, ..., ArgN const & argN );
+
+#endif
+}</pre>
+ <h2><a name="functions">Free Functions</a></h2>
+ <pre>template<class T, class... Args>
+ shared_ptr<T> make_shared( Args && ... args );
+template<class T, class A, class... Args>
+ shared_ptr<T> allocate_shared( A const & a, Args && ... args );</pre>
+ <blockquote>
+ Requires: The expression <code>new( pv ) T( std::forward<Args>(args)... )</code>,
+ where <code>pv</code> is a <code>void*</code> pointing to storage suitable
+ to hold an object of type <code>T</code>,
+ shall be well-formed. <code>A</code> shall be an Allocator,
+ as described in section 20.1.5 (<stong>Allocator requirements) of the C++ Standard.
+ The copy constructor and destructor of <code>A</code> shall not throw.
+ Effects: Allocates memory suitable for an object of type <code>T</code>
+ and constructs an object in it via the placement new expression <code>new( pv ) T()</code>
+ or <code>new( pv ) T( std::forward<Args>(args)... )</code>.
+ <code>allocate_shared</code> uses a copy of <code>a</code> to allocate memory.
+ If an exception is thrown, has no effect.
+ Returns: A <code>shared_ptr</code> instance that stores and owns the address
+ of the newly constructed object of type <code>T</code>.
+ Postconditions: <code>get() != 0 && use_count() == 1</code>.
+ Throws: <code>bad_alloc</code>, or an exception thrown from <code>A::allocate</code>
+ or the constructor of <code>T</code>.
+ Notes: This implementation allocates the memory required for the
+ returned <code>shared_ptr</code> and an object of type <code>T</code> in a single
+ allocation. This provides efficiency equivalent to an intrusive smart pointer.
+ The prototypes shown above are used if your compiler supports rvalue references
+ and variadic templates. They perfectly forward the <code>args</code> parameters to
+ the constructors of <code>T</code>.
+ Otherwise, the implementation will fall back on
+ forwarding the arguments to the constructors of <code>T</code> as const references.
+ If you need to pass a non-const reference to a constructor of <code>T</code>,
+ you may do so by wrapping the parameter in a call to <code>boost::ref</code>.
+ In addition, you will be
+ limited to a maximum of 9 arguments (not counting the allocator argument of
+ allocate_shared).
+ </blockquote>
+ <h2><a name="example">Example</a></h2>
+ <pre>boost::shared_ptr<std::string> x = boost::make_shared<std::string>("hello, world!");
+std::cout << *x;</pre>
+ <hr>
+ 
+ $Date: 2008-05-19 15:42:39 -0400 (Mon, 19 May 2008) $
+ Copyright 2008 Peter Dimov. Copyright 2008 Frank Mori Hess.
+ 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.
+ </body>
+</html>

Modified: trunk/libs/smart_ptr/shared_ptr.htm
==============================================================================
--- trunk/libs/smart_ptr/shared_ptr.htm (original)
+++ trunk/libs/smart_ptr/shared_ptr.htm 2009-03-11 09:48:51 EDT (Wed, 11 Mar 2009)
@@ -19,54 +19,54 @@
 <A href="smarttests.htm">Smart Pointer Timings</A> 
 <A href="sp_techniques.html">Programming Techniques</A>
 <h2><a name="Introduction">Introduction</a></h2>
- The shared_ptr class template stores a pointer to a dynamically allocated
- object, typically with a C++ new-expression. The object pointed to is
- guaranteed to be deleted when the last shared_ptr pointing to it is
+ The shared_ptr class template stores a pointer to a dynamically allocated
+ object, typically with a C++ new-expression. The object pointed to is
+ guaranteed to be deleted when the last shared_ptr pointing to it is
 destroyed or reset. See the example.
- Every shared_ptr meets the CopyConstructible and Assignable
- requirements of the C++ Standard Library, and so can be used in standard
- library containers. Comparison operators are supplied so that shared_ptr
+ Every shared_ptr meets the CopyConstructible and Assignable
+ requirements of the C++ Standard Library, and so can be used in standard
+ library containers. Comparison operators are supplied so that shared_ptr
 works with the standard library's associative containers.
- Normally, a shared_ptr cannot correctly hold a pointer to a dynamically
- allocated array. See shared_array for
+ Normally, a shared_ptr cannot correctly hold a pointer to a dynamically
+ allocated array. See shared_array for
 that usage.
- Because the implementation uses reference counting, cycles of shared_ptr instances
+ Because the implementation uses reference counting, cycles of shared_ptr instances
 will not be reclaimed. For example, if main() holds a shared_ptr to
 A, which directly or indirectly holds a shared_ptr back to A,
- A's use count will be 2. Destruction of the original shared_ptr will
+ A's use count will be 2. Destruction of the original shared_ptr will
 leave A dangling with a use count of 1. Use weak_ptr
 to "break cycles."
- The class template is parameterized on T, the type of the object pointed
- to. shared_ptr and most of its member functions place no
+ The class template is parameterized on T, the type of the object pointed
+ to. shared_ptr and most of its member functions place no
 requirements on T; it is allowed to be an incomplete type, or 
 void. Member functions that do place additional requirements (constructors,
 <A href="#reset">reset</A>) are explicitly documented below.
 shared_ptr<T> can be implicitly converted to shared_ptr
- whenever T* can be implicitly converted to U*.
- In particular, shared_ptr<T> is implicitly convertible
+ whenever T* can be implicitly converted to U*.
+ In particular, shared_ptr<T> is implicitly convertible
 to shared_ptr<T const>, to shared_ptr
 where U is an accessible base of T, and to 
 shared_ptr<void>.
- shared_ptr is now part of TR1, the first C++
- Library Technical Report. The latest draft of TR1 is available
+ shared_ptr is now part of TR1, the first C++
+ Library Technical Report. The latest draft of TR1 is available
 at the following location:
 http://www.open-std.org/JTC1/SC22/WG21/docs/papers/2005/n1745.pdf
 (1.36Mb PDF)
- This implementation conforms to the TR1 specification, with the only exception
+ 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>.
 <h2><a name="BestPractices">Best Practices</a></h2>
- A simple guideline that nearly eliminates the possibility of memory leaks is:
+ A simple guideline that nearly eliminates the possibility of memory leaks is:
 always use a named smart pointer variable to hold the result of new. 
- Every occurence of the new keyword in the code should have the
+ Every occurence of the new keyword in the code should have the
 form:
 <PRE>shared_ptr<T> p(new Y);</PRE>
 It is, of course, acceptable to use another smart pointer in place of shared_ptr
- above; having T and Y be the same type, or
+ above; having T and Y be the same type, or
 passing arguments to Y's constructor is also OK.
- If you observe this guideline, it naturally follows that you will have no
- explicit deletes; try/catch constructs will
+ If you observe this guideline, it naturally follows that you will have no
+ explicit deletes; try/catch constructs will
 be rare.
- Avoid using unnamed shared_ptr temporaries to save typing; to
+ Avoid using unnamed shared_ptr temporaries to save typing; to
 see why this is dangerous, consider this example:
 <PRE>void f(shared_ptr<int>, int);
int g();
@@ -83,13 +83,18 @@
}
</PRE>
 The function ok follows the guideline to the letter, whereas 
- bad constructs the temporary shared_ptr in place,
- admitting the possibility of a memory leak. Since function arguments are
- evaluated in unspecified order, it is possible for new int(2) to
+ bad constructs the temporary shared_ptr in place,
+ admitting the possibility of a memory leak. Since function arguments are
+ evaluated in unspecified order, it is possible for new int(2) to
 be evaluated first, g() second, and we may never get to the 
- shared_ptr constructor if g throws an exception.
+ shared_ptr constructor if g 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.
+ 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.
 <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 @@
 Postconditions: <code>use_count() == 0 && get() == 0</code>.
 Throws: nothing.
 </blockquote>
- [The nothrow guarantee is important, since reset() is specified
- in terms of the default constructor; this implies that the constructor must not
+ [The nothrow guarantee is important, since reset() is specified
+ in terms of the default constructor; this implies that the constructor must not
 allocate memory.]
 <pre>template<class Y> explicit shared_ptr(Y * p);</pre>
 <blockquote>
 Requirements: p must be convertible to T *. Y
- 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.
 
 Effects: Constructs a shared_ptr that owns the pointer p.
 Postconditions: <code>use_count() == 1 && get() == p</code>.
- Throws: std::bad_alloc, or an implementation-defined
+ Throws: std::bad_alloc, or an implementation-defined
 exception when a resource other than memory could not be obtained.
- Exception safety: If an exception is thrown, <code>delete p</code> is
+ Exception safety: If an exception is thrown, <code>delete p</code> is
 called.
- Notes: p must be a pointer to an object that was
+ Notes: p must be a pointer to an object that was
 allocated via a C++ new expression or be 0. The postcondition that <A href="#use_count">
 use count</A> is 1 holds even if p is 0; invoking delete
 on a pointer that has a value of 0 is harmless.
 </blockquote>
- [This constructor has been changed to a template in order to remember the actual
- pointer type passed. The destructor will call delete with the
- same pointer, complete with its original type, even when T does
+ [This constructor has been changed to a template in order to remember the actual
+ pointer type passed. The destructor will call delete with the
+ same pointer, complete with its original type, even when T does
 not have a virtual destructor, or is void.
- The optional intrusive counting support has been dropped as it exposes too much
- implementation details and doesn't interact well with weak_ptr.
+ The optional intrusive counting support has been dropped as it exposes too much
+ implementation details and doesn't interact well with weak_ptr.
 The current implementation uses a different mechanism, <A href="enable_shared_from_this.html">
 enable_shared_from_this</A>, to solve the "shared_ptr from 
 this" problem.]
@@ -212,46 +217,46 @@
template<class Y, class D, class A> shared_ptr(Y * p, D d, A a);</pre>
 <blockquote>
 Requirements: p must be convertible to T *. D
- must be CopyConstructible. The copy constructor and destructor
- of D must not throw. The expression <code>d(p)</code> must be
+ must be CopyConstructible. The copy constructor and destructor
+ of D must not throw. The expression <code>d(p)</code> must be
 well-formed, must not invoke undefined behavior, and must not throw exceptions. 
- A must be an Allocator, as described in section 20.1.5 (Allocator
+ A must be an Allocator, as described in section 20.1.5 (Allocator
 requirements) of the C++ Standard.
 
 Effects: Constructs a shared_ptr that owns the pointer 
- p and the deleter d. The second constructor allocates
+ p and the deleter d. The second constructor allocates
 memory using a copy of a.
 Postconditions: <code>use_count() == 1 && get() == p</code>.
- Throws: std::bad_alloc, or an implementation-defined
+ Throws: std::bad_alloc, or an implementation-defined
 exception when a resource other than memory could not be obtained.
 Exception safety: If an exception is thrown, <code>d(p)</code> is called.
- Notes: When the the time comes to delete the object pointed to by p,
+ Notes: When the the time comes to delete the object pointed to by p,
 the stored copy of d is invoked with the stored copy of p
 as an argument.
 </blockquote>
 [Custom deallocators allow a factory function returning a shared_ptr
- 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 shared_ptr
 to a statically allocated object, and other variations allow a shared_ptr
 to be used as a wrapper for another smart pointer, easing interoperability.
 The support for custom deallocators does not impose significant overhead. Other 
 shared_ptr features still require a deallocator to be kept.
- The requirement that the copy constructor of D does not throw comes from
- the pass by value. If the copy constructor throws, the pointer is leaked.
+ The requirement that the copy constructor of D 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.
- 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
+ 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.]
 <pre>shared_ptr(shared_ptr const & r); // never throws
template<class Y> shared_ptr(shared_ptr<Y> const & r); // never throws</pre>
 <blockquote>
- Effects: If r is empty, constructs an empty shared_ptr;
+ Effects: If r is empty, constructs an empty shared_ptr;
 otherwise, constructs a shared_ptr that shares ownership with r.
- Postconditions: <code>get() == r.get() && use_count() ==
+ Postconditions: <code>get() == r.get() && use_count() ==
 r.use_count()</code>.
 Throws: nothing.
 </blockquote>
@@ -268,21 +273,21 @@
 r and stores a copy of the pointer stored in r.
 Postconditions: <code>use_count() == r.use_count()</code>.
 Throws: bad_weak_ptr when <code>r.use_count() == 0</code>.
- Exception safety: If an exception is thrown, the constructor has no
+ Exception safety: If an exception is thrown, the constructor has no
 effect.
 </blockquote>
 <pre>template<class Y> shared_ptr(std::auto_ptr<Y> & r);</pre>
 <BLOCKQUOTE>
 Effects: Constructs a shared_ptr, as if by storing a copy of r.release().
 Postconditions: <code>use_count() == 1</code>.
- Throws: std::bad_alloc, or an implementation-defined
+ Throws: std::bad_alloc, or an implementation-defined
 exception when a resource other than memory could not be obtained.
- Exception safety: If an exception is thrown, the constructor has no
+ Exception safety: If an exception is thrown, the constructor has no
 effect.
 </BLOCKQUOTE>
- [This constructor takes a the source auto_ptr by reference and
- not by value, and cannot accept auto_ptr temporaries. This is
- by design, as the constructor offers the strong guarantee; an rvalue reference
+ [This constructor takes a the source auto_ptr by reference and
+ not by value, and cannot accept auto_ptr temporaries. This is
+ by design, as the constructor offers the strong guarantee; an rvalue reference
 would solve this problem, too.]
 <h3><a name="destructor">destructor</a></h3>
 <pre>~shared_ptr(); // never throws</pre>
@@ -290,15 +295,15 @@
 Effects:
 <UL>
 <LI>
- If *this is empty, or shares ownership with
- another shared_ptr instance (<code>use_count() > 1</code>),
+ If *this is empty, or shares ownership with
+ another shared_ptr instance (<code>use_count() > 1</code>),
 there are no side effects.
 <LI>
- Otherwise, if *this owns a pointer p
+ Otherwise, if *this owns a pointer p
 and a deleter d, <code>d(p)</code>
 is called.
 <LI>
- Otherwise, *this owns a pointer p,
+ Otherwise, *this owns a pointer p,
 and <code>delete p</code> is called.</LI></UL>
 Throws: nothing.
 </BLOCKQUOTE>
@@ -309,9 +314,9 @@
 <BLOCKQUOTE>
 Effects: Equivalent to <code>shared_ptr(r).swap(*this)</code>.
 Returns: <code>*this</code>.
- Notes: 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
+ Notes: 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:
 <pre>shared_ptr<int> p(new int);
shared_ptr<void> q(p);
@@ -365,32 +370,32 @@
 <blockquote>
 Returns: <code>use_count() == 1</code>.
 Throws: nothing.
- Notes: <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
+ Notes: <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.
 </blockquote>
 <h3><a name="use_count">use_count</a></h3>
 <pre>long use_count() const; // never throws</pre>
 <blockquote>
- Returns: the number of shared_ptr objects, *this included,
+ Returns: the number of shared_ptr objects, *this included,
 that share ownership with *this, or 0 when *this
 is empty.
 Throws: nothing.
- Notes: <code>use_count()</code> is not necessarily efficient. Use only
+ Notes: <code>use_count()</code> is not necessarily efficient. Use only
 for debugging and testing purposes, not for production code.
 </blockquote>
 <h3><a name="conversions">conversions</a></h3>
 <pre>operator unspecified-bool-type () const; // never throws</pre>
 <blockquote>
- Returns: an unspecified value that, when used in boolean contexts, is
+ Returns: an unspecified value that, when used in boolean contexts, is
 equivalent to <code>get() != 0</code>.
 Throws: nothing.
- Notes: This conversion operator allows shared_ptr 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
+ Notes: This conversion operator allows shared_ptr 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.
 </blockquote>
- [The conversion to bool is not merely syntactic sugar. It allows shared_ptrs
+ [The conversion to bool is not merely syntactic sugar. It allows shared_ptrs
 to be declared in conditions when using dynamic_pointer_cast
 or weak_ptr::lock.]
 <h3><a name="swap">swap</a></h3>
@@ -422,19 +427,19 @@
 operator< 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 operator<, <code>!(a
- < b) && !(b < a)</code>, two shared_ptr instances
+ under the equivalence relation defined by operator<, <code>!(a
+ < b) && !(b < a)</code>, two shared_ptr instances
 are equivalent if and only if they share ownership or are both empty.</LI></UL>
 Throws: nothing.
- Notes: Allows shared_ptr objects to be used as keys in
+ Notes: Allows shared_ptr objects to be used as keys in
 associative containers.
 </blockquote>
 [Operator< has been preferred over a std::less 
 specialization for consistency and legality reasons, as std::less
- is required to return the results of operator<, and many
+ is required to return the results of operator<, and many
 standard algorithms use operator< instead of std::less
- for comparisons when a predicate is not supplied. Composite objects, like std::pair,
- also implement their operator< in terms of their contained
+ for comparisons when a predicate is not supplied. Composite objects, like std::pair,
+ also implement their operator< in terms of their contained
 subobjects' operator<.
 The rest of the comparison operators are omitted by design.]
 <h3><a name="free-swap">swap</a></h3>
@@ -443,11 +448,11 @@
 <BLOCKQUOTE>
 Effects: Equivalent to <code>a.swap(b)</code>.
 Throws: nothing.
- Notes: Matches the interface of std::swap. Provided as an aid to
+ Notes: Matches the interface of std::swap. Provided as an aid to
 generic programming.
 </BLOCKQUOTE>
 [swap is defined in the same namespace as shared_ptr
- as this is currently the only legal way to supply a swap function
+ as this is currently the only legal way to supply a swap function
 that has a chance to be used by the standard library.]
 <h3><a name="get_pointer">get_pointer</a></h3>
 <pre>template<class T>
@@ -464,13 +469,13 @@
 <BLOCKQUOTE>
 Requires: The expression <code>static_cast<T*>(r.get())</code>
 must be well-formed.
- Returns: If r is empty, an empty shared_ptr<T>;
+ Returns: If r is empty, an empty shared_ptr<T>;
 otherwise, a shared_ptr<T> object that stores a copy of <code>
 static_cast<T*>(r.get())</code> and shares ownership with r.
 Throws: nothing.
 Notes: the seemingly equivalent expression
 <code>shared_ptr<T>(static_cast<T*>(r.get()))</code>
- will eventually result in undefined behavior, attempting to delete the same
+ will eventually result in undefined behavior, attempting to delete the same
 object twice.
 </BLOCKQUOTE>
 <h3><a name="const_pointer_cast">const_pointer_cast</a></h3>
@@ -479,13 +484,13 @@
 <BLOCKQUOTE>
 Requires: The expression <code>const_cast<T*>(r.get())</code>
 must be well-formed.
- Returns: If r is empty, an empty shared_ptr<T>;
+ Returns: If r is empty, an empty shared_ptr<T>;
 otherwise, a shared_ptr<T> object that stores a copy of <code>
 const_cast<T*>(r.get())</code> and shares ownership with r.
 Throws: nothing.
 Notes: the seemingly equivalent expression
 <code>shared_ptr<T>(const_cast<T*>(r.get()))</code>
- will eventually result in undefined behavior, attempting to delete the same
+ will eventually result in undefined behavior, attempting to delete the same
 object twice.
 </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 
- shared_ptr<T> object that stores a copy of it and shares
+ shared_ptr<T> object that stores a copy of it and shares
 ownership with r;
 <LI>
 Otherwise, an empty shared_ptr<T> object.</LI></UL>
 Throws: nothing.
 Notes: the seemingly equivalent expression
 <CODE>shared_ptr<T>(dynamic_cast<T*>(r.get()))</CODE>
- will eventually result in undefined behavior, attempting to delete the same
+ will eventually result in undefined behavior, attempting to delete the same
 object twice.
 </BLOCKQUOTE>
 <h3><a name="insertion-operator">operator<<</a></h3>
@@ -520,41 +525,41 @@
 D * get_deleter(shared_ptr<T> const & p);</pre>
 <BLOCKQUOTE>
 Returns: If *this owns a deleter d
- of type (cv-unqualified) D, returns <code>&d</code>;
+ of type (cv-unqualified) D, returns <code>&d</code>;
 otherwise returns 0.
 Throws: nothing.
 </BLOCKQUOTE>
 <h2><a name="example">Example</a></h2>
- See shared_ptr_example.cpp for a
+ See shared_ptr_example.cpp for a
 complete example program. The program builds a std::vector and std::set
 of shared_ptr objects.
 Note that after the containers have been populated, some of the shared_ptr
- objects will have a use count of 1 rather than a use count of 2, since the set
- is a std::set rather than a std::multiset, and thus does not
- contain duplicate entries. Furthermore, the use count may be even higher at
- various times while push_back and insert 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 std::set rather than a std::multiset, and thus does not
+ contain duplicate entries. Furthermore, the use count may be even higher at
+ various times while push_back and insert 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.
 <h2><a name="Handle/Body">Handle/Body</a> Idiom</h2>
- One common usage of shared_ptr is to implement a handle/body (also called
- pimpl) idiom which avoids exposing the body (implementation) in the header
+ One common usage of shared_ptr is to implement a handle/body (also called
+ pimpl) idiom which avoids exposing the body (implementation) in the header
 file.
 The shared_ptr_example2_test.cpp
- sample program includes a header file, shared_ptr_example2.hpp,
- which uses a shared_ptr<> 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 shared_ptr<> 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 T be a complete
+ implementation file. Note that there is no need for an explicit destructor.
+ Unlike ~scoped_ptr, ~shared_ptr does not require that T be a complete
 type.
 <h2><a name="ThreadSafety">Thread Safety</a></h2>
- shared_ptr objects offer the same level of thread safety as
- built-in types. A shared_ptr instance can be "read" (accessed
+ shared_ptr objects offer the same level of thread safety as
+ built-in types. A shared_ptr instance can be "read" (accessed
 using only const operations) simultaneously by multiple threads. Different shared_ptr
 instances can be "written to" (accessed using mutable operations such as operator=
- or reset) simultaneosly by multiple threads (even
- when these instances are copies, and share the same reference count
+ or reset) simultaneosly by multiple threads (even
+ when these instances are copies, and share the same reference count
 underneath.)
 Any other simultaneous accesses result in undefined behavior.
 Examples:
@@ -601,7 +606,7 @@
p3.reset(new int(2)); // undefined, multiple writes
</pre>
  
- Starting with Boost release 1.33.0, shared_ptr uses a lock-free
+ Starting with Boost release 1.33.0, shared_ptr uses a lock-free
 implementation on the following platforms:
 <UL>
 <LI>
@@ -614,75 +619,75 @@
 GNU GCC on PowerPC;
 <LI>
 Windows.</LI></UL>
- If your program is single-threaded and does not link to any libraries that might
+ If your program is single-threaded and does not link to any libraries that might
 have used shared_ptr in its default configuration, you can 
- #define the macro BOOST_SP_DISABLE_THREADS on a
+ #define the macro BOOST_SP_DISABLE_THREADS on a
 project-wide basis to switch to ordinary non-atomic reference count updates.
- (Defining BOOST_SP_DISABLE_THREADS 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.
+ (Defining BOOST_SP_DISABLE_THREADS 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.)
- You can define the macro BOOST_SP_USE_PTHREADS to turn off the
- lock-free platform-specific implementation and fall back to the generic pthread_mutex_t-based
+ You can define the macro BOOST_SP_USE_PTHREADS to turn off the
+ lock-free platform-specific implementation and fall back to the generic pthread_mutex_t-based
 code.
 <h2><a name="FAQ">Frequently Asked Questions</a></h2>
- Q. 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
+ Q. 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?
 
- A. An important goal of shared_ptr 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
+ A. An important goal of shared_ptr 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.) 
 
- Q. Why doesn't shared_ptr have template parameters supplying
+ Q. Why doesn't shared_ptr have template parameters supplying
 traits or policies to allow extensive user customization?
 
- A. Parameterization discourages users. The shared_ptr 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, shared_ptr is the smart
- pointer of choice for a wide range of applications. (Those interested in policy
+ A. Parameterization discourages users. The shared_ptr 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, shared_ptr 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.) 
 
- Q. I am not convinced. Default parameters can be used where appropriate
+ Q. I am not convinced. Default parameters can be used where appropriate
 to hide the complexity. Again, why not policies?
 
- A. Template parameters affect the type. See the answer to the first
+ A. Template parameters affect the type. See the answer to the first
 question above. 
 
 Q. Why doesn't shared_ptr use a linked list implementation?
 
- A. A linked list implementation does not offer enough advantages to
+ A. 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. 
 
- Q. Why doesn't shared_ptr (or any of the other Boost smart
+ Q. Why doesn't shared_ptr (or any of the other Boost smart
 pointers) supply an automatic conversion to T*?
 
 A. Automatic conversion is believed to be too error prone. 
 
 Q. Why does shared_ptr supply use_count()?
 
- A. 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
+ A. 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. 
 
 Q. Why doesn't shared_ptr specify complexity requirements?
 
- A. Because complexity requirements limit implementors and complicate the
- specification without apparent benefit to shared_ptr users. For example,
- error-checking implementations might become non-conforming if they had to meet
+ A. Because complexity requirements limit implementors and complicate the
+ specification without apparent benefit to shared_ptr users. For example,
+ error-checking implementations might become non-conforming if they had to meet
 stringent complexity requirements. 
 
 Q. Why doesn't shared_ptr provide a release() function?
 
- A. shared_ptr cannot give away ownership unless it's unique()
+ A. shared_ptr cannot give away ownership unless it's unique()
 because the other copy will still destroy the object.
 Consider:
 <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>
- Furthermore, the pointer returned by <code>release()</code> would be difficult
- to deallocate reliably, as the source shared_ptr could have been created
+ Furthermore, the pointer returned by <code>release()</code> would be difficult
+ to deallocate reliably, as the source shared_ptr could have been created
 with a custom deleter. 
 
- Q. Why is <code>operator->()</code> const, but its return value is a
+ Q. Why is <code>operator->()</code> const, but its return value is a
 non-const pointer to the element type?
 
- A. 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.shared_ptr is "as close to raw pointers as possible
+ A. 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.shared_ptr is "as close to raw pointers as possible
 but no closer". 
 
 
 <hr>
 
 $Date$
- Copyright 1999 Greg Colvin and Beman Dawes. Copyright 2002 Darin Adler.
- Copyright 2002-2005 Peter Dimov. Distributed under the Boost Software License,
+ 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.
 </body>

Modified: trunk/libs/smart_ptr/smart_ptr.htm
==============================================================================
--- trunk/libs/smart_ptr/smart_ptr.htm (original)
+++ trunk/libs/smart_ptr/smart_ptr.htm 2009-03-11 09:48:51 EDT (Wed, 11 Mar 2009)
@@ -14,15 +14,15 @@
 <a href="#History">History and Acknowledgements</a> 
 <a href="#References">References</a>
 <h2><a name="Introduction">Introduction</a></h2>
- 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
+ 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.
- Conceptually, smart pointers are seen as owning the object pointed to, and thus
+ 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.
- The smart pointer library provides five smart pointer class templates:
+ The smart pointer library provides six smart pointer class templates:
 <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>
 These templates are designed to complement the std::auto_ptr template.
- They are examples of the "resource acquisition is initialization" idiom
- described in Bjarne Stroustrup's "The C++ Programming Language", 3rd edition,
+ 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.
- A test program, smart_ptr_test.cpp, is
+ Additionally, the smart pointer library provides efficient factory functions
+ for creating <code>shared_ptr</code> objects:
+ <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>
+ A test program, smart_ptr_test.cpp, is
 provided to verify correct operation.
- A page on compatibility with older versions of
- the Boost smart pointer library describes some of the changes since earlier
+ 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.
- A page on smart pointer timings will be of interest
+ A page on smart pointer timings will be of interest
 to those curious about performance issues.
- A page on smart pointer programming techniques lists
+ A page on smart pointer programming techniques lists
 some advanced applications of <code>shared_ptr</code> and <code>weak_ptr</code>.
 <h2><a name="common_requirements">Common Requirements</a></h2>
- These smart pointer class templates have a template parameter, T, which
- specifies the type of the object pointed to by the smart pointer. The behavior
+ These smart pointer class templates have a template parameter, T, 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 operator delete
 for objects of type T throw exceptions.
- T may be an incomplete type at the point of smart pointer declaration.
- Unless otherwise specified, it is required that T 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
+ T may be an incomplete type at the point of smart pointer declaration.
+ Unless otherwise specified, it is required that T 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">
 checked_delete</a> function template.
- Note that shared_ptr does not have this restriction, as most of
+ Note that shared_ptr does not have this restriction, as most of
 its member functions do not require T to be a complete type.
 <h3>Rationale</h3>
- The requirements on T 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 T 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
+ The requirements on T 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 T 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.
- Note that scoped_ptr requires that T be a complete type at
+ Note that scoped_ptr requires that T be a complete type at
 destruction time, but shared_ptr does not.
 <h2><a name="Exception_Safety">Exception Safety</a></h2>
- 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 T meets
- the common requirements) is std::bad_alloc,
- and that is thrown only by functions which are explicitly documented as
+ 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 T meets
+ the common requirements) is std::bad_alloc,
+ and that is thrown only by functions which are explicitly documented as
 possibly throwing std::bad_alloc.
 <h2><a name="Exception-specifications">Exception-specifications</a></h2>
 Exception-specifications are not used; see <a href="http://www.boost.org/more/lib_guide.htm#Exception-specification">
 exception-specification rationale</a>.
- All the smart pointer templates contain member functions which can never throw
- exceptions, because they neither throw exceptions themselves nor call other
+ 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>.
 
- Functions which destroy objects of the pointed to type are prohibited from
+ Functions which destroy objects of the pointed to type are prohibited from
 throwing exceptions by the common requirements.
 <h2><a name="History">History</a> and Acknowledgements</h2>
- January 2002. Peter Dimov reworked all four classes, adding features, fixing
- bugs, and splitting them into four separate headers, and added weak_ptr.
- See the compatibility page for a summary of the
+ January 2002. Peter Dimov reworked all four classes, adding features, fixing
+ bugs, and splitting them into four separate headers, and added weak_ptr.
+ See the compatibility page for a summary of the
 changes.
- 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
+ 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.
 November 1999. Darin Adler provided operator ==, operator !=, and std::swap
 and std::less specializations for shared types.
 September 1999. Luis Coelho provided shared_ptr::swap and shared_array::swap
- May 1999. In April and May, 1999, Valentin Bonnard and David Abrahams made a
+ May 1999. In April and May, 1999, Valentin Bonnard and David Abrahams made a
 number of suggestions resulting in numerous improvements.
- October 1998. Beman Dawes proposed reviving the original semantics under the
- names safe_ptr and counted_ptr, 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 std::auto_ptr interface, and various function signatures and
+ October 1998. Beman Dawes proposed reviving the original semantics under the
+ names safe_ptr and counted_ptr, 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 std::auto_ptr interface, and various function signatures and
 semantics were finalized.
- Over the next three months, several implementations were considered for shared_ptr,
- 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
+ Over the next three months, several implementations were considered for shared_ptr,
+ 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>
- 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
+ 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&uumlhl suggested an elegant partial template specialization technique to allow
+ users to choose which implementation they preferred, and that was also
 experimented with.
- But Greg Colvin and Jerry Schwarz argued that "parameterization will discourage
+ But Greg Colvin and Jerry Schwarz argued that "parameterization will discourage
 users", and in the end we choose to supply only the direct implementation.
 Summer, 1994. Greg Colvin proposed to the C++ Standards Committee classes named auto_ptr
 and counted_ptr which were very similar to what we now call scoped_ptr
- and shared_ptr. [Col-94] In one of the very few
- cases where the Library Working Group's recommendations were not followed by
- the full committee, counted_ptr was rejected and surprising
+ and shared_ptr. [Col-94] In one of the very few
+ cases where the Library Working Group's recommendations were not followed by
+ the full committee, counted_ptr was rejected and surprising
 transfer-of-ownership semantics were added to auto_ptr.
 <h2><a name="References">References</a></h2>
 [<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.
 [<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.
 <hr>
 $Date$
- Copyright 1999 Greg Colvin and Beman Dawes. Copyright 2002 Darin Adler.
+ 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>.

Next message: fmhess_at_[hidden]: "[Boost-commit] svn:boost r51700 - trunk/libs/smart_ptr"
Previous message: john_at_[hidden]: "[Boost-commit] svn:boost r51698 - sandbox/tools/auto_index/src"

Date view	Thread view	Subject view	Author view

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