#include <iostream>
#include <string>
#include <deque>
#include <vector>
#include <unistd.h>
using namespace std;
struct Node
{
string str;
vector<string> vec;
Node(){};
~Node(){};
};
int main ()
{
deque<Node> deq;
for(int i = 0; i < 100; ++i)
{
Node tmp;
tmp.vec.resize(100000);
deq.push_back(tmp);
}
while(!deq.empty())
{
deq.pop_front();
}
{
deque<Node>().swap(deq);
}
cout<<"releas
";
sleep(80000000);
return 0;
}
By top
,I found my program's memory was about 61M, why? And it's ok if there is a copy-constructor in Node
.I would like to know why , not how to make it correct.
gcc (GCC) 4.9.1, centos
See Question&Answers more detail:os