diff options
Diffstat (limited to 'libstdc++-v3/testsuite/25_algorithms/unique')
6 files changed, 354 insertions, 0 deletions
diff --git a/libstdc++-v3/testsuite/25_algorithms/unique/1.cc b/libstdc++-v3/testsuite/25_algorithms/unique/1.cc new file mode 100644 index 000000000..f7e3b5e7d --- /dev/null +++ b/libstdc++-v3/testsuite/25_algorithms/unique/1.cc @@ -0,0 +1,32 @@ +// 2001-07-19 Peter Schmid <schmid@snake.iap.physik.tu-darmstadt.de> + +// Copyright (C) 2001, 2002, 2003, 2004, 2005, 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] Unique + +#include <list> +#include <algorithm> + +int main() +{ + using namespace std; + list<int> menge; + unique (menge.begin(), menge.end()); + return 0; +} diff --git a/libstdc++-v3/testsuite/25_algorithms/unique/11480.cc b/libstdc++-v3/testsuite/25_algorithms/unique/11480.cc new file mode 100644 index 000000000..f165dac54 --- /dev/null +++ b/libstdc++-v3/testsuite/25_algorithms/unique/11480.cc @@ -0,0 +1,45 @@ +// Copyright (C) 2003, 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/>. + +#include <algorithm> +#include <testsuite_hooks.h> + +int a[10] = { 1, 2, 3, 3, 4, 5, 5, 6, 7, 9 }; + +static int compare_count = 0; + +bool compare(int a, int b) +{ + compare_count++; + return a == b; +} + +// libstdc++/11480 +void test01() +{ + bool test __attribute__((unused)) = true; + + std::unique(a, a+10, compare); + VERIFY( compare_count == 9 ); +} + +int +main() +{ + test01(); + return 0; +} diff --git a/libstdc++-v3/testsuite/25_algorithms/unique/2.cc b/libstdc++-v3/testsuite/25_algorithms/unique/2.cc new file mode 100644 index 000000000..cae1b1672 --- /dev/null +++ b/libstdc++-v3/testsuite/25_algorithms/unique/2.cc @@ -0,0 +1,94 @@ +// 2003-10-14 Paolo Carlini <pcarlini@unitus.it> + +// Copyright (C) 2003, 2004, 2005, 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] Unique + +#include <list> +#include <algorithm> +#include <functional> +#include <testsuite_hooks.h> + +const int T1[] = {1, 4, 4, 6, 1, 2, 2, 3, 1, 6, 6, 6, 5, 7, 5, 4, 4}; +const int T2[] = {1, 1, 1, 2, 2, 1, 1, 7, 6, 6, 7, 8, 8, 8, 8, 9, 9}; +const int N = sizeof(T1) / sizeof(int); + +const int A1[] = {1, 4, 6, 1, 2, 3, 1, 6, 5, 7, 5, 4}; +const int A2[] = {1, 4, 4, 6, 6, 6, 6, 7}; +const int A3[] = {1, 1, 1}; + +const int B1[] = {1, 2, 1, 7, 6, 7, 8, 9}; +const int B2[] = {1, 1, 1, 2, 2, 7, 7, 8, 8, 8, 8, 9, 9}; +const int B3[] = {9, 9, 8, 8, 8, 8, 7, 6, 6, 1, 1, 1, 1, 1}; + +void test01() +{ + bool test __attribute__((unused)) = true; + using namespace std; + + list<int>::iterator pos; + + list<int> coll(T1, T1 + N); + pos = unique(coll.begin(), coll.end()); + VERIFY( equal(coll.begin(), pos, A1) ); + + list<int> coll2(T2, T2 + N); + pos = unique(coll2.begin(), coll2.end()); + VERIFY( equal(coll2.begin(), pos, B1) ); +} + +void test02() +{ + bool test __attribute__((unused)) = true; + using namespace std; + + list<int>::iterator pos; + + list<int> coll(T1, T1 + N); + pos = unique(coll.begin(), coll.end(), greater<int>()); + VERIFY( equal(coll.begin(), pos, A2) ); + + list<int> coll2(T2, T2 + N); + pos = unique(coll2.begin(), coll2.end(), greater<int>()); + VERIFY( equal(coll2.begin(), pos, B2) ); +} + +void test03() +{ + bool test __attribute__((unused)) = true; + using namespace std; + + list<int>::iterator pos; + + list<int> coll(T1, T1 + N); + pos = unique(coll.begin(), coll.end(), less<int>()); + VERIFY( equal(coll.begin(), pos, A3) ); + + list<int> coll2(T2, T2 + N); + reverse(coll2.begin(), coll2.end()); + pos = unique(coll2.begin(), coll2.end(), less<int>()); + VERIFY( equal(coll2.begin(), pos, B3) ); +} + +int main() +{ + test01(); + test02(); + test03(); + return 0; +} diff --git a/libstdc++-v3/testsuite/25_algorithms/unique/moveable.cc b/libstdc++-v3/testsuite/25_algorithms/unique/moveable.cc new file mode 100644 index 000000000..fd6da1168 --- /dev/null +++ b/libstdc++-v3/testsuite/25_algorithms/unique/moveable.cc @@ -0,0 +1,110 @@ +// { dg-options "-std=gnu++0x" } + +// Copyright (C) 2005, 2006, 2007, 2008, 2009, 2010 +// 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] Unique + +#undef _GLIBCXX_CONCEPT_CHECKS + +// XXX FIXME: parallel-mode should deal correctly with moveable-only types +// per C++0x, at minimum smoothly fall back to serial. +#undef _GLIBCXX_PARALLEL + +#include <vector> +#include <algorithm> +#include <functional> +#include <testsuite_hooks.h> +#include <testsuite_iterators.h> +#include <testsuite_rvalref.h> + +using __gnu_test::test_container; +using __gnu_test::forward_iterator_wrapper; +using __gnu_test::rvalstruct; + +typedef test_container<rvalstruct, forward_iterator_wrapper> Container; + +void test01() +{ + bool test __attribute__((unused)) = true; + + int intarray1[] = {1, 4, 4, 6, 1, 2, 2, 3, 1, 6, 6, 6, 5, 7, 5, 4, 4}; + int intarray2[] = {1, 1, 1, 2, 2, 1, 1, 7, 6, 6, 7, 8, 8, 8, 8, 9, 9}; + + const int N = sizeof(intarray1) / sizeof(int); + + rvalstruct T1[N]; + rvalstruct T2[N]; + + std::copy(intarray1,intarray1 + N, T1); + std::copy(intarray2,intarray2 + N, T2); + + const int A1[] = {1, 4, 6, 1, 2, 3, 1, 6, 5, 7, 5, 4}; + const int B1[] = {1, 2, 1, 7, 6, 7, 8, 9}; + + Container con(T1, T1 + N); + + VERIFY( std::unique(con.begin(), con.end()).ptr - T1 == 12 ); + for(int i = 0; i < 12; ++i) + VERIFY( T1[i].val == A1[i] ); + + Container con2(T2, T2 + N); + VERIFY( std::unique(con2.begin(), con2.end()).ptr - T2 == 8 ); + for(int i = 0; i < 8; ++i) + VERIFY( T2[i].val == B1[i] ); +} + +bool are_equal(const rvalstruct& rhs, const rvalstruct& lhs) +{ return rhs == lhs; } + +void test02() +{ + bool test __attribute__((unused)) = true; + + int intarray1[] = {1, 4, 4, 6, 1, 2, 2, 3, 1, 6, 6, 6, 5, 7, 5, 4, 4}; + int intarray2[] = {1, 1, 1, 2, 2, 1, 1, 7, 6, 6, 7, 8, 8, 8, 8, 9, 9}; + + const int N = sizeof(intarray1) / sizeof(int); + + rvalstruct T1[N]; + rvalstruct T2[N]; + + std::copy(intarray1,intarray1 + N, T1); + std::copy(intarray2,intarray2 + N, T2); + + const int A1[] = {1, 4, 6, 1, 2, 3, 1, 6, 5, 7, 5, 4}; + const int B1[] = {1, 2, 1, 7, 6, 7, 8, 9}; + + Container con(T1, T1 + N); + + VERIFY( std::unique(con.begin(), con.end(), are_equal).ptr - T1 == 12 ); + for(int i = 0; i < 12; ++i) + VERIFY( T1[i].val == A1[i] ); + + Container con2(T2, T2 + N); + VERIFY( std::unique(con2.begin(), con2.end(), are_equal).ptr - T2 == 8 ); + for(int i = 0; i < 8; ++i) + VERIFY( T2[i].val == B1[i] ); +} + +int main() +{ + test01(); + test02(); + return 0; +} diff --git a/libstdc++-v3/testsuite/25_algorithms/unique/requirements/explicit_instantiation/2.cc b/libstdc++-v3/testsuite/25_algorithms/unique/requirements/explicit_instantiation/2.cc new file mode 100644 index 000000000..3a004b136 --- /dev/null +++ b/libstdc++-v3/testsuite/25_algorithms/unique/requirements/explicit_instantiation/2.cc @@ -0,0 +1,37 @@ +// { dg-do compile } + +// 2007-09-20 Benjamin Kosnik <bkoz@redhat.com> + +// Copyright (C) 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/>. + + +#include <algorithm> +#include <functional> +#include <testsuite_api.h> + +namespace std +{ + using __gnu_test::NonDefaultConstructible; + + typedef NonDefaultConstructible value_type; + typedef value_type* iterator_type; + typedef std::less<value_type> predicate_type; + + template iterator_type unique(iterator_type, iterator_type); + template iterator_type unique(iterator_type, iterator_type, predicate_type); +} diff --git a/libstdc++-v3/testsuite/25_algorithms/unique/requirements/explicit_instantiation/pod.cc b/libstdc++-v3/testsuite/25_algorithms/unique/requirements/explicit_instantiation/pod.cc new file mode 100644 index 000000000..45dea5bf8 --- /dev/null +++ b/libstdc++-v3/testsuite/25_algorithms/unique/requirements/explicit_instantiation/pod.cc @@ -0,0 +1,36 @@ +// { dg-do compile } + +// 2007-09-20 Benjamin Kosnik <bkoz@redhat.com> + +// Copyright (C) 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/>. + + +#include <algorithm> +#include <testsuite_character.h> + +namespace std +{ + using __gnu_test::pod_int; + + typedef pod_int value_type; + typedef value_type* iterator_type; + typedef std::less<value_type> predicate_type; + + template iterator_type unique(iterator_type, iterator_type); + template iterator_type unique(iterator_type, iterator_type, predicate_type); +} |