126 lines
3.2 KiB
C++
126 lines
3.2 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 BinaryPredicate> void unique(BinaryPredicate binary_pred);
|
||
|
|
||
|
#include <forward_list>
|
||
|
#include <iterator>
|
||
|
#include <cassert>
|
||
|
|
||
|
#include "../../../min_allocator.h"
|
||
|
|
||
|
bool g(int x, int y)
|
||
|
{
|
||
|
return x == y;
|
||
|
}
|
||
|
|
||
|
int main()
|
||
|
{
|
||
|
{
|
||
|
typedef int T;
|
||
|
typedef std::forward_list<T> C;
|
||
|
const T t1[] = {0, 5, 5, 0, 0, 0, 5};
|
||
|
const T t2[] = {0, 5, 0, 5};
|
||
|
C c1(std::begin(t1), std::end(t1));
|
||
|
C c2(std::begin(t2), std::end(t2));
|
||
|
c1.unique(g);
|
||
|
assert(c1 == c2);
|
||
|
}
|
||
|
{
|
||
|
typedef int T;
|
||
|
typedef std::forward_list<T> C;
|
||
|
const T t1[] = {0, 0, 0, 0};
|
||
|
const T t2[] = {0};
|
||
|
C c1(std::begin(t1), std::end(t1));
|
||
|
C c2(std::begin(t2), std::end(t2));
|
||
|
c1.unique(g);
|
||
|
assert(c1 == c2);
|
||
|
}
|
||
|
{
|
||
|
typedef int T;
|
||
|
typedef std::forward_list<T> C;
|
||
|
const T t1[] = {5, 5, 5};
|
||
|
const T t2[] = {5};
|
||
|
C c1(std::begin(t1), std::end(t1));
|
||
|
C c2(std::begin(t2), std::end(t2));
|
||
|
c1.unique(g);
|
||
|
assert(c1 == c2);
|
||
|
}
|
||
|
{
|
||
|
typedef int T;
|
||
|
typedef std::forward_list<T> C;
|
||
|
C c1;
|
||
|
C c2;
|
||
|
c1.unique(g);
|
||
|
assert(c1 == c2);
|
||
|
}
|
||
|
{
|
||
|
typedef int T;
|
||
|
typedef std::forward_list<T> C;
|
||
|
const T t1[] = {5, 5, 5, 0};
|
||
|
const T t2[] = {5, 0};
|
||
|
C c1(std::begin(t1), std::end(t1));
|
||
|
C c2(std::begin(t2), std::end(t2));
|
||
|
c1.unique(g);
|
||
|
assert(c1 == c2);
|
||
|
}
|
||
|
#if __cplusplus >= 201103L
|
||
|
{
|
||
|
typedef int T;
|
||
|
typedef std::forward_list<T, min_allocator<T>> C;
|
||
|
const T t1[] = {0, 5, 5, 0, 0, 0, 5};
|
||
|
const T t2[] = {0, 5, 0, 5};
|
||
|
C c1(std::begin(t1), std::end(t1));
|
||
|
C c2(std::begin(t2), std::end(t2));
|
||
|
c1.unique(g);
|
||
|
assert(c1 == c2);
|
||
|
}
|
||
|
{
|
||
|
typedef int T;
|
||
|
typedef std::forward_list<T, min_allocator<T>> C;
|
||
|
const T t1[] = {0, 0, 0, 0};
|
||
|
const T t2[] = {0};
|
||
|
C c1(std::begin(t1), std::end(t1));
|
||
|
C c2(std::begin(t2), std::end(t2));
|
||
|
c1.unique(g);
|
||
|
assert(c1 == c2);
|
||
|
}
|
||
|
{
|
||
|
typedef int T;
|
||
|
typedef std::forward_list<T, min_allocator<T>> C;
|
||
|
const T t1[] = {5, 5, 5};
|
||
|
const T t2[] = {5};
|
||
|
C c1(std::begin(t1), std::end(t1));
|
||
|
C c2(std::begin(t2), std::end(t2));
|
||
|
c1.unique(g);
|
||
|
assert(c1 == c2);
|
||
|
}
|
||
|
{
|
||
|
typedef int T;
|
||
|
typedef std::forward_list<T, min_allocator<T>> C;
|
||
|
C c1;
|
||
|
C c2;
|
||
|
c1.unique(g);
|
||
|
assert(c1 == c2);
|
||
|
}
|
||
|
{
|
||
|
typedef int T;
|
||
|
typedef std::forward_list<T, min_allocator<T>> C;
|
||
|
const T t1[] = {5, 5, 5, 0};
|
||
|
const T t2[] = {5, 0};
|
||
|
C c1(std::begin(t1), std::end(t1));
|
||
|
C c2(std::begin(t2), std::end(t2));
|
||
|
c1.unique(g);
|
||
|
assert(c1 == c2);
|
||
|
}
|
||
|
#endif
|
||
|
}
|