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 #ifndef CDSLIB_ALGO_SPLIT_BITSTRING_H
32 #define CDSLIB_ALGO_SPLIT_BITSTRING_H
34 #include <cds/algo/base.h>
36 namespace cds { namespace algo {
38 /// Cuts a bit sequence from fixed-size bit-string
40 The splitter can be used as iterator over bit-string.
41 Each call of \p cut() or \p safe_cut() cuts the bit count specified
42 and keeps the position inside bit-string for the next call.
44 The splitter stores a const reference to bit-string, not a copy.
45 The maximum count of bits that can be cut in a single call is <tt> sizeof(UInt) * 8 </tt>
48 - \p BitString - a fixed-sized type that interprets as bit string
49 - \p BitStringSize - the siZe of \p BitString in bytes, default is <tt>sizeof( BitString )</tt>
50 - \p UInt - an unsigned integer, return type of \p cut()
52 template <typename BitString, size_t BitStringSize = sizeof( BitString ), typename UInt = typename std::conditional< BitStringSize % sizeof(size_t) == 0, size_t, unsigned >::type >
56 typedef BitString bitstring; ///< Bit-string type
57 typedef UInt uint_type; ///< Bit-string portion type
58 static CDS_CONSTEXPR size_t const c_bitstring_size = BitStringSize; ///< size of \p BitString in bytes
61 static CDS_CONSTEXPR size_t const c_nHashSize = (c_bitstring_size + sizeof(uint_type) - 1) / sizeof(uint_type);
62 static CDS_CONSTEXPR size_t const c_nBitPerByte = 8;
63 static CDS_CONSTEXPR size_t const c_nBitPerHash = c_bitstring_size * c_nBitPerByte;
64 static CDS_CONSTEXPR size_t const c_nBitPerInt = sizeof( uint_type ) * c_nBitPerByte;
68 /// Initializises the splitter with reference to \p h and zero start bit offset
69 explicit split_bitstring( bitstring const& h )
70 : m_ptr(reinterpret_cast<uint_type const*>( &h ))
74 , m_last( m_ptr + c_nHashSize )
78 /// Initializises the splitter with reference to \p h and start bit offset \p nBitOffset
79 split_bitstring( bitstring const& h, size_t nBitOffset )
80 : m_ptr( reinterpret_cast<uint_type const*>( &h ) + nBitOffset / c_nBitPerInt )
81 , m_offset( nBitOffset )
82 , m_first( reinterpret_cast<uint_type const*>(&h))
84 , m_last( m_first + c_nHashSize )
89 /// Returns \p true if end-of-string is not reached yet
90 explicit operator bool() const
95 /// Returns \p true if end-of-stream encountered
98 return m_offset >= c_nBitPerHash;
101 /// Cuts next \p nBits from bit-string
103 Precondition: <tt>nBits <= sizeof(uint_type) * 8</tt>
105 This function does not manage out-of-bound condition.
106 To control that use \p safe_cut().
108 uint_type cut( size_t nBits )
111 assert( nBits <= c_nBitPerInt );
112 assert( m_offset + nBits <= c_nBitPerHash );
114 assert( m_ptr < m_last );
118 uint_type const nRest = c_nBitPerInt - m_offset % c_nBitPerInt;
120 if ( nBits < nRest ) {
121 result = *m_ptr << ( nRest - nBits );
122 result = result >> ( c_nBitPerInt - nBits );
124 else if ( nBits == nRest ) {
125 result = *m_ptr >> ( c_nBitPerInt - nRest );
127 assert( m_offset % c_nBitPerInt == 0 );
130 uint_type const lsb = *m_ptr >> ( c_nBitPerInt - nRest );
134 result = *m_ptr << ( c_nBitPerInt - nBits );
135 result = result >> ( c_nBitPerInt - nBits );
136 result = (result << nRest) + lsb;
139 assert( m_offset <= c_nBitPerHash );
141 assert( m_ptr <= m_last );
146 /// Cuts up to \p nBits from the bit-string
148 Analog of \p cut() but if \p nBits is more than the rest of bit-string,
149 only the rest is returned.
150 If \p eos() is \p true the function returns 0.
152 uint_type safe_cut( size_t nBits )
157 assert( nBits <= sizeof(uint_type) * c_nBitPerByte );
159 if ( m_offset + nBits > c_nBitPerHash )
160 nBits = c_nBitPerHash - m_offset;
161 return nBits ? cut( nBits ) : 0;
164 /// Resets the splitter
165 void reset() CDS_NOEXCEPT
171 /// Returns pointer to source bitstring
172 bitstring const * source() const
174 return reinterpret_cast<bitstring const *>( m_first );
177 /// Returns current bit offset from beginning of bit-string
178 size_t bit_offset() const
185 uint_type const* m_ptr; ///< current position in the hash
186 size_t m_offset; ///< current bit offset in bit-string
187 uint_type const* m_first; ///< first position
189 uint_type const* m_last; ///< last position
194 }} // namespace cds::algo
196 #endif // #ifndef CDSLIB_ALGO_SPLIT_BITSTRING_H