Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
60 lines (48 loc) · 1.33 KB

File metadata and controls

60 lines (48 loc) · 1.33 KB
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
package queue.impl;
import array.DynamicArray;
public class ArrayQueue<E> implements Queue<E> {
private DynamicArray<E> eDynamicArray;
public ArrayQueue(int capacity) {
this.eDynamicArray = new DynamicArray<>(capacity);
}
public ArrayQueue() {
this(10);
}
@Override
public void enqueue(E e) {
eDynamicArray.addLast(e);
}
@Override
public E dequeue() {
return eDynamicArray.removeFirst();
}
@Override
public E getFront() {
return eDynamicArray.getFirst();
}
@Override
public int getSize() {
return eDynamicArray.getSize();
}
@Override
public boolean isEmpty() {
return eDynamicArray.isEmpty();
}
public int getCapacity() {
return eDynamicArray.getCapacity();
}
@Override
public String toString() {
StringBuilder builder = new StringBuilder();
builder.append(String.format("Queue:Size = %d , capacity = %d \n", getSize(), getCapacity()));
builder.append("front [");
for (int i = 0; i < eDynamicArray.getSize(); i++) {
builder.append(eDynamicArray.get(i));
if (i != eDynamicArray.getSize() - 1) {
builder.append(", ");
}
}
builder.append("] tail");
return builder.toString();
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.