File: emplace.pass.cpp

package info (click to toggle)
llvm-toolchain-21 1%3A21.1.0-1
  • links: PTS, VCS
  • area: main
  • in suites: sid
  • size: 2,235,796 kB
  • sloc: cpp: 7,617,614; ansic: 1,433,901; asm: 1,058,726; python: 252,096; f90: 94,671; objc: 70,753; lisp: 42,813; pascal: 18,401; sh: 10,032; ml: 5,111; perl: 4,720; awk: 3,523; makefile: 3,401; javascript: 2,272; xml: 892; fortran: 770
file content (181 lines) | stat: -rw-r--r-- 6,356 bytes parent folder | download | duplicates (3)
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
//===----------------------------------------------------------------------===//
//
// 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>

// template <class... Args>
//   pair<iterator, bool> emplace(Args&&... args);

#include <flat_map>
#include <cassert>
#include <deque>
#include <tuple>
#include <functional>
#include <type_traits>
#include <vector>

#include "MinSequenceContainer.h"
#include "../helpers.h"
#include "test_macros.h"
#include "../../../Emplaceable.h"
#include "DefaultOnly.h"
#include "min_allocator.h"

// Constraints: is_constructible_v<pair<key_type, mapped_type>, Args...> is true.
template <class M, class... Args>
concept CanEmplace = requires(M m, Args&&... args) { m.emplace(std::forward<Args>(args)...); };

using Map = std::flat_map<Emplaceable, Emplaceable>;
static_assert(CanEmplace<Map>);
static_assert(CanEmplace<Map, Emplaceable, Emplaceable>);
static_assert(CanEmplace<Map, std::piecewise_construct_t, std::tuple<int, double>, std::tuple<int, double>>);
static_assert(!CanEmplace<Map, Emplaceable>);
static_assert(!CanEmplace<Map, int, double>);

template <class KeyContainer, class ValueContainer>
constexpr 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>;
  using R     = std::pair<typename M::iterator, bool>;
  {
    // was empty
    M m;
    std::same_as<R> decltype(auto) r = m.emplace(typename M::value_type(2, 3.5));
    assert(r.second);
    assert(r.first == m.begin());
    assert(m.size() == 1);
    assert(r.first->first == 2);
    assert(r.first->second == 3.5);
  }
  {
    // key does not exist and inserted at the begin
    M m                              = {{3, 4.0}, {5, 3.0}, {6, 1.0}, {7, 0.0}};
    std::same_as<R> decltype(auto) r = m.emplace(typename M::value_type(2, 2.0));
    assert(r.second);
    assert(r.first == m.begin());
    assert(m.size() == 5);
    assert(r.first->first == 2);
    assert(r.first->second == 2.0);
  }
  {
    // key does not exist and inserted in the middle
    M m                              = {{0, 4.0}, {1, 3.0}, {3, 1.0}, {4, 0.0}};
    std::same_as<R> decltype(auto) r = m.emplace(typename M::value_type(2, 2.0));
    assert(r.second);
    assert(r.first == m.begin() + 2);
    assert(m.size() == 5);
    assert(r.first->first == 2);
    assert(r.first->second == 2.0);
  }
  {
    // key does not exist and inserted at the end
    M m                              = {{0, 4.0}, {1, 3.0}};
    std::same_as<R> decltype(auto) r = m.emplace(typename M::value_type(2, 2.0));
    assert(r.second);
    assert(r.first == m.begin() + 2);
    assert(m.size() == 3);
    assert(r.first->first == 2);
    assert(r.first->second == 2.0);
  }
  {
    // key already exists and original at the begin
    M m                              = {{2, 4.0}, {3, 3.0}, {5, 1.0}, {6, 0.0}};
    std::same_as<R> decltype(auto) r = m.emplace(typename M::value_type(2, 2.0));
    assert(!r.second);
    assert(r.first == m.begin());
    assert(m.size() == 4);
    assert(r.first->first == 2);
    assert(r.first->second == 4.0);
  }
  {
    // key already exists and original in the middle
    M m                              = {{0, 4.0}, {2, 3.0}, {3, 1.0}, {4, 0.0}};
    std::same_as<R> decltype(auto) r = m.emplace(typename M::value_type(2, 2.0));
    assert(!r.second);
    assert(r.first == m.begin() + 1);
    assert(m.size() == 4);
    assert(r.first->first == 2);
    assert(r.first->second == 3.0);
  }
  {
    // key already exists and original at the end
    M m                              = {{0, 4.0}, {1, 3.0}, {2, 1.0}};
    std::same_as<R> decltype(auto) r = m.emplace(typename M::value_type(2, 2.0));
    assert(!r.second);
    assert(r.first == m.begin() + 2);
    assert(m.size() == 3);
    assert(r.first->first == 2);
    assert(r.first->second == 1.0);
  }
}

template <class KeyContainer, class ValueContainer>
constexpr void test_emplaceable() {
  using M = std::flat_map<int, Emplaceable, std::less<int>, KeyContainer, ValueContainer>;
  using R = std::pair<typename M::iterator, bool>;

  M m;
  ASSERT_SAME_TYPE(decltype(m.emplace()), R);
  R r = m.emplace(std::piecewise_construct, std::forward_as_tuple(2), std::forward_as_tuple());
  assert(r.second);
  assert(r.first == m.begin());
  assert(m.size() == 1);
  assert(m.begin()->first == 2);
  assert(m.begin()->second == Emplaceable());
  r = m.emplace(std::piecewise_construct, std::forward_as_tuple(1), std::forward_as_tuple(2, 3.5));
  assert(r.second);
  assert(r.first == m.begin());
  assert(m.size() == 2);
  assert(m.begin()->first == 1);
  assert(m.begin()->second == Emplaceable(2, 3.5));
  r = m.emplace(std::piecewise_construct, std::forward_as_tuple(1), std::forward_as_tuple(2, 3.5));
  assert(!r.second);
  assert(r.first == m.begin());
  assert(m.size() == 2);
  assert(m.begin()->first == 1);
  assert(m.begin()->second == Emplaceable(2, 3.5));
}

constexpr bool test() {
  test<std::vector<int>, std::vector<double>>();
  test<MinSequenceContainer<int>, MinSequenceContainer<double>>();
  test<std::vector<int, min_allocator<int>>, std::vector<double, min_allocator<double>>>();

  test_emplaceable<std::vector<int>, std::vector<Emplaceable>>();
  test_emplaceable<MinSequenceContainer<int>, MinSequenceContainer<Emplaceable>>();
  test_emplaceable<std::vector<int, min_allocator<int>>, std::vector<Emplaceable, min_allocator<Emplaceable>>>();

#ifndef __cpp_lib_constexpr_deque
  if (!TEST_IS_CONSTANT_EVALUATED)
#endif
  {
    test<std::deque<int>, std::vector<double>>();
    test_emplaceable<std::deque<int>, std::vector<Emplaceable>>();
  }

  if (!TEST_IS_CONSTANT_EVALUATED) {
    auto emplace_func = [](auto& m, auto key_arg, auto value_arg) {
      m.emplace(std::piecewise_construct, std::tuple(key_arg), std::tuple(value_arg));
    };
    test_emplace_exception_guarantee(emplace_func);
  }

  return true;
}

int main(int, char**) {
  test();
#if TEST_STD_VER >= 26
  static_assert(test());
#endif

  return 0;
}