/*
This file is a part of libcds - Concurrent Data Structures library
- (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2016
+ (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2017
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 CDSUNIT_MAP_TEST_SKIPLIST_RCU_H
#define CDSUNIT_MAP_TEST_SKIPLIST_RCU_H
base_class::test( m );
- ASSERT_TRUE( m.empty() );
+ ASSERT_TRUE( m.empty());
ASSERT_CONTAINER_SIZE( m, 0 );
- typedef typename Map::value_type map_pair;
typedef typename Map::exempt_ptr exempt_ptr;
size_t const kkSize = base_class::kSize;
size_t nCount = 0;
int nKey = 0;
- while ( !m.empty() ) {
+ while ( !m.empty()) {
xp = m.extract_min();
ASSERT_FALSE( !xp );
EXPECT_EQ( xp->first.nKey, nKey + 1 );
xp = m.extract_max();
ASSERT_TRUE( !xp );
EXPECT_EQ( kkSize, nCount );
- ASSERT_TRUE( m.empty() );
+ ASSERT_TRUE( m.empty());
ASSERT_CONTAINER_SIZE( m, 0 );
// get_max
nKey = kkSize;
nCount = 0;
- while ( !m.empty() ) {
+ while ( !m.empty()) {
xp = m.extract_max();
ASSERT_FALSE( !xp );
EXPECT_EQ( xp->first.nKey, nKey - 1 );
xp = m.extract_max();
ASSERT_TRUE( !xp );
EXPECT_EQ( kkSize, nCount );
- ASSERT_TRUE( m.empty() );
+ ASSERT_TRUE( m.empty());
ASSERT_CONTAINER_SIZE( m, 0 );
}
#endif // CDSUNIT_MAP_TEST_SKIPLIST_RCU_H
-
\ No newline at end of file
+