| //===----------------------------------------------------------------------===// |
| // |
| // 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> |
| |
| // void unique(); |
| |
| #include <forward_list> |
| #include <iterator> |
| #include <cassert> |
| |
| #include "min_allocator.h" |
| |
| 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(); |
| 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(); |
| 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(); |
| assert(c1 == c2); |
| } |
| { |
| typedef int T; |
| typedef std::forward_list<T> C; |
| C c1; |
| C c2; |
| c1.unique(); |
| 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(); |
| assert(c1 == c2); |
| } |
| #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(); |
| 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(); |
| 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(); |
| assert(c1 == c2); |
| } |
| { |
| typedef int T; |
| typedef std::forward_list<T, min_allocator<T>> C; |
| C c1; |
| C c2; |
| c1.unique(); |
| 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(); |
| assert(c1 == c2); |
| } |
| #endif |
| |
| return 0; |
| } |