Member functions present in all container adaptors

assignment operator
c1 = c2
Assigns one container adaptor to another like container adaptor (stack to stack, queue to queue, priority_queue to priority_queue).
testing for empty
empty()
Returns true if container is empty, and otherwise false.
getting container size
size()
Returns number of elements currently in container.
inserting a value
push(val)
Adds an element to the container.
deleting a value
pop()
Removes the appropriate element from the container (top element for a stack, front element for a queue, and highest-priority element for a priority queue).

Member functions present in some container adaptors
but not common to all

queue-only member functions
front()
Returns a [const] reference to the first element in a queue.
back()
Returns a [const] reference to the last element in a queue.
stack-and-priority_queue-only member functions
top()
Returns a [const] reference to the top element in a stack, or to the element with highest priority in a priority queue.
stack and priority_queue comparison operators
==
Returns true if two like containers are equal (contain the same elements in the same order), and otherwise false.
!=
Returns true if two like containers are not equal, and otherwise false.
<
Returns true if first of two like containers is less than the second (in the lexicographic sense), and otherwise false.
<=
Returns true if first of two like containers is less than or equal to the second (in the lexicographic sense), and otherwise false.
>
Returns true if first of two like containers is greater than the second (in the lexicographic sense), and otherwise false.
>=
Returns true if first of two like containers is greater than or equal to the second (in the lexicographic sense), and otherwise false.