In computer science we go for working on a large variety of programs. Each of them has their own domain and utility. Based on the purpose and environment of the program creation, we have a large number of data structures available to choose from. One of them is 'queues. Before discussing about this data type let us take a look at its syntax.
This data structure works on the FIFO technique, where FIFO stands for First In First Out. The element which was first inserted will be extracted at the first and so on. There is an element called as 'front' which is the element at the front most position or say the first position, also there is an element called as 'rear' which is the element at the last position. In normal queues insertion of elements take at the rear end and the deletion is done from the front.
Queues in the application areas are implied as the container adaptors.
The containers should have a support for the following list of operations:
T: The argument specifies the type of the element which the container adaptor will be holding.
Container: The argument specifies an internal object of container where the elements of the queues are held.
Given below is a list of the queue member types with a short description of the same.
With the help of functions, an object or variable can be played with in the field of programming. Queues provide a large number of functions that can be used or embedded in the programs. A list of the same is given below:
Example: A simple program to show the use of basic queue functions.
The queue fquiz is : 10 20 30 fquiz.size() : 3 fquiz.front() : 10 fquiz.back() : 30 fquiz.pop() : 20 30