-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathBoundedDeque.java
More file actions
186 lines (171 loc) · 3.39 KB
/
BoundedDeque.java
File metadata and controls
186 lines (171 loc) · 3.39 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
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
import java.util.LinkedList;
public class BoundedDeque implements InstructuresDeque
{
private Object[] buff;
private int capacity, size;
private int front, rear;
public BoundedDeque(int capacity) throws IllegalArgumentException
{
if(capacity<=0)
{
IllegalArgumentException e = new IllegalArgumentException("capacity must be positive");
throw e;
}
this.capacity= capacity;
buff = new Object[capacity];
front = rear = -1;
size = 0;
}
public int size()
{
return this.size;
}
public boolean isEmpty()
{
if(size==0)
{
return true;
}
else
{
return false;
}
}
public void addTop(Object element) throws IllegalStateException
{
if(this.rear==-1&&this.front==-1)
{
this.rear = this.front = 0;
}
else
{
this.front = (this.front+this.capacity-1)%(this.capacity);
if(this.front == this.rear)
{
IllegalStateException e = new IllegalStateException();
throw e;
}
}
buff[front] = element;
this.size++;
}
public String toString()
{
String output = "";
boolean loop = true;
int counter = this.front;
while(loop)
{
if(this.buff[counter]!=null)
{
output = output + " [" + counter + "]" + buff[counter];
}
if(counter==this.rear)
{
loop = false;
}
counter = (counter+1)%capacity;
}
return output;
}
public void addBottom(Object element) throws IllegalStateException
{
if(this.rear==-1&&this.front==-1)
{
this.rear = this.front = 0;
}
else
{
this.rear = (this.rear+1)%(this.capacity);
if(this.front == this.rear)
{
IllegalStateException e = new IllegalStateException();
throw e;
}
}
buff[rear] = element;
this.size++;
}
public Object removeTop()
{
if(this.size==0)
{
IllegalStateException e = new IllegalStateException();
throw e;
}
else if(this.size==1)
{
Object temp = this.buff[front];
this.buff[front] = null;
this.front = this.rear = -1;
this.size--;
return temp;
}
else
{
Object temp = this.buff[front];
this.buff[this.front] = null;
this.front = (this.front+1)%capacity;
this.size--;
return temp;
}
}
public Object removeBottom()
{
if(this.size==0)
{
IllegalStateException e = new IllegalStateException();
throw e;
}
else if(this.size==1)
{
Object temp = this.buff[rear];
this.buff[rear] = null;
this.front = this.rear = -1;
this.size--;
return temp;
}
else
{
Object temp = this.buff[rear];
this.buff[this.rear] = null;
this.rear = (this.rear+this.capacity-1)%capacity;
this.size--;
return temp;
}
}
public Object top()
{
if(this.front!=-1)
{
return this.buff[front];
}
else
{
return null;
}
}
public Object bottom()
{
if(this.rear!=-1)
{
return this.buff[rear];
}
else
{
return null;
}
}
/*public static void main(String[] args)
{
BoundedDeque a = new BoundedDeque(10);
a.addTop("1");
a.addTop("2");
a.addBottom("3");
a.addTop("5");
a.addBottom("4");
a.removeTop();
a.removeBottom();
System.out.println(a);
}*/
}