2012-07-09 02:47:43 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
|
|
|
// This file is dual licensed under the MIT and the University of Illinois Open
|
|
|
|
// Source Licenses. See LICENSE.TXT for details.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
// <vector>
|
|
|
|
|
|
|
|
// template <class... Args> iterator emplace(const_iterator pos, Args&&... args);
|
|
|
|
|
|
|
|
#include <vector>
|
|
|
|
#include <cassert>
|
2013-06-27 19:35:32 +00:00
|
|
|
|
|
|
|
#include "../../../min_allocator.h"
|
|
|
|
|
2012-07-09 02:47:43 +00:00
|
|
|
int main()
|
|
|
|
{
|
|
|
|
#ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS
|
|
|
|
{
|
|
|
|
std::vector<int> v;
|
|
|
|
v.reserve(3);
|
|
|
|
v = { 1, 2, 3 };
|
|
|
|
v.emplace(v.begin(), v.back());
|
|
|
|
assert(v[0] == 3);
|
|
|
|
}
|
|
|
|
{
|
|
|
|
std::vector<int> v;
|
|
|
|
v.reserve(4);
|
|
|
|
v = { 1, 2, 3 };
|
|
|
|
v.emplace(v.begin(), v.back());
|
|
|
|
assert(v[0] == 3);
|
|
|
|
}
|
2013-06-27 19:35:32 +00:00
|
|
|
#if __cplusplus >= 201103L
|
|
|
|
{
|
|
|
|
std::vector<int, min_allocator<int>> v;
|
|
|
|
v.reserve(3);
|
|
|
|
v = { 1, 2, 3 };
|
|
|
|
v.emplace(v.begin(), v.back());
|
|
|
|
assert(v[0] == 3);
|
|
|
|
}
|
|
|
|
{
|
|
|
|
std::vector<int, min_allocator<int>> v;
|
|
|
|
v.reserve(4);
|
|
|
|
v = { 1, 2, 3 };
|
|
|
|
v.emplace(v.begin(), v.back());
|
|
|
|
assert(v[0] == 3);
|
|
|
|
}
|
|
|
|
#endif
|
2012-07-09 02:47:43 +00:00
|
|
|
#endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS
|
|
|
|
}
|