4684ddb6aa
- import libcxx - reduce targets to the one when compiled as a tools Change-Id: Iabb8427f80ff8e89463559a28bcb8b4f2bdbc496
60 lines
1.5 KiB
C++
60 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.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// <forward_list>
|
|
|
|
// template <class T, class Allocator>
|
|
// bool operator==(const forward_list<T, Allocator>& x,
|
|
// const forward_list<T, Allocator>& y);
|
|
//
|
|
// template <class T, class Allocator>
|
|
// bool operator!=(const forward_list<T, Allocator>& x,
|
|
// const forward_list<T, Allocator>& y);
|
|
|
|
#include <forward_list>
|
|
#include <iterator>
|
|
#include <algorithm>
|
|
#include <cassert>
|
|
|
|
#include "../../../min_allocator.h"
|
|
|
|
template <class C>
|
|
void test(int N, int M)
|
|
{
|
|
typedef typename C::value_type T;
|
|
C c1;
|
|
for (int i = 0; i < N; ++i)
|
|
c1.push_front(i);
|
|
C c2;
|
|
for (int i = 0; i < M; ++i)
|
|
c2.push_front(i);
|
|
if (N == M)
|
|
assert(c1 == c2);
|
|
else
|
|
assert(c1 != c2);
|
|
c2 = c1;
|
|
assert(c1 == c2);
|
|
if (N > 0)
|
|
{
|
|
c2.front() = N+1;
|
|
assert(c1 != c2);
|
|
}
|
|
}
|
|
|
|
int main()
|
|
{
|
|
for (int i = 0; i < 10; ++i)
|
|
for (int j = 0; j < 10; ++j)
|
|
test<std::forward_list<int> >(i, j);
|
|
#if __cplusplus >= 201103L
|
|
for (int i = 0; i < 10; ++i)
|
|
for (int j = 0; j < 10; ++j)
|
|
test<std::forward_list<int, min_allocator<int>> >(i, j);
|
|
#endif
|
|
}
|