home *** CD-ROM | disk | FTP | other *** search
- //: C20:DequeOverflow.cpp
- // From Thinking in C++, 2nd Edition
- // Available at http://www.BruceEckel.com
- // (c) Bruce Eckel 1999
- // Copyright notice in Copyright.txt
- // A deque is much more efficient than a vector
- // when pushing back a lot of elements, since it
- // doesn't require copying and destroying.
- #include "Noisy.h"
- #include <deque>
- #include <cstdlib>
- using namespace std;
-
- int main(int argc, char* argv[]) {
- int size = 1000;
- if(argc >= 2) size = atoi(argv[1]);
- deque<Noisy> dn;
- Noisy n;
- for(int i = 0; i < size; i++)
- dn.push_back(n);
- cout << "\n cleaning up \n";
- } ///:~
-