29f7432ff3
git-svn-id: https://llvm.org/svn/llvm-project/libcxx/trunk@184859 91177308-0d34-0410-b5e6-96231b3b80d8
67 lines
1.6 KiB
C++
67 lines
1.6 KiB
C++
//===----------------------------------------------------------------------===//
|
|
//
|
|
// 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.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// <list>
|
|
|
|
// template <class... Args> void emplace_front(Args&&... args);
|
|
|
|
#include <list>
|
|
#include <cassert>
|
|
|
|
#include "../../../min_allocator.h"
|
|
|
|
class A
|
|
{
|
|
int i_;
|
|
double d_;
|
|
|
|
A(const A&);
|
|
A& operator=(const A&);
|
|
public:
|
|
A(int i, double d)
|
|
: i_(i), d_(d) {}
|
|
|
|
int geti() const {return i_;}
|
|
double getd() const {return d_;}
|
|
};
|
|
|
|
int main()
|
|
{
|
|
#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES
|
|
{
|
|
std::list<A> c;
|
|
c.emplace_front(2, 3.5);
|
|
assert(c.size() == 1);
|
|
assert(c.front().geti() == 2);
|
|
assert(c.front().getd() == 3.5);
|
|
c.emplace_front(3, 4.5);
|
|
assert(c.size() == 2);
|
|
assert(c.front().geti() == 3);
|
|
assert(c.front().getd() == 4.5);
|
|
assert(c.back().geti() == 2);
|
|
assert(c.back().getd() == 3.5);
|
|
}
|
|
#if __cplusplus >= 201103L
|
|
{
|
|
std::list<A, min_allocator<A>> c;
|
|
c.emplace_front(2, 3.5);
|
|
assert(c.size() == 1);
|
|
assert(c.front().geti() == 2);
|
|
assert(c.front().getd() == 3.5);
|
|
c.emplace_front(3, 4.5);
|
|
assert(c.size() == 2);
|
|
assert(c.front().geti() == 3);
|
|
assert(c.front().getd() == 4.5);
|
|
assert(c.back().geti() == 2);
|
|
assert(c.back().getd() == 3.5);
|
|
}
|
|
#endif
|
|
#endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES
|
|
}
|