3bbfb3d91d
2002-12-26 Phil Edwards <pme@gcc.gnu.org> * include/std/std_bitset.h (_Base_bitset::_M_do_left_shift, _Base_bitset::_M_do_right_shift): Expect a non-zero shift. (bitset::operator<<=, bitset::operator>>=): When shifting more bits than are in the bitset, zero memory rather than segfault. (operator>>(basic_istream,bitset): Only call setstate once, after all work has been done. * testsuite/23_containers/bitset_members.cc (test03): New test. * testsuite/23_containers/bitset_shift.cc (test02): New test. From-SVN: r60533
131 lines
2.9 KiB
C++
131 lines
2.9 KiB
C++
// 2000-01-15 Anders Widell <awl@hem.passagen.se>
|
|
|
|
// Copyright (C) 2000 Free Software Foundation, Inc.
|
|
//
|
|
// This file is part of the GNU ISO C++ Library. This library is free
|
|
// software; you can redistribute it and/or modify it under the
|
|
// terms of the GNU General Public License as published by the
|
|
// Free Software Foundation; either version 2, or (at your option)
|
|
// any later version.
|
|
|
|
// This library is distributed in the hope that it will be useful,
|
|
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
// GNU General Public License for more details.
|
|
|
|
// You should have received a copy of the GNU General Public License along
|
|
// with this library; see the file COPYING. If not, write to the Free
|
|
// Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307,
|
|
// USA.
|
|
|
|
#include <string>
|
|
#include <set>
|
|
#include <bitset>
|
|
|
|
#include <testsuite_hooks.h>
|
|
|
|
static char original_bits[1024];
|
|
static char left_shifted[1024];
|
|
static char right_shifted[1024];
|
|
|
|
char
|
|
random_bit() {
|
|
static long x = 1;
|
|
return ((x = (3432L*x + 6789L) % 9973L) & 1) + '0';
|
|
}
|
|
|
|
void
|
|
initialise(size_t size) {
|
|
for (size_t i=0; i<size; i++)
|
|
original_bits[i] = random_bit();
|
|
|
|
original_bits[size] = '\0';
|
|
left_shifted[size] = '\0';
|
|
right_shifted[size] = '\0';
|
|
}
|
|
|
|
void
|
|
shift_arrays(size_t shift_step, size_t size) {
|
|
for (size_t i=shift_step; i<size; i++) {
|
|
right_shifted[i] = original_bits[i-shift_step];
|
|
left_shifted[size-i-1] = original_bits[size+shift_step-i-1];
|
|
}
|
|
for (size_t i=0; i<shift_step && i<size; i++) {
|
|
right_shifted[i] = '0';
|
|
left_shifted[size-i-1] = '0';
|
|
}
|
|
}
|
|
|
|
template <size_t size>
|
|
bool
|
|
do_test() {
|
|
bool test = true;
|
|
|
|
std::bitset<size> shifted;
|
|
std::bitset<size> correct;
|
|
|
|
initialise(size);
|
|
|
|
//std::bitset<size> original = std::string(original_bits);
|
|
std::bitset<size> original = std::bitset<size> (std::string(original_bits));
|
|
|
|
for (size_t shift_step=0; shift_step==0 || shift_step<size; shift_step++) {
|
|
shift_arrays(shift_step, size);
|
|
|
|
shifted = original;
|
|
shifted <<= shift_step;
|
|
//correct = std::string(left_shifted);
|
|
correct = std::bitset<size> (std::string(left_shifted));
|
|
VERIFY( shifted == correct );
|
|
|
|
shifted = original;
|
|
shifted >>= shift_step;
|
|
//correct = std::string(right_shifted);
|
|
correct = std::bitset<size> (std::string(right_shifted));
|
|
VERIFY( shifted == correct );
|
|
}
|
|
|
|
return test;
|
|
}
|
|
|
|
bool
|
|
test01() {
|
|
bool test = true;
|
|
|
|
VERIFY( do_test<32>() );
|
|
VERIFY( do_test<48>() );
|
|
VERIFY( do_test<64>() );
|
|
|
|
VERIFY( do_test<511>() );
|
|
VERIFY( do_test<513>() );
|
|
VERIFY( do_test<997>() );
|
|
|
|
#ifdef DEBUG_ASSERT
|
|
assert(test);
|
|
#endif
|
|
return test;
|
|
}
|
|
|
|
bool
|
|
test02()
|
|
{
|
|
bool test = true;
|
|
|
|
std::bitset<66> b;
|
|
b <<= 400;
|
|
VERIFY( b.count() == 0 );
|
|
|
|
#ifdef DEBUG_ASSERT
|
|
assert(test);
|
|
#endif
|
|
return test;
|
|
}
|
|
|
|
int
|
|
main() {
|
|
test01();
|
|
test02();
|
|
|
|
return 0;
|
|
}
|