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
|
//===----------------------------------------------------------------------===//
//
// 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
// <flat_map>
// iterator begin() noexcept;
// const_iterator begin() const noexcept
// iterator end() noexcept;
// const_iterator end() const noexcept;
//
// const_iterator cbegin() const noexcept;
// const_iterator cend() const noexcept;
#include <cassert>
#include <cstddef>
#include <deque>
#include <flat_map>
#include <functional>
#include <string>
#include "MinSequenceContainer.h"
#include "test_macros.h"
#include "min_allocator.h"
template <class KeyContainer, class ValueContainer>
void test() {
using Key = typename KeyContainer::value_type;
using Value = typename ValueContainer::value_type;
using M = std::flat_map<Key, Value, std::less<Key>, KeyContainer, ValueContainer>;
M m = {{1, 'a'}, {2, 'b'}, {3, 'c'}, {4, 'd'}};
const M& cm = m;
ASSERT_SAME_TYPE(decltype(m.begin()), typename M::iterator);
ASSERT_SAME_TYPE(decltype(m.cbegin()), typename M::const_iterator);
ASSERT_SAME_TYPE(decltype(cm.begin()), typename M::const_iterator);
ASSERT_SAME_TYPE(decltype(m.end()), typename M::iterator);
ASSERT_SAME_TYPE(decltype(m.cend()), typename M::const_iterator);
ASSERT_SAME_TYPE(decltype(cm.end()), typename M::const_iterator);
static_assert(noexcept(m.begin()));
static_assert(noexcept(cm.begin()));
static_assert(noexcept(m.cbegin()));
static_assert(noexcept(m.end()));
static_assert(noexcept(cm.end()));
static_assert(noexcept(m.cend()));
assert(m.size() == 4);
assert(std::distance(m.begin(), m.end()) == 4);
assert(std::distance(cm.begin(), cm.end()) == 4);
assert(std::distance(m.cbegin(), m.cend()) == 4);
typename M::iterator i; // default-construct
i = m.begin(); // move-assignment
typename M::const_iterator k = i; // converting constructor
assert(i == k); // comparison
for (int j = 1; j <= 4; ++j, ++i) { // pre-increment
assert(i->first == j); // operator->
assert(i->second == 'a' + j - 1);
}
assert(i == m.end());
for (int j = 4; j >= 1; --j) {
--i; // pre-decrement
assert((*i).first == j);
assert((*i).second == 'a' + j - 1);
}
assert(i == m.begin());
}
int main(int, char**) {
test<std::vector<int>, std::vector<char>>();
test<std::deque<int>, std::vector<char>>();
test<MinSequenceContainer<int>, MinSequenceContainer<char>>();
test<std::vector<int, min_allocator<int>>, std::vector<char, min_allocator<char>>>();
{
// N3644 testing
using C = std::flat_map<int, char>;
C::iterator ii1{}, ii2{};
C::iterator ii4 = ii1;
C::const_iterator cii{};
assert(ii1 == ii2);
assert(ii1 == ii4);
assert(!(ii1 != ii2));
assert((ii1 == cii));
assert((cii == ii1));
assert(!(ii1 != cii));
assert(!(cii != ii1));
}
return 0;
}
|
