Merge with trank @ 137446
[official-gcc.git] / libstdc++-v3 / testsuite / 25_algorithms / find_if_not / 1.cc
blobe16e8088231b25f20c25438af44f21035c9011e4
1 // { dg-options "-std=gnu++0x" }
3 // 2008-06-25 Paolo Carlini <paolo.carlini@oracle.com>
5 // Copyright (C) 2008 Free Software Foundation, Inc.
6 //
7 // This file is part of the GNU ISO C++ Library. This library is free
8 // software; you can redistribute it and/or modify it under the
9 // terms of the GNU General Public License as published by the
10 // Free Software Foundation; either version 2, or (at your option)
11 // any later version.
13 // This library is distributed in the hope that it will be useful,
14 // but WITHOUT ANY WARRANTY; without even the implied warranty of
15 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 // GNU General Public License for more details.
18 // You should have received a copy of the GNU General Public License along
19 // with this library; see the file COPYING. If not, write to the Free
20 // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
21 // USA.
23 #include <algorithm>
24 #include <testsuite_hooks.h>
25 #include <testsuite_iterators.h>
27 using __gnu_test::test_container;
28 using __gnu_test::input_iterator_wrapper;
30 typedef test_container<int, input_iterator_wrapper> Container;
31 int array[] = {0, 0, 0, 1, 0, 1};
33 bool
34 predicate(const int& i)
35 { return i == 0; }
37 void
38 test1()
40 bool test __attribute__((unused)) = true;
42 Container con(array, array);
43 VERIFY( std::find_if_not(con.begin(), con.end(),
44 predicate).ptr == array );
47 void
48 test2()
50 bool test __attribute__((unused)) = true;
52 Container con(array, array + 1);
53 VERIFY( std::find_if_not(con.begin(), con.end(),
54 predicate).ptr == array + 1 );
57 void
58 test3()
60 bool test __attribute__((unused)) = true;
62 Container con(array, array + 6);
63 VERIFY( std::find_if_not(con.begin(), con.end(),
64 predicate).ptr == array + 3 );
67 int
68 main()
70 test1();
71 test2();
72 test3();
73 return 0;