[STL] common container Methods

1. Vector
Constructors Constructor
Operators assigns values to or compares vectors.
Assign () assigns values to elements in a vector.
At () returns the element at the specified position.
Back () returns the last element.
In () returns the iterator of the first element
Capacity () returns the number of elements that a vector can hold (without allocating memory again)
Clear () Clear all elements
Empty () determines whether the vector is null (null when true is returned)
End () returns the iterator for the last element)
Erase () deletes a specified Element
Front () returns the first element
Get_allocator () returns the memory distributor of the vector.
Insert () inserts an element into a vector.
Max_size () returns the maximum number of elements that a vector can hold (upper limit)
Pop_back () remove the last element
Push_back () adds an element at the end of the vector.
Rbegin () returns the inverse iterator at the end of the vector.
Rend () returns the inverse iterator starting with the vector.
Reserve () sets the minimum number of elements in a vector.
Resize () changes the size of the number of vector Elements
Size () returns the size of the number of vector elements.
Swap () swap two vectors
2. List
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.
3. Stack
Operation comparison and stack allocation
If the empty () Stack is empty, true is returned.
Pop () removes the top element of the stack.
Push () adds elements to the top of the stack
Size () returns the number of elements in the stack.
Top () returns the top element of the stack.
4. Queue
Back () returns the last element
Empty () returns true if the queue is empty
Front () returns the first element
Pop () deletes the first element
Push () adds an element to the end
Size () returns the number of elements in the queue.