find.pass.cpp
1.2 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
//===----------------------------------------------------------------------===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===----------------------------------------------------------------------===//
// <vector>
// vector<bool>
// std::find with vector<bool>::iterator
// https://bugs.llvm.org/show_bug.cgi?id=16816
#include <vector>
#include <algorithm>
#include <cassert>
#include <cstddef>
#include "test_macros.h"
int main(int, char**)
{
{
for (unsigned i = 1; i < 256; ++i)
{
std::vector<bool> b(i,true);
std::vector<bool>::iterator j = std::find(b.begin()+1, b.end(), false);
assert(static_cast<std::size_t>(j-b.begin()) == i);
assert(b.end() == j);
}
}
{
for (unsigned i = 1; i < 256; ++i)
{
std::vector<bool> b(i,false);
std::vector<bool>::iterator j = std::find(b.begin()+1, b.end(), true);
assert(static_cast<std::size_t>(j-b.begin()) == i);
assert(b.end() == j);
}
}
return 0;
}