bc8d3f97eb
git-svn-id: https://llvm.org/svn/llvm-project/libcxx/trunk@103490 91177308-0d34-0410-b5e6-96231b3b80d8
107 lines
2.7 KiB
C++
107 lines
2.7 KiB
C++
//===----------------------------------------------------------------------===//
|
|
//
|
|
// ÊÊÊÊÊÊÊÊÊÊÊÊÊÊÊÊÊÊÊÊThe LLVM Compiler Infrastructure
|
|
//
|
|
// This file is distributed under the University of Illinois Open Source
|
|
// License. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// <vector>
|
|
|
|
// template <class... Args> iterator emplace(const_iterator pos, Args&&... args);
|
|
|
|
#include <vector>
|
|
#include <cassert>
|
|
#include "../../../stack_allocator.h"
|
|
|
|
#ifdef _LIBCPP_MOVE
|
|
|
|
class A
|
|
{
|
|
int i_;
|
|
double d_;
|
|
|
|
A(const A&);
|
|
A& operator=(const A&);
|
|
public:
|
|
A(int i, double d)
|
|
: i_(i), d_(d) {}
|
|
|
|
A(A&& a)
|
|
: i_(a.i_),
|
|
d_(a.d_)
|
|
{
|
|
a.i_ = 0;
|
|
a.d_ = 0;
|
|
}
|
|
|
|
A& operator=(A&& a)
|
|
{
|
|
i_ = a.i_;
|
|
d_ = a.d_;
|
|
a.i_ = 0;
|
|
a.d_ = 0;
|
|
return *this;
|
|
}
|
|
|
|
int geti() const {return i_;}
|
|
double getd() const {return d_;}
|
|
};
|
|
|
|
#endif
|
|
|
|
int main()
|
|
{
|
|
#ifdef _LIBCPP_MOVE
|
|
{
|
|
std::vector<A> c;
|
|
std::vector<A>::iterator i = c.emplace(c.cbegin(), 2, 3.5);
|
|
assert(i == c.begin());
|
|
assert(c.size() == 1);
|
|
assert(c.front().geti() == 2);
|
|
assert(c.front().getd() == 3.5);
|
|
i = c.emplace(c.cend(), 3, 4.5);
|
|
assert(i == c.end()-1);
|
|
assert(c.size() == 2);
|
|
assert(c.front().geti() == 2);
|
|
assert(c.front().getd() == 3.5);
|
|
assert(c.back().geti() == 3);
|
|
assert(c.back().getd() == 4.5);
|
|
i = c.emplace(c.cbegin()+1, 4, 6.5);
|
|
assert(i == c.begin()+1);
|
|
assert(c.size() == 3);
|
|
assert(c.front().geti() == 2);
|
|
assert(c.front().getd() == 3.5);
|
|
assert(c[1].geti() == 4);
|
|
assert(c[1].getd() == 6.5);
|
|
assert(c.back().geti() == 3);
|
|
assert(c.back().getd() == 4.5);
|
|
}
|
|
{
|
|
std::vector<A, stack_allocator<A, 7> > c;
|
|
std::vector<A, stack_allocator<A, 7> >::iterator i = c.emplace(c.cbegin(), 2, 3.5);
|
|
assert(i == c.begin());
|
|
assert(c.size() == 1);
|
|
assert(c.front().geti() == 2);
|
|
assert(c.front().getd() == 3.5);
|
|
i = c.emplace(c.cend(), 3, 4.5);
|
|
assert(i == c.end()-1);
|
|
assert(c.size() == 2);
|
|
assert(c.front().geti() == 2);
|
|
assert(c.front().getd() == 3.5);
|
|
assert(c.back().geti() == 3);
|
|
assert(c.back().getd() == 4.5);
|
|
i = c.emplace(c.cbegin()+1, 4, 6.5);
|
|
assert(i == c.begin()+1);
|
|
assert(c.size() == 3);
|
|
assert(c.front().geti() == 2);
|
|
assert(c.front().getd() == 3.5);
|
|
assert(c[1].geti() == 4);
|
|
assert(c[1].getd() == 6.5);
|
|
assert(c.back().geti() == 3);
|
|
assert(c.back().getd() == 4.5);
|
|
}
|
|
#endif
|
|
}
|