2d66ab5e8e
We've been improving these the tests for vector quite a bit and we are probably not done improving our container tests. Formatting everything at once will make subsequent reviews easier.
51 lines
1.2 KiB
C++
51 lines
1.2 KiB
C++
//===----------------------------------------------------------------------===//
|
|
//
|
|
// 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://llvm.org/PR16816
|
|
|
|
#include <vector>
|
|
#include <algorithm>
|
|
#include <cassert>
|
|
#include <cstddef>
|
|
|
|
#include "test_macros.h"
|
|
|
|
TEST_CONSTEXPR_CXX20 bool tests() {
|
|
{
|
|
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 true;
|
|
}
|
|
|
|
int main(int, char**) {
|
|
tests();
|
|
#if TEST_STD_VER > 17
|
|
static_assert(tests());
|
|
#endif
|
|
return 0;
|
|
}
|