forked from AdaGold/stacks-queues
-
Notifications
You must be signed in to change notification settings - Fork 42
Expand file tree
/
Copy pathqueue.rb
More file actions
63 lines (56 loc) · 1.13 KB
/
queue.rb
File metadata and controls
63 lines (56 loc) · 1.13 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
# QUEUE_SIZE = 20
class Queue
def initialize
@store = Array.new(20)
@queue_size = 20
@front = @rear = -1
end
def enqueue(element)
# raise NotImplementedError, "Not yet implemented"
if @front == -1 #Q is empty
@front = 0
@rear = 1
@store[@front] = element
elsif @front == @rear
raise ArgumentError, "Q FULL"
else #not empty
@store[@rear] = element
@rear = (@rear + 1) % @queue_size
end
end
def dequeue
if @front == -1
reise ArgumentError, "Queue empty"
else
element = @store[@front]
@front = (@front + 1) % @queue_size
if @front == @rear
@front = -1
@rear = -1
end
end
return element
end
def front
raise NotImplementedError, "Not yet implemented"
end
def size
raise NotImplementedError, "Not yet implemented"
end
def empty?
if @front == -1
return true
else
return false
end
end
def to_s
list = []
current = @front
while current != @rear
list << @store[current]
current = (current + 1) % @queue_size
end
return list.to_s
end
end