Course


Lists

Learn about the C++ STL Lists

C++ Lists

list: Linked list of variables, struct or objects. Insert/remove anywhere. Lists are sequence containers that allow non-contiguous memory allocation. As compared to vector, 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 doubly linked list. For implementing a singly linked list, we use forward list.

C++ (GCC 9.2.0)
  • Input  

Functions used with 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(g) – Adds a new element ‘g’ at the beginning of the list .
  • push_back(g) – Adds a new element ‘g’ at the end of the list.
  • pop_front() – Removes the first element of the list, and reduces size of the list by 1.
  • pop_back() – Removes the last element of the list, and reduces size of the list by 1
  • list::begin() and list::end() in C++ STL– begin() function returns an iterator pointing to the first element of the list
  • end() – end() function returns an iterator pointing to the theoretical last element which follows the last element.
  • empty() – Returns whether the list is empty(1) or not(0).
  • insert() – Inserts new elements in the list before the element at a specified position.
  • erase() – Removes a single element or a range of elements from the list.
  • assign() – Assigns new elements to list by replacing current elements and resizes the list.
  • remove() – Removes all the elements from the list, which are equal to given element.
  • list::remove_if() in C++ STL– Used to remove all the values from the list that correspond true to the predicate or condition given as parameter to the function.
  • reverse() – Reverses the list.
  • size() – Returns the number of elements in the list.
  • resize() - resize a list container.
  • sort() – Sorts the list in increasing order.
  • max_size() function in C++ STL– Returns the maximum number of elements a list container can hold.
  • unique() in C++ STL– Removes all duplicate consecutive elements from the list.
  • clear() in C++ STL– clear() function is used to remove all the elements of the list container, thus making it size 0.
  • swap() in C++ STL– This function is used to swap the contents of one list with another list of same type and size.
  • splice() function in C++ STL– Used to transfer elements from one list to another.
  • merge() function in C++ STL– Merges two sorted lists into one
  • emplace() function in C++ STL– Extends list by inserting new element at a given position.

C++ Scientific Programming