Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from https://www.tutorialspoint.com/cpp_standard_library/cpp_vector_insert_range.htm below:

C++ Vector Library - insert() Function

The C++ function std::vector::insert() extends vector by inserting new elements in the container. Reallocation happens if there is need of more space

This function increases container size.

Following is the declaration for std::vector::insert() function form std::vector header.

template <class InputIterator>
void insert (iterator position, InputIterator first, InputIterator last);

template <class InputIterator>
iterator insert (const_iterator position, InputIterator first, 
   InputIterator last);

• position − Index in the vector where new element to be inserted.

• first − Input iterator to the initial position in range.

• last − Input iterator to the final position in range.

Returns an iterator which points to the newly inserted element.

Linear i.e. O(n)

The following example shows the usage of std::vector::insert() function.

#include <iostream>
#include <vector>

using namespace std;

int main(void) {
   vector<int> v1 = {2, 3, 4, 5};
   vector<int> v2 = {1};

   v2.insert(v2.begin() + 1, v1.begin(), v1.begin() + 3);

   for (auto it = v2.begin(); it != v2.end(); ++it)
      cout << *it << endl;

   return 0;
}

Let us compile and run the above program, this will produce the following result −

1
2
3
4

vector.htm

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4