{"id":9036,"date":"2022-07-12T07:46:56","date_gmt":"2022-07-12T07:46:56","guid":{"rendered":"https:\/\/www.prepbytes.com\/blog\/?p=9036"},"modified":"2022-08-30T03:10:32","modified_gmt":"2022-08-30T03:10:32","slug":"stack-queue-in-python-using-module-queue","status":"publish","type":"post","link":"https:\/\/prepbytes.com\/blog\/stack-queue-in-python-using-module-queue\/","title":{"rendered":"Stack, Queue in Python using Module queue"},"content":{"rendered":"

\"\"<\/p>\n

In python, it is quite easy to implement stack and queue data structures. Stack works on the principle of LIFO (Last in First out)<\/strong> i.e. element which is inserted in last will be removed first. And queue works on the principle of FIFO (First in First out)<\/a><\/strong> i.e. element which is inserted first will be removed first. In Python, there are inbuilt functions and classes which will make our code shorter and simple.<\/p>\n

\"\"<\/p>\n

\"\"<\/p>\n

The queue module is used to implement multi-producer, multi-consumer queues and it is very useful in threaded programming when we have to exchange the information safely between multiple threads. The Queue class in this module implements all the required locking semantics and it depends on the thread support\u2019s availability in Python.
\nThe queue module has three types of queue implementation, which differ only in the order in which the entries are retrieved. For the FIFO queue, the first element added is the first element removed and for the LIFO queue(it works like a stack), the most recent element added will be the first element which will be removed. And for priority queue, elements are kept in sorted order (using the heapq module) and the lowest valued element will be removed first.<\/p>\n

Classes and exceptions in the queue module is as follows:<\/h3>\n

class queue.Queue(maxsize = 0)<\/h4>\n

This is a constructor for a FIFO queue. Argument maxsize is an integer which sets the upper bound limit on the number of elements that can be placed in the queue. Insertion operation will be blocked once this size has been reached, until the queue elements are consumed. If the value of maxsize will be less than or equal to zero then the size of the queue will be infinite.<\/p>\n

class queue.LifoQueue(maxsize=0)<\/h4>\n

This is a constructor for a LIFO queue. Argument maxsize is an integer which sets the upper bound limit on the number of elements that can be placed in the queue. Insertion operation will be blocked once this size has been reached, until the queue elements are consumed. If the value of maxsize will be less than or equal to zero then the size of the queue will be infinite. This constructor works the same as stack data structures.<\/p>\n

class queue.PriorityQueue(maxsize=0)<\/h4>\n

This is a constructor for a priority queue. Argument maxsize is an integer which sets the upper bound limit on the number of elements that can be placed in the queue. Insertion operation will be blocked once this size has been reached, until the queue elements are consumed. If the value of maxsize will be less than or equal to zero then the size of the queue will be infinite. <\/p>\n

exception queue.Empty<\/h4>\n

This exception will be raised when non-blocking get() (or get_nowait()) is called on a queue object which is empty.<\/p>\n

exception queue.Full<\/h4>\n

This exception will be raised when non-blocking put() (or put_nowait()) is called on a queue object which is full.<\/p>\n

Queue Objects<\/h3>\n

Queue.qsize()<\/h4>\n

This function returns the approximate size of the queue.<\/p>\n

Queue.empty()<\/h4>\n

This function will return True if the queue is empty otherwise False. If empty() returns True it will not guarantee that a subsequent call to put() will not block. Similarly(), if empty() returns False it will not guarantee that a subsequent call to get() will not block.<\/p>\n

Queue.full()<\/h4>\n

This function will return True if the queue is full, else False will be returned. If full() returns True it will not guarantee that a subsequent call to get() will not block. Similarly, if full() returns False it will not guarantee that a subsequent call to put() will not block.<\/p>\n

Queue.put(item)<\/h4>\n

This function will put an item into the queue. <\/p>\n

Queue.get()<\/h4>\n

This function will remove and return an item from the queue.<\/p>\n

Example Code of Queue:<\/h3>\n\t\t\t\t\t\t