You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
63 lines
1.6 KiB
C++
63 lines
1.6 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
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// test bitset<N>& operator<<=(size_t pos);
|
|
|
|
#include <bitset>
|
|
#include <cstdlib>
|
|
#include <cassert>
|
|
|
|
#include "test_macros.h"
|
|
|
|
#if defined(TEST_COMPILER_CLANG)
|
|
#pragma clang diagnostic ignored "-Wtautological-compare"
|
|
#elif defined(TEST_COMPILER_C1XX)
|
|
#pragma warning(disable: 6294) // Ill-defined for-loop: initial condition does not satisfy test. Loop body not executed.
|
|
#endif
|
|
|
|
template <std::size_t N>
|
|
std::bitset<N>
|
|
make_bitset()
|
|
{
|
|
std::bitset<N> v;
|
|
for (std::size_t i = 0; i < N; ++i)
|
|
v[i] = static_cast<bool>(std::rand() & 1);
|
|
return v;
|
|
}
|
|
|
|
template <std::size_t N>
|
|
void test_left_shift()
|
|
{
|
|
for (std::size_t s = 0; s <= N+1; ++s)
|
|
{
|
|
std::bitset<N> v1 = make_bitset<N>();
|
|
std::bitset<N> v2 = v1;
|
|
v1 <<= s;
|
|
for (std::size_t i = 0; i < N; ++i)
|
|
if (i < s)
|
|
assert(v1[i] == 0);
|
|
else
|
|
assert(v1[i] == v2[i-s]);
|
|
}
|
|
}
|
|
|
|
int main(int, char**)
|
|
{
|
|
test_left_shift<0>();
|
|
test_left_shift<1>();
|
|
test_left_shift<31>();
|
|
test_left_shift<32>();
|
|
test_left_shift<33>();
|
|
test_left_shift<63>();
|
|
test_left_shift<64>();
|
|
test_left_shift<65>();
|
|
test_left_shift<1000>();
|
|
|
|
return 0;
|
|
}
|