| Index: gcc/libstdc++-v3/testsuite/25_algorithms/unique_copy/2.cc
|
| diff --git a/gcc/libstdc++-v3/testsuite/25_algorithms/unique_copy/2.cc b/gcc/libstdc++-v3/testsuite/25_algorithms/unique_copy/2.cc
|
| deleted file mode 100644
|
| index f0879a4d10def27aff61296e0fcf5199e023c0ef..0000000000000000000000000000000000000000
|
| --- a/gcc/libstdc++-v3/testsuite/25_algorithms/unique_copy/2.cc
|
| +++ /dev/null
|
| @@ -1,85 +0,0 @@
|
| -// Copyright (C) 2006, 2007, 2009 Free Software Foundation, Inc.
|
| -//
|
| -// This file is part of the GNU ISO C++ Library. This library is free
|
| -// software; you can redistribute it and/or modify it under the
|
| -// terms of the GNU General Public License as published by the
|
| -// Free Software Foundation; either version 3, or (at your option)
|
| -// any later version.
|
| -
|
| -// This library is distributed in the hope that it will be useful,
|
| -// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
| -// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
| -// GNU General Public License for more details.
|
| -
|
| -// You should have received a copy of the GNU General Public License along
|
| -// with this library; see the file COPYING3. If not see
|
| -// <http://www.gnu.org/licenses/>.
|
| -
|
| -// 25.2.8 [lib.alg.unique]
|
| -
|
| -#include <algorithm>
|
| -#include <functional>
|
| -#include <testsuite_hooks.h>
|
| -#include <testsuite_iterators.h>
|
| -
|
| -using __gnu_test::test_container;
|
| -using __gnu_test::forward_iterator_wrapper;
|
| -using __gnu_test::output_iterator_wrapper;
|
| -using std::unique_copy;
|
| -using std::equal_to;
|
| -
|
| -typedef test_container<int, forward_iterator_wrapper> Fcontainer;
|
| -typedef test_container<int, output_iterator_wrapper> Ocontainer;
|
| -
|
| -int array1[] = {0, 0, 0, 1, 1, 1};
|
| -int array2[2];
|
| -
|
| -void
|
| -test1()
|
| -{
|
| - bool test __attribute__((unused)) = true;
|
| - Fcontainer con1(array1, array1);
|
| - Ocontainer con2(array2, array2);
|
| - VERIFY( unique_copy(con1.begin(), con1.end(), con2.begin()).ptr == array2 );
|
| -}
|
| -
|
| -void
|
| -test2()
|
| -{
|
| - bool test __attribute__((unused)) = true;
|
| - Fcontainer con1(array1, array1 + 6);
|
| - Ocontainer con2(array2, array2 + 2);
|
| - VERIFY( unique_copy(con1.begin(), con1.end(), con2.begin()).ptr
|
| - == array2 + 2 );
|
| - VERIFY( array2[0] == 0 && array2[1] == 1 );
|
| -}
|
| -
|
| -void
|
| -test3()
|
| -{
|
| - bool test __attribute__((unused)) = true;
|
| - Fcontainer con1(array1, array1);
|
| - Ocontainer con2(array2, array2);
|
| - VERIFY( unique_copy(con1.begin(), con1.end(), con2.begin(),
|
| - equal_to<int>()).ptr == array2 );
|
| -}
|
| -
|
| -void
|
| -test4()
|
| -{
|
| - bool test __attribute__((unused)) = true;
|
| - Fcontainer con1(array1, array1 + 6);
|
| - Ocontainer con2(array2, array2 + 2);
|
| - VERIFY( unique_copy(con1.begin(), con1.end(), con2.begin(),
|
| - equal_to<int>()).ptr == array2 + 2 );
|
| - VERIFY( array2[0] == 0 && array2[1] == 1 );
|
| -}
|
| -
|
| -int
|
| -main()
|
| -{
|
| - test1();
|
| - test2();
|
| - test3();
|
| - test4();
|
| -}
|
|
|