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
|
<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>Unique Sorted Associative Container</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>Unique Sorted Associative Container</H1>
<Table CellPadding=0 CellSpacing=0 width=100%>
<TR>
<TD Align=left><Img src = "containers.gif" Alt="" WIDTH = "194" HEIGHT = "38" ></TD>
<TD Align=right><Img src = "concept.gif" Alt="" WIDTH = "194" HEIGHT = "38" ></TD>
</TR>
<TR>
<TD Align=left VAlign=top><b>Category</b>: containers</TD>
<TD Align=right VAlign=top><b>Component type</b>: concept</TD>
</TR>
</Table>
<h3>Description</h3>
A Unique Sorted Associative Container is a <A href="SortedAssociativeContainer.html">Sorted Associative
Container</A> that is also a <A href="UniqueAssociativeContainer.html">Unique Associative Container</A>. That is,
it is a <A href="SortedAssociativeContainer.html">Sorted Associative Container</A> with the property that no two
elements in the container have the same key.
<h3>Refinement of</h3>
<A href="SortedAssociativeContainer.html">Sorted Associative Container</A>,
<A href="UniqueAssociativeContainer.html">Unique Associative Container</A>
<h3>Associated types</h3>
None, except for those described in the
<A href="SortedAssociativeContainer.html">Sorted Associative Container</A>
and <A href="UniqueAssociativeContainer.html">Unique Associative Container</A>
requirements.
<h3>Notation</h3>
<Table>
<TR>
<TD VAlign=top>
<tt>X</tt>
</TD>
<TD VAlign=top>
A type that is a model of Unique Sorted Associative Container
</TD>
</TR>
<TR>
<TD VAlign=top>
<tt>a</tt>
</TD>
<TD VAlign=top>
Object of type <tt>X</tt>
</TD>
</TR>
<TR>
<TD VAlign=top>
<tt>t</tt>
</TD>
<TD VAlign=top>
Object of type <tt>X::value_type</tt>
</TD>
</TR>
<TR>
<TD VAlign=top>
<tt>k</tt>
</TD>
<TD VAlign=top>
Object of type <tt>X::key_type</tt>
</TD>
</TR>
<TR>
<TD VAlign=top>
<tt>p</tt>, <tt>q</tt>
</TD>
<TD VAlign=top>
Object of type <tt>X::iterator</tt>
</TD>
</TR>
<TR>
<TD VAlign=top>
<tt>c</tt>
</TD>
<TD VAlign=top>
Object of type <tt>X::key_compare</tt>
</TD>
</tr>
</table>
<h3>Definitions</h3>
<h3>Valid expressions</h3>
In addition to the expressions defined in
<A href="SortedAssociativeContainer.html">Sorted Associative Container</A> and
<A href="UniqueAssociativeContainer.html">Unique Associative Container</A>,
the following expressions must be valid.
<Table border>
<TR>
<TH>
Name
</TH>
<TH>
Expression
</TH>
<TH>
Type requirements
</TH>
<TH>
Return type
</TH>
</TR>
<TR>
<TD VAlign=top>
Range constructor
</TD>
<TD VAlign=top>
<pre>
X(i, j)
X a(i, j);
</pre>
</TD>
<TD VAlign=top>
<tt>i</tt> and <tt>j</tt> are <A href="InputIterator.html">Input Iterators</A> whose value type is convertible
to <tt>T</tt> <A href="#1">[1]</A>.
</TD>
<TD VAlign=top>
</TD>
</TR>
<TR>
<TD VAlign=top>
Range constructor with compare
</TD>
<TD VAlign=top>
<pre>
X(i, j, c)
X a(i, j, c);
</pre>
</TD>
<TD VAlign=top>
<tt>i</tt> and <tt>j</tt> are <A href="InputIterator.html">Input Iterators</A> whose value type is convertible
to <tt>T</tt> <A href="#1">[1]</A>. <tt>c</tt> is an object of type <tt>key_compare</tt>.
</TD>
<TD VAlign=top>
</TD>
</TR>
<TR>
<TD VAlign=top>
Insert with hint
</TD>
<TD VAlign=top>
<tt>a.insert(p, t)</tt>
</TD>
<TD VAlign=top>
</TD>
<TD VAlign=top>
<tt>iterator</tt>
</TD>
</TR>
<TR>
<TD VAlign=top>
Insert range
</TD>
<TD VAlign=top>
<tt>a.insert(i, j)</tt>
</TD>
<TD VAlign=top>
<tt>i</tt> and <tt>j</tt> are <A href="InputIterator.html">Input Iterators</A> whose value type is convertible
to <tt>X::value_type</tt>. <A href="#1">[1]</A>
</TD>
<TD VAlign=top>
<tt>void</tt>
</TD>
</tr>
</table>
<h3>Expression semantics</h3>
<Table border>
<TR>
<TH>
Name
</TH>
<TH>
Expression
</TH>
<TH>
Precondition
</TH>
<TH>
Semantics
</TH>
<TH>
Postcondition
</TH>
</TR>
<TR>
<TD VAlign=top>
Range constructor
</TD>
<TD VAlign=top>
<pre>
X(i, j)
X a(i, j);
</pre>
</TD>
<TD VAlign=top>
<tt>[i,j)</tt> is a valid range.
</TD>
<TD VAlign=top>
Creates an associative container that contains all of the elements in the range <tt>[i,j)</tt>
that have unique keys. The comparison object used by the container
is <tt>key_compare()</tt>.
</TD>
<TD VAlign=top>
<tt>size()</tt> is less than or equal to the distance from <tt>i</tt> to <tt>j</tt>.
</TD>
</TR>
<TR>
<TD VAlign=top>
Range constructor with compare
</TD>
<TD VAlign=top>
<pre>
X(i, j, c)
X a(i, j, c);
</pre>
</TD>
<TD VAlign=top>
<tt>[i,j)</tt> is a valid range.
</TD>
<TD VAlign=top>
Creates an associative container that contains all of the elements in the range <tt>[i,j)</tt>
that have unique keys. The comparison object used by the container
is <tt>c</tt>.
</TD>
<TD VAlign=top>
<tt>size()</tt> is less than or equal to the distance from <tt>i</tt> to <tt>j</tt>.
</TD>
</TR>
<TR>
<TD VAlign=top>
Insert with hint
</TD>
<TD VAlign=top>
<tt>a.insert(p, t)</tt>
</TD>
<TD VAlign=top>
<tt>p</tt> is a nonsingular iterator in <tt>a</tt>.
</TD>
<TD VAlign=top>
Inserts <tt>t</tt> into <tt>a</tt> if and only if <tt>a</tt> does not already contain
an element whose key is equivalent to <tt>t</tt>'s key. The argument <tt>p</tt> is a hint:
it points to the location where the search will begin. The return
value is a dereferenceable iterator that points to the element with
a key that is equivalent to that of <tt>t</tt>.
</TD>
<TD VAlign=top>
<tt>a</tt> contains an element whose key is the same as that of <tt>t</tt>.
The size of <tt>a</tt> is incremented by either <tt>1</tt> or <tt>0</tt>.
</TD>
</TR>
<TR>
<TD VAlign=top>
Insert range
</TD>
<TD VAlign=top>
<tt>a.insert(i, j)</tt>
</TD>
<TD VAlign=top>
<tt>[i, j)</tt> is a valid range.
</TD>
<TD VAlign=top>
Equivalent to <tt>a.insert(t)</tt> for each object <tt>t</tt> that is pointed to
by an iterator in the range <tt>[i, j)</tt>. Each element is inserted into
<tt>a</tt> if and only if <tt>a</tt> does not already contain an element with
an equivalent key.
</TD>
<TD VAlign=top>
The size of <tt>a</tt> is incremented by at most <tt>j - i</tt>.
</TD>
</tr>
</table>
<h3>Complexity guarantees</h3>
The range constructor, and range constructor with compare, are in
general <tt>O(N * log(N))</tt>, where <tt>N</tt> is the size of the range. However,
they are linear in <tt>N</tt> if the range is already sorted by
<tt>value_comp()</tt>.
<P>
Insert with hint is logarithmic in general, but it is amortized
constant time if <tt>t</tt> is inserted immediately before <tt>p</tt>.
<P>
Insert range is in general <tt>O(N * log(N))</tt>, where <tt>N</tt> is the size of
the range. However, it is linear in <tt>N</tt> if the range is already
sorted by <tt>value_comp()</tt>.
<h3>Invariants</h3>
<Table border>
<TR>
<TD VAlign=top>
Strictly ascending order
</TD>
<TD VAlign=top>
The elements in a Unique Sorted Associative Container are always arranged
in strictly ascending order by key. That is, if <tt>a</tt> is a Unique Sorted
Associative Container, then <tt><A href="is_sorted.html">is_sorted</A>(a.begin(), a.end(),
a.value_comp())</tt> is always <tt>true</tt>. Furthermore, if <tt>i</tt> and <tt>j</tt>
are dereferenceable iterators in <tt>a</tt> such that <tt>i</tt> precedes <tt>j</tt>,
then <tt>a.value_comp()(*i, *j)</tt> is always <tt>true</tt>. <A href="#2">[2]</A>
</TD>
</tr>
</table>
<h3>Models</h3>
<UL>
<LI>
<tt><A href="Map.html">map</A></tt>
<LI>
<tt><A href="set.html">set</A></tt>
</UL>
<h3>Notes</h3>
<P><A name="1">[1]</A>
At present (early 1998), not all compilers support
"member templates". If your compiler supports member
templates then <tt>i</tt> and <tt>j</tt> may be of any type that
conforms to the <A href="InputIterator.html">Input Iterator</A>
requirements. If your compiler does not yet support member
templates, however, then <tt>i</tt> and <tt>j</tt> must be of type
<tt>const T*</tt> or of type <tt>X::const_iterator</tt>.
<P><A name="2">[2]</A>
This is a more stringent invariant than that of
<A href="SortedAssociativeContainer.html">Sorted Associative Container</A>.
In a <A href="SortedAssociativeContainer.html">Sorted Associative Container</A>
we merely know that every element is less
than or equal to its successor; in a
<A href="UniqueSortedAssociativeContainer.html">Unique Sorted Associative Container</A>, however,
we know that it must be less than its successor.
<h3>See also</h3>
<A href="AssociativeContainer.html">Associative Container</A>,
<A href="SortedAssociativeContainer.html">Sorted Associative Container</A>,
<A href="MultipleSortedAssociativeContainer.html">Multiple Sorted Associative Container</A>,
<A href="HashedAssociativeContainer.html">Hashed Associative Container</A>
<!--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 ©
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>
|
