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
|
//===----------------------------------------------------------------------===//
//
// 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, c++17, c++20
// UNSUPPORTED: no-exceptions
// <flat_map>
// flat_multimap(flat_multimap&& s);
// If any member function in [flat.multimap.defn] exits via an exception, the invariant is restored.
#include <algorithm>
#include <cassert>
#include <flat_map>
#include <functional>
#include <utility>
#include <vector>
#include "../helpers.h"
#include "test_macros.h"
static int countdown = 0;
struct EvilContainer : std::vector<int> {
EvilContainer() = default;
EvilContainer(EvilContainer&& rhs) {
// Throw on move-construction.
if (--countdown == 0) {
rhs.insert(rhs.end(), 0);
rhs.insert(rhs.end(), 0);
throw 42;
}
}
};
int main(int, char**) {
{
using M = std::flat_multimap<int, int, std::less<int>, EvilContainer, std::vector<int>>;
M mo = {{1, 1}, {1, 2}, {3, 3}};
countdown = 1;
try {
M m = std::move(mo);
assert(false); // not reached
} catch (int x) {
assert(x == 42);
}
// The source flat_multimap maintains its class invariant.
check_invariant(mo);
LIBCPP_ASSERT(mo.empty());
}
{
using M = std::flat_multimap<int, int, std::less<int>, std::vector<int>, EvilContainer>;
M mo = {{1, 1}, {1, 2}, {3, 3}};
countdown = 1;
try {
M m = std::move(mo);
assert(false); // not reached
} catch (int x) {
assert(x == 42);
}
// The source flat_multimap maintains its class invariant.
check_invariant(mo);
LIBCPP_ASSERT(mo.empty());
}
return 0;
}
|
