1//===----------------------------------------------------------------------===//
2//
3// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4// See https://llvm.org/LICENSE.txt for license information.
5// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6//
7//===----------------------------------------------------------------------===//
8
9// UNSUPPORTED: c++03
10
11// <deque>
12
13// template <class... Args> reference emplace_front(Args&&... args);
14// return type is 'reference' in C++17; 'void' before
15
16#include "asan_testing.h"
17#include <deque>
18#include <cstddef>
19#include <cassert>
20
21#include "test_macros.h"
22#include "../../../Emplaceable.h"
23#include "min_allocator.h"
24#include "test_allocator.h"
25
26template <class C>
27C
28make(int size, int start = 0 )
29{
30 const int b = 4096 / sizeof(int);
31 int init = 0;
32 if (start > 0)
33 {
34 init = (start+1) / b + ((start+1) % b != 0);
35 init *= b;
36 --init;
37 }
38 C c(init);
39 for (int i = 0; i < init-start; ++i)
40 c.pop_back();
41 for (int i = 0; i < size; ++i)
42 c.push_back(Emplaceable());
43 for (int i = 0; i < start; ++i)
44 c.pop_front();
45 return c;
46}
47
48template <class C>
49void
50test(C& c1)
51{
52 typedef typename C::iterator I;
53 std::size_t c1_osize = c1.size();
54#if TEST_STD_VER > 14
55 typedef typename C::reference Ref;
56 Ref res_ref = c1.emplace_front(Emplaceable(1, 2.5));
57#else
58 c1.emplace_front(Emplaceable(1, 2.5));
59#endif
60 assert(c1.size() == c1_osize + 1);
61 assert(std::distance(c1.begin(), c1.end())
62 == static_cast<std::ptrdiff_t>(c1.size()));
63 I i = c1.begin();
64 assert(*i == Emplaceable(1, 2.5));
65 LIBCPP_ASSERT(is_double_ended_contiguous_container_asan_correct(c1));
66#if TEST_STD_VER > 14
67 assert(&res_ref == &(*i));
68#endif
69}
70
71template <class C>
72void
73testN(int start, int N)
74{
75 C c1 = make<C>(N, start);
76 test(c1);
77}
78
79
80int main(int, char**)
81{
82 {
83 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049};
84 const int N = sizeof(rng)/sizeof(rng[0]);
85 for (int i = 0; i < N; ++i)
86 for (int j = 0; j < N; ++j)
87 testN<std::deque<Emplaceable> >(rng[i], rng[j]);
88 }
89 {
90 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049};
91 const int N = sizeof(rng)/sizeof(rng[0]);
92 for (int i = 0; i < N; ++i)
93 for (int j = 0; j < N; ++j)
94 testN<std::deque<Emplaceable, min_allocator<Emplaceable>> >(rng[i], rng[j]);
95 }
96 {
97 std::deque<Tag_X, TaggingAllocator<Tag_X>> c;
98 c.emplace_front();
99 assert(c.size() == 1);
100 LIBCPP_ASSERT(is_double_ended_contiguous_container_asan_correct(c));
101 c.emplace_front(1, 2, 3);
102 assert(c.size() == 2);
103 LIBCPP_ASSERT(is_double_ended_contiguous_container_asan_correct(c));
104 c.emplace_front();
105 assert(c.size() == 3);
106 LIBCPP_ASSERT(is_double_ended_contiguous_container_asan_correct(c));
107 c.emplace_front(1, 2, 3);
108 assert(c.size() == 4);
109 LIBCPP_ASSERT(is_double_ended_contiguous_container_asan_correct(c));
110 }
111
112 return 0;
113}
114

source code of libcxx/test/std/containers/sequences/deque/deque.modifiers/emplace_front.pass.cpp