| //===----------------------------------------------------------------------===// |
| // |
| // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. |
| // See https://llvm.org/LICENSE.txt for license information. |
| // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception |
| // |
| //===----------------------------------------------------------------------===// |
| |
| // <forward_list> |
| |
| // template <class BinaryPredicate> void unique(BinaryPredicate binary_pred); |
| |
| #include <forward_list> |
| #include <iterator> |
| #include <cassert> |
| |
| #include "test_macros.h" |
| #include "min_allocator.h" |
| |
| struct PredLWG529 { |
| PredLWG529 (int i) : i_(i) {}; |
| ~PredLWG529() { i_ = -32767; } |
| bool operator() (const PredLWG529 &lhs, const PredLWG529 &rhs) const { return lhs.i_ == rhs.i_; } |
| |
| bool operator==(int i) const { return i == i_;} |
| int i_; |
| }; |
| |
| |
| bool g(int x, int y) |
| { |
| return x == y; |
| } |
| |
| int main(int, char**) |
| { |
| { |
| 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); |
| } |
| |
| { // LWG issue #526 |
| int a1[] = {1, 1, 1, 2, 3, 5, 2, 11}; |
| int a2[] = {1, 2, 3, 5, 2, 11}; |
| std::forward_list<PredLWG529> c(a1, a1 + 8); |
| c.unique(std::ref(c.front())); |
| for (size_t i = 0; i < 6; ++i) |
| { |
| assert(!c.empty()); |
| assert(c.front() == a2[i]); |
| c.pop_front(); |
| } |
| assert(c.empty()); |
| } |
| |
| #if TEST_STD_VER >= 11 |
| { |
| 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 |
| |
| return 0; |
| } |