mirror of
git://gcc.gnu.org/git/gcc.git
synced 2024-12-26 19:00:02 +08:00
462b73969e
2001-05-30 Phil Edwards <pme@sources.redhat.com> * docs/doxygen/user.cfg.in: Minor addition. * docs/html/documentation.html: Reorganize. Put most-looked-at stuff first. * docs/html/install.html: Update for 3.0. HTML fixups. * docs/html/17_intro/howto.html: Likewise. * docs/html/18_support/howto.html: Likewise. * docs/html/19_diagnostics/howto.html: Likewise. * docs/html/20_util/howto.html: Likewise. * docs/html/23_containers/howto.html: Likewise. * docs/html/24_iterators/howto.html: Likewise. More notes. * docs/html/25_algorithms/howto.html: Likewise. * docs/html/26_numerics/howto.html: Likewise. More notes. * docs/html/27_io/howto.html: Likewise. * docs/html/ext/howto.html: Likewise. * docs/html/faq/index.html: Likewise. * docs/html/faq/index.txt: Regenerate. * docs/html/27_io/iostreams_hierarchy.pdf: Remove in favor of Doxygen-created documentation. From-SVN: r42723
209 lines
7.9 KiB
HTML
209 lines
7.9 KiB
HTML
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0//EN">
|
|
<HTML>
|
|
<HEAD>
|
|
<META HTTP-EQUIV="Content-Type" CONTENT="text/html; charset=iso-8859-1">
|
|
<META NAME="AUTHOR" CONTENT="pme@sources.redhat.com (Phil Edwards)">
|
|
<META NAME="KEYWORDS" CONTENT="HOWTO, libstdc++, GCC, g++, libg++, STL">
|
|
<META NAME="DESCRIPTION" CONTENT="HOWTO for the libstdc++ chapter 20.">
|
|
<META NAME="GENERATOR" CONTENT="vi and eight fingers">
|
|
<TITLE>libstdc++-v3 HOWTO: Chapter 20</TITLE>
|
|
<LINK REL=StyleSheet HREF="../lib3styles.css">
|
|
<!-- $Id: howto.html,v 1.3 2001/04/03 00:26:55 pme Exp $ -->
|
|
</HEAD>
|
|
<BODY>
|
|
|
|
<H1 CLASS="centered"><A NAME="top">Chapter 20: General Utilities</A></H1>
|
|
|
|
<P>Chapter 20 deals with utility classes and functions, such as
|
|
the oft-debated <TT>auto_ptr<></TT>.
|
|
</P>
|
|
|
|
|
|
<!-- ####################################################### -->
|
|
<HR>
|
|
<H1>Contents</H1>
|
|
<UL>
|
|
<LI><A HREF="#1"><TT>auto_ptr</TT> is not omnipotent</A>
|
|
<LI><A HREF="#2"><TT>auto_ptr</TT> inside container classes</A>
|
|
<LI><A HREF="#3">Functors</A>
|
|
<LI><A HREF="#4">Pairs</A>
|
|
</UL>
|
|
|
|
<HR>
|
|
|
|
<!-- ####################################################### -->
|
|
|
|
<H2><A NAME="1"><TT>auto_ptr</TT> is not omnipotent</A></H2>
|
|
<P>I'm not going to try and explain all of the fun and delicious
|
|
things that can happen with misuse of the auto_ptr class template
|
|
(called AP here), nor am I going to try and teach you how to use
|
|
AP safely in the presence of copying. The AP class is a really
|
|
nifty idea for a smart pointer, but it is one of the dumbest of
|
|
all the smart pointers -- and that's fine.
|
|
</P>
|
|
<P>AP is not meant to be a supersmart solution to all resource
|
|
leaks everywhere. Neither is it meant to be an effective form
|
|
of garbage collection (although it can help, a little bit).
|
|
And it can <EM>not</EM> be used for arrays!
|
|
</P>
|
|
<P>AP <EM>is</EM> meant to prevent nasty leaks in the presence of
|
|
exceptions. That's <EM>all</EM>. This code is AP-friendly:
|
|
<PRE>
|
|
// not a recommend naming scheme, but good for web-based FAQs
|
|
typedef std::auto_ptr<MyClass> APMC;
|
|
|
|
extern function_taking_MyClass_pointer (MyClass*);
|
|
extern some_throwable_function ();
|
|
|
|
void func (int data)
|
|
{
|
|
APMC ap (new MyClass(data));
|
|
|
|
some_throwable_function(); // this will throw an exception
|
|
|
|
function_taking_MyClass_pointer (ap.get());
|
|
}
|
|
</PRE>When an exception gets thrown, the instance of MyClass that's
|
|
been created on the heap will be <TT>delete</TT>'d as the stack is
|
|
unwound past <TT>func()</TT>.
|
|
</P>
|
|
<P>Changing that code as follows is <EM>not</EM> AP-friendly:
|
|
<PRE>
|
|
APMC ap (new MyClass[22]);
|
|
</PRE>You will get the same problems as you would without the use
|
|
of AP:
|
|
<PRE>
|
|
char* array = new char[10]; // array new...
|
|
...
|
|
delete array; // ...but single-object delete
|
|
</PRE>
|
|
</P>
|
|
<P>AP cannot tell whether the pointer you've passed at creation points
|
|
to one or many things. If it points to many things, you are about
|
|
to die. AP is trivial to write, however, so you could write your
|
|
own <TT>auto_array_ptr</TT> for that situation (in fact, this has
|
|
been done many times; check the mailing lists, Usenet, Boost, etc).
|
|
</P>
|
|
<P>Return <A HREF="#top">to top of page</A> or
|
|
<A HREF="../faq/index.html">to the FAQ</A>.
|
|
</P>
|
|
|
|
<HR>
|
|
<H2><A NAME="2"><TT>auto_ptr</TT> inside container classes</A></H2>
|
|
<P>All of the <A HREF="../23_containers/howto.html">containers</A>
|
|
described in the standard library require their contained types
|
|
to have, among other things, a copy contructor like this:
|
|
<PRE>
|
|
struct My_Type
|
|
{
|
|
My_Type (My_Type const&);
|
|
};
|
|
</PRE>
|
|
Note the const keyword; the object being copied shouldn't change.
|
|
The template class <TT>auto_ptr</TT> (called AP here) does not
|
|
meet this requirement. Creating a new AP by copying an existing
|
|
one transfers ownership of the pointed-to object, which means that
|
|
the AP being copied must change, which in turn means that the
|
|
copy ctors of AP do not take const objects.
|
|
</P>
|
|
<P>The resulting rule is simple: <EM>Never ever use a container of
|
|
auto_ptr objects.</EM> The standard says that undefined behavior
|
|
is the result, but it is guaranteed to be messy.
|
|
</P>
|
|
<P>To prevent you from doing this to yourself, the
|
|
<A HREF="../19_diagnostics/howto.html#3">concept checks</A> built
|
|
in to this implementation will issue an error if you try to
|
|
compile code like this:
|
|
<PRE>
|
|
#include <vector>
|
|
#include <memory>
|
|
|
|
void f()
|
|
{
|
|
std::vector< std::auto_ptr<int> > vec_ap_int;
|
|
}
|
|
</PRE>
|
|
Should you try this with the checks enabled, you will see an error.
|
|
</P>
|
|
<P>Return <A HREF="#top">to top of page</A> or
|
|
<A HREF="../faq/index.html">to the FAQ</A>.
|
|
</P>
|
|
|
|
<HR>
|
|
<H2><A NAME="3">Functors</A></H2>
|
|
<P>If you don't know what functors are, you're not alone. Many people
|
|
get slightly the wrong idea. In the interest of not reinventing
|
|
the wheel, we will refer you to the introduction to the functor
|
|
concept written by SGI as part of their STL, in
|
|
<A HREF="http://www.sgi.com/Technology/STL/functors.html">their
|
|
http://www.sgi.com/Technology/STL/functors.html</A>.
|
|
</P>
|
|
<P>Return <A HREF="#top">to top of page</A> or
|
|
<A HREF="../faq/index.html">to the FAQ</A>.
|
|
</P>
|
|
|
|
<HR>
|
|
<H2><A NAME="4">Pairs</A></H2>
|
|
<P>The <TT>pair<T1,T2></TT> is a simple and handy way to
|
|
carry around a pair of objects. One is of type T1, and another of
|
|
type T2; they may be the same type, but you don't get anything
|
|
extra if they are. The two members can be accessed directly, as
|
|
<TT>.first</TT> and <TT>.second</TT>.
|
|
</P>
|
|
<P>Construction is simple. The default ctor initializes each member
|
|
with its respective default ctor. The other simple ctor,
|
|
<PRE>
|
|
pair (const T1& x, const T2& y);
|
|
</PRE>does what you think it does, <TT>first</TT> getting <TT>x</TT>
|
|
and <TT>second</TT> getting <TT>y</TT>.
|
|
</P>
|
|
<P>There is a copy constructor, but it requires that your compiler
|
|
handle member function templates:
|
|
<PRE>
|
|
template <class U, class V> pain (const pair<U,V>& p);
|
|
</PRE>The compiler will convert as necessary from U to T1 and from
|
|
V to T2 in order to perform the respective initializations.
|
|
</P>
|
|
<P>The comparison operators are done for you. Equality
|
|
of two <TT>pair<T1,T2></TT>s is defined as both <TT>first</TT>
|
|
members comparing equal and both <TT>second</TT> members comparing
|
|
equal; this simply delegates responsibility to the respective
|
|
<TT>operator==</TT> functions (for types like MyClass) or builtin
|
|
comparisons (for types like int, char, etc).
|
|
</P>
|
|
<P>The less-than operator is a bit odd the first time you see it. It
|
|
is defined as evaluating to:
|
|
<PRE>
|
|
x.first < y.first ||
|
|
( !(y.first < x.first) && x.second < y.second )
|
|
</PRE>
|
|
The other operators are not defined using the <TT>rel_ops</TT>
|
|
functions above, but their semantics are the same.
|
|
</P>
|
|
<P>Finally, there is a template function called <TT>make_pair</TT>
|
|
that takes two references-to-const objects and returns an
|
|
instance of a pair instantiated on their respective types:
|
|
<PRE>
|
|
pair<int,MyClass> p = make_pair(4,myobject);
|
|
</PRE>
|
|
</P>
|
|
<P>Return <A HREF="#top">to top of page</A> or
|
|
<A HREF="../faq/index.html">to the FAQ</A>.
|
|
</P>
|
|
|
|
|
|
|
|
|
|
<!-- ####################################################### -->
|
|
|
|
<HR>
|
|
<P CLASS="fineprint"><EM>
|
|
Comments and suggestions are welcome, and may be sent to
|
|
<A HREF="mailto:libstdc++@gcc.gnu.org">the mailing list</A>.
|
|
<BR> $Id: howto.html,v 1.3 2001/04/03 00:26:55 pme Exp $
|
|
</EM></P>
|
|
|
|
|
|
</BODY>
|
|
</HTML>
|