4684ddb6aa
- import libcxx - reduce targets to the one when compiled as a tools Change-Id: Iabb8427f80ff8e89463559a28bcb8b4f2bdbc496
66 lines
1.5 KiB
C++
66 lines
1.5 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>
|
|
|
|
// Test nested types and default template args:
|
|
|
|
// template <class T, class Allocator = allocator<T> >
|
|
// class deque;
|
|
|
|
// iterator, const_iterator
|
|
|
|
#include <deque>
|
|
#include <iterator>
|
|
#include <cassert>
|
|
|
|
#include "../../min_allocator.h"
|
|
|
|
int main()
|
|
{
|
|
{
|
|
typedef std::deque<int> C;
|
|
C c;
|
|
C::iterator i;
|
|
i = c.begin();
|
|
C::const_iterator j;
|
|
j = c.cbegin();
|
|
assert(i == j);
|
|
}
|
|
#if __cplusplus >= 201103L
|
|
{
|
|
typedef std::deque<int, min_allocator<int>> C;
|
|
C c;
|
|
C::iterator i;
|
|
i = c.begin();
|
|
C::const_iterator j;
|
|
j = c.cbegin();
|
|
assert(i == j);
|
|
}
|
|
#endif
|
|
#if _LIBCPP_STD_VER > 11
|
|
{ // N3644 testing
|
|
std::deque<int>::iterator ii1{}, ii2{};
|
|
std::deque<int>::iterator ii4 = ii1;
|
|
std::deque<int>::const_iterator cii{};
|
|
assert ( ii1 == ii2 );
|
|
assert ( ii1 == ii4 );
|
|
assert ( ii1 == cii );
|
|
|
|
assert ( !(ii1 != ii2 ));
|
|
assert ( !(ii1 != cii ));
|
|
|
|
// std::deque<int> c;
|
|
// assert ( ii1 != c.cbegin());
|
|
// assert ( cii != c.begin());
|
|
// assert ( cii != c.cend());
|
|
// assert ( ii1 != c.end());
|
|
}
|
|
#endif
|
|
}
|