From 554fd8c5195424bdbcabf5de30fdc183aba391bd Mon Sep 17 00:00:00 2001 From: upstream source tree Date: Sun, 15 Mar 2015 20:14:05 -0400 Subject: obtained gcc-4.6.4.tar.bz2 from upstream website; verified gcc-4.6.4.tar.bz2.sig; imported gcc-4.6.4 source tree from verified upstream tarball. downloading a git-generated archive based on the 'upstream' tag should provide you with a source tree that is binary identical to the one extracted from the above tarball. if you have obtained the source via the command 'git clone', however, do note that line-endings of files in your working directory might differ from line-endings of the respective files in the upstream repository. --- libstdc++-v3/testsuite/25_algorithms/unique/2.cc | 94 ++++++++++++++++++++++++ 1 file changed, 94 insertions(+) create mode 100644 libstdc++-v3/testsuite/25_algorithms/unique/2.cc (limited to 'libstdc++-v3/testsuite/25_algorithms/unique/2.cc') 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 + +// 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 +// . + +// 25.2.8 [lib.alg.unique] Unique + +#include +#include +#include +#include + +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::iterator pos; + + list coll(T1, T1 + N); + pos = unique(coll.begin(), coll.end()); + VERIFY( equal(coll.begin(), pos, A1) ); + + list 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::iterator pos; + + list coll(T1, T1 + N); + pos = unique(coll.begin(), coll.end(), greater()); + VERIFY( equal(coll.begin(), pos, A2) ); + + list coll2(T2, T2 + N); + pos = unique(coll2.begin(), coll2.end(), greater()); + VERIFY( equal(coll2.begin(), pos, B2) ); +} + +void test03() +{ + bool test __attribute__((unused)) = true; + using namespace std; + + list::iterator pos; + + list coll(T1, T1 + N); + pos = unique(coll.begin(), coll.end(), less()); + VERIFY( equal(coll.begin(), pos, A3) ); + + list coll2(T2, T2 + N); + reverse(coll2.begin(), coll2.end()); + pos = unique(coll2.begin(), coll2.end(), less()); + VERIFY( equal(coll2.begin(), pos, B3) ); +} + +int main() +{ + test01(); + test02(); + test03(); + return 0; +} -- cgit v1.2.3