feedc0de/boost_container
1
0
Fork 0
forked from boostorg/container
Code Pull Requests Activity

Updated range insertion code for enhanced performance.

Browse Source
This commit is contained in:
Ion Gaztañaga
2014-09-17 21:51:38 +02:00
parent f213f55f20
commit 0ccf576872
2 changed files with 131 additions and 97 deletions
Download Patch File Download Diff File Expand all files Collapse all files

64
test/flat_set_test.cpp
View File

@@ -322,12 +322,74 @@ bool flat_tree_ordered_insertion_test()
//Re-re-insertion of even
std::set<int> int_even_set;
for(std::size_t i = 0; i < NumElements; i+=2){
int_set.insert(static_cast<int>(i));
int_even_set.insert(static_cast<int>(i));
}
fset.insert(ordered_unique_range, int_even_set.begin(), int_even_set.end());
int_set4.insert(int_even_set.begin(), int_even_set.end());
if(!CheckEqualContainers(&int_set4, &fset))
return false;
//Partial Re-re-insertion of even
int_even_set.clear();
for(std::size_t i = 0; i < NumElements; i+=4){
int_even_set.insert(static_cast<int>(i));
}
fset.clear();
int_set4.clear();
//insert 0,4,8,12...
fset.insert(ordered_unique_range, int_even_set.begin(), int_even_set.end());
int_set4.insert(int_even_set.begin(), int_even_set.end());
if(!CheckEqualContainers(&int_set4, &fset))
return false;
for(std::size_t i = 2; i < NumElements; i+=4){
int_even_set.insert(static_cast<int>(i));
}
//insert 0,2,4,6,8,10,12...
fset.insert(ordered_unique_range, int_even_set.begin(), int_even_set.end());
int_set4.insert(int_even_set.begin(), int_even_set.end());
if(!CheckEqualContainers(&int_set4, &fset))
return false;
int_even_set.clear();
for(std::size_t i = 0; i < NumElements; i+=8){
int_even_set.insert(static_cast<int>(i));
}
fset.clear();
int_set4.clear();
//insert 0,8,16...
fset.insert(ordered_unique_range, int_even_set.begin(), int_even_set.end());
int_set4.insert(int_even_set.begin(), int_even_set.end());
if(!CheckEqualContainers(&int_set4, &fset))
return false;
for(std::size_t i = 0; i < NumElements; i+=2){
int_even_set.insert(static_cast<int>(i));
}
//insert 0,2,4,6,8,10,12...
fset.insert(ordered_unique_range, int_even_set.begin(), int_even_set.end());
int_set4.insert(int_even_set.begin(), int_even_set.end());
if(!CheckEqualContainers(&int_set4, &fset))
return false;
int_even_set.clear();
for(std::size_t i = 0; i < NumElements; i+=8){
int_even_set.insert(static_cast<int>(i));
int_even_set.insert(static_cast<int>(i+2));
}
int_even_set.insert(static_cast<int>(NumElements-2));
fset.clear();
int_set4.clear();
//insert 0,2,8,10...
fset.insert(ordered_unique_range, int_even_set.begin(), int_even_set.end());
int_set4.insert(int_even_set.begin(), int_even_set.end());
if(!CheckEqualContainers(&int_set4, &fset))
return false;
for(std::size_t i = 0; i < NumElements; i+=2){
int_even_set.insert(static_cast<int>(i));
}
//insert 0,2,4,6,8,10,12...
fset.insert(ordered_unique_range, int_even_set.begin(), int_even_set.end());
int_set4.insert(int_even_set.begin(), int_even_set.end());
if(!CheckEqualContainers(&int_set4, &fset))
return false;
}
return true;