Gitiles
Code Review Sign In
gerrit-public.fairphone.software / platform / external / libcxx / 1d4a1edbc7e4461b59239e1b8297e9dd395a6322 / . / test / std / containers / associative / map / map.modifiers / insert_cv.pass.cpp
blob: 3d28242fd322864ff2017d0d049eacc00652fd21 [file] [log] [blame]
Howard Hinnantbc8d3f92010-05-11 19:42:16 +0000[diff] [blame]1//===----------------------------------------------------------------------===//
2//
Howard Hinnantf5256e12010-05-11 21:36:01 +0000[diff] [blame]3// The LLVM Compiler Infrastructure
Howard Hinnantbc8d3f92010-05-11 19:42:16 +0000[diff] [blame]4//
Howard Hinnantb64f8b02010-11-16 22:09:02 +0000[diff] [blame]5// This file is dual licensed under the MIT and the University of Illinois Open
6// Source Licenses. See LICENSE.TXT for details.
Howard Hinnantbc8d3f92010-05-11 19:42:16 +0000[diff] [blame]7//
8//===----------------------------------------------------------------------===//
9
10// <map>
11
12// class map
13
14// pair<iterator, bool> insert(const value_type& v);
15
16#include <map>
17#include <cassert>
18
Marshall Clow061d0cc2013-11-26 20:58:02 +0000[diff] [blame]19#include "min_allocator.h"
Howard Hinnant70342b92013-06-19 21:29:40 +0000[diff] [blame]20
Howard Hinnantbc8d3f92010-05-11 19:42:16 +0000[diff] [blame]21int main()
22{
Dan Albert1d4a1ed2016-05-25 22:36:09 -0700[diff] [blame^]23 {
24 typedef std::map<int, double> M;
25 typedef std::pair<M::iterator, bool> R;
26 M m;
27 R r = m.insert(M::value_type(2, 2.5));
28 assert(r.second);
29 assert(r.first == m.begin());
30 assert(m.size() == 1);
31 assert(r.first->first == 2);
32 assert(r.first->second == 2.5);
33
34 r = m.insert(M::value_type(1, 1.5));
35 assert(r.second);
36 assert(r.first == m.begin());
37 assert(m.size() == 2);
38 assert(r.first->first == 1);
39 assert(r.first->second == 1.5);
40
41 r = m.insert(M::value_type(3, 3.5));
42 assert(r.second);
43 assert(r.first == prev(m.end()));
44 assert(m.size() == 3);
45 assert(r.first->first == 3);
46 assert(r.first->second == 3.5);
47
48 r = m.insert(M::value_type(3, 3.5));
49 assert(!r.second);
50 assert(r.first == prev(m.end()));
51 assert(m.size() == 3);
52 assert(r.first->first == 3);
53 assert(r.first->second == 3.5);
54 }
55#if __cplusplus >= 201103L
Howard Hinnant70342b92013-06-19 21:29:40 +0000[diff] [blame]56 {
57 typedef std::map<int, double, std::less<int>, min_allocator<std::pair<const int, double>>> M;
Dan Albert1d4a1ed2016-05-25 22:36:09 -0700[diff] [blame^]58 typedef std::pair<M::iterator, bool> R;
59 M m;
60 R r = m.insert(M::value_type(2, 2.5));
61 assert(r.second);
62 assert(r.first == m.begin());
63 assert(m.size() == 1);
64 assert(r.first->first == 2);
65 assert(r.first->second == 2.5);
66
67 r = m.insert(M::value_type(1, 1.5));
68 assert(r.second);
69 assert(r.first == m.begin());
70 assert(m.size() == 2);
71 assert(r.first->first == 1);
72 assert(r.first->second == 1.5);
73
74 r = m.insert(M::value_type(3, 3.5));
75 assert(r.second);
76 assert(r.first == prev(m.end()));
77 assert(m.size() == 3);
78 assert(r.first->first == 3);
79 assert(r.first->second == 3.5);
80
81 r = m.insert(M::value_type(3, 3.5));
82 assert(!r.second);
83 assert(r.first == prev(m.end()));
84 assert(m.size() == 3);
85 assert(r.first->first == 3);
86 assert(r.first->second == 3.5);
Howard Hinnant70342b92013-06-19 21:29:40 +0000[diff] [blame]87 }
88#endif
Howard Hinnantbc8d3f92010-05-11 19:42:16 +0000[diff] [blame]89}