Queue in C++ Standard Template Library (STL)
Queues are a type of container adaptors that operate in a first in first out (FIFO) type of arrangement. Elements are inserted at the back (end) and are deleted from the front. Queues use an encapsulated object of deque or list (sequential container class) as its underlying container, providing a specific set of member functions to access its elements.
Following is an example to demonstrate the queue and its various methods.
The queue gquiz is : 10 20 30 gquiz.size() : 3 gquiz.front() : 10 gquiz.back() : 30 gquiz.pop() : 20 30
Methods of Queue are:
The time complexity and definition of the following functions are as follows:
|queue::empty()||Returns whether the queue is empty. It return true if the queue is empty otherwise returns false.|
|queue::size()||Returns the size of the queue.|
|queue::swap()||Exchange the contents of two queues but the queues must be of the same data type, although sizes may differ.|
|queue::emplace()||Insert a new element into the queue container, the new element is added to the end of the queue.|
|queue::front()||Returns a reference to the first element of the queue.|
|queue::back()||Returns a reference to the last element of the queue.|
|queue::push(g)||Adds the element ‘g’ at the end of the queue.|
|queue::pop()||Deletes the first element of the queue.|
C++ program for some more methods
The first queue is : 1 2 3 The second queue is : 4 5 6 After swapping, the first queue is : 4 5 6 After swapping the second queue is : 1 2 3 0
Recent Articles on C++ Queue
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.