/*
This file is a part of libcds - Concurrent Data Structures library
- (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2016
+ (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2017
Source code repo: http://github.com/khizmax/libcds/
Download: http://sourceforge.net/projects/libcds/files/
-
+
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include <gtest/gtest.h>
#include <cds/algo/int_algo.h>
-#include <cds/os/timer.h>
+//#include <cds/details/bit_reverse_counter.h>
namespace {
class bitop : public ::testing::Test
EXPECT_EQ( cds::bitop::MSB(n), 0 ) << "n=" << n;
EXPECT_EQ( cds::bitop::LSB( n ), 0 ) << "n=" << n;
EXPECT_EQ( cds::bitop::SBC( n ), 0 ) << "n=" << n;
- EXPECT_EQ( cds::bitop::ZBC( n ), sizeof( n ) * 8 ) << "n=" << n;
+ EXPECT_EQ( cds::bitop::ZBC( n ), static_cast<int>( sizeof( n ) * 8 )) << "n=" << n;
int nBit = 1;
for ( n = 1; n != 0; n *= 2 ) {
EXPECT_EQ( cds::bitop::MSBnz( n ), nBit - 1 ) << "n=" << n;
EXPECT_EQ( cds::bitop::LSBnz( n ), nBit - 1 ) << "n=" << n;
EXPECT_EQ( cds::bitop::SBC( n ), 1 ) << "n=" << n;
- EXPECT_EQ( cds::bitop::ZBC( n ), sizeof( n ) * 8 - 1 ) << "n=" << n;
+ EXPECT_EQ( cds::bitop::ZBC( n ), static_cast<int>( sizeof( n ) * 8 - 1 )) << "n=" << n;
++nBit;
}
EXPECT_EQ( cds::bitop::MSB( n ), 0 ) << "n=" << n;
EXPECT_EQ( cds::bitop::LSB( n ), 0 ) << "n=" << n;
EXPECT_EQ( cds::bitop::SBC( n ), 0 ) << "n=" << n;
- EXPECT_EQ( cds::bitop::ZBC( n ), sizeof( n ) * 8 ) << "n=" << n;
+ EXPECT_EQ( cds::bitop::ZBC( n ), static_cast<int>( sizeof( n ) * 8 )) << "n=" << n;
int nBit = 1;
for ( n = 1; n != 0; n *= 2 ) {
EXPECT_EQ( cds::bitop::MSBnz( n ), nBit - 1 ) << "n=" << n;
EXPECT_EQ( cds::bitop::LSBnz( n ), nBit - 1 ) << "n=" << n;
EXPECT_EQ( cds::bitop::SBC( n ), 1 ) << "n=" << n;
- EXPECT_EQ( cds::bitop::ZBC( n ), sizeof( n ) * 8 - 1 ) << "n=" << n;
+ EXPECT_EQ( cds::bitop::ZBC( n ), static_cast<int>( sizeof( n ) * 8 - 1 )) << "n=" << n;
++nBit;
}
TEST_F( bitop, floor_pow2 )
{
- EXPECT_EQ( cds::beans::floor2( 0 ), 1 );
- EXPECT_EQ( cds::beans::floor2( 1 ), 1 );
- EXPECT_EQ( cds::beans::floor2( 2 ), 2 );
- EXPECT_EQ( cds::beans::floor2( 3 ), 2 );
- EXPECT_EQ( cds::beans::floor2( 4 ), 4 );
- EXPECT_EQ( cds::beans::floor2( 5 ), 4 );
- EXPECT_EQ( cds::beans::floor2( 7 ), 4 );
- EXPECT_EQ( cds::beans::floor2( 8 ), 8 );
- EXPECT_EQ( cds::beans::floor2( 9 ), 8 );
+ EXPECT_EQ( cds::beans::floor2( 0u ), 1u );
+ EXPECT_EQ( cds::beans::floor2( 1u ), 1u );
+ EXPECT_EQ( cds::beans::floor2( 2u ), 2u );
+ EXPECT_EQ( cds::beans::floor2( 3u ), 2u );
+ EXPECT_EQ( cds::beans::floor2( 4u ), 4u );
+ EXPECT_EQ( cds::beans::floor2( 5u ), 4u );
+ EXPECT_EQ( cds::beans::floor2( 7u ), 4u );
+ EXPECT_EQ( cds::beans::floor2( 8u ), 8u );
+ EXPECT_EQ( cds::beans::floor2( 9u ), 8u );
for ( uint32_t n = 2; n; n <<= 1 )
{
TEST_F( bitop, ceil_pow2 )
{
- EXPECT_EQ( cds::beans::ceil2( 0 ), 1 );
- EXPECT_EQ( cds::beans::ceil2( 1 ), 1 );
- EXPECT_EQ( cds::beans::ceil2( 2 ), 2 );
- EXPECT_EQ( cds::beans::ceil2( 3 ), 4 );
- EXPECT_EQ( cds::beans::ceil2( 4 ), 4 );
- EXPECT_EQ( cds::beans::ceil2( 5 ), 8 );
- EXPECT_EQ( cds::beans::ceil2( 7 ), 8 );
- EXPECT_EQ( cds::beans::ceil2( 8 ), 8 );
- EXPECT_EQ( cds::beans::ceil2( 9 ), 16 );
+ EXPECT_EQ( cds::beans::ceil2( 0u ), 1u );
+ EXPECT_EQ( cds::beans::ceil2( 1u ), 1u );
+ EXPECT_EQ( cds::beans::ceil2( 2u ), 2u );
+ EXPECT_EQ( cds::beans::ceil2( 3u ), 4u );
+ EXPECT_EQ( cds::beans::ceil2( 4u ), 4u );
+ EXPECT_EQ( cds::beans::ceil2( 5u ), 8u );
+ EXPECT_EQ( cds::beans::ceil2( 7u ), 8u );
+ EXPECT_EQ( cds::beans::ceil2( 8u ), 8u );
+ EXPECT_EQ( cds::beans::ceil2( 9u ), 16u );
for ( uint32_t n = 4; n < (uint32_t(1) << 31); n <<= 1 )
{
}
}
+ /*
+ TEST_F( bitop, bit_reverse_counter )
+ {
+ cds::bitop::bit_reverse_counter<> c;
+
+ while ( c.value() < 8 ) {
+ size_t res = c.inc();
+ std::cout << "inc result: " << res
+ << " value: " << c.value()
+ << " reversed: " << c.reversed_value()
+ << " high_bit: " << c.high_bit() << "\n";
+ }
+
+ while ( c.value() > 0 ) {
+ size_t res = c.dec();
+ std::cout << "dec result: " << res
+ << " value: " << c.value()
+ << " reversed: " << c.reversed_value()
+ << " high_bit: " << c.high_bit() << "\n";
+ }
+ }
+ */
+
} // namespace