header_libraries/tests/daw_bit_queues_test.cpp at master · beached/header_libraries · GitHub

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
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
// Copyright (c) Darrell Wright
//
// Distributed under the Boost Software License, Version 1.0. (See accompanying
// file LICENSE or copy at http://www.boost.org/LICENSE_1_0.txt)
//
// Official repository: https://github.com/beached/header_libraries
//

#include "daw/daw_bit_queues.h"

#include "daw/daw_benchmark.h"
#include "daw/daw_bit_count.h"
#include "daw/daw_ensure.h"

#include <cstddef>
#include <cstdint>
#include <iostream>
#include <limits>
#include <stdexcept>

constexpr bool daw_bit_queues_test_001( ) {
	using value_type = uint16_t;
	auto test1 = daw::basic_bit_queue<value_type, value_type>{ };
	test1.push_back( std::uint8_t{ 0b1010'1010U }, 8 );
	daw::expecting( test1.pop_back( 2 ) == 0b10U );
	test1.clear( );
	test1.push_back( 1, 1 );
	daw::expecting( test1.value( ) == 1 );
	daw::expecting( test1.size( ) == 1 );
	daw::expecting( test1.pop_back( 1 ) == 1 );
	test1.clear( );
	daw::expecting( test1.value( ) == 0 );
	daw::expecting( test1.size( ) == 0 );

	{
		daw::basic_bit_queue<value_type, value_type> test2;
		test2.push_back( 2 );
		daw::expecting( test2.value( ) == 2 );
		daw::expecting( test2.size( ) == sizeof( value_type ) * 8 );
		auto result = test2.pop_back( 1 );
		daw::expecting( result == 0 );
	}

	uint16_t v = 1;
	test1.push_back( 1, 1 );

	for( size_t n = 1; n < sizeof( value_type ) * 8; ++n ) {
		test1.push_back( 0, 1 );
		v *= 2;
		daw::expecting( test1.value( ) == v );
	}

	for( size_t n = 1; n < sizeof( value_type ) * 8; ++n ) {
		int const result = test1.pop_front( 1 );
		daw::expecting( result == 0 );
	}
	daw::expecting( test1.value( ) == 1 );
	daw::expecting( test1.size( ) == 1 );
	daw::expecting( test1.pop_back( 1 ) == 1 );
	daw::expecting( test1.empty( ) );

	v = 1;
	test1.push_back( 1, 1 );
	for( size_t n = 1; n < sizeof( value_type ) * 8; ++n ) {
		test1.push_back( 0, 1 );
		v *= 2;
		daw::expecting( test1.value( ) == v );
	}
	daw::expecting( test1.pop_back( 1 ), 1 );
	for( size_t n = 1; n < sizeof( value_type ) * 8; ++n ) {
		int const result = test1.pop_front( 1 );
		daw::expecting( result == 0 );
	}
	daw::expecting( test1.size( ) == 0 );
	daw::expecting( test1.empty( ) );
	return true;
}

constexpr bool daw_bit_queues_test_002( ) {
	using value_type = uint8_t;
	daw::basic_bit_queue<value_type, value_type> test1;
	test1.push_back( std::numeric_limits<value_type>::max( ) );
	daw::expecting( test1.pop_back( 3 ) == 7 );
	return true;
}

constexpr bool daw_bit_queues_test_003( ) {
	using value_type = uint16_t;
	daw::basic_bit_queue<value_type, value_type> test1;
	test1.push_back( 37, 4 );
	daw::expecting( 5U, test1.value( ) );
	(void)test1.pop_back( 1 );
	daw::expecting( 2U, test1.value( ) );
	return true;
}

void daw_nibble_queue_test_001( ) {
	using value_type = uint32_t;

	auto const nibble_to_hex = []( uint8_t c ) -> uint8_t {
		if( c < 10u ) {
			return '0' + c;
		} else if( c < 16u ) {
			return 'a' + ( c - 10u );
		} else {
			throw std::runtime_error( "Invalid nibble" );
		}
	};

	for( uint32_t n = 0; n < 32; ++n ) {
		auto test1 = daw::basic_nibble_queue<value_type, uint8_t>( 1u << n );
		auto str = std::string( );
		while( test1.can_pop( 1 ) ) {
			str += static_cast<char>( nibble_to_hex( test1.pop_front( 1 ) ) );
		}
		std::cout << str << std::endl;
	}
}

int main( ) {
	daw_ensure( daw_bit_queues_test_001( ) );
	//	static_assert( daw_bit_queues_test_002( ) );
	//	static_assert( daw_bit_queues_test_003( ) );
	daw_nibble_queue_test_001( );
}