Mastering Fundamentals: C++ and Data Structures

List in C++

Board Infinity
Board Infinity
List in C++

    Header in C++

    C++ Pointers

    Displaying A to Z characters using a loop: C++ Program

    Working of Jump Statements in C++

    Inline Functions in C++

    Understanding Substr() Function in C++

    Constructor vs Destructor in C++

    Understanding Copy Constructor in C++

    Becoming Friends with Friend Function in C++

    How File Handling Works in C++

    A Detailed Overview of Macros in C++

    List in C++

    A Set Data Structure (STL) In C++

    A Quick Guide to Circular Linked List in C++

    Stack using Linked List in C++

    How to Sort a Vector in C++

    What are Priority Queues in C++?

    Guide To 5 Data Structures In C++

Introduction

The term "storage container" in C++ refers to the std::list. You can add and remove things from the std:list from any location. A doubly-linked list is used to implement standard::list. This indicates that bi-directional and sequential access to list data is possible. The STL (Standard Template Library) provides sequential access in all directions but not fast random access.

List components can be dispersed among various memory blocks. A container stores the data that is required for sequential access. During runtime, the std::list might grow and contract from both ends as necessary. The storage needs are automatically met by an internal allocator.

The best use cases for lists in C++ are:

  • In comparison to array and vector, the std::list performs better.
  • In terms of inserting, moving, and withdrawing pieces from any position, they perform better.
  • Algorithms that heavily rely on these operations also perform better when used with the std::list.

Syntax

We must import the list> header file in order to define the std::list.

template < class Type, class Alloc =allocator<T> > class list;

Here is a description of the above parameters:

  • T – Defines the type of element contained. You can substitute "T" by any data type, even user-defined types.
  • Alloc – establishes the allocator object's type. By default, this uses the allocator class template. It uses a straightforward memory allocation paradigm and is value-dependent.

Code Example

#include <iostream>
#include <list>
using namespace std;
int main(void) {
 list<int> l;
 list<int> l1 = { 10, 20, 30 };
 list<int> l2(l1.begin(), l1.end());
 list<int> l3(move(l1)); 
cout << "Size of list l: " << l.size() << endl;
 cout << "List l2 contents: " << endl;
 for (auto it = l2.begin(); it != l2.end(); ++it)
       cout << *it << endl;
 cout << "List l3 contents: " << endl;
 for (auto it = l3.begin(); it != l3.end(); ++it)
 cout << *it << endl;
 return 0;
}

write your code here: Coding Playground

Code Example for Deletion of Elements

#include <algorithm>
#include <iostream>
#include <list>
using namespace std;
int main() {
 std::list<int> my_list = { 12, 5, 10, 9 };
 cout << "List elements before deletion: ";
 for (int x : my_list) {
 std::cout << x << '\n';
 }
 list<int>::iterator i = my_list.begin();
 my_list.erase(i);
 cout << "\nList elements after deletion: ";
 for (int x : my_list) {
 std::cout << x << '\n';
 }
 return 0;
}

write your code here: Coding Playground

Summary of the List Data Type in C++

  • The storage container is known as std::list.
  • It permits the constant deletion of things as well as the insertion of things from any location.
  • The system is set up as a doubly-linked architecture.
  • Both sequential and bidirectional access is possible to the std::list data. Fast random access is not supported by std::list.
  • It does, however, permit sequential access in every direction.
  • List components from std::list can be dispersed across many memory blocks.
  • Std::list can be shrunk or expanded from both ends as necessary during runtime.
  • The insert() function is used to add entries to a std::list.
  • Use of the erase() method is required to remove entries from the std::list.