C ++ standard template library list

Lists stores elements in the linked list sequentially. Compared with vectors, lists allows fast insertion and deletion, but random access is slow.

Assign () assigns a value to the list
Back () returns the last element
Begin () returns the iterator pointing to the first element.
Clear () delete all elements
Empty () returns true if list is empty.
End () returns the iterator at the end.
Erase () deletes an element.
Front () returns the first element
Get_allocator () returns the list Configurator
Insert () inserts an element into the list.
Max_size () returns the maximum number of elements that a list can hold.
Merge () combines two lists
Pop_back () Delete the last element
Pop_front () deletes the first element
Push_back () adds an element to the end of the list.
Push_front () adds an element to the list header.
Rbegin () returns the reverse iterator pointing to the first element.
Remove () delete an element from the list
Remove_if () deletes an element based on the specified conditions.
Rend () points to the reverse iterator at the end of the list
Resize () changes the list size.
Reverse () Reverse the list element
Size () returns the number of elements in the list.
Sort () sorts the list
Splice () merges two lists
Swap () exchange two lists
Unique () deletes repeated elements in the list.