make a big vector and then minimize its memory : vector capacity « vector « C++ Tutorial

Home
C++ Tutorial
1.Language Basics
2.Data Types
3.Operators statements
4.Array
5.Development
6.Exceptions
7.Function
8.Structure
9.Class
10.Operator Overloading
11.Pointer
12.File Stream
13.template
14.STL Introduction
15.string
16.vector
17.list
18.bitset
19.set multiset
20.valarray
21.queue stack
22.deque
23.map multimap
24.STL Algorithms Modifying sequence operations
25.STL Algorithms Non modifying sequence operations
26.STL Algorithms Binary search
27.STL Algorithms Sorting
28.STL Algorithms Merge
29.STL Algorithms Min Max
30.STL Algorithms Iterator
31.STL Algorithms Heap
32.STL Algorithms Helper
C / ANSI-C
C Tutorial
C++
Visual C++ .NET
C++ Tutorial » vector » vector capacity 
16.7.2.make a big vector and then minimize its memory
#include <algorithm>
#include <iostream>
#include <vector>

using namespace std;

int main( )
{
   const int big_size = 10000;
   vector<double> vbig_size );
   // make a big vector and then minimize its memory
   v.assignbig_size, 3.33 );
   cout << "\n\nBefore resizing, the capacity of the vector is "
      << v.capacity() << " and its size is " << v.size();
   v.resize);
   cout << "\nAfter resizing, the capacity of the vector is "
      << v.capacity() << " and its size is " << v.size();
   vector<double>).swap);

   cout << "\nAfter swapping, the capacity of the vector is "
      << v.capacity() << " and its size is " << v.size();
}
16.7.vector capacity
16.7.1.make a big vector and then deallocate all its memory
16.7.2.make a big vector and then minimize its memory
16.7.3.make the vector as large as possible without reallocating
16.7.4.Demonstrating the STL vector capacity
16.7.5.Demonstrating the STL vector capacity and reserve functions
www.java2java.com | Contact Us
Copyright 2009 - 12 Demo Source and Support. All rights reserved.
All other trademarks are property of their respective owners.