sync with N3126
git-svn-id: https://llvm.org/svn/llvm-project/libcxx/trunk@113101 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
@@ -0,0 +1,37 @@
|
||||
//===----------------------------------------------------------------------===//
|
||||
//
|
||||
// The LLVM Compiler Infrastructure
|
||||
//
|
||||
// This file is distributed under the University of Illinois Open Source
|
||||
// License. See LICENSE.TXT for details.
|
||||
//
|
||||
//===----------------------------------------------------------------------===//
|
||||
|
||||
// <stack>
|
||||
|
||||
// explicit stack(const container_type& c);
|
||||
|
||||
#include <stack>
|
||||
#include <cassert>
|
||||
|
||||
template <class C>
|
||||
C
|
||||
make(int n)
|
||||
{
|
||||
C c;
|
||||
for (int i = 0; i < n; ++i)
|
||||
c.push_back(i);
|
||||
return c;
|
||||
}
|
||||
|
||||
int main()
|
||||
{
|
||||
std::deque<int> d = make<std::deque<int> >(5);
|
||||
std::stack<int> q(d);
|
||||
assert(q.size() == 5);
|
||||
for (int i = 0; i < d.size(); ++i)
|
||||
{
|
||||
assert(q.top() == d[d.size() - i - 1]);
|
||||
q.pop();
|
||||
}
|
||||
}
|
@@ -0,0 +1,32 @@
|
||||
//===----------------------------------------------------------------------===//
|
||||
//
|
||||
// The LLVM Compiler Infrastructure
|
||||
//
|
||||
// This file is distributed under the University of Illinois Open Source
|
||||
// License. See LICENSE.TXT for details.
|
||||
//
|
||||
//===----------------------------------------------------------------------===//
|
||||
|
||||
// <stack>
|
||||
|
||||
// stack(const stack&) = default;
|
||||
|
||||
#include <stack>
|
||||
#include <cassert>
|
||||
|
||||
template <class C>
|
||||
C
|
||||
make(int n)
|
||||
{
|
||||
C c;
|
||||
for (int i = 0; i < n; ++i)
|
||||
c.push_back(i);
|
||||
return c;
|
||||
}
|
||||
|
||||
int main()
|
||||
{
|
||||
std::stack<int> q(make<std::deque<int> >(5));
|
||||
std::stack<int> q2 = q;
|
||||
assert(q2 == q);
|
||||
}
|
@@ -0,0 +1,28 @@
|
||||
//===----------------------------------------------------------------------===//
|
||||
//
|
||||
// The LLVM Compiler Infrastructure
|
||||
//
|
||||
// This file is distributed under the University of Illinois Open Source
|
||||
// License. See LICENSE.TXT for details.
|
||||
//
|
||||
//===----------------------------------------------------------------------===//
|
||||
|
||||
// <stack>
|
||||
|
||||
// stack();
|
||||
|
||||
#include <stack>
|
||||
#include <vector>
|
||||
#include <cassert>
|
||||
|
||||
#include "../../../../stack_allocator.h"
|
||||
|
||||
int main()
|
||||
{
|
||||
std::stack<int, std::vector<int, stack_allocator<int, 10> > > q;
|
||||
assert(q.size() == 0);
|
||||
q.push(1);
|
||||
q.push(2);
|
||||
assert(q.size() == 2);
|
||||
assert(q.top() == 2);
|
||||
}
|
@@ -0,0 +1,41 @@
|
||||
//===----------------------------------------------------------------------===//
|
||||
//
|
||||
// The LLVM Compiler Infrastructure
|
||||
//
|
||||
// This file is distributed under the University of Illinois Open Source
|
||||
// License. See LICENSE.TXT for details.
|
||||
//
|
||||
//===----------------------------------------------------------------------===//
|
||||
|
||||
// <stack>
|
||||
|
||||
// stack(stack&& q);
|
||||
|
||||
#include <stack>
|
||||
#include <cassert>
|
||||
|
||||
#include "../../../../MoveOnly.h"
|
||||
|
||||
#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES
|
||||
|
||||
template <class C>
|
||||
C
|
||||
make(int n)
|
||||
{
|
||||
C c;
|
||||
for (int i = 0; i < n; ++i)
|
||||
c.push_back(MoveOnly(i));
|
||||
return c;
|
||||
}
|
||||
|
||||
#endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES
|
||||
|
||||
int main()
|
||||
{
|
||||
#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES
|
||||
std::stack<MoveOnly> q(make<std::deque<MoveOnly> >(5));
|
||||
std::stack<MoveOnly> q2 = std::move(q);
|
||||
assert(q2.size() == 5);
|
||||
assert(q.empty());
|
||||
#endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES
|
||||
}
|
@@ -0,0 +1,39 @@
|
||||
//===----------------------------------------------------------------------===//
|
||||
//
|
||||
// The LLVM Compiler Infrastructure
|
||||
//
|
||||
// This file is distributed under the University of Illinois Open Source
|
||||
// License. See LICENSE.TXT for details.
|
||||
//
|
||||
//===----------------------------------------------------------------------===//
|
||||
|
||||
// <stack>
|
||||
|
||||
// explicit stack(container_type&& c);
|
||||
|
||||
#include <stack>
|
||||
#include <cassert>
|
||||
|
||||
#include "../../../../MoveOnly.h"
|
||||
|
||||
#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES
|
||||
|
||||
template <class C>
|
||||
C
|
||||
make(int n)
|
||||
{
|
||||
C c;
|
||||
for (int i = 0; i < n; ++i)
|
||||
c.push_back(MoveOnly(i));
|
||||
return c;
|
||||
}
|
||||
|
||||
#endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES
|
||||
|
||||
int main()
|
||||
{
|
||||
#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES
|
||||
std::stack<MoveOnly> q(make<std::deque<MoveOnly> >(5));
|
||||
assert(q.size() == 5);
|
||||
#endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES
|
||||
}
|
Reference in New Issue
Block a user