1 //===----------------------------------------------------------------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is dual licensed under the MIT and the University of Illinois Open
6 // Source Licenses. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // UNSUPPORTED: c++98, c++03
14 // template <class... Args> reference emplace_front(Args&&... args);
20 #include "test_macros.h"
21 #include "../../../Emplaceable.h"
22 #include "min_allocator.h"
26 make(int size, int start = 0 )
28 const int b = 4096 / sizeof(int);
32 init = (start+1) / b + ((start+1) % b != 0);
37 for (int i = 0; i < init-start; ++i)
39 for (int i = 0; i < size; ++i)
40 c.push_back(Emplaceable());
41 for (int i = 0; i < start; ++i)
50 typedef typename C::iterator I;
51 typedef typename C::reference Ref;
52 std::size_t c1_osize = c1.size();
53 Ref res_ref = c1.emplace_front(Emplaceable(1, 2.5));
54 assert(c1.size() == c1_osize + 1);
55 assert(distance(c1.begin(), c1.end())
56 == static_cast<std::ptrdiff_t>(c1.size()));
58 assert(*i == Emplaceable(1, 2.5));
59 assert(&res_ref == &(*i));
64 testN(int start, int N)
66 C c1 = make<C>(N, start);
74 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049};
75 const int N = sizeof(rng)/sizeof(rng[0]);
76 for (int i = 0; i < N; ++i)
77 for (int j = 0; j < N; ++j)
78 testN<std::deque<Emplaceable> >(rng[i], rng[j]);
81 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049};
82 const int N = sizeof(rng)/sizeof(rng[0]);
83 for (int i = 0; i < N; ++i)
84 for (int j = 0; j < N; ++j)
85 testN<std::deque<Emplaceable, min_allocator<Emplaceable>> >(rng[i], rng[j]);