-//$$CDS-header$$
+/*
+ This file is a part of libcds - Concurrent Data Structures library
-#ifndef __CDS_INTRUSIVE_DETAILS_MICHAEL_SET_BASE_H
-#define __CDS_INTRUSIVE_DETAILS_MICHAEL_SET_BASE_H
+ (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2016
+
+ 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:
+
+ * Redistributions of source code must retain the above copyright notice, this
+ list of conditions and the following disclaimer.
+
+ * Redistributions in binary form must reproduce the above copyright notice,
+ this list of conditions and the following disclaimer in the documentation
+ and/or other materials provided with the distribution.
+
+ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+ DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
+ FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+ DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+ 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.
+*/
+
+#ifndef CDSLIB_INTRUSIVE_DETAILS_MICHAEL_SET_BASE_H
+#define CDSLIB_INTRUSIVE_DETAILS_MICHAEL_SET_BASE_H
#include <cds/intrusive/details/base.h>
#include <cds/opt/compare.h>
/** @ingroup cds_intrusive_helper
*/
namespace michael_set {
-
/// MichaelHashSet traits
struct traits {
/// Hash function
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();
}
};
}
//@endcond
- }
+ } // namespace michael_set
//@cond
// Forward declarations
}} // namespace cds::intrusive
-#endif // #ifndef __CDS_INTRUSIVE_DETAILS_MICHAEL_SET_BASE_H
+#endif // #ifndef CDSLIB_INTRUSIVE_DETAILS_MICHAEL_SET_BASE_H