ab04aadaf4
git-svn-id: https://llvm.org/svn/llvm-project/libcxx/trunk@190251 91177308-0d34-0410-b5e6-96231b3b80d8
114 lines
3.1 KiB
C++
114 lines
3.1 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>
|
|
|
|
// explicit deque(size_type n);
|
|
|
|
#include <deque>
|
|
#include <cassert>
|
|
|
|
#include "../../../stack_allocator.h"
|
|
#include "../../../DefaultOnly.h"
|
|
#include "../../../min_allocator.h"
|
|
|
|
template <class T, class Allocator>
|
|
void
|
|
test2(unsigned n)
|
|
{
|
|
#if _LIBCPP_STD_VER > 11
|
|
typedef std::deque<T, Allocator> C;
|
|
typedef typename C::const_iterator const_iterator;
|
|
assert(DefaultOnly::count == 0);
|
|
{
|
|
C d(n, Allocator());
|
|
assert(DefaultOnly::count == n);
|
|
assert(d.size() == n);
|
|
assert(distance(d.begin(), d.end()) == d.size());
|
|
#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES
|
|
for (const_iterator i = d.begin(), e = d.end(); i != e; ++i)
|
|
assert(*i == T());
|
|
#endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES
|
|
}
|
|
assert(DefaultOnly::count == 0);
|
|
#endif
|
|
}
|
|
|
|
template <class T, class Allocator>
|
|
void
|
|
test1(unsigned n)
|
|
{
|
|
typedef std::deque<T, Allocator> C;
|
|
typedef typename C::const_iterator const_iterator;
|
|
assert(DefaultOnly::count == 0);
|
|
{
|
|
C d(n);
|
|
assert(DefaultOnly::count == n);
|
|
assert(d.size() == n);
|
|
assert(distance(d.begin(), d.end()) == d.size());
|
|
#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES
|
|
for (const_iterator i = d.begin(), e = d.end(); i != e; ++i)
|
|
assert(*i == T());
|
|
#endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES
|
|
}
|
|
assert(DefaultOnly::count == 0);
|
|
}
|
|
|
|
template <class T, class Allocator>
|
|
void
|
|
test3(unsigned n, Allocator const &alloc = Allocator())
|
|
{
|
|
#if _LIBCPP_STD_VER > 11
|
|
typedef std::deque<T, Allocator> C;
|
|
typedef typename C::const_iterator const_iterator;
|
|
{
|
|
C d(n, alloc);
|
|
assert(d.size() == n);
|
|
assert(d.get_allocator() == alloc);
|
|
}
|
|
#endif
|
|
}
|
|
|
|
template <class T, class Allocator>
|
|
void
|
|
test(unsigned n)
|
|
{
|
|
test1<T, Allocator> ( n );
|
|
test2<T, Allocator> ( n );
|
|
}
|
|
|
|
int main()
|
|
{
|
|
test<DefaultOnly, std::allocator<DefaultOnly> >(0);
|
|
test<DefaultOnly, std::allocator<DefaultOnly> >(1);
|
|
test<DefaultOnly, std::allocator<DefaultOnly> >(10);
|
|
test<DefaultOnly, std::allocator<DefaultOnly> >(1023);
|
|
test<DefaultOnly, std::allocator<DefaultOnly> >(1024);
|
|
test<DefaultOnly, std::allocator<DefaultOnly> >(1025);
|
|
test<DefaultOnly, std::allocator<DefaultOnly> >(2047);
|
|
test<DefaultOnly, std::allocator<DefaultOnly> >(2048);
|
|
test<DefaultOnly, std::allocator<DefaultOnly> >(2049);
|
|
test<DefaultOnly, std::allocator<DefaultOnly> >(4095);
|
|
test<DefaultOnly, std::allocator<DefaultOnly> >(4096);
|
|
test<DefaultOnly, std::allocator<DefaultOnly> >(4097);
|
|
|
|
test1<DefaultOnly, stack_allocator<DefaultOnly, 4096> >(4095);
|
|
|
|
#if __cplusplus >= 201103L
|
|
test<DefaultOnly, min_allocator<DefaultOnly> >(4095);
|
|
#endif
|
|
|
|
#if _LIBCPP_STD_VER > 11
|
|
test3<DefaultOnly, std::allocator<DefaultOnly>> (1023);
|
|
test3<int, std::allocator<int>>(1);
|
|
test3<int, min_allocator<int>> (3);
|
|
#endif
|
|
|
|
}
|