Fix addvdi3 and subvdi3 patterns
[official-gcc.git] / libstdc++-v3 / testsuite / 25_algorithms / adjacent_find / vectorbool.cc
blob779e5ece84af74ba8a9266c5c3072eb947f3a6e1
1 // Copyright (C) 2013-2022 Free Software Foundation, Inc.
2 //
3 // This file is part of the GNU ISO C++ Library. This library is free
4 // software; you can redistribute it and/or modify it under the
5 // terms of the GNU General Public License as published by the
6 // Free Software Foundation; either version 3, or (at your option)
7 // any later version.
9 // This library is distributed in the hope that it will be useful,
10 // but WITHOUT ANY WARRANTY; without even the implied warranty of
11 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 // GNU General Public License for more details.
14 // You should have received a copy of the GNU General Public License along
15 // with this library; see the file COPYING3. If not see
16 // <http://www.gnu.org/licenses/>.
18 // 25.1.5 [lib.alg.adjacent_find]
20 #include <vector>
21 #include <algorithm>
22 #include <testsuite_hooks.h>
24 void
25 test01()
27 std::vector<bool> v;
28 v.push_back(true);
29 v.push_back(false);
30 v.push_back(true);
31 v.push_back(false);
32 v.push_back(false);
34 VERIFY( std::adjacent_find(v.begin(), v.end()) == v.begin() + 3 );
35 VERIFY( std::adjacent_find(v.begin(), v.end() - 1) == v.end() - 1 );
38 int
39 main()
41 test01();