File: insert_or_assign.pass.cpp

package info (click to toggle)
llvm-toolchain-13 1%3A13.0.1-6~deb11u1
  • links: PTS, VCS
  • area: main
  • in suites: bullseye
  • size: 1,418,812 kB
  • sloc: cpp: 5,290,827; ansic: 996,570; asm: 544,593; python: 188,212; objc: 72,027; lisp: 30,291; f90: 25,395; sh: 24,900; javascript: 9,780; pascal: 9,398; perl: 7,484; ml: 5,432; awk: 3,523; makefile: 2,892; xml: 953; cs: 573; fortran: 539
file content (288 lines) | stat: -rw-r--r-- 11,088 bytes parent folder | download | duplicates (16)
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
//===----------------------------------------------------------------------===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===----------------------------------------------------------------------===//
//
// UNSUPPORTED: c++03, c++11, c++14

// <map>

// class map

// template <class M>
//  pair<iterator, bool> insert_or_assign(const key_type& k, M&& obj);            // C++17
// template <class M>
//  pair<iterator, bool> insert_or_assign(key_type&& k, M&& obj);                 // C++17
// template <class M>
//  iterator insert_or_assign(const_iterator hint, const key_type& k, M&& obj);   // C++17
// template <class M>
//  iterator insert_or_assign(const_iterator hint, key_type&& k, M&& obj);        // C++17

#include <map>
#include <cassert>
#include <tuple>

#include "test_macros.h"

class Moveable
{
    Moveable(const Moveable&);
    Moveable& operator=(const Moveable&);

    int int_;
    double double_;
public:
    Moveable() : int_(0), double_(0) {}
    Moveable(int i, double d) : int_(i), double_(d) {}
    Moveable(Moveable&& x)
        : int_(x.int_), double_(x.double_)
            {x.int_ = -1; x.double_ = -1;}
    Moveable& operator=(Moveable&& x)
        {int_ = x.int_; x.int_ = -1;
         double_ = x.double_; x.double_ = -1;
         return *this;
        }

    bool operator==(const Moveable& x) const
        {return int_ == x.int_ && double_ == x.double_;}
    bool operator<(const Moveable& x) const
        {return int_ < x.int_ || (int_ == x.int_ && double_ < x.double_);}

    int get() const {return int_;}
    bool moved() const {return int_ == -1;}
};


int main(int, char**)
{
    { // pair<iterator, bool> insert_or_assign(const key_type& k, M&& obj);
        typedef std::map<int, Moveable> M;
        typedef std::pair<M::iterator, bool> R;
        M m;
        R r;
        for ( int i = 0; i < 20; i += 2 )
            m.emplace ( i, Moveable(i, (double) i));
        assert(m.size() == 10);

        for (int i=0; i < 20; i += 2)
        {
            Moveable mv(i+1, i+1);
            r = m.insert_or_assign(i, std::move(mv));
            assert(m.size() == 10);
            assert(!r.second);                    // was not inserted
            assert(mv.moved());                   // was moved from
            assert(r.first->first == i);          // key
            assert(r.first->second.get() == i+1); // value
        }

        Moveable mv1(5, 5.0);
        r = m.insert_or_assign(-1, std::move(mv1));
        assert(m.size() == 11);
        assert(r.second);                    // was inserted
        assert(mv1.moved());                 // was moved from
        assert(r.first->first        == -1); // key
        assert(r.first->second.get() == 5);  // value

        Moveable mv2(9, 9.0);
        r = m.insert_or_assign(3, std::move(mv2));
        assert(m.size() == 12);
        assert(r.second);                   // was inserted
        assert(mv2.moved());                // was moved from
        assert(r.first->first        == 3); // key
        assert(r.first->second.get() == 9); // value

        Moveable mv3(-1, 5.0);
        r = m.insert_or_assign(117, std::move(mv3));
        assert(m.size() == 13);
        assert(r.second);                     // was inserted
        assert(mv3.moved());                  // was moved from
        assert(r.first->first        == 117); // key
        assert(r.first->second.get() == -1);  // value
    }
    { // pair<iterator, bool> insert_or_assign(key_type&& k, M&& obj);
        typedef std::map<Moveable, Moveable> M;
        typedef std::pair<M::iterator, bool> R;
        M m;
        R r;
        for ( int i = 0; i < 20; i += 2 )
            m.emplace ( Moveable(i, (double) i), Moveable(i+1, (double) i+1));
        assert(m.size() == 10);

        Moveable mvkey1(2, 2.0);
        Moveable mv1(4, 4.0);
        r = m.insert_or_assign(std::move(mvkey1), std::move(mv1));
        assert(m.size() == 10);
        assert(!r.second);                  // was not inserted
        assert(!mvkey1.moved());            // was not moved from
        assert(mv1.moved());                // was moved from
        assert(r.first->first == mvkey1);   // key
        assert(r.first->second.get() == 4); // value

        Moveable mvkey2(3, 3.0);
        Moveable mv2(5, 5.0);
        r = m.try_emplace(std::move(mvkey2), std::move(mv2));
        assert(m.size() == 11);
        assert(r.second);                   // was inserted
        assert(mv2.moved());                // was moved from
        assert(mvkey2.moved());             // was moved from
        assert(r.first->first.get()  == 3); // key
        assert(r.first->second.get() == 5); // value
    }
    { // iterator insert_or_assign(const_iterator hint, const key_type& k, M&& obj);
        typedef std::map<int, Moveable> M;
        M m;
        M::iterator r;
        for ( int i = 0; i < 20; i += 2 )
            m.emplace ( i, Moveable(i, (double) i));
        assert(m.size() == 10);
        M::const_iterator it = m.find(2);

        Moveable mv1(3, 3.0);
        r = m.insert_or_assign(it, 2, std::move(mv1));
        assert(m.size() == 10);
        assert(mv1.moved());           // was moved from
        assert(r->first        == 2);  // key
        assert(r->second.get() == 3);  // value

        Moveable mv2(5, 5.0);
        r = m.insert_or_assign(it, 3, std::move(mv2));
        assert(m.size() == 11);
        assert(mv2.moved());           // was moved from
        assert(r->first        == 3);  // key
        assert(r->second.get() == 5);  // value

        // wrong hint: begin()
        Moveable mv3(7, 7.0);
        r = m.insert_or_assign(m.begin(), 4, std::move(mv3));
        assert(m.size() == 11);
        assert(mv3.moved());           // was moved from
        assert(r->first        == 4);  // key
        assert(r->second.get() == 7);  // value

        Moveable mv4(9, 9.0);
        r = m.insert_or_assign(m.begin(), 5, std::move(mv4));
        assert(m.size() == 12);
        assert(mv4.moved());           // was moved from
        assert(r->first        == 5);  // key
        assert(r->second.get() == 9);  // value

        // wrong hint: end()
        Moveable mv5(11, 11.0);
        r = m.insert_or_assign(m.end(), 6, std::move(mv5));
        assert(m.size() == 12);
        assert(mv5.moved());           // was moved from
        assert(r->first        == 6);  // key
        assert(r->second.get() == 11); // value

        Moveable mv6(13, 13.0);
        r = m.insert_or_assign(m.end(), 7, std::move(mv6));
        assert(m.size() == 13);
        assert(mv6.moved());           // was moved from
        assert(r->first        == 7);  // key
        assert(r->second.get() == 13); // value

        // wrong hint: third element
        Moveable mv7(15, 15.0);
        r = m.insert_or_assign(std::next(m.begin(), 2), 8, std::move(mv7));
        assert(m.size() == 13);
        assert(mv7.moved());           // was moved from
        assert(r->first        == 8);  // key
        assert(r->second.get() == 15); // value

        Moveable mv8(17, 17.0);
        r = m.insert_or_assign(std::next(m.begin(), 2), 9, std::move(mv8));
        assert(m.size() == 14);
        assert(mv8.moved());           // was moved from
        assert(r->first        == 9);  // key
        assert(r->second.get() == 17); // value
    }
    { // iterator insert_or_assign(const_iterator hint, key_type&& k, M&& obj);
        typedef std::map<Moveable, Moveable> M;
        M m;
        M::iterator r;
        for ( int i = 0; i < 20; i += 2 )
            m.emplace ( Moveable(i, (double) i), Moveable(i+1, (double) i+1));
        assert(m.size() == 10);
        M::const_iterator it = std::next(m.cbegin());

        Moveable mvkey1(2, 2.0);
        Moveable mv1(4, 4.0);
        r = m.insert_or_assign(it, std::move(mvkey1), std::move(mv1));
        assert(m.size() == 10);
        assert(mv1.moved());          // was moved from
        assert(!mvkey1.moved());      // was not moved from
        assert(r->first == mvkey1);   // key
        assert(r->second.get() == 4); // value

        Moveable mvkey2(3, 3.0);
        Moveable mv2(5, 5.0);
        r = m.insert_or_assign(it, std::move(mvkey2), std::move(mv2));
        assert(m.size() == 11);
        assert(mv2.moved());           // was moved from
        assert(mvkey2.moved());        // was moved from
        assert(r->first.get()  == 3);  // key
        assert(r->second.get() == 5);  // value

        // wrong hint: begin()
        Moveable mvkey3(6, 6.0);
        Moveable mv3(8, 8.0);
        r = m.insert_or_assign(m.begin(), std::move(mvkey3), std::move(mv3));
        assert(m.size() == 11);
        assert(mv3.moved());           // was moved from
        assert(!mvkey3.moved());       // was not moved from
        assert(r->first == mvkey3);    // key
        assert(r->second.get() == 8);  // value

        Moveable mvkey4(7, 7.0);
        Moveable mv4(9, 9.0);
        r = m.insert_or_assign(m.begin(), std::move(mvkey4), std::move(mv4));
        assert(m.size() == 12);
        assert(mv4.moved());           // was moved from
        assert(mvkey4.moved());        // was moved from
        assert(r->first.get()  == 7);  // key
        assert(r->second.get() == 9);  // value

        // wrong hint: end()
        Moveable mvkey5(8, 8.0);
        Moveable mv5(10, 10.0);
        r = m.insert_or_assign(m.end(), std::move(mvkey5), std::move(mv5));
        assert(m.size() == 12);
        assert(mv5.moved());           // was moved from
        assert(!mvkey5.moved());       // was not moved from
        assert(r->first == mvkey5);    // key
        assert(r->second.get() == 10); // value

        Moveable mvkey6(9, 9.0);
        Moveable mv6(11, 11.0);
        r = m.insert_or_assign(m.end(), std::move(mvkey6), std::move(mv6));
        assert(m.size() == 13);
        assert(mv6.moved());           // was moved from
        assert(mvkey6.moved());        // was moved from
        assert(r->first.get()  == 9);  // key
        assert(r->second.get() == 11); // value

        // wrong hint: third element
        Moveable mvkey7(10, 10.0);
        Moveable mv7(12, 12.0);
        r = m.insert_or_assign(std::next(m.begin(), 2), std::move(mvkey7), std::move(mv7));
        assert(m.size() == 13);
        assert(mv7.moved());           // was moved from
        assert(!mvkey7.moved());       // was not moved from
        assert(r->first == mvkey7);    // key
        assert(r->second.get() == 12); // value

        Moveable mvkey8(11, 11.0);
        Moveable mv8(13, 13.0);
        r = m.insert_or_assign(std::next(m.begin(), 2), std::move(mvkey8), std::move(mv8));
        assert(m.size() == 14);
        assert(mv8.moved());           // was moved from
        assert(mvkey8.moved());        // was moved from
        assert(r->first.get()  == 11); // key
        assert(r->second.get() == 13); // value
    }

  return 0;
}