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
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
|
<!--
Licensed to the Apache Software Foundation (ASF) under one
or more contributor license agreements. See the NOTICE file
distributed with this work for additional information
regarding copyright ownership. The ASF licenses this file
to you under the Apache License, Version 2.0 (the
"License"); you may not use this file except in compliance
with the License. You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing,
software distributed under the License is distributed on an
"AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
KIND, either express or implied. See the License for the
specific language governing permissions and limitations
under the License.
-->
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html>
<head>
<meta http-equiv="Content-Type" content="text/html;charset=UTF-8">
<title>qpid/RangeSet.h Source File</title>
<link href="doxygen.css" rel="stylesheet" type="text/css">
<link href="tabs.css" rel="stylesheet" type="text/css">
</head>
<body bgcolor="#FFFFFF">
<table border="0" width="90%" align="center">
<tr>
<td align="left">
<a title="Apache Qpid Project Page" href="http://qpid.apache.org">Apache Qpid - AMQP Messaging for Java JMS, C++, Python, Ruby, and .NET</a>
</td>
<td align="right">
<a title="Apache Qpid Documentation" href="http://qpid.apache.org/documentation.html">Apache Qpid Documentation</a>
</td>
</tr>
</table>
<!-- Generated by Doxygen 1.7.5 -->
<div id="navrow1" class="tabs">
<ul class="tablist">
<li><a href="index.html"><span>Main Page</span></a></li>
<li><a href="modules.html"><span>Modules</span></a></li>
<li><a href="namespaces.html"><span>Namespaces</span></a></li>
<li><a href="annotated.html"><span>Classes</span></a></li>
<li class="current"><a href="files.html"><span>Files</span></a></li>
</ul>
</div>
<div id="navrow2" class="tabs2">
<ul class="tablist">
<li><a href="files.html"><span>File List</span></a></li>
<li><a href="globals.html"><span>File Members</span></a></li>
</ul>
</div>
<div class="header">
<div class="headertitle">
<div class="title">qpid/RangeSet.h</div> </div>
</div>
<div class="contents">
<a href="a00548.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="preprocessor">#ifndef QPID_RANGESET_H</span>
<a name="l00002"></a>00002 <span class="preprocessor"></span><span class="preprocessor">#define QPID_RANGESET_H</span>
<a name="l00003"></a>00003 <span class="preprocessor"></span>
<a name="l00004"></a>00004 <span class="comment">/*</span>
<a name="l00005"></a>00005 <span class="comment"> *</span>
<a name="l00006"></a>00006 <span class="comment"> * Licensed to the Apache Software Foundation (ASF) under one</span>
<a name="l00007"></a>00007 <span class="comment"> * or more contributor license agreements. See the NOTICE file</span>
<a name="l00008"></a>00008 <span class="comment"> * distributed with this work for additional information</span>
<a name="l00009"></a>00009 <span class="comment"> * regarding copyright ownership. The ASF licenses this file</span>
<a name="l00010"></a>00010 <span class="comment"> * to you under the Apache License, Version 2.0 (the</span>
<a name="l00011"></a>00011 <span class="comment"> * "License"); you may not use this file except in compliance</span>
<a name="l00012"></a>00012 <span class="comment"> * with the License. You may obtain a copy of the License at</span>
<a name="l00013"></a>00013 <span class="comment"> *</span>
<a name="l00014"></a>00014 <span class="comment"> * http://www.apache.org/licenses/LICENSE-2.0</span>
<a name="l00015"></a>00015 <span class="comment"> *</span>
<a name="l00016"></a>00016 <span class="comment"> * Unless required by applicable law or agreed to in writing,</span>
<a name="l00017"></a>00017 <span class="comment"> * software distributed under the License is distributed on an</span>
<a name="l00018"></a>00018 <span class="comment"> * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY</span>
<a name="l00019"></a>00019 <span class="comment"> * KIND, either express or implied. See the License for the</span>
<a name="l00020"></a>00020 <span class="comment"> * specific language governing permissions and limitations</span>
<a name="l00021"></a>00021 <span class="comment"> * under the License.</span>
<a name="l00022"></a>00022 <span class="comment"> *</span>
<a name="l00023"></a>00023 <span class="comment"> */</span>
<a name="l00024"></a>00024
<a name="l00025"></a>00025 <span class="preprocessor">#include "<a class="code" href="a00528.html">qpid/InlineVector.h</a>"</span>
<a name="l00026"></a>00026 <span class="preprocessor">#include <boost/iterator/iterator_facade.hpp></span>
<a name="l00027"></a>00027 <span class="preprocessor">#include <boost/operators.hpp></span>
<a name="l00028"></a>00028 <span class="preprocessor">#include <boost/bind.hpp></span>
<a name="l00029"></a>00029 <span class="preprocessor">#include <algorithm></span>
<a name="l00030"></a>00030 <span class="preprocessor">#include <numeric></span>
<a name="l00031"></a>00031
<a name="l00032"></a>00032 <span class="keyword">namespace </span>qpid {
<a name="l00033"></a>00033
<a name="l00038"></a>00038 <span class="keyword">template</span> <<span class="keyword">class</span> T>
<a name="l00039"></a>00039 <span class="keyword">class </span>Range {
<a name="l00040"></a>00040 <span class="keyword">public</span>:
<a name="l00041"></a><a class="code" href="a00267.html#ace1bf6189190391528b2fe3568bab047">00041</a> <span class="keyword">static</span> <a class="code" href="a00267.html" title="A range of values, used in RangeSet.">Range</a> <a class="code" href="a00267.html#ace1bf6189190391528b2fe3568bab047">makeClosed</a>(<span class="keyword">const</span> T& <a class="code" href="a00267.html#a4c5737144ff7b90a84ad61a005789eae">first</a>, T <a class="code" href="a00267.html#ae83ef914c82a39d4c904cacc7eb6a098" title="Last in closed range, i.e.">last</a>) { <span class="keywordflow">return</span> <a class="code" href="a00267.html#a5519595ba5f1bc551ff7299188774718">Range</a>(first, ++last); }
<a name="l00042"></a>00042
<a name="l00043"></a><a class="code" href="a00267.html#a5519595ba5f1bc551ff7299188774718">00043</a> <a class="code" href="a00267.html#a5519595ba5f1bc551ff7299188774718">Range</a>() : begin_(), end_() {}
<a name="l00044"></a><a class="code" href="a00267.html#a597143eca6cb7aa24744a0986d111cc6">00044</a> <span class="keyword">explicit</span> <a class="code" href="a00267.html#a597143eca6cb7aa24744a0986d111cc6">Range</a>(<span class="keyword">const</span> T& t) : begin_(t), end_(t) { ++end_; }
<a name="l00045"></a><a class="code" href="a00267.html#a9e7b042a7562dab27caf5758ba146c9a">00045</a> <a class="code" href="a00267.html#a9e7b042a7562dab27caf5758ba146c9a">Range</a>(<span class="keyword">const</span> T& b, <span class="keyword">const</span> T& e) : begin_(b), end_(e) { assert(b <= e); }
<a name="l00046"></a>00046
<a name="l00047"></a><a class="code" href="a00267.html#a0a077c9ebfcd09d9c597ad38e32e2626">00047</a> T <a class="code" href="a00267.html#a0a077c9ebfcd09d9c597ad38e32e2626">begin</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> begin_; }
<a name="l00049"></a><a class="code" href="a00267.html#ad5cddcac7a1ae006d1c8ad0143cd967f">00049</a> T <a class="code" href="a00267.html#ad5cddcac7a1ae006d1c8ad0143cd967f" title="End of _open_ range, i.e.">end</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> end_; }
<a name="l00050"></a>00050
<a name="l00051"></a><a class="code" href="a00267.html#a4c5737144ff7b90a84ad61a005789eae">00051</a> T <a class="code" href="a00267.html#a4c5737144ff7b90a84ad61a005789eae">first</a>()<span class="keyword"> const </span>{ assert(!<a class="code" href="a00267.html#af44f9c08e4385b817f18420b355532ce">empty</a>()); <span class="keywordflow">return</span> begin_; }
<a name="l00053"></a><a class="code" href="a00267.html#ae83ef914c82a39d4c904cacc7eb6a098">00053</a> T <a class="code" href="a00267.html#ae83ef914c82a39d4c904cacc7eb6a098" title="Last in closed range, i.e.">last</a>()<span class="keyword"> const </span>{ assert(!<a class="code" href="a00267.html#af44f9c08e4385b817f18420b355532ce">empty</a>()); T ret=end_; <span class="keywordflow">return</span> --ret; }
<a name="l00054"></a>00054
<a name="l00055"></a><a class="code" href="a00267.html#a1d137f912e223d058894719c241ae3fa">00055</a> <span class="keywordtype">void</span> <a class="code" href="a00267.html#a1d137f912e223d058894719c241ae3fa">begin</a>(<span class="keyword">const</span> T& t) { begin_ = t; }
<a name="l00056"></a><a class="code" href="a00267.html#a672899318dea8eba4413a7d31233fa6d">00056</a> <span class="keywordtype">void</span> <a class="code" href="a00267.html#a672899318dea8eba4413a7d31233fa6d">end</a>(<span class="keyword">const</span> T& t) { end_ = t; }
<a name="l00057"></a><a class="code" href="a00267.html#ab316bde8f2ba31652d1b6b5de5125532">00057</a> <span class="keywordtype">size_t</span> <a class="code" href="a00267.html#ab316bde8f2ba31652d1b6b5de5125532">size</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> end_ - begin_; }
<a name="l00058"></a><a class="code" href="a00267.html#af44f9c08e4385b817f18420b355532ce">00058</a> <span class="keywordtype">bool</span> <a class="code" href="a00267.html#af44f9c08e4385b817f18420b355532ce">empty</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> begin_ == end_; }
<a name="l00059"></a>00059
<a name="l00060"></a><a class="code" href="a00267.html#af8406197041463af2f877e8781b61d24">00060</a> <span class="keywordtype">bool</span> <a class="code" href="a00267.html#af8406197041463af2f877e8781b61d24">contains</a>(<span class="keyword">const</span> T& x)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> begin_ <= x && x < end_; }
<a name="l00061"></a><a class="code" href="a00267.html#a3d28f48937798ed4fad4ea003f7312a4">00061</a> <span class="keywordtype">bool</span> <a class="code" href="a00267.html#a3d28f48937798ed4fad4ea003f7312a4">contains</a>(<span class="keyword">const</span> <a class="code" href="a00267.html" title="A range of values, used in RangeSet.">Range</a>& r)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> begin_ <= r.begin_ && r.end_ <= end_; }
<a name="l00062"></a><a class="code" href="a00267.html#af820cb62ae7ee89e10a530f3fa3e57f3">00062</a> <span class="keywordtype">bool</span> <a class="code" href="a00267.html#af820cb62ae7ee89e10a530f3fa3e57f3">strictContains</a>(<span class="keyword">const</span> <a class="code" href="a00267.html" title="A range of values, used in RangeSet.">Range</a>& r)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> begin_ < r.begin_ && r.end_ < end_; }
<a name="l00063"></a>00063
<a name="l00064"></a><a class="code" href="a00267.html#a937d2b7349b77ee37317fae2ca111c7d">00064</a> <span class="keywordtype">bool</span> <a class="code" href="a00267.html#a937d2b7349b77ee37317fae2ca111c7d">operator==</a>(<span class="keyword">const</span> <a class="code" href="a00267.html" title="A range of values, used in RangeSet.">Range</a>& x) { <span class="keywordflow">return</span> begin_ == x.begin_ && end_== x.end_; }
<a name="l00065"></a>00065
<a name="l00066"></a><a class="code" href="a00267.html#ac4ee7733c18de559d61559948eae77d7">00066</a> <span class="keywordtype">bool</span> <a class="code" href="a00267.html#ac4ee7733c18de559d61559948eae77d7">operator<</a>(<span class="keyword">const</span> T& t)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> end_ < t; }
<a name="l00067"></a><a class="code" href="a00267.html#aa5ca5a16e0ccec25463769caa0b82bac">00067</a> <span class="keywordtype">bool</span> operator<(const Range<T>& r) <span class="keyword">const</span> { <span class="keywordflow">return</span> end_ < r.begin_; }
<a name="l00068"></a>00068
<a name="l00070"></a><a class="code" href="a00267.html#a689f4289ec040d06e74c2010db46fa34">00070</a> <span class="keywordtype">bool</span> <a class="code" href="a00267.html#a689f4289ec040d06e74c2010db46fa34" title="touching ranges can be merged into a single range.">touching</a>(<span class="keyword">const</span> <a class="code" href="a00267.html" title="A range of values, used in RangeSet.">Range</a>& r)<span class="keyword"> const </span>{
<a name="l00071"></a>00071 <span class="keywordflow">return</span> std::max(begin_, r.begin_) <= std::min(end_, r.end_);
<a name="l00072"></a>00072 }
<a name="l00073"></a>00073
<a name="l00075"></a><a class="code" href="a00267.html#abed70423a5349572199713be16a0e449">00075</a> <span class="keywordtype">void</span> <a class="code" href="a00267.html#abed70423a5349572199713be16a0e449">merge</a>(<span class="keyword">const</span> <a class="code" href="a00267.html" title="A range of values, used in RangeSet.">Range</a>& r) {
<a name="l00076"></a>00076 assert(<a class="code" href="a00267.html#a689f4289ec040d06e74c2010db46fa34" title="touching ranges can be merged into a single range.">touching</a>(r));
<a name="l00077"></a>00077 begin_ = std::min(begin_, r.begin_);
<a name="l00078"></a>00078 end_ = std::max(end_, r.end_);
<a name="l00079"></a>00079 }
<a name="l00080"></a>00080
<a name="l00081"></a><a class="code" href="a00267.html#a36dccf4411f22b6494ba4e295ae35b26">00081</a> <a class="code" href="a00267.html#a36dccf4411f22b6494ba4e295ae35b26">operator bool</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> !<a class="code" href="a00267.html#af44f9c08e4385b817f18420b355532ce">empty</a>(); }
<a name="l00082"></a>00082
<a name="l00083"></a><a class="code" href="a00267.html#a22ab06b6bbdfe5def8fecefe3471cbe3">00083</a> <span class="keyword">template</span> <<span class="keyword">class</span> S> <span class="keywordtype">void</span> <a class="code" href="a00267.html#a22ab06b6bbdfe5def8fecefe3471cbe3">serialize</a>(S& s) { s(begin_)(end_); }
<a name="l00084"></a>00084
<a name="l00085"></a>00085 <span class="keyword">private</span>:
<a name="l00086"></a>00086 T begin_, end_;
<a name="l00087"></a>00087 };
<a name="l00088"></a>00088
<a name="l00089"></a>00089
<a name="l00095"></a>00095 <span class="keyword">template</span> <<span class="keyword">class</span> T>
<a name="l00096"></a>00096 <span class="keyword">class </span>RangeSet
<a name="l00097"></a>00097 : boost::additive1<RangeSet<T>,
<a name="l00098"></a>00098 boost::additive2<RangeSet<T>, Range<T>,
<a name="l00099"></a>00099 boost::additive2<RangeSet<T>, T> > >
<a name="l00100"></a>00100 {
<a name="l00101"></a>00101 <span class="keyword">typedef</span> InlineVector<Range<T>, 3> Ranges; <span class="comment">// TODO aconway 2008-04-21: what's the optimial inlined value?</span>
<a name="l00102"></a>00102
<a name="l00103"></a>00103 <span class="keyword">public</span>:
<a name="l00104"></a>00104
<a name="l00105"></a>00105 <span class="keyword">class </span><a class="code" href="a00269.html#a67171474c4da6cc8efe0c7fafefd2b2d">iterator</a> : <span class="keyword">public</span> boost::iterator_facade<
<a name="l00106"></a>00106 iterator,
<a name="l00107"></a>00107 const T,
<a name="l00108"></a>00108 boost::forward_traversal_tag>
<a name="l00109"></a>00109 {
<a name="l00110"></a>00110 <span class="keyword">public</span>:
<a name="l00111"></a><a class="code" href="a00173.html#acfeeee3484e47f7452f94dde6eeb6b53">00111</a> <a class="code" href="a00173.html#acfeeee3484e47f7452f94dde6eeb6b53">iterator</a>() : ranges(), iter(), value() {}
<a name="l00112"></a>00112
<a name="l00113"></a>00113 <span class="keyword">private</span>:
<a name="l00114"></a>00114 <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a00151.html">Ranges</a><a class="code" href="a00173.html">::const_iterator</a> RangesIter;
<a name="l00115"></a>00115 <a class="code" href="a00173.html#acfeeee3484e47f7452f94dde6eeb6b53">iterator</a>(<span class="keyword">const</span> <a class="code" href="a00151.html">Ranges</a>& r, <span class="keyword">const</span> RangesIter& i, <span class="keyword">const</span> T& t)
<a name="l00116"></a>00116 : ranges(&r), iter(i), value(t) {}
<a name="l00117"></a>00117
<a name="l00118"></a>00118 <span class="keywordtype">void</span> increment();
<a name="l00119"></a>00119 <span class="keywordtype">bool</span> equal(<span class="keyword">const</span> <a class="code" href="a00173.html#acfeeee3484e47f7452f94dde6eeb6b53">iterator</a>& i) <span class="keyword">const</span>;
<a name="l00120"></a>00120 <span class="keyword">const</span> T& dereference()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> value; }
<a name="l00121"></a>00121
<a name="l00122"></a>00122 <span class="keyword">const</span> Ranges* ranges;
<a name="l00123"></a>00123 RangesIter iter;
<a name="l00124"></a>00124 T value;
<a name="l00125"></a>00125
<a name="l00126"></a><a class="code" href="a00173.html#a4960c96e55eb28a1eda4326b6225db6d">00126</a> <span class="keyword">friend</span> <span class="keyword">class </span><a class="code" href="a00269.html" title="A set implemented as a list of [begin, end) ranges.">RangeSet</a><T>;
<a name="l00127"></a><a class="code" href="a00173.html#ac09f73e325921cc50ebcd96bed0f8096">00127</a> <span class="keyword">friend</span> <span class="keyword">class </span>boost::iterator_core_access;
<a name="l00128"></a>00128 };
<a name="l00129"></a>00129
<a name="l00130"></a><a class="code" href="a00269.html#a5cdadb6447d19101f56ee20794bbf734">00130</a> <span class="keyword">typedef</span> <a class="code" href="a00269.html#a67171474c4da6cc8efe0c7fafefd2b2d">iterator</a> <a class="code" href="a00269.html#a5cdadb6447d19101f56ee20794bbf734">const_iterator</a>;
<a name="l00131"></a>00131
<a name="l00132"></a><a class="code" href="a00269.html#a974a0335f40de9ae815a75bce636d99c">00132</a> <a class="code" href="a00269.html#a974a0335f40de9ae815a75bce636d99c">RangeSet</a>() {}
<a name="l00133"></a><a class="code" href="a00269.html#ac810612826f187bb1e6ef05c8d663cad">00133</a> <span class="keyword">explicit</span> <a class="code" href="a00269.html#ac810612826f187bb1e6ef05c8d663cad">RangeSet</a>(<span class="keyword">const</span> <a class="code" href="a00267.html" title="A range of values, used in RangeSet.">Range<T></a>& r) { *<span class="keyword">this</span> += r; }
<a name="l00134"></a><a class="code" href="a00269.html#a90b8d5c19c26bf2ab2a6e782d1133a69">00134</a> <a class="code" href="a00269.html#a90b8d5c19c26bf2ab2a6e782d1133a69">RangeSet</a>(<span class="keyword">const</span> T& a, <span class="keyword">const</span> T& b) { *<span class="keyword">this</span> += <a class="code" href="a00267.html" title="A range of values, used in RangeSet.">Range<T></a>(a,b); }
<a name="l00135"></a>00135
<a name="l00136"></a><a class="code" href="a00269.html#ad03d258f12afa6ef7e12ebc9a12cb645">00136</a> <span class="keywordtype">bool</span> <a class="code" href="a00269.html#ad03d258f12afa6ef7e12ebc9a12cb645">contiguous</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> ranges.size() <= 1; }
<a name="l00137"></a>00137
<a name="l00138"></a>00138 <span class="keywordtype">bool</span> <a class="code" href="a00269.html#a50871ec085ffe8f96a23271486012f0e">contains</a>(<span class="keyword">const</span> T& t) <span class="keyword">const</span>;
<a name="l00139"></a>00139 <span class="keywordtype">bool</span> <a class="code" href="a00269.html#a50871ec085ffe8f96a23271486012f0e">contains</a>(<span class="keyword">const</span> <a class="code" href="a00267.html" title="A range of values, used in RangeSet.">Range<T></a>&) <span class="keyword">const</span>;
<a name="l00140"></a>00140
<a name="l00142"></a>00142 <a class="code" href="a00267.html" title="A range of values, used in RangeSet.">Range<T></a> <a class="code" href="a00269.html#a168c6f5d42ddb36c47fbd5ac8edd1975">toRange</a>() <span class="keyword">const</span>;
<a name="l00143"></a>00143
<a name="l00144"></a>00144 <span class="keywordtype">bool</span> <a class="code" href="a00269.html#af1dbc6f2de399d1d70847da939e81128">operator==</a>(<span class="keyword">const</span> <a class="code" href="a00269.html" title="A set implemented as a list of [begin, end) ranges.">RangeSet<T></a>&) <span class="keyword">const</span>;
<a name="l00145"></a>00145
<a name="l00146"></a>00146 <span class="keywordtype">void</span> <a class="code" href="a00269.html#a6670f25275aa798535e54892821b67f4">addRange</a> (<span class="keyword">const</span> <a class="code" href="a00267.html" title="A range of values, used in RangeSet.">Range<T></a>&);
<a name="l00147"></a>00147 <span class="keywordtype">void</span> <a class="code" href="a00269.html#af45793ca1719fbc44350b43e00cb40f0">addSet</a> (<span class="keyword">const</span> <a class="code" href="a00269.html" title="A set implemented as a list of [begin, end) ranges.">RangeSet<T></a>&);
<a name="l00148"></a>00148
<a name="l00149"></a><a class="code" href="a00269.html#aa214ad380bddd9269dde6bc723276306">00149</a> <a class="code" href="a00269.html" title="A set implemented as a list of [begin, end) ranges.">RangeSet<T></a>& <a class="code" href="a00269.html#aa214ad380bddd9269dde6bc723276306">operator+=</a>(<span class="keyword">const</span> T& t) { <span class="keywordflow">return</span> *<span class="keyword">this</span> += <a class="code" href="a00267.html" title="A range of values, used in RangeSet.">Range<T></a>(t); }
<a name="l00150"></a><a class="code" href="a00269.html#a7f8aabd4fe77b42b54d5ef5db99fbca9">00150</a> <a class="code" href="a00269.html" title="A set implemented as a list of [begin, end) ranges.">RangeSet<T></a>& <a class="code" href="a00269.html#a7f8aabd4fe77b42b54d5ef5db99fbca9">operator+=</a>(<span class="keyword">const</span> <a class="code" href="a00267.html" title="A range of values, used in RangeSet.">Range<T></a>& r) { <a class="code" href="a00269.html#a6670f25275aa798535e54892821b67f4">addRange</a>(r); <span class="keywordflow">return</span> *<span class="keyword">this</span>; }
<a name="l00151"></a><a class="code" href="a00269.html#aa5813512a6f8e3505cbf542ce41caecc">00151</a> <a class="code" href="a00269.html" title="A set implemented as a list of [begin, end) ranges.">RangeSet<T></a>& <a class="code" href="a00269.html#aa5813512a6f8e3505cbf542ce41caecc">operator+=</a>(<span class="keyword">const</span> <a class="code" href="a00269.html" title="A set implemented as a list of [begin, end) ranges.">RangeSet<T></a>& s) { <a class="code" href="a00269.html#af45793ca1719fbc44350b43e00cb40f0">addSet</a>(s); <span class="keywordflow">return</span> *<span class="keyword">this</span>; }
<a name="l00152"></a>00152
<a name="l00153"></a>00153 <span class="keywordtype">void</span> <a class="code" href="a00269.html#af11fbfd4cc15610b84d356f4138cb623">removeRange</a> (<span class="keyword">const</span> <a class="code" href="a00267.html" title="A range of values, used in RangeSet.">Range<T></a>&);
<a name="l00154"></a>00154 <span class="keywordtype">void</span> <a class="code" href="a00269.html#a49c803d49088cec93571d447a925e3a1">removeSet</a> (<span class="keyword">const</span> <a class="code" href="a00269.html" title="A set implemented as a list of [begin, end) ranges.">RangeSet<T></a>&);
<a name="l00155"></a>00155
<a name="l00156"></a><a class="code" href="a00269.html#adad3d4d2be2b3b5972a0766d861d76f7">00156</a> <a class="code" href="a00269.html" title="A set implemented as a list of [begin, end) ranges.">RangeSet<T></a>& <a class="code" href="a00269.html#adad3d4d2be2b3b5972a0766d861d76f7">operator-=</a>(<span class="keyword">const</span> T& t) { <span class="keywordflow">return</span> *<span class="keyword">this</span> -= <a class="code" href="a00267.html" title="A range of values, used in RangeSet.">Range<T></a>(t); }
<a name="l00157"></a><a class="code" href="a00269.html#ae6e725a83f18e646c0cd41832978db59">00157</a> <a class="code" href="a00269.html" title="A set implemented as a list of [begin, end) ranges.">RangeSet<T></a>& <a class="code" href="a00269.html#ae6e725a83f18e646c0cd41832978db59">operator-=</a>(<span class="keyword">const</span> <a class="code" href="a00267.html" title="A range of values, used in RangeSet.">Range<T></a>& r) { <a class="code" href="a00269.html#af11fbfd4cc15610b84d356f4138cb623">removeRange</a>(r); <span class="keywordflow">return</span> *<span class="keyword">this</span>; }
<a name="l00158"></a><a class="code" href="a00269.html#ac3460bc8a34353572266150a5c673be0">00158</a> <a class="code" href="a00269.html" title="A set implemented as a list of [begin, end) ranges.">RangeSet<T></a>& <a class="code" href="a00269.html#ac3460bc8a34353572266150a5c673be0">operator-=</a>(<span class="keyword">const</span> <a class="code" href="a00269.html" title="A set implemented as a list of [begin, end) ranges.">RangeSet<T></a>& s) { <a class="code" href="a00269.html#a49c803d49088cec93571d447a925e3a1">removeSet</a>(s); <span class="keywordflow">return</span> *<span class="keyword">this</span>; }
<a name="l00159"></a>00159
<a name="l00160"></a><a class="code" href="a00269.html#a138aad3089cd1e9dd7206eb50f6bfd2b">00160</a> T <a class="code" href="a00269.html#a138aad3089cd1e9dd7206eb50f6bfd2b">front</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> ranges.front().begin(); }
<a name="l00161"></a><a class="code" href="a00269.html#a15f2c81f9b597fe7b9b6938e6a55792d">00161</a> T <a class="code" href="a00269.html#a15f2c81f9b597fe7b9b6938e6a55792d">back</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> ranges.back().end(); }
<a name="l00162"></a>00162
<a name="l00163"></a>00163 <span class="comment">// Iterate over elements in the set.</span>
<a name="l00164"></a>00164 <a class="code" href="a00269.html#a67171474c4da6cc8efe0c7fafefd2b2d">iterator</a> <a class="code" href="a00269.html#af16adf716ab59636bb4dfa130a8e993d">begin</a>() <span class="keyword">const</span>;
<a name="l00165"></a>00165 <a class="code" href="a00269.html#a67171474c4da6cc8efe0c7fafefd2b2d">iterator</a> <a class="code" href="a00269.html#aa82ab3464b6c17fcd421be8ad97deea4">end</a>() <span class="keyword">const</span>;
<a name="l00166"></a>00166
<a name="l00167"></a>00167 <span class="comment">// Iterate over ranges in the set.</span>
<a name="l00168"></a><a class="code" href="a00269.html#a8d99ec609a78357b8afcd4a69c43ba3d">00168</a> <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a00151.html">Ranges</a><a class="code" href="a00269.html#a5cdadb6447d19101f56ee20794bbf734">::const_iterator</a> <a class="code" href="a00269.html#a8d99ec609a78357b8afcd4a69c43ba3d">RangeIterator</a>;
<a name="l00169"></a><a class="code" href="a00269.html#a6e78d9676544bf60eabed6d62aeada8a">00169</a> <a class="code" href="a00269.html#a8d99ec609a78357b8afcd4a69c43ba3d">RangeIterator</a> <a class="code" href="a00269.html#a6e78d9676544bf60eabed6d62aeada8a">rangesBegin</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> ranges.begin(); }
<a name="l00170"></a><a class="code" href="a00269.html#a383947b5766ac93f91c37359a10729f7">00170</a> <a class="code" href="a00269.html#a8d99ec609a78357b8afcd4a69c43ba3d">RangeIterator</a> <a class="code" href="a00269.html#a383947b5766ac93f91c37359a10729f7">rangesEnd</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> ranges.end(); }
<a name="l00171"></a><a class="code" href="a00269.html#a07969835847f16ea54fbb603dacda690">00171</a> <span class="keywordtype">size_t</span> <a class="code" href="a00269.html#a07969835847f16ea54fbb603dacda690">rangesSize</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> ranges.size(); }
<a name="l00172"></a>00172
<a name="l00173"></a>00173 <span class="comment">// The difference between the start and end of this range set</span>
<a name="l00174"></a>00174 <a class="code" href="a00556.html#a435d1572bf3f880d55459d9805097f62">uint32_t</a> <a class="code" href="a00269.html#af78e740274ee8013a154d35195c3754c">span</a>() <span class="keyword">const</span>;
<a name="l00175"></a>00175
<a name="l00176"></a>00176 <span class="keywordtype">size_t</span> <a class="code" href="a00269.html#a56fcee2e1186a9e087f7886a35b97a16">size</a>() <span class="keyword">const</span>;
<a name="l00177"></a><a class="code" href="a00269.html#a6e54169550b6eda9f5617ccb742fee7f">00177</a> <span class="keywordtype">bool</span> <a class="code" href="a00269.html#a6e54169550b6eda9f5617ccb742fee7f">empty</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> ranges.empty(); }
<a name="l00178"></a><a class="code" href="a00269.html#abbe2fcd50ca952dc6ff00fc35161b9ab">00178</a> <span class="keywordtype">void</span> <a class="code" href="a00269.html#abbe2fcd50ca952dc6ff00fc35161b9ab">clear</a>() { ranges.clear(); }
<a name="l00179"></a>00179
<a name="l00183"></a>00183 <a class="code" href="a00267.html" title="A range of values, used in RangeSet.">Range<T></a> <a class="code" href="a00269.html#af548ba4811a3517474546872f26ebb85" title="Return the largest contiguous range containing x.">rangeContaining</a>(<span class="keyword">const</span> T&) <span class="keyword">const</span>;
<a name="l00184"></a>00184
<a name="l00185"></a><a class="code" href="a00269.html#a21aa8149cd23f54fadac696747ff3342">00185</a> <span class="keyword">template</span> <<span class="keyword">class</span> S> <span class="keywordtype">void</span> <a class="code" href="a00269.html#a21aa8149cd23f54fadac696747ff3342">serialize</a>(S& s) { s.split(*<span class="keyword">this</span>); s(ranges.begin(), ranges.end()); }
<a name="l00186"></a><a class="code" href="a00269.html#aff3027921a3b82e5ab906dfe786f3064">00186</a> <span class="keyword">template</span> <<span class="keyword">class</span> S> <span class="keywordtype">void</span> <a class="code" href="a00269.html#aff3027921a3b82e5ab906dfe786f3064">encode</a>(S& s)<span class="keyword"> const </span>{ s(<a class="code" href="a00556.html#a273cf69d639a59973b6019625df33e30">uint16_t</a>(ranges.size()*<span class="keyword">sizeof</span>(<a class="code" href="a00267.html" title="A range of values, used in RangeSet.">Range<T></a>))); }
<a name="l00187"></a><a class="code" href="a00269.html#ac182f3944992fdb0a6b90d79e5413064">00187</a> <span class="keyword">template</span> <<span class="keyword">class</span> S> <span class="keywordtype">void</span> <a class="code" href="a00269.html#ac182f3944992fdb0a6b90d79e5413064">decode</a>(S& s) { <a class="code" href="a00556.html#a273cf69d639a59973b6019625df33e30">uint16_t</a> sz; s(sz); ranges.resize(sz/<span class="keyword">sizeof</span>(<a class="code" href="a00267.html" title="A range of values, used in RangeSet.">Range<T></a>)); }
<a name="l00188"></a>00188
<a name="l00189"></a>00189 <span class="keyword">private</span>:
<a name="l00190"></a>00190 <span class="keyword">static</span> <span class="keywordtype">size_t</span> accumulateSize(<span class="keywordtype">size_t</span> s, <span class="keyword">const</span> <a class="code" href="a00267.html" title="A range of values, used in RangeSet.">Range<T></a>& r) { <span class="keywordflow">return</span> s+r.size(); }
<a name="l00191"></a>00191 Ranges ranges;
<a name="l00192"></a>00192
<a name="l00193"></a>00193 <span class="keyword">template</span> <<span class="keyword">class</span> U> <span class="keyword">friend</span> std::ostream& operator<<(std::ostream& o, const RangeSet<U>& r);
<a name="l00194"></a>00194
<a name="l00195"></a><a class="code" href="a00269.html#a67171474c4da6cc8efe0c7fafefd2b2d">00195</a> <span class="keyword">friend</span> <span class="keyword">class </span><a class="code" href="a00173.html">iterator</a>;
<a name="l00196"></a>00196 };
<a name="l00197"></a>00197
<a name="l00198"></a>00198 <span class="keyword">template</span> <<span class="keyword">class</span> T>
<a name="l00199"></a><a class="code" href="a00574.html#a53bb24052c793e02e1108425660a5d07">00199</a> std::ostream& operator<<(std::ostream& o, const Range<T>& r) {
<a name="l00200"></a>00200 <span class="keywordflow">return</span> o << <span class="stringliteral">"["</span> << r.begin() << <span class="stringliteral">","</span> << r.end() << <span class="stringliteral">")"</span>;
<a name="l00201"></a>00201 }
<a name="l00202"></a>00202
<a name="l00203"></a>00203 <span class="keyword">template</span> <<span class="keyword">class</span> T>
<a name="l00204"></a><a class="code" href="a00574.html#a731c4149da588e385686fd7437e4a5c0">00204</a> std::ostream& operator<<(std::ostream& o, const RangeSet<T>& rs) {
<a name="l00205"></a>00205 std::ostream_iterator<Range<T> > i(o, <span class="stringliteral">" "</span>);
<a name="l00206"></a>00206 o << <span class="stringliteral">"{ "</span>;
<a name="l00207"></a>00207 std::copy(rs.ranges.begin(), rs.ranges.end(), i);
<a name="l00208"></a>00208 <span class="keywordflow">return</span> o << <span class="stringliteral">"}"</span>;
<a name="l00209"></a>00209 }
<a name="l00210"></a>00210
<a name="l00211"></a>00211 <span class="keyword">template</span> <<span class="keyword">class</span> T>
<a name="l00212"></a><a class="code" href="a00269.html#a50871ec085ffe8f96a23271486012f0e">00212</a> <span class="keywordtype">bool</span> <a class="code" href="a00269.html#a50871ec085ffe8f96a23271486012f0e">RangeSet<T>::contains</a>(<span class="keyword">const</span> T& t)<span class="keyword"> const </span>{
<a name="l00213"></a>00213 <span class="keyword">typename</span> <a class="code" href="a00151.html">Ranges</a><a class="code" href="a00173.html">::const_iterator</a> i =
<a name="l00214"></a>00214 std::lower_bound(ranges.begin(), ranges.end(), <a class="code" href="a00267.html" title="A range of values, used in RangeSet.">Range<T></a>(t));
<a name="l00215"></a>00215 <span class="keywordflow">return</span> i != ranges.end() && i->contains(t);
<a name="l00216"></a>00216 }
<a name="l00217"></a>00217
<a name="l00218"></a>00218 <span class="keyword">template</span> <<span class="keyword">class</span> T>
<a name="l00219"></a><a class="code" href="a00269.html#aa16fcb099634e10eb5a0a77f537dc25c">00219</a> <span class="keywordtype">bool</span> <a class="code" href="a00269.html#a50871ec085ffe8f96a23271486012f0e">RangeSet<T>::contains</a>(<span class="keyword">const</span> <a class="code" href="a00267.html" title="A range of values, used in RangeSet.">Range<T></a>& r)<span class="keyword"> const </span>{
<a name="l00220"></a>00220 <span class="keyword">typename</span> <a class="code" href="a00151.html">Ranges</a><a class="code" href="a00173.html">::const_iterator</a> i =
<a name="l00221"></a>00221 std::lower_bound(ranges.begin(), ranges.end(), r);
<a name="l00222"></a>00222 <span class="keywordflow">return</span> i != ranges.end() && i->contains(r);
<a name="l00223"></a>00223 }
<a name="l00224"></a>00224
<a name="l00225"></a><a class="code" href="a00269.html#a6670f25275aa798535e54892821b67f4">00225</a> <span class="keyword">template</span> <<span class="keyword">class</span> T> <span class="keywordtype">void</span> <a class="code" href="a00269.html#a6670f25275aa798535e54892821b67f4">RangeSet<T>::addRange</a>(<span class="keyword">const</span> <a class="code" href="a00267.html" title="A range of values, used in RangeSet.">Range<T></a>& r) {
<a name="l00226"></a>00226 <span class="keywordflow">if</span> (r.empty()) <span class="keywordflow">return</span>;
<a name="l00227"></a>00227 <span class="keyword">typename</span> <a class="code" href="a00151.html">Ranges</a><a class="code" href="a00173.html">::iterator</a> i =
<a name="l00228"></a>00228 std::lower_bound(ranges.begin(), ranges.end(), r);
<a name="l00229"></a>00229 <span class="keywordflow">if</span> (i == ranges.end() || !i->touching(r))
<a name="l00230"></a>00230 ranges.insert(i, r);
<a name="l00231"></a>00231 <span class="keywordflow">else</span> {
<a name="l00232"></a>00232 i->merge(r);
<a name="l00233"></a>00233 <span class="keyword">typename</span> <a class="code" href="a00151.html">Ranges</a><a class="code" href="a00173.html">::iterator</a> j = i;
<a name="l00234"></a>00234 <span class="keywordflow">if</span> (++j != ranges.end() && i->touching(*j)) {
<a name="l00235"></a>00235 i->merge(*j);
<a name="l00236"></a>00236 ranges.erase(j);
<a name="l00237"></a>00237 }
<a name="l00238"></a>00238 }
<a name="l00239"></a>00239 }
<a name="l00240"></a>00240
<a name="l00241"></a>00241
<a name="l00242"></a><a class="code" href="a00269.html#af45793ca1719fbc44350b43e00cb40f0">00242</a> <span class="keyword">template</span> <<span class="keyword">class</span> T> <span class="keywordtype">void</span> <a class="code" href="a00269.html#af45793ca1719fbc44350b43e00cb40f0">RangeSet<T>::addSet</a>(<span class="keyword">const</span> <a class="code" href="a00269.html" title="A set implemented as a list of [begin, end) ranges.">RangeSet<T></a>& s) {
<a name="l00243"></a>00243 <span class="keyword">typedef</span> <a class="code" href="a00269.html" title="A set implemented as a list of [begin, end) ranges.">RangeSet<T></a>& (<a class="code" href="a00269.html" title="A set implemented as a list of [begin, end) ranges.">RangeSet<T></a>::*RangeSetRangeOp)(<span class="keyword">const</span> <a class="code" href="a00267.html" title="A range of values, used in RangeSet.">Range<T></a>&);
<a name="l00244"></a>00244 std::for_each(s.ranges.begin(), s.ranges.end(),
<a name="l00245"></a>00245 boost::bind((RangeSetRangeOp)&<a class="code" href="a00269.html" title="A set implemented as a list of [begin, end) ranges.">RangeSet<T>::operator</a>+=, <span class="keyword">this</span>, _1));
<a name="l00246"></a>00246 }
<a name="l00247"></a>00247
<a name="l00248"></a><a class="code" href="a00269.html#af11fbfd4cc15610b84d356f4138cb623">00248</a> <span class="keyword">template</span> <<span class="keyword">class</span> T> <span class="keywordtype">void</span> <a class="code" href="a00269.html#af11fbfd4cc15610b84d356f4138cb623">RangeSet<T>::removeRange</a>(<span class="keyword">const</span> <a class="code" href="a00267.html" title="A range of values, used in RangeSet.">Range<T></a>& r) {
<a name="l00249"></a>00249 <span class="keywordflow">if</span> (r.empty()) <span class="keywordflow">return</span>;
<a name="l00250"></a>00250 <span class="keyword">typename</span> <a class="code" href="a00151.html">Ranges</a><a class="code" href="a00173.html">::iterator</a> i,j;
<a name="l00251"></a>00251 i = std::lower_bound(ranges.begin(), ranges.end(), r);
<a name="l00252"></a>00252 <span class="keywordflow">if</span> (i == ranges.end() || i->begin() >= r.end())
<a name="l00253"></a>00253 <span class="keywordflow">return</span>; <span class="comment">// Outside of set</span>
<a name="l00254"></a>00254 <span class="keywordflow">if</span> (*i == r) <span class="comment">// Erase i</span>
<a name="l00255"></a>00255 ranges.erase(i);
<a name="l00256"></a>00256 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (i->strictContains(r)) { <span class="comment">// Split i</span>
<a name="l00257"></a>00257 <a class="code" href="a00267.html" title="A range of values, used in RangeSet.">Range<T></a> i1(i->begin(), r.begin());
<a name="l00258"></a>00258 <a class="code" href="a00267.html" title="A range of values, used in RangeSet.">Range<T></a> i2(r.end(), i->end());
<a name="l00259"></a>00259 *i = i2;
<a name="l00260"></a>00260 ranges.insert(i, i1);
<a name="l00261"></a>00261 } <span class="keywordflow">else</span> {
<a name="l00262"></a>00262 <span class="keywordflow">if</span> (i->begin() < r.begin()) { <span class="comment">// Truncate i</span>
<a name="l00263"></a>00263 i-><a class="code" href="a00267.html#ad5cddcac7a1ae006d1c8ad0143cd967f" title="End of _open_ range, i.e.">end</a>(r.begin());
<a name="l00264"></a>00264 ++i;
<a name="l00265"></a>00265 }
<a name="l00266"></a>00266 <span class="keywordflow">for</span> (j = i; j != ranges.end() && r.contains(*j); ++j)
<a name="l00267"></a>00267 ; <span class="comment">// Ranges to erase.</span>
<a name="l00268"></a>00268 <span class="keywordflow">if</span> (j != ranges.end() && r.end() > j->begin())
<a name="l00269"></a>00269 j->begin(r.end()); <span class="comment">// Truncate j</span>
<a name="l00270"></a>00270 ranges.erase(i,j);
<a name="l00271"></a>00271 }
<a name="l00272"></a>00272 }
<a name="l00273"></a>00273
<a name="l00274"></a><a class="code" href="a00269.html#a49c803d49088cec93571d447a925e3a1">00274</a> <span class="keyword">template</span> <<span class="keyword">class</span> T> <span class="keywordtype">void</span> <a class="code" href="a00269.html#a49c803d49088cec93571d447a925e3a1">RangeSet<T>::removeSet</a>(<span class="keyword">const</span> <a class="code" href="a00269.html" title="A set implemented as a list of [begin, end) ranges.">RangeSet<T></a>& r) {
<a name="l00275"></a>00275 std::for_each(
<a name="l00276"></a>00276 r.ranges.begin(), r.ranges.end(),
<a name="l00277"></a>00277 boost::bind(&<a class="code" href="a00269.html" title="A set implemented as a list of [begin, end) ranges.">RangeSet<T>::removeRange</a>, <span class="keyword">this</span>, _1));
<a name="l00278"></a>00278 }
<a name="l00279"></a>00279
<a name="l00280"></a><a class="code" href="a00269.html#a168c6f5d42ddb36c47fbd5ac8edd1975">00280</a> <span class="keyword">template</span> <<span class="keyword">class</span> T> <a class="code" href="a00267.html" title="A range of values, used in RangeSet.">Range<T></a> <a class="code" href="a00269.html#a168c6f5d42ddb36c47fbd5ac8edd1975">RangeSet<T>::toRange</a>()<span class="keyword"> const </span>{
<a name="l00281"></a>00281 assert(contiguous());
<a name="l00282"></a>00282 <span class="keywordflow">return</span> empty() ? <a class="code" href="a00267.html" title="A range of values, used in RangeSet.">Range<T></a>() : ranges.front();
<a name="l00283"></a>00283 }
<a name="l00284"></a>00284
<a name="l00285"></a>00285 <span class="keyword">template</span> <<span class="keyword">class</span> T> <span class="keywordtype">void</span> <a class="code" href="a00269.html" title="A set implemented as a list of [begin, end) ranges.">RangeSet<T>::iterator::increment</a>() {
<a name="l00286"></a>00286 assert(ranges && iter != ranges->end());
<a name="l00287"></a>00287 <span class="keywordflow">if</span> (!iter->contains(++value)) {
<a name="l00288"></a>00288 ++iter;
<a name="l00289"></a>00289 <span class="keywordflow">if</span> (iter == ranges->end())
<a name="l00290"></a>00290 *<span class="keyword">this</span>=<a class="code" href="a00173.html#acfeeee3484e47f7452f94dde6eeb6b53">iterator</a>(); <span class="comment">// end() iterator</span>
<a name="l00291"></a>00291 <span class="keywordflow">else</span>
<a name="l00292"></a>00292 value=iter->begin();
<a name="l00293"></a>00293 }
<a name="l00294"></a>00294 }
<a name="l00295"></a>00295
<a name="l00296"></a><a class="code" href="a00269.html#af1dbc6f2de399d1d70847da939e81128">00296</a> <span class="keyword">template</span> <<span class="keyword">class</span> T> <span class="keywordtype">bool</span> <a class="code" href="a00269.html#af1dbc6f2de399d1d70847da939e81128">RangeSet<T>::operator==</a>(<span class="keyword">const</span> <a class="code" href="a00269.html" title="A set implemented as a list of [begin, end) ranges.">RangeSet<T></a>& r)<span class="keyword"> const </span>{
<a name="l00297"></a>00297 <span class="keywordflow">return</span> ranges.size() == r.ranges.size() && std::equal(ranges.begin(), ranges.end(), r.ranges.begin());
<a name="l00298"></a>00298 }
<a name="l00299"></a>00299
<a name="l00300"></a><a class="code" href="a00269.html#af16adf716ab59636bb4dfa130a8e993d">00300</a> <span class="keyword">template</span> <<span class="keyword">class</span> T> <span class="keyword">typename</span> <a class="code" href="a00173.html">RangeSet<T>::iterator</a> <a class="code" href="a00269.html#af16adf716ab59636bb4dfa130a8e993d">RangeSet<T>::begin</a>()<span class="keyword"> const </span>{
<a name="l00301"></a>00301 <span class="keywordflow">return</span> <a class="code" href="a00269.html#a6e54169550b6eda9f5617ccb742fee7f">empty</a>() ? <a class="code" href="a00269.html#aa82ab3464b6c17fcd421be8ad97deea4">end</a>() : <a class="code" href="a00269.html#a67171474c4da6cc8efe0c7fafefd2b2d">iterator</a>(ranges, ranges.begin(), <a class="code" href="a00269.html#a138aad3089cd1e9dd7206eb50f6bfd2b">front</a>());
<a name="l00302"></a>00302 }
<a name="l00303"></a>00303
<a name="l00304"></a><a class="code" href="a00269.html#aa82ab3464b6c17fcd421be8ad97deea4">00304</a> <span class="keyword">template</span> <<span class="keyword">class</span> T> <span class="keyword">typename</span> <a class="code" href="a00173.html">RangeSet<T>::iterator</a> <a class="code" href="a00269.html#aa82ab3464b6c17fcd421be8ad97deea4">RangeSet<T>::end</a>()<span class="keyword"> const </span>{
<a name="l00305"></a>00305 <span class="keywordflow">return</span> <a class="code" href="a00269.html#a67171474c4da6cc8efe0c7fafefd2b2d">iterator</a>();
<a name="l00306"></a>00306 }
<a name="l00307"></a>00307
<a name="l00308"></a>00308 <span class="keyword">template</span> <<span class="keyword">class</span> T> <span class="keywordtype">bool</span> <a class="code" href="a00269.html" title="A set implemented as a list of [begin, end) ranges.">RangeSet<T>::iterator::equal</a>(<span class="keyword">const</span> <a class="code" href="a00269.html#a67171474c4da6cc8efe0c7fafefd2b2d">iterator</a>& i)<span class="keyword"> const </span>{
<a name="l00309"></a>00309 <span class="keywordflow">return</span> ranges==i.ranges && (ranges==0 || value==i.value);
<a name="l00310"></a>00310 }
<a name="l00311"></a>00311
<a name="l00312"></a><a class="code" href="a00269.html#af548ba4811a3517474546872f26ebb85">00312</a> <span class="keyword">template</span> <<span class="keyword">class</span> T> <a class="code" href="a00267.html" title="A range of values, used in RangeSet.">Range<T></a> <a class="code" href="a00269.html#af548ba4811a3517474546872f26ebb85" title="Return the largest contiguous range containing x.">RangeSet<T>::rangeContaining</a>(<span class="keyword">const</span> T& t)<span class="keyword"> const </span>{
<a name="l00313"></a>00313 <span class="keyword">typename</span> <a class="code" href="a00151.html">Ranges</a><a class="code" href="a00173.html">::const_iterator</a> i =
<a name="l00314"></a>00314 std::lower_bound(ranges.begin(), ranges.end(), <a class="code" href="a00267.html" title="A range of values, used in RangeSet.">Range<T></a>(t));
<a name="l00315"></a>00315 <span class="keywordflow">return</span> (i != ranges.end() && i->contains(t)) ? *i : <a class="code" href="a00267.html" title="A range of values, used in RangeSet.">Range<T></a>(t,t);
<a name="l00316"></a>00316 }
<a name="l00317"></a>00317
<a name="l00318"></a><a class="code" href="a00269.html#af78e740274ee8013a154d35195c3754c">00318</a> <span class="keyword">template</span> <<span class="keyword">class</span> T> <a class="code" href="a00556.html#a435d1572bf3f880d55459d9805097f62">uint32_t</a> <a class="code" href="a00269.html#af78e740274ee8013a154d35195c3754c">RangeSet<T>::span</a>()<span class="keyword"> const </span>{
<a name="l00319"></a>00319 <span class="keywordflow">if</span> (ranges.empty()) <span class="keywordflow">return</span> 0;
<a name="l00320"></a>00320 <span class="keywordflow">return</span> ranges.back().last() - ranges.front().first();
<a name="l00321"></a>00321 }
<a name="l00322"></a>00322
<a name="l00323"></a><a class="code" href="a00269.html#a56fcee2e1186a9e087f7886a35b97a16">00323</a> <span class="keyword">template</span> <<span class="keyword">class</span> T> <span class="keywordtype">size_t</span> <a class="code" href="a00269.html#a56fcee2e1186a9e087f7886a35b97a16">RangeSet<T>::size</a>()<span class="keyword"> const </span>{
<a name="l00324"></a>00324 <span class="keywordflow">return</span> std::accumulate(<a class="code" href="a00269.html#a6e78d9676544bf60eabed6d62aeada8a">rangesBegin</a>(), <a class="code" href="a00269.html#a383947b5766ac93f91c37359a10729f7">rangesEnd</a>(), 0, &<a class="code" href="a00269.html" title="A set implemented as a list of [begin, end) ranges.">RangeSet<T>::accumulateSize</a>);
<a name="l00325"></a>00325 }
<a name="l00326"></a>00326
<a name="l00327"></a>00327 } <span class="comment">// namespace qpid</span>
<a name="l00328"></a>00328
<a name="l00329"></a>00329
<a name="l00330"></a>00330 <span class="preprocessor">#endif </span>
</pre></div></div>
</div>
<!--
Licensed to the Apache Software Foundation (ASF) under one
or more contributor license agreements. See the NOTICE file
distributed with this work for additional information
regarding copyright ownership. The ASF licenses this file
to you under the Apache License, Version 2.0 (the
"License"); you may not use this file except in compliance
with the License. You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing,
software distributed under the License is distributed on an
"AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
KIND, either express or implied. See the License for the
specific language governing permissions and limitations
under the License.
-->
<hr size="1">
<address style="text-align: left;"><small>
Qpid C++ API Reference</small></address>
<address style="text-align: right;">
<small>
Generated on Thu May 10 2012 for Qpid C++ Client API by <a href="http://www.doxygen.org/index.html"><img src="doxygen.png" alt="doxygen" align="middle" border="0"></a> 1.7.5</small>
</address>
</body>
</html>
|
