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.
*/
#ifndef CDSLIB_INTRUSIVE_DETAILS_MICHAEL_SET_BASE_H
nLoadFactor = 1;
if ( nMaxItemCount == 0 )
nMaxItemCount = 4;
- const size_t nBucketCount = (size_t)( nMaxItemCount / nLoadFactor );
- const size_t nLog2 = cds::bitop::MSB( nBucketCount );
+ const size_t nBucketCount = nMaxItemCount / nLoadFactor;
+ const size_t exp2 = size_t( 1 ) << cds::bitop::MSB( nBucketCount );
- return (( size_t( 1 << nLog2 ) < nBucketCount ? size_t( 1 << (nLog2 + 1) ) : size_t( 1 << nLog2 ))) - 1;
+ return ( exp2 < nBucketCount ? exp2 * 2 : exp2 ) - 1;
}
template <typename OrderedList, bool IsConst>
template <typename OrderedList, bool IsConst>
class iterator
{
- friend class iterator < OrderedList, !IsConst >;
+ friend class iterator< OrderedList, !IsConst >;
+
protected:
typedef OrderedList bucket_type;
typedef typename list_iterator_selector< bucket_type, IsConst>::bucket_ptr bucket_ptr;
void next()
{
if ( m_pCurBucket < m_pEndBucket ) {
- if ( ++m_itList != m_pCurBucket->end() )
+ if ( ++m_itList != m_pCurBucket->end())
return;
while ( ++m_pCurBucket < m_pEndBucket ) {
m_itList = m_pCurBucket->begin();
- if ( m_itList != m_pCurBucket->end() )
+ if ( m_itList != m_pCurBucket->end())
return;
}
}
, m_itList( it )
, m_pEndBucket( pLast )
{
- if ( it == pFirst->end() )
+ if ( it == pFirst->end())
next();
}