boostorg/container
1
0
Fork 1
mirror of https://github.com/boostorg/container.git synced 2026-01-26 09:12:35 +01:00
Code Issues Packages Projects Releases Wiki Activity

Added documentation on scoped allocators

Browse Source 
[SVN r77679]
This commit is contained in:
Ion Gaztañaga
2012-03-31 20:57:45 +00:00
parent 7f1456c30f
commit 0098adea15
2 changed files with 66 additions and 22 deletions
Download Patch File Download Diff File Expand all files Collapse all files

36
test/vector_test.cpp
View File

@@ -94,27 +94,27 @@ enum Test
};
int main()
{
const std::size_t positions_length = 10;
std::size_t positions[positions_length];
vector<int> vector_int;
vector<int> vector_int2(positions_length);
for(std::size_t i = 0; i != positions_length; ++i){
positions[i] = 0u;
}
for(std::size_t i = 0, max = vector_int2.size(); i != max; ++i){
vector_int2[i] = i;
}
{/*
{
const std::size_t positions_length = 10;
std::size_t positions[positions_length];
vector<int> vector_int;
vector<int> vector_int2(positions_length);
for(std::size_t i = 0; i != positions_length; ++i){
positions[i] = 0u;
}
for(std::size_t i = 0, max = vector_int2.size(); i != max; ++i){
vector_int2[i] = i;
}
vector_int.insert(vector_int.begin(), 999);
vector_int.insert(vector_int.begin(), 999);
//vector_int.insert_at_ordered_positions(positions, positions_length, vector_int2.end());
for(std::size_t i = 0, max = vector_int.size(); i != max; ++i){
std::cout << vector_int[i] << std::endl;
}
return 0;
vector_int.insert_ordered_at(positions_length, positions + positions_length, vector_int2.end());
for(std::size_t i = 0, max = vector_int.size(); i != max; ++i){
std::cout << vector_int[i] << std::endl;
}
}*/
recursive_vector_test();
{
//Now test move semantics