/*
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:
>::type
> list_type;
- typedef cc::MichaelHashSet< gc_type, list_type,
+ typedef cc::MichaelHashSet< gc_type, list_type,
typename cc::michael_set::make_traits<
cds::opt::hash< hash_int >
>::type
>::type
> list_type;
- typedef cc::MichaelHashSet< gc_type, list_type,
+ typedef cc::MichaelHashSet< gc_type, list_type,
typename cc::michael_set::make_traits<
cds::opt::hash< hash_int >
>::type
};
typedef cc::MichaelList< gc_type, int_item, list_traits > list_type;
- typedef cc::MichaelHashSet< gc_type, list_type,
+ typedef cc::MichaelHashSet< gc_type, list_type,
typename cc::michael_set::make_traits<
cds::opt::hash< hash_int >
>::type
set_type s( kSize, 4 );
test( s );
+ EXPECT_GE( s.statistics().m_nInsertSuccess, 0u );
}
TEST_F( MichaelSet_HP, wrapped_stat )
set_type s( kSize, 4 );
test( s );
+ EXPECT_GE( s.statistics().m_nInsertSuccess, 0u );
}
} // namespace