feedc0de/boost_intrusive
1
0
Fork 0
forked from boostorg/intrusive
Code Pull Requests Activity

Added support for node and value pointers non-convertible from raw references

Browse Source
This commit is contained in:
Ion Gaztañaga
2014-06-12 11:49:42 +02:00
parent 4390889bf0
commit 563eca32de
48 changed files with 1203 additions and 1267 deletions
Download Patch File Download Diff File Expand all files Collapse all files
test/unordered_set_test.cpp
+1 -19
View File
@@ -358,24 +358,6 @@ void test_unordered_set<ValueTraits, CacheBegin, CompareHash, Incremental>::
{ int init_values [] = { 1, 2, 3, 4, 5 };
TEST_INTRUSIVE_SEQUENCE( init_values, testset1.begin() ); }
//This incremental rehash should success because the new size is twice the original
//and split_count is the same as the old bucket count
BOOST_TEST(testset1.incremental_rehash(bucket_traits(
pointer_traits<typename unordered_set_type::bucket_ptr>::
pointer_to(buckets1[0]), BucketSize*2)) == true);
BOOST_TEST(testset1.split_count() == BucketSize);
{ int init_values [] = { 1, 2, 3, 4, 5 };
TEST_INTRUSIVE_SEQUENCE( init_values, testset1.begin() ); }
//This incremental rehash should also success because the new size is half the original
//and split_count is the same as the new bucket count
BOOST_TEST(testset1.incremental_rehash(bucket_traits(
pointer_traits<typename unordered_set_type::bucket_ptr>::
pointer_to(buckets1[0]), BucketSize)) == true);
BOOST_TEST(testset1.split_count() == BucketSize);
{ int init_values [] = { 1, 2, 3, 4, 5 };
TEST_INTRUSIVE_SEQUENCE( init_values, testset1.begin() ); }
//
//Try incremental hashing specifying a new bucket traits pointing to the same array
//
@@ -731,7 +713,7 @@ class test_main_template<VoidPointer, false, incremental>
}
};
int main( int, char* [] )
int main()
{
test_main_template<void*, false, true>()();
test_main_template<smart_ptr<void>, false, true>()();