Forward List and List of Tuples in C++ with Examples
Last Updated :
24 Dec, 2021
What is Forward List?
Forward list in STL is used to implement a singly linked list. It was introduced from C++11 onwards, forward lists are more useful than other containers in insertion, removal, and moving operations (like sort) and allow time constant insertion and removal of elements.
It differs from the list by the fact that the forward list keeps track of the location of only the next element while the list keeps track of both the next and previous elements, thus increasing the storage space required to store each element.
The drawback of a forward list is that it cannot be iterated backward and its individual elements cannot be accessed directly.
Forward List is preferred over the list when only forward traversal is required (same as singly linked list is preferred over doubly linked list) as we can save space. Some example cases are, chaining in hashing, adjacency list representation of the graph, etc.
Functions associated with forward list:
- push_front(): This function is used to insert the element at the first position in a forward list. The value from this function is copied to the space before the first element in the container. The size of the forward list increases by 1.
- pop_front(): This function is used to delete the first element of the list.
- empty(): Returns whether the list is empty(1) or not(0).
What is List?
Lists are sequence containers that allow non-contiguous memory allocation. As compared to vector, the list has slow traversal, but once a position has been found, insertion and deletion are quick. Normally, when we say a List, we talk about a doubly linked list. For implementing a singly linked list, we use a forward list.
Functions associated with a list:
- front(): Returns the value of the first element in the list.
- back(): Returns the value of the last element in the list.
- push_front(x): Adds a new element ‘x’ at the beginning of the list.
- push_back(x): Adds a new element ‘x’ at the end of the list.
- empty(): Returns whether the list is empty(1) or not(0).
What is Tuple?
A tuple in C++ is an object that has the ability to group a number of elements. The elements can be of the same type as well as different data types. The order in which tuple elements are initialized can be accessed in the same order.
Functions associated with a tuple:
1. make_tuple(): It is used to assign tuples with values. The values passed should be in order with the values declared in the tuple.
2. get(): It is used to access the tuple values and modify them, it accepts the index and tuple name as arguments to access a particular tuple element.
Forward list of tuples
In C++, A forward list of tuples is a forward list in which each element is a tuple itself. Although, a tuple can contain more or fewer elements, for simplicity we have used tuples having three elements only.
Syntax:
forward_list<tuple<dataType1, dataType2, dataType3> myForwardList;
Here,
dataType1, dataType2, and dataType3 are similar or dissimilar data types.
Example 1: Below is the C++ program to demonstrate the working of forward list of tuples.
C++
// C++ program to demonstrate
// the working of forward list
// of tuples
#include <bits/stdc++.h>
using namespace std;
// Function to print forward
// list elements
void print(forward_list<tuple<int, int,
int>> &forwardListOftuples)
{
for (auto currentTuple : forwardListOftuples)
{
// Each element of the forward list is
// a tuple itself
tuple<int, int, int> tuple = currentTuple;
cout << "[ ";
// Printing tuple elements
cout << get<0>(currentTuple) << ' ' <<
get<1>(currentTuple) << ' ' <<
get<2>(currentTuple);
cout << ']';
cout << '\n';
}
}
// Driver code
int main()
{
// Declaring a forward list of tuples
// having integer values only
forward_list<tuple<int, int, int> >
forwardListOftuples;
// Declaring a tuple
tuple<int, int, int> tuple1;
// Initializing the
// tuple
tuple1 = make_tuple(11, 22, 33);
// Push the tuple at the back
// in the forward list
forwardListOftuples.push_front(tuple1);
// Declaring another tuple
tuple<int, int, int> tuple2;
// Initializing the
// tuple
tuple2 = make_tuple(33, 44, 55);
// Push the tuple at the front
// in the forward list
forwardListOftuples.push_front(tuple2);
// Declaring another tuple
tuple<int, int, int> tuple3;
// Initializing the tuple
tuple3 = make_tuple(55, 66, 77);
// Push the tuple at the front
// in the forward list
forwardListOftuples.push_front(tuple3);
// Declaring another tuple
tuple<int, int, int> tuple4;
// Initializing the tuple
tuple4 = make_tuple(77, 88, 99);
// Push the tuple at the front
// in the forward list
forwardListOftuples.push_front(tuple4);
// Calling print function
print(forwardListOftuples);
return 0;
}
Output:
[ 77 88 99]
[ 55 66 77]
[ 33 44 55]
[ 11 22 33]
Example 2: Below is the C++ program to demonstrate the working of forward list of tuples.
C++
// C++ program to demonstrate
// the working of forward list
// of tuples
#include <bits/stdc++.h>
using namespace std;
// Function to print forward
// list elements
void print(forward_list<tuple<string, string,
bool>> &forwardListOftuples)
{
for (auto currentTuple : forwardListOftuples)
{
// Each element of the forward list is
// a tuple itself
tuple<string, string, bool> tuple =
currentTuple;
cout << "[ ";
// Printing tuple elements
cout << get<0>(currentTuple) << ' ' <<
get<1>(currentTuple) << ' ' <<
get<2>(currentTuple);
cout << ']';
cout << '\n';
}
}
// Driver code
int main()
{
// Declaring a forward list of tuples
// having first two values of string
// type and third value as bool type
forward_list<tuple<string, string, bool>>
forwardListOftuples;
// Declaring a tuple
tuple<string, string, bool> tuple1;
// Initializing the
// tuple
tuple1 = make_tuple("GeeksforGeeks",
"Computer Science", 0);
// Push the tuple at the back
// in the forward list
forwardListOftuples.push_front(tuple1);
// Declaring another tuple
tuple<string, string, bool> tuple2;
// Initializing the
// tuple
tuple2 = make_tuple("Java", "C++", 1);
// Push the tuple at the front
// in the forward list
forwardListOftuples.push_front(tuple2);
// Declaring another tuple
tuple<string, string, bool> tuple3;
// Initializing the tuple
tuple3 = make_tuple("GFG", "C", 1);
// Push the tuple at the front
// in the forward list
forwardListOftuples.push_front(tuple3);
// Declaring another tuple
tuple<string, string, bool> tuple4;
// Initializing the tuple
tuple4 = make_tuple("Swift", "Python", 0);
// Push the tuple at the front
// in the forward list
forwardListOftuples.push_front(tuple4);
// Calling print function
print(forwardListOftuples);
return 0;
}
Output:
[ Swift Python 0]
[ GFG C 1]
[ Java C++ 1]
[ GeeksforGeeks Computer Science 0]
List of tuples
In C++, a list of tuples is a list in which each element is a tuple itself. Although, a tuple can contain more or fewer elements, for simplicity we have used tuples having three elements only.
Syntax:
list<tuple<dataType1, dataType2, dataType3> myList;
Here,
dataType1, dataType2, and dataType3 are similar or dissimilar data types.
Example 1: Below is the C++ program to demonstrate the working of list of tuples.
C++
// C++ program to demonstrate
// the working of list of tuples
#include <bits/stdc++.h>
using namespace std;
// Function to print
// list elements
void print(list<tuple<int, int,
int>> &listOftuples)
{
for (auto currentTuple : listOftuples)
{
// Each element of the List is
// a tuple itself
tuple<int, int, int> tuple = currentTuple;
cout << "[ ";
// Printing tuple elements
cout << get<0>(currentTuple) << ' ' <<
get<1>(currentTuple) << ' ' <<
get<2>(currentTuple);
cout << ']';
cout << '\n';
}
}
// Driver code
int main()
{
// Declaring a List of tuples
// having all values of integer type
list<tuple<int, int, int>>
listOftuples;
// Declaring a tuple
tuple<int, int, int> tuple1;
// Initializing the
// tuple
tuple1 = make_tuple(11, 22, 33);
// Push the tuple at the back
// in the List
listOftuples.push_front(tuple1);
// Declaring another tuple
tuple<int, int, int> tuple2;
// Initializing the
// tuple
tuple2 = make_tuple(33, 44, 55);
// Push the tuple at the front
// in the List
listOftuples.push_front(tuple2);
// Declaring another tuple
tuple<int, int, int> tuple3;
// Initializing the tuple
tuple3 = make_tuple(55, 66, 77);
// Push the tuple at the front
// in the List
listOftuples.push_front(tuple3);
// Declaring another tuple
tuple<int, int, int> tuple4;
// Initializing the tuple
tuple4 = make_tuple(77, 88, 99);
// Push the tuple at the front
// in the List
listOftuples.push_front(tuple4);
// Calling print function
print(listOftuples);
return 0;
}
Output:
[ 77 88 99]
[ 55 66 77]
[ 33 44 55]
[ 11 22 33]
Example 2: Below is the C++ program to demonstrate the working of list of tuples.
C++
// C++ program to demonstrate
// the working of list of tuples
#include <bits/stdc++.h>
using namespace std;
// Function to print
// list elements
void print(list<tuple<string, string,
bool>> &listOftuples)
{
for (auto currentTuple : listOftuples)
{
// Each element of the List is
// a tuple itself
tuple<string, string, bool> tuple =
currentTuple;
cout << "[ ";
// Printing tuple elements
cout << get<0>(currentTuple) << ' ' <<
get<1>(currentTuple) << ' ' <<
get<2>(currentTuple);
cout << ']';
cout << '\n';
}
}
// Driver code
int main()
{
// Declaring a List of tuples
// having first two values as string type
// and third value is of bool type
list<tuple<string, string, bool>>
listOftuples;
// Declaring a tuple
tuple<string, string, bool> tuple1;
// Initializing the
// tuple
tuple1 = make_tuple("GeeksforGeeks",
"Computer Science", 0);
// Push the tuple at the back
// in the List
listOftuples.push_front(tuple1);
// Declaring another tuple
tuple<string, string, bool> tuple2;
// Initializing the
// tuple
tuple2 = make_tuple("Java", "C++", 1);
// Push the tuple at the front
// in the List
listOftuples.push_front(tuple2);
// Declaring another tuple
tuple<string, string, bool> tuple3;
// Initializing the tuple
tuple3 = make_tuple("GFG", "C", 1);
// Push the tuple at the front
// in the List
listOftuples.push_front(tuple3);
// Declaring another tuple
tuple<string, string, bool> tuple4;
// Initializing the tuple
tuple4 = make_tuple("Swift", "Python", 0);
// Push the tuple at the front
// in the List
listOftuples.push_front(tuple4);
// Calling print function
print(listOftuples);
return 0;
}
Output:
[ Swift Python 0]
[ GFG C 1]
[ Java C++ 1]
[ GeeksforGeeks Computer Science 0]
Similar Reads
Forward List in C++ STL In C++, forward_list container provides the implementation of singly linked list data structure. It stores data in non-contiguous memory where each element points to the next element in the sequence. This makes insertion and deletion faster once the position of the element is known.Example:C++#inclu
7 min read
Commonly Used Methods
forward_list::begin() and forward_list::end() in C++ STLForward list in STL implements singly linked list. Introduced from C++11, the forward list is more useful than other containers in insertion, removal, and moving operations (like sort) and allows time constant insertion and removal of elements. It differs from list by the fact that the forward list
3 min read
forward_list::push_front() and forward_list::pop_front() in C++ STLForward list in STL implements singly linked list. Introduced from C++11, forward list are useful than other containers in insertion, removal and moving operations (like sort) and allows time constant insertion and removal of elements.It differs from list by the fact that forward list keeps track of
4 min read
forward_list assign() function in C++ STLThe forward_list::assign() is a function in C++ STL which assigns new content to a forward list, replacing its current content and adjusting its size as required.Syntax: Version 1:forward_list_name.assign(iterator it1, iterator it2) Version 2:forward_list_name.assign(int n, val) Version 3:forward_li
2 min read
forward_list::front() and forward_list::empty() in C++ STLForward list in STL implements singly linked list. Introduced from C++11, forward list are useful than other containers in insertion, removal and moving operations (like sort) and allows time constant insertion and removal of elements.It differs from list by the fact that forward list keeps track of
3 min read
forward_list::remove() and forward_list::remove_if() in C++ STLForward list in STL implements singly linked list. The forward list was introduced in C++11, and is useful than other containers in insertion, removal, and moving operations (like sort) and allows time constant insertion and removal of elements. It differs from the list by the fact that the forward
4 min read
forward_list::clear() and forward_list::erase_after() in C++ STLForward list in STL implements singly linked list. Introduced from C++11, forward list are useful than other containers in insertion, removal and moving operations (like sort) and allows time constant insertion and removal of elements.It differs from list by the fact that forward list keeps track of
4 min read
forward_list::reverse() in C++ STLstd::forward_list::reverse() is an inbuilt function in CPP STL which reverses the order of the elements present in the forward_list. Syntax: forwardlist_name.reverse()Parameter: The function does not accept any parameter. Return value: The function has no return value. It reverses the forward list.
1 min read
forward_list::swap() in C++ STLThe forward_list::swap() is a built-in function in CPP STL which exchanges the contents of the first given forward_list with another forward_list. Syntax: swap(forward_list first, forward_list second) or forward_list1.swap(forward_list second) Parameters: The function accepts two parameters which ar
3 min read
std::forward_list::sort() in C++ STLForward list in STL implements singly linked list. Introduced from C++11, forward list are useful than other containers in insertion, removal and moving operations (like sort) and allows time constant insertion and removal of elements.It differs from list by the fact that forward list keeps track of
3 min read
Other Member Methods
Forward List and List of Pairs in C++ with Examples Forward List Forward list in STL implements singly linked list. Introduced from C++11, forward lists are more useful than other containers in insertion, removal, and moving operations (like sort) and allow time constant insertion and removal of elements. It differs from the list by the fact that the
8 min read
Forward List and List of Tuples in C++ with Examples What is Forward List? Forward list in STL is used to implement a singly linked list. It was introduced from C++11 onwards, forward lists are more useful than other containers in insertion, removal, and moving operations (like sort) and allow time constant insertion and removal of elements. It differ
9 min read
Difference Between Forward List and List in C++ Forward List is a sequence container that allows unidirectional sequential access to its data. It contains data of the same type. In STL, it has been implemented using Singly Linked List, which requires constant time for insertion and deletion. Elements of the forward list are scattered in the memor
3 min read
Common Forward List Programs