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
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
// <deque>
|
|
|
|
|
|
|
|
// deque(size_type n, const value_type& v);
|
|
|
|
|
|
|
|
#include <deque>
|
|
|
|
#include <cassert>
|
|
|
|
|
|
|
|
#include "../../../stack_allocator.h"
|
|
|
|
|
|
|
|
template <class T, class Allocator>
|
|
|
|
void
|
|
|
|
test(unsigned n, const T& x)
|
|
|
|
{
|
|
|
|
typedef std::deque<T, Allocator> C;
|
|
|
|
typedef typename C::const_iterator const_iterator;
|
|
|
|
C d(n, x);
|
|
|
|
assert(d.size() == n);
|
|
|
|
assert(distance(d.begin(), d.end()) == d.size());
|
|
|
|
for (const_iterator i = d.begin(), e = d.end(); i != e; ++i)
|
|
|
|
assert(*i == x);
|
|
|
|
}
|
|
|
|
|
|
|
|
int main()
|
|
|
|
{
|
|
|
|
test<int, std::allocator<int> >(0, 5);
|
|
|
|
test<int, std::allocator<int> >(1, 10);
|
|
|
|
test<int, std::allocator<int> >(10, 11);
|
|
|
|
test<int, std::allocator<int> >(1023, -11);
|
|
|
|
test<int, std::allocator<int> >(1024, 25);
|
|
|
|
test<int, std::allocator<int> >(1025, 0);
|
|
|
|
test<int, std::allocator<int> >(2047, 110);
|
|
|
|
test<int, std::allocator<int> >(2048, -500);
|
|
|
|
test<int, std::allocator<int> >(2049, 654);
|
|
|
|
test<int, std::allocator<int> >(4095, 78);
|
|
|
|
test<int, std::allocator<int> >(4096, 1165);
|
|
|
|
test<int, std::allocator<int> >(4097, 157);
|
|
|
|
test<int, stack_allocator<int, 4096> >(4095, 90);
|
|
|
|
}
|