File: transform.html

package info (click to toggle)
stl-manual 3.30-6
  • links: PTS
  • area: main
  • in suites: etch, etch-m68k
  • size: 4,092 kB
  • ctags: 4,448
  • sloc: cpp: 17,845; ansic: 2,842; makefile: 41
file content (203 lines) | stat: -rw-r--r-- 8,822 bytes parent folder | download | duplicates (7)
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
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
<HTML>
<!--
  -- Copyright (c) 1996-1999
  -- Silicon Graphics Computer Systems, Inc.
  --
  -- Permission to use, copy, modify, distribute and sell this software
  -- and its documentation for any purpose is hereby granted without fee,
  -- provided that the above copyright notice appears in all copies and
  -- that both that copyright notice and this permission notice appear
  -- in supporting documentation.  Silicon Graphics makes no
  -- representations about the suitability of this software for any
  -- purpose.  It is provided "as is" without express or implied warranty.
  --
  -- Copyright (c) 1994
  -- Hewlett-Packard Company
  --
  -- Permission to use, copy, modify, distribute and sell this software
  -- and its documentation for any purpose is hereby granted without fee,
  -- provided that the above copyright notice appears in all copies and
  -- that both that copyright notice and this permission notice appear
  -- in supporting documentation.  Hewlett-Packard Company makes no
  -- representations about the suitability of this software for any
  -- purpose.  It is provided "as is" without express or implied warranty.
  --
  -->
<Head>
<Title>transform</Title>
<!-- Generated by htmldoc -->
</HEAD>
<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
	ALINK="#ff0000"> 
<IMG SRC="CorpID.gif" 
     ALT="SGI" HEIGHT="43" WIDTH="151"> 
<!--end header-->
<BR Clear>
<H1>transform</H1>

<Table CellPadding=0 CellSpacing=0 width=100%>
<TR>
<TD Align=left><Img src = "algorithms.gif" Alt=""   WIDTH = "194"  HEIGHT = "38" ></TD>
<TD Align=right><Img src = "function.gif" Alt=""   WIDTH = "194"  HEIGHT = "38" ></TD>
</TR>
<TR>
<TD Align=left VAlign=top><b>Category</b>: algorithms</TD>
<TD Align=right VAlign=top><b>Component type</b>: function</TD>
</TR>
</Table>

<h3>Prototype</h3>
<tt>Transform</tt> is an overloaded name; there are actually two <tt>transform</tt>
functions.
<pre>
template &lt;class <A href="InputIterator.html">InputIterator</A>, class <A href="OutputIterator.html">OutputIterator</A>, class <A href="UnaryFunction.html">UnaryFunction</A>&gt;
OutputIterator transform(InputIterator first, InputIterator last,
                         OutputIterator result, UnaryFunction op);


template &lt;class <A href="InputIterator.html">InputIterator</A>1, class <A href="InputIterator.html">InputIterator</A>2, class <A href="OutputIterator.html">OutputIterator</A>,
          class <A href="BinaryFunction.html">BinaryFunction</A>&gt;
OutputIterator transform(InputIterator1 first1, InputIterator1 last1,
                         InputIterator2 first2, OutputIterator result,
                         BinaryFunction binary_op);
</pre>                   
<h3>Description</h3>
<tt>Transform</tt> performs an operation on objects; there are two versions
of <tt>transform</tt>, one of which uses a single range of <A href="InputIterator.html">Input Iterators</A>
and one of which uses two ranges of <A href="InputIterator.html">Input Iterators</A>.
<P>
The first version of <tt>transform</tt> performs the operation <tt>op(*i)</tt>
for each iterator <tt>i</tt> in the range <tt>[first, last)</tt>, and assigns
the result of that operation to <tt>*o</tt>, where <tt>o</tt> is the corresponding
output iterator.  That is, for each <tt>n</tt> such that <tt>0 &lt;= n &lt; last - first</tt>,
it performs the assignment <tt>*(result + n) = op(*(first + n))</tt>.
The return value is <tt>result + (last - first)</tt>.
<P>
The second version of <tt>transform</tt> is very similar, except that it
uses a <A href="BinaryFunction.html">Binary Function</A> instead of a <A href="UnaryFunction.html">Unary Function</A>:
it performs the operation <tt>op(*i1, *i2)</tt> for each iterator <tt>i1</tt> in the
range <tt>[first1, last1)</tt> and assigns the result to <tt>*o</tt>, where
<tt>i2</tt> is the corresponding iterator in the second input range and
where <tt>o</tt> is the corresponding output iterator.  That is, 
for each <tt>n</tt> such that <tt>0 &lt;= n &lt; last1 - first1</tt>,
it performs the assignment <tt>*(result + n) = op(*(first1 + n), *(first2
+ n)</tt>.  The return value is <tt>result + (last1 - first1)</tt>.
<P>
Note that <tt>transform</tt> may be used to modify a sequence &quot;in place&quot;:
it is permissible for the iterators <tt>first</tt> and <tt>result</tt> to be the same. <A href="#1">[1]</A>
<h3>Definition</h3>
Defined in the standard header <A href="algorithm">algorithm</A>, and in the nonstandard
backward-compatibility header <A href="algo.h">algo.h</A>.
<h3>Requirements on types</h3>
For the first (unary) version: 
<UL>
<LI>
<tt>InputIterator</tt> must be a model of <A href="InputIterator.html">Input Iterator</A>.
<LI>
<tt>OutputIterator</tt> must be a model of <A href="OutputIterator.html">Output Iterator</A>.
<LI>
<tt>UnaryFunction</tt> must be a model of <A href="UnaryFunction.html">Unary Function</A>.
<LI>
<tt>InputIterator</tt>'s value type must be
   convertible to <tt>UnaryFunction</tt>'s argument type.
<LI>
<tt>UnaryFunction</tt>'s result type must be convertible to a type in
   <tt>OutputIterator</tt>'s set of value types.
</UL>
For the second (binary) version:
<UL>
<LI>
<tt>InputIterator1</tt> and <tt>InputIterator2</tt>
   must be models of <A href="InputIterator.html">Input Iterator</A>.
<LI>
<tt>OutputIterator</tt> must be a model of <A href="OutputIterator.html">Output Iterator</A>.
<LI>
<tt>BinaryFunction</tt> must be a model of <A href="BinaryFunction.html">Binary Function</A>.
<LI>
<tt>InputIterator1</tt>'s and <tt>InputIterator2</tt>'s value types must
   be convertible, respectively, to <tt>BinaryFunction</tt>'s first and second
   argument types.
<LI>
<tt>UnaryFunction</tt>'s result type must be convertible
   to a type in <tt>OutputIterator</tt>'s set of value types.
</UL>
<h3>Preconditions</h3>
For the first (unary) version: 
<UL>
<LI>
<tt>[first, last)</tt> is a valid range.
<LI>
<tt>result</tt> is not an iterator within the range <tt>[first+1, last)</tt>. <A href="#1">[1]</A>
<LI>
There is enough space to hold all of the elements being copied.
   More formally, the requirement is that 
   <tt>[result, result + (last - first))</tt> is a valid range. 
</UL>
For the second (binary) version:
<UL>
<LI>
<tt>[first1, last1)</tt> is a valid range.
<LI>
<tt>[first2, first2 + (last1 - first1))</tt> is a valid range.
<LI>
<tt>result</tt> is not an iterator within the range <tt>[first1+1, last1)</tt>
    or <tt>[first2 + 1, first2 + (last1 - first1))</tt>.
<LI>
There is enough space to hold all of the elements being copied.
   More formally, the requirement is that 
   <tt>[result, result + (last1 - first1))</tt> is a valid range.
</UL>
<h3>Complexity</h3>
Linear.  The operation is applied exactly <tt>last - first</tt> times 
in the case of the unary version, or <tt>last1 - first1</tt> in the case
of the binary version.
<h3>Example</h3>
Replace every number in an array with its negative.
<pre>
const int N = 1000;
double A[N];
<A href="iota.html">iota</A>(A, A+N, 1);

transform(A, A+N, A, <A href="negate.html">negate</A>&lt;double&gt;());
</pre>
<P>
Calculate the sum of two vectors, storing the result in a third vector.
<pre>
const int N = 1000;
<A href="Vector.html">vector</A>&lt;int&gt; V1(N);
<A href="Vector.html">vector</A>&lt;int&gt; V2(N);
<A href="Vector.html">vector</A>&lt;int&gt; V3(N);

<A href="iota.html">iota</A>(V1.begin(), V1.end(), 1);
<A href="fill.html">fill</A>(V2.begin(), V2.end(), 75);

assert(V2.size() &gt;= V1.size() &amp;&amp; V3.size() &gt;= V1.size());
transform(V1.begin(), V1.end(), V2.begin(), V3.begin(),
          <A href="plus.html">plus</A>&lt;int&gt;());
</pre>
<h3>Notes</h3>
<P><A name="1">[1]</A>
The <A href="OutputIterator.html">Output Iterator</A> <tt>result</tt> is not permitted to be the same as
any of the <A href="InputIterator.html">Input Iterators</A> in the range <tt>[first, last)</tt>, with the
exception of <tt>first</tt> itself.  That is: 
<tt>transform(V.begin(), V.end(), V.begin(), fabs)</tt> is valid, but
<tt>transform(V.begin(), V.end(), V.begin() + 1, fabs)</tt> is not.
<h3>See also</h3>
The <A href="functors.html">function object overview</A>, <tt><A href="copy.html">copy</A></tt>, <tt><A href="generate.html">generate</A></tt>, 
<tt><A href="fill.html">fill</A></tt>

<!--start footer--> 
<HR SIZE="6">
<A href="http://www.sgi.com/"><IMG SRC="surf.gif" HEIGHT="54" WIDTH="54" 
        ALT="[Silicon Surf]"></A>
<A HREF="index.html"><IMG SRC="stl_home.gif" 
        HEIGHT="54" WIDTH="54" ALT="[STL Home]"></A>
<BR>
<FONT SIZE="-2">
<A href="http://www.sgi.com/Misc/sgi_info.html" TARGET="_top">Copyright &copy; 
1999 Silicon Graphics, Inc.</A> All Rights Reserved.</FONT>
<FONT SIZE="-3"><a href="http://www.sgi.com/Misc/external.list.html" TARGET="_top">TrademarkInformation</A>
</FONT>
<P>
</BODY>
</HTML>