Vector Capacity vs size : Vector « Data Structure « C++

Home C++ 1. Bitset 2. Class 3. Console 4. Data Structure 5. Data Type 6. Deque 7. Development 8. File 9. Function 10. Generic 11. Language 12. List 13. Map Multimap 14. Overload 15. Pointer 16. Qt 17. Queue Stack 18. Set Multiset 19. STL Algorithms Binary search 20. STL Algorithms Heap 21. STL Algorithms Helper 22. STL Algorithms Iterator 23. STL Algorithms Merge 24. STL Algorithms Min Max 25. STL Algorithms Modifying sequence operations 26. STL Algorithms Non modifying sequence operations 27. STL Algorithms Sorting 28. STL Basics 29. String 30. Valarray 31. Vector C / ANSI-C C Tutorial C++ Tutorial Visual C++ .NET

C++ » Data Structure » Vector Screenshots  Vector Capacity vs size #include <iostream> #include <vector> using namespace std; int main() {   vector<char> vectorObject(10);   cout << "Initial size: " << vectorObject.size() << endl;   cout << "Initial capacity: " << vectorObject.capacity();   cout << "\n\n";   vectorObject.reserve(20); // reserve more space   cout << "Size after reserve: " << vectorObject.size() << endl;   cout << "Capacity after reserve: " << vectorObject.capacity();   cout << "\n\n";   return 0; }                     Related examples in the same category 1. Perform an in-place merge for two vectors 2. Using Other Search functions 3. Matching Elements Using the equals and mismatch Operations 4. Creating and Resizing Vectors 5. Demonstrate count and count_if. 6. Demonstrate remove_copy in Vector 7. Access a vector using an iterator. 8. Demonstrate insert and erase. 9. Store a class object in a vector. 10. Demonstrate allocator's max_size() fucntion in vector 11. Demonstrate count() in vector 12. Demonstrate count_if(). 13. Demonstrate reverse in vector 14. Demonstrate insert_iterator in vector 15. Demonstrate adjacent_difference() in vector 16. Demonstrate inner_product() in vector 17. Demonstrate partial_sum() in Vector 18. Storing Class Objects with overloaded operators in a Vector 19. Vector Init Array 20. Use istream_iterator with the copy algorithm 21. Demonstrate remove_copy and replace_copy. 22. Vector: Insert Erase Sort 23. Demonstrate accumulate() in vector 24. end() in vector 25. Use pop_back() and empty(). 26. Access the elements of a vector through an iterator. 27. The basic operation of a vector: size, push_back, 28. Accessing a Vector Through an Iterator 29. Use istream_iterator to read various data types 30. Create permutations based on vector 31. Work with heaps: make_heap from vector 32. Demonstrating the four ways that vectors can be created. 33. Using clear()