forward_list emplace_after() and emplace_front() in C++ STL

Given is the task to show the working of forward_list::emplace_after() and forward_list::emplace_front() functions in c++.

A forward_list only keeps linkage with the next element unlike normal list that keeps linkage with the next as well as the preceding elements, which helps iterations in both directions. But forward_list can only iterate in the forward direction.

The forward_list::emplace_after() and forward_list::emplace_front() functions are a part of the c++ standard library.

The forward_list::emplace_after() function is used to insert a new element inside a list after the element whose position is specified inside the argument

The forward_list::emplace_front() function is used to insert an element in the beginning of the list.

<forward_list> header file should be included to call the function.

forward_list::emplace_after()

Syntax

Forward_List_Name.emplace_after(iterator , element);

Parameters

The function accepts two parameters −

Iterator, the iterator contains the position at which the new element has to be placed.

Element, it contains the element that has to be placed.

Return Value

The function returns an iterator that points to the new element that has been placed inside the forward list.

forward_list::emplace_front()

Syntax

Forward_List_Name.emplace_front(element);

Parameters

The function accepts one parameter.

Return Value

The function does not return anything.

Example

Input: 11,34,56
Output: 41 11 34 56

Explanation −

Here we created a forwards list Lt with elements 11,34,56. Then we called the emplace_front() function that is used to insert a new element at the beginning of a forward list and here that element is 41.

So when we print the forward list, the output generated is 41 11 34 56 which has the first element as 41.

Approach used in the below program as follows −

• First create a list, let us say “Lt” of type int and assign it some values.
• Then call the function emplace_front() to place a new element at the beginning of the list.
• Then create an object of type auto, let us say “itr” that will work as our iterator to store the position to be passed into the emplace_after() position, next to which our new element will be placed. Give itr a location, let us say, the end of the list.
• Then call the emplace_after() function to enter the element at a specified position. The first argument should be the iterator “itr” that specifies the position in the list and the second argument should be the element to be placed at that position.

Algorithm

Start
Step 1->In function main()
   Initialize forward_list<int> Lt={}
   Call function Lt.emplace_front()
   Initialize auto itr=Lt.end();
   Call Lt.emplace_after(itr , element)
   End
Stop

Example

#include<iostream>
#include<list>
using namespace std;
int main() {
   forward_list<int> Lt = { 5,6,7,8 };
   //Using the emplace_front() function to place element at the beginning.
   Lt.emplace_front(3);
   auto itr = Lt.end();
   /*Using the emplace_after() function to place an element after the location specified*/
   Lt.emplace_after(itr , 10)
   //Displaying the list
   for(auto itr = Lt.begin() ; itr!=Lt.end ; itr++)
   cout<<” *itr ”<<” ”;
   return 0;
}

Output

If we run the above code it will generate the following output −

3 5 6 7 8 10

Sunidhi Bansal

Updated on 20-Jan-2020 10:13:50

• Related Questions & Answers
• list emplace() function in C++ STL
• queue::emplace() in C++ STL
• map emplace() in C++ STL
• multimap::emplace() in C++ STL
• stack emplace() in C++ STL
• emplace vs insert in C++ STL
• list::front() and list::back() in C++ STL
• list front() function in C++ STL
• forward list::cend() in C++ STL
• Forward list assign() function in C++ STL
• forward_list::front() and forward_list::empty() in C++ STL
• queue::front() and queue::back() in C++ STL
• deque front( ) and deque back( ) in C++ in STL
• Python Front and rear range deletion in a list?
• list begin( ) and list end( ) in C++ STL
• list::emplace_front() and list::emplace_back() in C++ STL