summaryrefslogtreecommitdiff
path: root/libstdc++-v3/doc/xml/manual/utilities.xml
blob: 5c3a8fd4864de2c07eb7dc36d25819da9ca6df6c (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
<chapter xmlns="http://docbook.org/ns/docbook" version="5.0" 
	 xml:id="std.util" xreflabel="Utilities">
<?dbhtml filename="utilities.html"?>

<info><title>
  Utilities
  <indexterm><primary>Utilities</primary></indexterm>
</title>
  <keywordset>
    <keyword>
      ISO C++
    </keyword>
    <keyword>
      library
    </keyword>
  </keywordset>
</info>



<!-- Section 01 : Functors -->
<section xml:id="std.util.functors" xreflabel="Functors"><info><title>Functors</title></info>
<?dbhtml filename="functors.html"?>
  
   <para>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 chapter of their STL, in
      <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://www.sgi.com/tech/stl/functors.html">their
      http://www.sgi.com/tech/stl/functors.html</link>.
   </para>
</section>

<!-- Section 02 : Pairs -->
<section xml:id="std.util.pairs" xreflabel="Pairs"><info><title>Pairs</title></info>
<?dbhtml filename="pairs.html"?>
  
   <para>The <code>pair&lt;T1,T2&gt;</code> 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
      <code>.first</code> and <code>.second</code>.
   </para>
   <para>Construction is simple.  The default ctor initializes each member
      with its respective default ctor.  The other simple ctor,
   </para>
   <programlisting>
    pair (const T1&amp; x, const T2&amp; y);
   </programlisting>
   <para>does what you think it does, <code>first</code> getting <code>x</code>
      and <code>second</code> getting <code>y</code>.
   </para>
   <para>There is a copy constructor, but it requires that your compiler
      handle member function templates:
   </para>
   <programlisting>
    template &lt;class U, class V&gt; pair (const pair&lt;U,V&gt;&amp; p);
   </programlisting>
   <para>The compiler will convert as necessary from U to T1 and from
      V to T2 in order to perform the respective initializations.
   </para>
   <para>The comparison operators are done for you.  Equality
      of two <code>pair&lt;T1,T2&gt;</code>s is defined as both <code>first</code>
      members comparing equal and both <code>second</code> members comparing
      equal; this simply delegates responsibility to the respective
      <code>operator==</code> functions (for types like MyClass) or builtin
      comparisons (for types like int, char, etc).
   </para>
   <para>
      The less-than operator is a bit odd the first time you see it.  It
      is defined as evaluating to:
   </para>
   <programlisting>
    x.first  &lt;  y.first  ||
	( !(y.first  &lt;  x.first)  &amp;&amp;  x.second  &lt;  y.second )
   </programlisting>
   <para>The other operators are not defined using the <code>rel_ops</code>
      functions above, but their semantics are the same.
   </para>
   <para>Finally, there is a template function called <function>make_pair</function>
      that takes two references-to-const objects and returns an
      instance of a pair instantiated on their respective types:
   </para>
   <programlisting>
    pair&lt;int,MyClass&gt; p = make_pair(4,myobject);
   </programlisting>

</section>

<!-- Section 03 : Memory -->
<section xml:id="std.util.memory" xreflabel="Memory"><info><title>Memory</title></info>
<?dbhtml filename="memory.html"?>
  
  <para>
    Memory contains three general areas. First, function and operator
    calls via <function>new</function> and <function>delete</function>
    operator or member function calls.  Second, allocation via
    <classname>allocator</classname>. And finally, smart pointer and
    intelligent pointer abstractions.
  </para>

  <!--  Section 01 : allocator -->
  <xi:include xmlns:xi="http://www.w3.org/2001/XInclude" parse="xml" href="allocator.xml">
  </xi:include>

  <!--  Section 02 : auto_ptr -->
  <xi:include xmlns:xi="http://www.w3.org/2001/XInclude" parse="xml" href="auto_ptr.xml">
  </xi:include>

  <!--  Section 03 : shared_ptr -->
  <xi:include xmlns:xi="http://www.w3.org/2001/XInclude" parse="xml" href="shared_ptr.xml">
  </xi:include>

</section>

<!-- Section 04 : Traits -->
<section xml:id="std.util.traits" xreflabel="Traits"><info><title>Traits</title></info>
<?dbhtml filename="traits.html"?>
  
  <para>
  </para>
</section>

</chapter>