World's Best AI Learning Platform with profoundly Demanding Certification Programs
Designed by IITian's, only for AI Learners.
Download our e-book of Introduction To Python
Related Blog
Top Discussion
How to leave/exit/deactivate a Python virtualenvironment Exception Type: JSONDecodeError at /update/ Exception Value: Expecting value: line 1 column 1 (char 0) Which are different modes to open a file ? What is a random forest model and how do you build a random forest model? How to plot Bubble plot with Encircling? How to integrate Sales force and Django? What is list and explain list methods? Find the Largest and smallest items in a collection. Join Discussion
Top Courses
Machine Learning with Python & Statistics
4 (4,001 Ratings)
218 Learners
Webinars
Live Masterclass on : "How Machine Learns in Machine Learning"
Dec 9th (6:00 PM) 226 Registered
Python Design Patterns - Queues
Neha Kumawat
a year ago
Queue is a collection of objects, which define a simple data structure following the FIFO (Fast In Fast Out) and the LIFO (Last In First Out) procedures. The insert and delete operations are referred as enqueue and dequeue operations.
Queues do not allow random access to the objects they contain.
How to implement the FIFO procedure?
The following program helps in the implementation of FIFO −
import Queue
q = Queue.Queue()
#put items at the end of the queue
for x in range(4):
q.put("item-" + str(x))
#remove items from the head of the queue
while not q.empty():
print q.get()
Output
The above program generates the following output −
How to implement the LIFO procedure?
The following program helps in the implementation of the LIFO procedure −
import Queue
q = Queue.LifoQueue()
#add items at the head of the queue
for x in range(4):
q.put("item-" + str(x))
#remove items from the head of the queue
while not q.empty():
print q.get()
Output
The above program generates the following output −
What is a Priority Queue?
Priority queue is a container data structure that manages a set of records with the ordered keys to provide quick access to the record with smallest or largest key in specified data structure.
How to implement a priority queue?
The implementation of priority queue is as follows −
import Queue
class Task(object):
def __init__(self, priority, name):
self.priority = priority
self.name = name
def __cmp__(self, other):
return cmp(self.priority, other.priority)
q = Queue.PriorityQueue()
q.put( Task(100, 'a not agent task') )
q.put( Task(5, 'a highly agent task') )
q.put( Task(10, 'an important task') )
while not q.empty():
cur_task = q.get()
print 'process task:', cur_task.name
Output
The above program generates the following output −