Smart pointer and utility changes related to adding checked_delere and checked_array_delete

[SVN r10189]

shared_array.htm

@@ -108,17 +108,23 @@ name BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION is defined.</p>
 <p>Provides the type of the stored pointer.</p>
 <h3><a name="shared_array_ctor">shared_array constructors</a></h3>
 <pre>explicit shared_array( T* p=0 );</pre>
+<p><b>T</b> is required be a complete type at point of instantiation.&nbsp; See <a href="smart_ptr.htm#Common requirements">Common
+Requirements</a>.</p>
 <p>Constructs a <strong>shared_array</strong>, storing a copy of <tt>p</tt>,
 which must have been allocated via a C++ <tt>new</tt>[] expression or be 0.
 Afterwards, use_count() is 1 (even if p==0; see <a href="#shared_array_~shared_array">~shared_array</a>).</p>
 <p>The only exception which may be thrown is <tt>std::bad_alloc</tt>.&nbsp; If
 an exception is thrown,&nbsp; <tt>delete[] p</tt> is called.</p>
 <pre>shared_array( const shared_array&amp; r);  // never throws</pre>
+<p><b>T</b> is not required be a complete type at point of instantiation.&nbsp;
+See <a href="smart_ptr.htm#Common requirements">Common Requirements</a>.</p>
 <p>Constructs a <strong>shared_array</strong>, as if by storing a copy of the
 pointer stored in <strong>r</strong>. Afterwards, <strong>use_count()</strong>
 for all copies is 1 more than the initial <strong>r.use_count()</strong>.</p>
 <h3><a name="shared_array_~shared_array">shared_array destructor</a></h3>
 <pre>~shared_array();</pre>
+<p><b>T</b> is required be a complete type at point of instantiation.&nbsp; See <a href="smart_ptr.htm#Common requirements">Common
+Requirements</a>.</p>
 <p>If <strong>use_count()</strong> == 1, deletes the array pointed to by the
 stored pointer.&nbsp;Otherwise, <strong>use_count()</strong> for any remaining
 copies is decremented by 1. Note that in C++ <tt>delete</tt>[] on a pointer with
@@ -126,6 +132,8 @@ a value of 0 is harmless.</p>
 <p>Does not throw exceptions.</p>
 <h3>shared_array <a name="shared_array_operator=">operator=</a></h3>
 <pre>shared_array&amp; operator=( const shared_array&amp; r);  // never throws</pre>
+<p><b>T</b> is required be a complete type at point of instantiation.&nbsp; See <a href="smart_ptr.htm#Common requirements">Common
+Requirements</a>.</p>
 <p>First, if <strong>use_count()</strong> == 1, deletes the array pointed to by
 the stored pointer.&nbsp;Otherwise, <strong>use_count()</strong> for any
 remaining copies is decremented by 1. Note that in C++ <tt>delete</tt>[] on a
@@ -135,6 +143,8 @@ of the pointer stored in <strong>r</strong>. Afterwards, <strong>use_count()</st
 for all copies is 1 more than the initial <strong>r.use_count()</strong>.&nbsp;</p>
 <h3>shared_array <a name="shared_array_reset">reset</a></h3>
 <pre>void reset( T* p=0 );</pre>
+<p><b>T</b> is required be a complete type at point of instantiation.&nbsp; See <a href="smart_ptr.htm#Common requirements">Common
+Requirements</a>.</p>
 <p>First, if <strong>use_count()</strong> == 1, deletes the array pointed to by
 the stored pointer.&nbsp;Otherwise, <strong>use_count()</strong> for any
 remaining copies is decremented by 1. Note that in C++&nbsp; <tt>delete</tt>[]
@@ -147,6 +157,8 @@ see <a href="#shared_array_~shared_array">~shared_array</a>).</p>
 an exception is thrown,&nbsp; <tt>delete[] p</tt> is called.</p>
 <h3>shared_array <a name="shared_array_operator[]">operator[]</a></h3>
 <p><tt>T&amp; operator[](std::size_t i) const; // never throws</tt></p>
+<p><b>T</b> is required be a complete type at point of instantiation.&nbsp; See <a href="smart_ptr.htm#Common requirements">Common
+Requirements</a>.</p>
 <p>Returns a reference to element <tt>i</tt> of the array pointed to by the
 stored pointer.</p>
 <p>Behavior is undefined (and almost certainly undesirable) if <tt>get()==0</tt>,
@@ -154,16 +166,24 @@ or if <tt>i</tt> is less than 0 or is greater or equal to the number of elements
 in the array.</p>
 <h3>shared_array <a name="shared_array_get">get</a></h3>
 <pre>T* get() const;  // never throws</pre>
+<p><b>T</b> is not required be a complete type at point of instantiation.&nbsp;
+See <a href="smart_ptr.htm#Common requirements">Common Requirements</a>.</p>
 <p>Returns the stored pointer.</p>
 <h3>shared_array<a name="shared_array_use_count"> use_count</a></h3>
 <p><tt>long use_count() const; // never throws</tt></p>
+<p><b>T</b> is not required be a complete type at point of instantiation.&nbsp;
+See <a href="smart_ptr.htm#Common requirements">Common Requirements</a>.</p>
 <p>Returns the number of <strong>shared_arrays</strong> sharing ownership of the
 stored pointer.</p>
 <h3>shared_array <a name="shared_array_unique">unique</a></h3>
 <p><tt>bool unique() const; // never throws</tt></p>
+<p><b>T</b> is not required be a complete type at point of instantiation.&nbsp;
+See <a href="smart_ptr.htm#Common requirements">Common Requirements</a>.</p>
 <p>Returns <strong>use_count()</strong> == 1.</p>
 <h3><a name="shared_array_swap">shared_array swap</a></h3>
 <p><code>void swap( shared_array&lt;T&gt;&amp; other ) throw()</code></p>
+<p><b>T</b> is not required be a complete type at point of instantiation.&nbsp;
+See <a href="smart_ptr.htm#Common requirements">Common Requirements</a>.</p>
 <p>Swaps the two smart pointers, as if by std::swap.</p>
 <h2>Class <a name="shared_array_example">shared_array example</a></h2>
 <p>[To be supplied. In the meantime, see <a href="smart_ptr_test.cpp">smart_ptr_test.cpp</a>.]</p>