2 This file is a part of libcds - Concurrent Data Structures library
4 (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2016
6 Source code repo: http://github.com/khizmax/libcds/
7 Download: http://sourceforge.net/projects/libcds/files/
9 Redistribution and use in source and binary forms, with or without
10 modification, are permitted provided that the following conditions are met:
12 * Redistributions of source code must retain the above copyright notice, this
13 list of conditions and the following disclaimer.
15 * Redistributions in binary form must reproduce the above copyright notice,
16 this list of conditions and the following disclaimer in the documentation
17 and/or other materials provided with the distribution.
19 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
20 AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
22 DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
23 FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
25 SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
26 CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
27 OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
28 OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
31 #include <cds/algo/split_bitstring.h>
32 #include <gtest/gtest.h>
35 class Split_bitstrig : public ::testing::Test
44 byte_order.ui = 0xFF000001;
46 return byte_order.ch != 0x01;
51 typedef cds::algo::split_bitstring< size_t > split_bitstring;
53 size_t src = sizeof(src) == 8 ? 0xFEDCBA9876543210 : 0x76543210;
54 split_bitstring splitter(src);
58 ASSERT_FALSE( splitter.eos());
59 ASSERT_FALSE( !splitter );
60 res = splitter.cut(sizeof(src) * 8);
61 EXPECT_EQ( res, src );
62 ASSERT_TRUE( splitter.eos());
63 ASSERT_TRUE( !splitter );
64 EXPECT_EQ(splitter.safe_cut(sizeof(src) * 8), 0u );
65 ASSERT_TRUE( splitter.eos());
66 ASSERT_TRUE( !splitter );
68 ASSERT_FALSE( splitter.eos());
69 ASSERT_FALSE( !splitter );
70 res = splitter.cut(sizeof(src) * 8);
71 EXPECT_EQ( res, src );
72 ASSERT_TRUE( splitter.eos());
73 ASSERT_TRUE( !splitter );
74 EXPECT_EQ( splitter.safe_cut(sizeof(src) * 8), 0u );
75 ASSERT_TRUE( splitter.eos());
76 ASSERT_TRUE( !splitter );
80 for ( size_t i = 0; i < sizeof(size_t) * 2; ++i ) {
81 ASSERT_FALSE( splitter.eos());
82 ASSERT_FALSE( !splitter );
83 ASSERT_EQ( splitter.cut( 4 ), i );
85 ASSERT_TRUE( splitter.eos());
86 ASSERT_FALSE( splitter );
92 for ( size_t i = 0; i < sizeof(size_t) * 8; ++i ) {
93 ASSERT_FALSE( splitter.eos());
94 ASSERT_FALSE( !splitter );
95 res = res + (splitter.cut( 1 ) << i);
97 ASSERT_TRUE( splitter.eos());
98 ASSERT_TRUE( !splitter );
99 EXPECT_EQ( res, src );
104 for ( size_t k = 0; k < 100; ++k ) {
109 ASSERT_FALSE( splitter.eos());
110 ASSERT_FALSE( !splitter );
111 int bits = std::rand() % 16;
112 res = res + ( splitter.safe_cut( bits ) << shift );
115 ASSERT_TRUE( splitter.eos());
116 ASSERT_TRUE( !splitter );
117 EXPECT_EQ( res, src );
124 typedef cds::algo::split_bitstring< size_t > split_bitstring;
126 size_t src = sizeof(src) == 8 ? 0xFEDCBA9876543210 : 0x76543210;
127 split_bitstring splitter(src);
131 ASSERT_FALSE( splitter.eos());
132 ASSERT_FALSE( !splitter );
133 res = splitter.cut(sizeof(src) * 8);
134 ASSERT_EQ( res, src );
135 ASSERT_TRUE( splitter.eos());
136 ASSERT_TRUE( !splitter );
137 EXPECT_EQ(splitter.safe_cut(sizeof(src) * 8), 0u );
138 ASSERT_TRUE( splitter.eos());
139 ASSERT_TRUE( !splitter );
141 ASSERT_FALSE( splitter.eos());
142 ASSERT_FALSE( !splitter );
143 res = splitter.cut(sizeof(src) * 8);
144 EXPECT_EQ( res, src );
145 ASSERT_TRUE( splitter.eos());
146 ASSERT_TRUE( !splitter );
147 EXPECT_EQ(splitter.safe_cut(sizeof(src) * 8), 0u );
148 ASSERT_TRUE( splitter.eos());
149 ASSERT_TRUE( !splitter );
151 // Cut each hex digit
153 for ( size_t i = 0; i < sizeof(size_t) * 2; ++i ) {
154 ASSERT_FALSE( splitter.eos());
155 ASSERT_FALSE( !splitter );
156 EXPECT_EQ( splitter.cut( 4 ), 0x0F - i );
158 ASSERT_TRUE( splitter.eos());
159 ASSERT_TRUE( !splitter );
165 for ( size_t i = 0; i < sizeof(size_t) * 8; ++i ) {
166 ASSERT_FALSE( splitter.eos());
167 ASSERT_FALSE( !splitter );
168 res = (res << 1) + splitter.cut( 1 );
170 ASSERT_TRUE( splitter.eos());
171 ASSERT_TRUE( !splitter );
172 EXPECT_EQ( res, src );
177 for ( size_t k = 0; k < 100; ++k ) {
181 ASSERT_FALSE( splitter.eos());
182 ASSERT_FALSE( !splitter );
183 int bits = std::rand() % 16;
184 res = (res << bits) + splitter.safe_cut( bits );
186 ASSERT_TRUE( splitter.eos());
187 ASSERT_TRUE( !splitter );
188 EXPECT_EQ( res, src );
193 template <typename PartUInt>
196 typedef PartUInt part_uint;
198 typedef cds::algo::split_bitstring< uint64_t, part_uint > split_bitstring;
200 uint64_t src = 0xFEDCBA9876543210;
201 split_bitstring splitter(src);
204 // Cut each hex digit
206 for ( size_t i = 0; i < sizeof(size_t) * 2; ++i ) {
207 ASSERT_FALSE( splitter.eos());
208 ASSERT_FALSE( !splitter );
209 EXPECT_EQ( static_cast<size_t>(splitter.cut( 4 )), i );
211 ASSERT_TRUE( splitter.eos());
212 ASSERT_TRUE( !splitter );
218 for ( size_t i = 0; i < sizeof(size_t) * 8; ++i ) {
219 ASSERT_FALSE( splitter.eos());
220 ASSERT_FALSE( !splitter );
221 res = res + ( static_cast<uint64_t>(splitter.cut( 1 )) << i);
223 ASSERT_TRUE( splitter.eos());
224 ASSERT_TRUE( !splitter );
225 EXPECT_EQ( res, src );
230 for ( size_t k = 0; k < 100; ++k ) {
235 ASSERT_FALSE( splitter.eos());
236 ASSERT_FALSE( !splitter );
237 int bits = std::rand() % 16;
238 res = res + ( static_cast<uint64_t>(splitter.safe_cut( bits )) << shift );
241 ASSERT_TRUE( splitter.eos());
242 ASSERT_TRUE( !splitter );
243 EXPECT_EQ( res, src );
248 template <typename PartUInt>
251 typedef PartUInt part_uint;
253 typedef cds::algo::split_bitstring< uint64_t, part_uint > split_bitstring;
255 uint64_t src = 0xFEDCBA9876543210;
256 split_bitstring splitter(src);
259 // Cut each hex digit
261 for ( size_t i = 0; i < sizeof(size_t) * 2; ++i ) {
262 ASSERT_FALSE( splitter.eos());
263 ASSERT_FALSE( !splitter );
264 EXPECT_EQ( splitter.cut( 4 ), 0x0F - i );
266 ASSERT_TRUE( splitter.eos());
267 ASSERT_TRUE( !splitter );
273 for ( size_t i = 0; i < sizeof(size_t) * 8; ++i ) {
274 ASSERT_FALSE( splitter.eos());
275 ASSERT_FALSE( !splitter );
276 res = (res << 1) + splitter.cut( 1 );
278 ASSERT_TRUE( splitter.eos());
279 ASSERT_TRUE( !splitter );
280 EXPECT_EQ( res, src );
285 for ( size_t k = 0; k < 100; ++k ) {
289 ASSERT_FALSE( splitter.eos());
290 ASSERT_FALSE( !splitter );
291 int bits = std::rand() % 16;
292 res = (res << bits) + splitter.safe_cut( bits );
294 ASSERT_TRUE( splitter.eos());
295 ASSERT_TRUE( !splitter );
296 EXPECT_EQ( res, src );
302 TEST_F( Split_bitstrig, cut_uint )
304 if ( is_big_endian())
310 TEST_F( Split_bitstrig, cut_uint16 )
312 if ( is_big_endian())
313 cut_small_be<uint16_t>();
315 cut_small_le<uint16_t>();