-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathupper_bound.html
More file actions
382 lines (308 loc) · 27.5 KB
/
upper_bound.html
File metadata and controls
382 lines (308 loc) · 27.5 KB
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
<!doctype html>
<html class="cpprefjp" lang="ja" itemscope="" itemtype="http://schema.org/WebPage">
<head>
<!-- Google tag (gtag.js) -->
<script async src="https://www.googletagmanager.com/gtag/js?id=G-NXNBNVBTJS"></script>
<script>
window.dataLayer = window.dataLayer || [];
function gtag(){dataLayer.push(arguments);}
gtag('js', new Date());
gtag('config', 'G-NXNBNVBTJS');
</script>
<meta charset="UTF-8">
<title>multimap::upper_bound - cpprefjp C++日本語リファレンス</title>
<meta name="viewport" content="width=device-width,initial-scale=1">
<meta name="keywords" content="
C++,標準ライブラリ,リファレンス,ドキュメント,STL,std,map,std,multimap,function
">
<meta name="title" content="multimap::upper_bound - cpprefjp C++日本語リファレンス" />
<meta itemprop="name" content="multimap::upper_bound - cpprefjp C++日本語リファレンス" />
<meta property="og:title" content="multimap::upper_bound - cpprefjp C++日本語リファレンス" />
<meta property="og:url" content="https://cpprefjp.github.io/reference/map/multimap/upper_bound.html" />
<meta property="og:site_name" content="cpprefjp - C++日本語リファレンス" />
<meta property="og:type" content="article" />
<meta property="og:description" content="`x` より大きいキーを持つコンテナ内の最初の要素を指すイテレータを返す（コンテナの比較オブジェクトを使う）。" />
<meta name="twitter:card" content="summary" />
<meta name="twitter:title" content="multimap::upper_bound - cpprefjp C++日本語リファレンス" />
<meta name="twitter:url" content="https://cpprefjp.github.io/reference/map/multimap/upper_bound.html" />
<meta name="twitter:description" content="`x` より大きいキーを持つコンテナ内の最初の要素を指すイテレータを返す（コンテナの比較オブジェクトを使う）。" />
<link rel="alternate" type="application/atom+xml" title="Atom" href="https://cpprefjp.github.io/rss.xml" />
<link rel="apple-touch-icon" sizes="180x180" href="../../../static/favicons/apple-touch-icon.png?cachebust=be86fa2321ebe02b6955b61b98b778e377bcbf95">
<link rel="icon" type="image/png" sizes="32x32" href="../../../static/favicons/favicon-32x32.png?cachebust=be86fa2321ebe02b6955b61b98b778e377bcbf95">
<link rel="icon" type="image/png" sizes="16x16" href="../../../static/favicons/favicon-16x16.png?cachebust=be86fa2321ebe02b6955b61b98b778e377bcbf95">
<link rel="manifest" href="../../../manifest.json?cachebust=be86fa2321ebe02b6955b61b98b778e377bcbf95">
<meta name="theme-color" content="#f5f8fc">
<link rel="stylesheet" href="../../../static/pygments/default.css?cachebust=be86fa2321ebe02b6955b61b98b778e377bcbf95">
<!-- <link rel="stylesheet" href="../../../static/css/root.css"> -->
<link href="../../../static/kunai/css/kunai-stage-0.css?cachebust=be86fa2321ebe02b6955b61b98b778e377bcbf95" rel="stylesheet">
<link href="../../../static/kunai/css/kunai-stage-1.css?cachebust=be86fa2321ebe02b6955b61b98b778e377bcbf95" rel="stylesheet">
<link href="../../../static/kunai/css/kunai-stage-2.css?cachebust=be86fa2321ebe02b6955b61b98b778e377bcbf95" rel="stylesheet">
<link href="../../../static/kunai/css/kunai-stage-3.css?cachebust=be86fa2321ebe02b6955b61b98b778e377bcbf95" rel="stylesheet">
<script type="text/javascript" src="../../../static/kunai/js/kunai-vendor.js?cachebust=be86fa2321ebe02b6955b61b98b778e377bcbf95"></script>
<script type="text/javascript" src="../../../static/kunai/js/kunai.js?cachebust=be86fa2321ebe02b6955b61b98b778e377bcbf95"></script>
<script type="text/javascript">
document.addEventListener('DOMContentLoaded', function() {
var kn = new Kunai;
kn.cpprefjp();
});
</script>
</head>
<body>
<header data-kunai-mdinfo="{"meta": {"header": ["map"], "namespace": ["std"], "class": ["multimap"], "id-type": ["function"]}, "sources": [{"id": "d5d424364cafac80fca4ede655f1a735691c73ea", "source": "#include <iostream>\n#include <string>\n#include <map>\n\nint main()\n{\n // (1)\n {\n std::multimap<std::string, int> m = {\n {\"A\", 3},\n {\"B\", 1},\n {\"B\", 2},\n {\"C\", 4},\n {\"D\", 5}\n };\n\n // B\u4ee5\u4e0aD\u4ee5\u4e0b\u306e\u7bc4\u56f2\u3092\u53d6\u5f97\n decltype(m)::iterator it = m.lower_bound(\"B\");\n decltype(m)::iterator last = m.upper_bound(\"D\");\n\n while (it != last) {\n std::cout << it->first << ',' << it->second << std::endl;\n ++it;\n }\n std::cout << std::endl;\n }\n\n // (2)\n {\n std::multimap<std::string, int, std::less<>> m = {\n {\"A\", 3},\n {\"B\", 1},\n {\"B\", 2},\n {\"C\", 4},\n {\"D\", 5}\n };\n\n // std::less\u306evoid\u306b\u5bfe\u3059\u308b\u7279\u6b8a\u5316\u3092\u4f7f\u7528\u3059\u308b\u3053\u3068\u3067\u3001\n // \u6587\u5b57\u5217\u30ea\u30c6\u30e9\u30eb\u3092lower_bound()\u95a2\u6570\u306e\u5f15\u6570\u3068\u3057\u3066\u6e21\u3057\u305f\u969b\u306b\u3001\n // std::string\u578b\u306e\u4e00\u6642\u30aa\u30d6\u30b8\u30a7\u30af\u30c8\u304c\u751f\u6210\u3055\u308c\u306a\u3044\u3002\n decltype(m)::iterator it = m.lower_bound(\"B\");\n decltype(m)::iterator last = m.upper_bound(\"D\");\n\n while (it != last) {\n std::cout << it->first << \",\" << it->second << std::endl;\n ++it;\n }\n }\n}\n"}], "page_id": ["reference", "map", "multimap", "upper_bound"]}">
<nav class="navbar navbar-default" role="navigation">
<div class="container-fluid">
<div class="navbar-header">
<button type="button" class="navbar-toggle collapsed" data-toggle="collapse" data-target="#navbar-collapse">
<span class="sr-only">Toggle navigation</span>
<span class="icon-bar"></span>
<span class="icon-bar"></span>
<span class="icon-bar"></span>
</button>
<a class="navbar-brand" href="../../../index.html">
<div class="title-wrapper clearfix">
<div class="title">cpprefjp - C++日本語リファレンス</div>
</div>
</a>
</div>
<div class="collapse navbar-collapse" id="navbar-collapse">
<ul class="nav navbar-nav navbar-right">
<li>
<div class="google-search">
<script>
(function() {
var cx = '013316413321391058734:ji_u66hl7hq';
var gcse = document.createElement('script');
gcse.type = 'text/javascript';
gcse.async = true;
gcse.src = (document.location.protocol == 'https:' ? 'https:' : 'http:') +
'//www.google.com/cse/cse.js?cx=' + cx;
var s = document.getElementsByTagName('script')[0];
s.parentNode.insertBefore(gcse, s);
})();
</script>
<div class="gcse-search"></div>
</div>
</li>
<li>
<a href="https://github.com/cpprefjp/site">GitHub Project</a>
</li>
</ul>
</div>
</div>
</nav>
</header>
<main id="main" role="main">
<div class="container-fluid">
<div class="row">
<div class="col-sm-9 col-sm-push-3" itemscope itemtype="http://schema.org/Article">
<div class="row">
<div class="col-sm-12 google-search-result">
<gcse:searchresults></gcse:searchresults>
</div>
</div>
<div class="row">
<div class="col-sm-12 content-header">
<ol class="breadcrumb">
<li itemscope itemtype="http://www.schema.org/SiteNavigationElement">
<span>
<a href="../../../index.html" itemprop="url">
<i class="fa fa-fw fa-home"></i>
</a>
</span>
</li>
<li itemscope itemtype="http://www.schema.org/SiteNavigationElement">
<span>
<a href="../../../reference.html" itemprop="url">
<span itemprop="name">リファレンス</span>
</a>
</span>
</li>
<li itemscope itemtype="http://www.schema.org/SiteNavigationElement">
<span>
<a href="../../../reference/map.html" itemprop="url">
<span itemprop="name">map</span>
</a>
</span>
</li>
<li itemscope itemtype="http://www.schema.org/SiteNavigationElement">
<span>
<a href="../../../reference/map/multimap.html" itemprop="url">
<span itemprop="name">multimap</span>
</a>
</span>
</li>
<li class="active" itemscope itemtype="http://www.schema.org/SiteNavigationElement">
<span>
<span itemprop="name">upper_bound</span>
</span>
</li>
</ol>
<div class="crsearch"></div>
</div>
</div>
<div class="row">
<div class="col-sm-12 edit-button">
<p class="text-right"><small>
最終更新日時(UTC):
<span itemprop="datePublished" content="2026-02-17T14:22:33">
2026年02月17日 14時22分33秒
</span>
<br/>
<span itemprop="author" itemscope itemtype="http://schema.org/Person">
<span itemprop="name">Akira Takahashi</span>
</span>
が更新
</small></p>
<p class="text-right">
<a class="history" target="_blank" href="https://github.com/cpprefjp/site/commits/master/reference/map/multimap/upper_bound.md">
<span class="fa fa-fw fa-clock-o fa-flip-horizontal"></span>履歴
</a>
<a class="edit" target="_blank" href="https://github.com/cpprefjp/site/edit/master/reference/map/multimap/upper_bound.md">
<span class="fa fa-fw fa-pencil"></span>編集
</a>
</p>
</div>
</div>
<div class="row">
<div class="col-sm-12 content-body">
<div class="identifier-type">function</div><div class="header"><map></div><h1 itemprop="name"><span class="namespace" title="namespace std">std::</span><span class="class" title="class multimap">multimap::</span><span class="token">upper_bound</span></h1>
<div itemprop="articleBody"><p><div class="codehilite"><pre><span></span><code><span class="n">iterator</span><span class="w"> </span><span class="nf">upper_bound</span><span class="p">(</span><span class="k">const</span><span class="w"> </span><span class="n">key_type</span><span class="o">&</span><span class="w"> </span><span class="n">x</span><span class="p">);</span><span class="w"> </span><span class="c1">// (1) C++03</span>
<span class="k">constexpr</span><span class="w"> </span><span class="n">iterator</span><span class="w"> </span><span class="nf">upper_bound</span><span class="p">(</span><span class="k">const</span><span class="w"> </span><span class="n">key_type</span><span class="o">&</span><span class="w"> </span><span class="n">x</span><span class="p">);</span><span class="w"> </span><span class="c1">// (1) C++26</span>
<span class="k">template</span><span class="w"> </span><span class="o"><</span><span class="k">class</span><span class="w"> </span><span class="nc">K</span><span class="o">></span>
<span class="n">iterator</span><span class="w"> </span><span class="n">upper_bound</span><span class="p">(</span><span class="k">const</span><span class="w"> </span><span class="n">K</span><span class="o">&</span><span class="w"> </span><span class="n">x</span><span class="p">);</span><span class="w"> </span><span class="c1">// (2) C++14</span>
<span class="k">template</span><span class="w"> </span><span class="o"><</span><span class="k">class</span><span class="w"> </span><span class="nc">K</span><span class="o">></span>
<span class="k">constexpr</span><span class="w"> </span><span class="n">iterator</span><span class="w"> </span><span class="n">upper_bound</span><span class="p">(</span><span class="k">const</span><span class="w"> </span><span class="n">K</span><span class="o">&</span><span class="w"> </span><span class="n">x</span><span class="p">);</span><span class="w"> </span><span class="c1">// (2) C++26</span>
<span class="n">const_iterator</span><span class="w"> </span><span class="nf">upper_bound</span><span class="p">(</span><span class="k">const</span><span class="w"> </span><span class="n">key_type</span><span class="o">&</span><span class="w"> </span><span class="n">x</span><span class="p">)</span><span class="w"> </span><span class="k">const</span><span class="p">;</span><span class="w"> </span><span class="c1">// (3) C++03</span>
<span class="k">constexpr</span><span class="w"> </span><span class="n">const_iterator</span><span class="w"> </span><span class="nf">upper_bound</span><span class="p">(</span><span class="k">const</span><span class="w"> </span><span class="n">key_type</span><span class="o">&</span><span class="w"> </span><span class="n">x</span><span class="p">)</span><span class="w"> </span><span class="k">const</span><span class="p">;</span><span class="w"> </span><span class="c1">// (3) C++26</span>
<span class="k">template</span><span class="w"> </span><span class="o"><</span><span class="k">class</span><span class="w"> </span><span class="nc">K</span><span class="o">></span>
<span class="n">const_iterator</span><span class="w"> </span><span class="n">upper_bound</span><span class="p">(</span><span class="k">const</span><span class="w"> </span><span class="n">K</span><span class="o">&</span><span class="w"> </span><span class="n">x</span><span class="p">)</span><span class="w"> </span><span class="k">const</span><span class="p">;</span><span class="w"> </span><span class="c1">// (4) C++14</span>
<span class="k">template</span><span class="w"> </span><span class="o"><</span><span class="k">class</span><span class="w"> </span><span class="nc">K</span><span class="o">></span>
<span class="k">constexpr</span><span class="w"> </span><span class="n">const_iterator</span><span class="w"> </span><span class="n">upper_bound</span><span class="p">(</span><span class="k">const</span><span class="w"> </span><span class="n">K</span><span class="o">&</span><span class="w"> </span><span class="n">x</span><span class="p">)</span><span class="w"> </span><span class="k">const</span><span class="p">;</span><span class="w"> </span><span class="c1">// (4) C++26</span>
</code></pre></div>
</p>
<h2>概要</h2>
<p><code>x</code> より大きいキーを持つコンテナ内の最初の要素を指すイテレータを返す（コンテナの比較オブジェクトを使う）。</p>
<p><code><a href="lower_bound.html">lower_bound()</a></code> と異なり、このメンバ関数は <code>x</code> と等しいときは要素へのイテレータを返さず、それは大きい場合にのみ要素へのイテレータを返す。</p>
<p>内部的に、<code>multimap</code> コンテナ内の全ての要素は常に比較オブジェクトで定義された基準に従って並ぶため、この関数が返す値に続く全ての要素は <code>x</code> より大きいことに注意。</p>
<ul>
<li>(1), (3) : <code>key_type</code>型のキーを受け取り、そのキーより大きい最初の要素へのイテレータを取得する。</li>
<li>(2), (4) : <code>key_type</code>と比較可能な<code>K</code>型のキーを受け取り、そのキーより大きい最初の要素へのイテレータを取得する。</li>
</ul>
<h2><a class="cpprefjp-defined-word" data-desc="関数呼び出し式の評価結果となるオブジェクト・値">戻り値</a></h2>
<ul>
<li>(1), (3) : キー<code>x</code>より大きい最初の要素へのイテレータを返す。そのような要素がない場合は、<code><a href="end.html">end()</a></code>を返す。</li>
<li>(2), (4) : <code>key_compare</code>型の関数オブジェクトを<code>c</code>、コンテナ内の各要素が持つキーを<code>k</code>として、キーが小さくないか判定する式<code>c(x, k)</code>が<code>true</code>となる要素へのイテレータを返す。そのような要素がない場合は、<code><a href="end.html">end()</a></code> を返す。</li>
</ul>
<h2><a class="cpprefjp-defined-word" data-desc="関数等の意味論を構成する要素の1つ。Complexity。関数が使うアルゴリズムの空間計算量・時間計算量">計算量</a></h2>
<p><code><a href="size.html">size()</a></code> について対数時間。</p>
<h2>備考</h2>
<ul>
<li>(2), (4) : この関数が<a class="cpprefjp-defined-word" data-desc="関数呼び出し時に、同名の関数の中から実際に呼び出す関数を決定する処理。このときの候補になることを、オーバーロード解決に参加するという">オーバーロード解決</a>に参加する条件は、<code><a href="find.html">find()</a></code>メンバ関数の備考欄を参照。</li>
</ul>
<h2>例</h2>
<p><div class="yata" id="d5d424364cafac80fca4ede655f1a735691c73ea"><div class="codehilite"><pre><span></span><code><span class="cp">#include <a href="../../iostream.html"><iostream></a></span>
<span class="cp">#include <a href="../../string.html"><string></a></span>
<span class="cp">#include <a href="../../map.html"><map></a></span>
<span class="kt">int</span><span class="w"> </span><span class="nf">main</span><span class="p">()</span>
<span class="p">{</span>
<span class="w"> </span><span class="c1">// (1)</span>
<span class="w"> </span><span class="p">{</span>
<span class="w"> </span><span class="n">std</span><span class="o">::</span><span class="n">multimap</span><span class="o"><</span><span class="n"><a href="../../string/basic_string.html">std::string</a></span><span class="p">,</span><span class="w"> </span><span class="kt">int</span><span class="o">></span><span class="w"> </span><span class="n">m</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
<span class="w"> </span><span class="p">{</span><span class="s">"A"</span><span class="p">,</span><span class="w"> </span><span class="mi">3</span><span class="p">},</span>
<span class="w"> </span><span class="p">{</span><span class="s">"B"</span><span class="p">,</span><span class="w"> </span><span class="mi">1</span><span class="p">},</span>
<span class="w"> </span><span class="p">{</span><span class="s">"B"</span><span class="p">,</span><span class="w"> </span><span class="mi">2</span><span class="p">},</span>
<span class="w"> </span><span class="p">{</span><span class="s">"C"</span><span class="p">,</span><span class="w"> </span><span class="mi">4</span><span class="p">},</span>
<span class="w"> </span><span class="p">{</span><span class="s">"D"</span><span class="p">,</span><span class="w"> </span><span class="mi">5</span><span class="p">}</span>
<span class="w"> </span><span class="p">};</span>
<span class="w"> </span><span class="c1">// B以上D以下の範囲を取得</span>
<span class="w"> </span><span class="k">decltype</span><span class="p">(</span><span class="n">m</span><span class="p">)</span><span class="o">::</span><span class="n">iterator</span><span class="w"> </span><span class="n">it</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n"><a href="lower_bound.html">m.lower_bound</a></span><span class="p">(</span><span class="s">"B"</span><span class="p">);</span>
<span class="w"> </span><span class="k">decltype</span><span class="p">(</span><span class="n">m</span><span class="p">)</span><span class="o">::</span><span class="n">iterator</span><span class="w"> </span><span class="n">last</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">m</span><span class="p">.</span><span class="n"><span style="color:#ff0000">upper_bound</span></span><span class="p">(</span><span class="s">"D"</span><span class="p">);</span>
<span class="w"> </span><span class="k">while</span><span class="w"> </span><span class="p">(</span><span class="n">it</span><span class="w"> </span><span class="o">!=</span><span class="w"> </span><span class="n">last</span><span class="p">)</span><span class="w"> </span><span class="p">{</span>
<span class="w"> </span><span class="n"><a href="../../iostream/cout.html">std::cout</a></span><span class="w"> </span><span class="o"><<</span><span class="w"> </span><span class="n">it</span><span class="o">-></span><span class="n">first</span><span class="w"> </span><span class="o"><<</span><span class="w"> </span><span class="sc">','</span><span class="w"> </span><span class="o"><<</span><span class="w"> </span><span class="n">it</span><span class="o">-></span><span class="n">second</span><span class="w"> </span><span class="o"><<</span><span class="w"> </span><span class="n"><a href="../../ostream/endl.html">std::endl</a></span><span class="p">;</span>
<span class="w"> </span><span class="o">++</span><span class="n">it</span><span class="p">;</span>
<span class="w"> </span><span class="p">}</span>
<span class="w"> </span><span class="n"><a href="../../iostream/cout.html">std::cout</a></span><span class="w"> </span><span class="o"><<</span><span class="w"> </span><span class="n"><a href="../../ostream/endl.html">std::endl</a></span><span class="p">;</span>
<span class="w"> </span><span class="p">}</span>
<span class="w"> </span><span class="c1">// (2)</span>
<span class="w"> </span><span class="p">{</span>
<span class="w"> </span><span class="n">std</span><span class="o">::</span><span class="n">multimap</span><span class="o"><</span><span class="n"><a href="../../string/basic_string.html">std::string</a></span><span class="p">,</span><span class="w"> </span><span class="kt">int</span><span class="p">,</span><span class="w"> </span><span class="n"><a href="../../functional/less.html">std::less</a></span><span class="o"><>></span><span class="w"> </span><span class="n">m</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
<span class="w"> </span><span class="p">{</span><span class="s">"A"</span><span class="p">,</span><span class="w"> </span><span class="mi">3</span><span class="p">},</span>
<span class="w"> </span><span class="p">{</span><span class="s">"B"</span><span class="p">,</span><span class="w"> </span><span class="mi">1</span><span class="p">},</span>
<span class="w"> </span><span class="p">{</span><span class="s">"B"</span><span class="p">,</span><span class="w"> </span><span class="mi">2</span><span class="p">},</span>
<span class="w"> </span><span class="p">{</span><span class="s">"C"</span><span class="p">,</span><span class="w"> </span><span class="mi">4</span><span class="p">},</span>
<span class="w"> </span><span class="p">{</span><span class="s">"D"</span><span class="p">,</span><span class="w"> </span><span class="mi">5</span><span class="p">}</span>
<span class="w"> </span><span class="p">};</span>
<span class="w"> </span><span class="c1">// <a href="../../functional/less.html">std::less</a>のvoidに対する特殊化を使用することで、</span>
<span class="w"> </span><span class="c1">// 文字列リテラルをlower_bound()関数の引数として渡した際に、</span>
<span class="w"> </span><span class="c1">// <a href="../../string/basic_string.html">std::string</a>型の一時オブジェクトが生成されない。</span>
<span class="w"> </span><span class="k">decltype</span><span class="p">(</span><span class="n">m</span><span class="p">)</span><span class="o">::</span><span class="n">iterator</span><span class="w"> </span><span class="n">it</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n"><a href="lower_bound.html">m.lower_bound</a></span><span class="p">(</span><span class="s">"B"</span><span class="p">);</span>
<span class="w"> </span><span class="k">decltype</span><span class="p">(</span><span class="n">m</span><span class="p">)</span><span class="o">::</span><span class="n">iterator</span><span class="w"> </span><span class="n">last</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">m</span><span class="p">.</span><span class="n"><span style="color:#ff0000">upper_bound</span></span><span class="p">(</span><span class="s">"D"</span><span class="p">);</span>
<span class="w"> </span><span class="k">while</span><span class="w"> </span><span class="p">(</span><span class="n">it</span><span class="w"> </span><span class="o">!=</span><span class="w"> </span><span class="n">last</span><span class="p">)</span><span class="w"> </span><span class="p">{</span>
<span class="w"> </span><span class="n"><a href="../../iostream/cout.html">std::cout</a></span><span class="w"> </span><span class="o"><<</span><span class="w"> </span><span class="n">it</span><span class="o">-></span><span class="n">first</span><span class="w"> </span><span class="o"><<</span><span class="w"> </span><span class="s">","</span><span class="w"> </span><span class="o"><<</span><span class="w"> </span><span class="n">it</span><span class="o">-></span><span class="n">second</span><span class="w"> </span><span class="o"><<</span><span class="w"> </span><span class="n"><a href="../../ostream/endl.html">std::endl</a></span><span class="p">;</span>
<span class="w"> </span><span class="o">++</span><span class="n">it</span><span class="p">;</span>
<span class="w"> </span><span class="p">}</span>
<span class="w"> </span><span class="p">}</span>
<span class="p">}</span>
</code></pre></div>
</div></p>
<h3>出力</h3>
<p><pre><code>B,1
B,2
C,4
D,5
B,1
B,2
C,4
D,5
</code></pre></p>
<h2>関連項目</h2>
<table border="1" bordercolor="#888" style="border-collapse:collapse">
<thead>
<tr>
<th>名前</th>
<th>説明</th>
</tr>
</thead>
<tbody>
<tr>
<td><code><a href="lower_bound.html">lower_bound</a></code></td>
<td>与えられた値よりも小さくない最初の要素へのイテレータを返す</td>
</tr>
<tr>
<td><code><a href="equal_range.html">equal_range</a></code></td>
<td>指定したキーにマッチする要素範囲を返す</td>
</tr>
<tr>
<td><code><a href="find.html">find</a></code></td>
<td>指定したキーで要素を探す</td>
</tr>
<tr>
<td><code><a href="count.html">count</a></code></td>
<td>指定したキーにマッチする要素の数を返す</td>
</tr>
</tbody>
</table>
<h2>参照</h2>
<ul>
<li><a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2013/n3657.htm" target="_blank">N3657 Adding heterogeneous comparison lookup to associative containers (rev 4)</a></li>
<li><a href="https://open-std.org/jtc1/sc22/wg21/docs/papers/2025/p3372r3.html" target="_blank">P3372R3 constexpr containers and adaptors</a></li>
</ul></div>
</div>
</div>
</div>
<div id="sidebar" class="col-sm-3 col-sm-pull-9">
</div>
</div>
</div>
</main>
<footer class="footer navbar navbar-default">
<div class="container-fluid">
<p><small>
本サイトの情報は、
<a href="https://creativecommons.org/licenses/by/4.0/deed.ja" rel="nofollow">クリエイティブ・コモンズ 表示 4.0 非移植 ライセンス(CC BY)</a>
の下に提供されています。
</small></p>
</div>
</footer>
</body>
</html>