#Stl vector code code

The size( ) function displays the size of the vector. The push_back( ) member function inserts value at the end of the vector, expanding its size as needed. Here are following points to be noted related to various functions we used in the above example −

#Stl vector code code

When the above code is compiled and executed, it produces the following result − Let us take the following program that demonstrates the vector container (a C++ Standard Template) which is similar to an array with an exception that it automatically handles its own storage requirements in case it grows − For now, keep in mind that all the three components have a rich set of pre-defined functions which help us in doing complicated tasks in very easy fashion. We will discuss about all the three C++ STL components in next chapter while discussing C++ Standard Library. These collections may be containers or subsets of containers. Iterators are used to step through the elements of collections of objects. They provide the means by which you will perform initialization, sorting, searching, and transforming of the contents of containers. There are several different types of containers like deque, list, vector, map etc.Īlgorithms act on containers. The C++ STL (Standard Template Library) is a powerful set of C++ template classes to provide general-purpose classes and functions with templates that implement many popular and commonly used algorithms and data structures like vectors, lists, queues, and stacks.Īt the core of the C++ Standard Template Library are following three well-structured components − Sr.NoĬontainers are used to manage collections of objects of a certain kind. Hope you have already understood the concept of C++ Template which we have discussed earlier.