2010-05-11 21:42:16 +02:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
2010-05-11 23:36:01 +02:00
|
|
|
// The LLVM Compiler Infrastructure
|
2010-05-11 21:42:16 +02:00
|
|
|
//
|
2010-11-16 23:09:02 +01:00
|
|
|
// This file is dual licensed under the MIT and the University of Illinois Open
|
|
|
|
// Source Licenses. See LICENSE.TXT for details.
|
2010-05-11 21:42:16 +02:00
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
// <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();
|
|
|
|
}
|
|
|
|
}
|