fcd8db7133
git-svn-id: https://llvm.org/svn/llvm-project/libcxx/trunk@184673 91177308-0d34-0410-b5e6-96231b3b80d8
92 lines
2.4 KiB
C++
92 lines
2.4 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.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// <deque>
|
|
|
|
// reference operator[](size_type __i);
|
|
// const_reference operator[](size_type __i) const;
|
|
//
|
|
// reference at(size_type __i);
|
|
// const_reference at(size_type __i) const;
|
|
//
|
|
// reference front();
|
|
// const_reference front() const;
|
|
//
|
|
// reference back();
|
|
// const_reference back() const;
|
|
|
|
#include <deque>
|
|
#include <cassert>
|
|
|
|
#include "../../../min_allocator.h"
|
|
|
|
template <class C>
|
|
C
|
|
make(int size, int start = 0 )
|
|
{
|
|
const int b = 4096 / sizeof(int);
|
|
int init = 0;
|
|
if (start > 0)
|
|
{
|
|
init = (start+1) / b + ((start+1) % b != 0);
|
|
init *= b;
|
|
--init;
|
|
}
|
|
C c(init, 0);
|
|
for (int i = 0; i < init-start; ++i)
|
|
c.pop_back();
|
|
for (int i = 0; i < size; ++i)
|
|
c.push_back(i);
|
|
for (int i = 0; i < start; ++i)
|
|
c.pop_front();
|
|
return c;
|
|
};
|
|
|
|
int main()
|
|
{
|
|
{
|
|
std::deque<int> c = make<std::deque<int> >(10);
|
|
for (unsigned i = 0; i < 10; ++i)
|
|
assert(c[i] == i);
|
|
for (unsigned i = 0; i < 10; ++i)
|
|
assert(c.at(i) == i);
|
|
assert(c.front() == 0);
|
|
assert(c.back() == 9);
|
|
}
|
|
{
|
|
const std::deque<int> c = make<std::deque<int> >(10);
|
|
for (unsigned i = 0; i < 10; ++i)
|
|
assert(c[i] == i);
|
|
for (unsigned i = 0; i < 10; ++i)
|
|
assert(c.at(i) == i);
|
|
assert(c.front() == 0);
|
|
assert(c.back() == 9);
|
|
}
|
|
#if __cplusplus >= 201103L
|
|
{
|
|
std::deque<int, min_allocator<int>> c = make<std::deque<int, min_allocator<int>> >(10);
|
|
for (unsigned i = 0; i < 10; ++i)
|
|
assert(c[i] == i);
|
|
for (unsigned i = 0; i < 10; ++i)
|
|
assert(c.at(i) == i);
|
|
assert(c.front() == 0);
|
|
assert(c.back() == 9);
|
|
}
|
|
{
|
|
const std::deque<int, min_allocator<int>> c = make<std::deque<int, min_allocator<int>> >(10);
|
|
for (unsigned i = 0; i < 10; ++i)
|
|
assert(c[i] == i);
|
|
for (unsigned i = 0; i < 10; ++i)
|
|
assert(c.at(i) == i);
|
|
assert(c.front() == 0);
|
|
assert(c.back() == 9);
|
|
}
|
|
#endif
|
|
}
|