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
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
|
<!DOCTYPE html
PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
<!-- saved from url=(0014)about:internet -->
<html xmlns:MSHelp="http://www.microsoft.com/MSHelp/" lang="en-us" xml:lang="en-us"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
<meta name="DC.Type" content="reference">
<meta name="DC.Title" content="Container Range Concept">
<meta name="DC.subject" content="Container Range Concept">
<meta name="keywords" content="Container Range Concept">
<meta name="DC.Relation" scheme="URI" content="../../reference/containers_overview.htm">
<meta name="DC.Relation" scheme="URI" content="concurrent_hash_map_cls.htm">
<meta name="DC.Relation" scheme="URI" content="concurrent_vector.htm">
<meta name="DC.Relation" scheme="URI" content="../algorithms/parallel_for_func.htm">
<meta name="DC.Relation" scheme="URI" content="../algorithms/parallel_reduce_func.htm">
<meta name="DC.Relation" scheme="URI" content="../algorithms/parallel_scan_func.htm">
<meta name="DC.Relation" scheme="URI" content="../algorithms/range_concept.htm">
<meta name="DC.Relation" scheme="URI" content="concurrent_hash_map_cls/capacity_map_cls.htm">
<meta name="DC.Relation" scheme="URI" content="concurrent_vector/parallel_iteration.htm">
<meta name="DC.Format" content="XHTML">
<meta name="DC.Identifier" content="container_range_concept">
<meta name="DC.Language" content="en-US">
<link rel="stylesheet" type="text/css" href="../../intel_css_styles.css">
<title>Container Range Concept</title>
</head>
<body id="container_range_concept">
<!-- ==============(Start:NavScript)================= -->
<script src="..\..\NavScript.js" language="JavaScript1.2" type="text/javascript"></script>
<script language="JavaScript1.2" type="text/javascript">WriteNavLink(2);</script>
<!-- ==============(End:NavScript)================= -->
<a name="container_range_concept"><!-- --></a>
<h1 class="topictitle1">Container Range Concept</h1>
<div>
<div class="section"><h2 class="sectiontitle">Summary</h2>
<p>View set of items in a container as a recursively
divisible range.
</p>
</div>
<div class="section"><h2 class="sectiontitle">Requirements</h2>
<p>A Container Range is a
<strong>Range</strong> with the further requirements listed in below.
</p>
<div class="tablenoborder"><a name="tbl18"><!-- --></a><table cellpadding="4" summary="" id="tbl18" width="100%" frame="hsides" border="1" rules="all"><caption><span class="tablecap">Additional Requirements on a Container
Range R</span></caption>
<thead align="left">
<tr>
<th class="cellrowborder" valign="top" width="NaN%" id="d59076e52">
<p><strong>Pseudo-Signature</strong>
</p>
</th>
<th class="row-nocellborder" valign="top" width="NaN%" id="d59076e60">
<p><strong>Semantics</strong>
</p>
</th>
</tr>
</thead>
<tbody>
<tr>
<td class="cellrowborder" valign="top" width="NaN%" headers="d59076e52 ">
<p><samp class="codeph">R::value_type</samp>
</p>
</td>
<td class="row-nocellborder" valign="top" width="NaN%" headers="d59076e60 ">
<p>Item type
</p>
</td>
</tr>
<tr>
<td class="cellrowborder" valign="top" width="NaN%" headers="d59076e52 ">
<p><samp class="codeph">R::reference</samp>
</p>
</td>
<td class="row-nocellborder" valign="top" width="NaN%" headers="d59076e60 ">
<p>Item reference type
</p>
</td>
</tr>
<tr>
<td class="cellrowborder" valign="top" width="NaN%" headers="d59076e52 ">
<p><samp class="codeph">R::const_reference</samp>
</p>
</td>
<td class="row-nocellborder" valign="top" width="NaN%" headers="d59076e60 ">
<p>Item const reference type
</p>
</td>
</tr>
<tr>
<td class="cellrowborder" valign="top" width="NaN%" headers="d59076e52 ">
<p><samp class="codeph">R::difference_type</samp>
</p>
</td>
<td class="row-nocellborder" valign="top" width="NaN%" headers="d59076e60 ">
<p>Type for difference of two iterators
</p>
</td>
</tr>
<tr>
<td class="cellrowborder" valign="top" width="NaN%" headers="d59076e52 ">
<p><samp class="codeph">R::iterator</samp>
</p>
</td>
<td class="row-nocellborder" valign="top" width="NaN%" headers="d59076e60 ">
<p>Iterator type for range
</p>
</td>
</tr>
<tr>
<td class="cellrowborder" valign="top" width="NaN%" headers="d59076e52 ">
<p><samp class="codeph">R::iterator R::begin()</samp>
</p>
</td>
<td class="row-nocellborder" valign="top" width="NaN%" headers="d59076e60 ">
<p>First item in range
</p>
</td>
</tr>
<tr>
<td class="cellrowborder" valign="top" width="NaN%" headers="d59076e52 ">
<p><samp class="codeph">R::iterator R::end()</samp>
</p>
</td>
<td class="row-nocellborder" valign="top" width="NaN%" headers="d59076e60 ">
<p>One past last item in range
</p>
</td>
</tr>
<tr>
<td class="cellrowborder" valign="top" width="NaN%" headers="d59076e52 ">
<p><samp class="codeph">R::size_type R::grainsize()
const</samp>
</p>
</td>
<td class="row-nocellborder" valign="top" width="NaN%" headers="d59076e60 ">
<p>Grain size
</p>
</td>
</tr>
</tbody>
</table>
</div>
</div>
<div class="section"><h2 class="sectiontitle">Model Types</h2>
<p>Classes
<samp class="codeph">concurrent_hash_map</samp> and
<samp class="codeph">concurrent_vector</samp> both have member types
<samp class="codeph">range_type</samp> and
<samp class="codeph">const_range_type</samp> that model a Container Range.
</p>
<p>Use the range types in conjunction with
<samp class="codeph">parallel_for</samp>,
<samp class="codeph">parallel_reduce</samp>, and
<samp class="codeph">parallel_scan</samp> to iterate over items in a container.
</p>
</div>
</div>
<div class="familylinks">
<div class="parentlink"><strong>Parent topic:</strong> <a href="../../reference/containers_overview.htm">Containers Overview</a></div>
</div>
<div class="See Also">
<h2>See Also</h2>
<div class="linklist">
<div><a href="concurrent_hash_map_cls.htm">concurrent_hash_map
</a></div>
<div><a href="concurrent_vector.htm">concurrent_vector
</a></div>
<div><a href="../algorithms/parallel_for_func.htm">parallel_for
</a></div>
<div><a href="../algorithms/parallel_reduce_func.htm">parallel_reduce
</a></div>
<div><a href="../algorithms/parallel_scan_func.htm">parallel_scan
</a></div>
<div><a href="../algorithms/range_concept.htm">Range
</a></div>
<div><a href="concurrent_hash_map_cls/capacity_map_cls.htm">Capacity
</a></div>
<div><a href="concurrent_vector/parallel_iteration.htm">Parallel Iteration
</a></div></div>
</div>
</body>
</html>
|
