Repository navigation
Expand file tree
/
Copy pathqueue.py
More file actions
111 lines (94 loc) · 4.11 KB
/
Copy pathqueue.py
File metadata and controls
111 lines (94 loc) · 4.11 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
#===============================================================================
# implementation of Queue and Priority Queue using Arrays
#===============================================================================
import numpy
import random
class Queue:
#===============================================================================
# Arrays, linked lists, trees, etc. are best for
# data that represents real objects.
#
# Stacks & Queues are instead used to complete a
# task and are soon after discarded.
#
# Stacks & Queues
# 1. Allow only a single item to be added or removed at a time
# 2. Queues allow access to the first item inserted (FIFO)
#===============================================================================
#===========================================================================
# initializing Queue with specific size
#===========================================================================
def __init__(self, queue_size):
self.queue_size = queue_size
self.queue_array = numpy.array([None] * queue_size)
#Sets stack as empty
self.front , self.rear, self.number_of_items = 0, 0, 0
print "Queue of size %d initialized." %(self.queue_size)
self.display_queue()
def display_queue(self):
print "[ " ,
for element in self.queue_array:
if element != None:
if self.queue_array[self.rear - 1] == element and self.queue_array[self.front] == element:
print element, " [F] [R], " ,
elif self.queue_array[self.front] == element:
print element, " [F], " ,
elif self.queue_array[self.rear - 1] == element:
print element, " [R], " ,
else:
print element, " ," ,
else:
print " ," ,
print " ]"
def insert(self, value):
if self.number_of_items + 1 <= self.queue_size:
self.queue_array[self.rear] = value
self.rear += 1
self.number_of_items += 1
print "INSERT : %s added in Queue" %(value)
self.display_queue()
else:
print "Sorry but Queue is already full."
self.display_queue()
def insert_many(self, multiple_value):
for value in multiple_value:
self.insert(value)
#===========================================================================
# This priority insert will add items in order from high to low
#===========================================================================
def priority_insert(self, value):
if ( self.number_of_items == 0):
self.insert(value)
else:
for i in range(self.number_of_items - 1, -1, -1):
if( value > self.queue_array[i]):
self.queue_array[i + 1] = self.queue_array[i]
else: break
self.queue_array[self.front] = value
self.rear += 1
self.number_of_items += 1
self.display_queue()
def priority_insert_many(self, multiple_value):
for value in multiple_value:
self.priority_insert(value)
def remove(self):
if self.number_of_items > 0:
print "REMOVE : value %s was removed from Queue" %(self.queue_array[self.front])
self.queue_array[self.front] = None
self.front += 1
self.number_of_items -= 1
self.display_queue()
else:
print "Queue is already empty"
self.display_queue()
def peek(self):
if self.number_of_items > 0:
print " %s is the first element in Queue" %(self.queue_array[self.front])
else:
print "Queue is already empty"
queue_size = int(raw_input("Enter the Queue size : "))
new_queue = Queue(queue_size)
new_queue.insert_many(random.sample(xrange(0, 100), queue_size))
new_queue.remove()
new_queue.peek()
#new_queue.priority_insert_many(random.sample(xrange(0, 100), queue_size))