C++ Forward_list Library - merge() Function

---

Description

The C++ function std::forward_list::merge() merges two sorted forward_lists into one by using move semantics. The forward_lists should be sorted into ascending order.

Declaration

Following is the declaration for std::forward_list::merge() function form std::forward_list header.

C++11

void merge (forward_list&& x);

Parameters

x − Another forward_list object of same type.

Return value

None

Exceptions

This member function never throws exception.

Time complexity

Linear i.e. O(n)

Example

The following example shows the usage of std::forward_list::merge() function.

#include <iostream>
#include <forward_list>

using namespace std;

int main(void) {

   forward_list<int> fl1 = {1, 5, 11, 31};
   forward_list<int> fl2 = {10, 20, 30};

   fl1.merge(move(fl2));

   cout << "List contains following elements" << endl;

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

   return 0;
}

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

List contains following elements
1
5
10
11
20
30
31