The C++ function std::list::erase() removes single element from the the list and decreases it's size by one.
DeclarationFollowing is the declaration for std::list::erase() function form std::list header.
C++98iterator erase (iterator position);C++11
iterator erase (const_iterator position);Parameters
position − Iterator to the list element.
Return valueReturns a random access iterator which points to the location from where element was removed.
ExceptionsIf position is invalid then behavior is undefined.
Time complexityLinear i.e. O(n)
ExampleThe following example shows the usage of std::list::erase() function.
#include <iostream> #include <list> using namespace std; int main(void) { list<int> l = {1, 2, 3, 4, 5}; cout << "Size of list befor erase operation = " << l.size() << endl; l.erase(l.begin()); cout << "Size of list after erase operation = " << l.size() << endl; cout << "List contains following elements" << endl; for (auto it = l.begin(); it != l.end(); ++it) cout << *it << endl; return 0; }
Let us compile and run the above program, this will produce the following result −
Size of list befor erase operation = 5 Size of list after erase operation = 4 List contains following elements 2 3 4 5
list.htm
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4