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
|
//===----------------------------------------------------------------------===//
//
// 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 find(const key_type& k);
// const_iterator find(const key_type& k) const;
#include <cassert>
#include <deque>
#include <flat_map>
#include <functional>
#include <string>
#include <utility>
#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'}, {4, 'd'}, {5, 'e'}, {8, 'h'}};
ASSERT_SAME_TYPE(decltype(m.find(0)), typename M::iterator);
ASSERT_SAME_TYPE(decltype(std::as_const(m).find(0)), typename M::const_iterator);
assert(m.find(0) == m.end());
assert(m.find(1) == m.begin());
assert(m.find(2) == m.begin() + 1);
assert(m.find(3) == m.end());
assert(m.find(4) == m.begin() + 2);
assert(m.find(5) == m.begin() + 3);
assert(m.find(6) == m.end());
assert(m.find(7) == m.end());
assert(std::as_const(m).find(8) == m.begin() + 4);
assert(std::as_const(m).find(9) == m.end());
}
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>>>();
return 0;
}
|
