-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathQueue.java
More file actions
91 lines (82 loc) · 1.54 KB
/
Queue.java
File metadata and controls
91 lines (82 loc) · 1.54 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
package datastructure.stackandqueue;
/**
* The type Queue.
*
* @param <V> the type parameter
*/
public class Queue <V>{
private int maxSize;
private V[] array;
private int front;
private int back;
private int currentSize;
/**
* Instantiates a new Queue.
*
* @param maxSize the max size
*/
public Queue(int maxSize){
this.maxSize=maxSize;
array = (V[]) new Object[maxSize];
front =0;
back =-1;
currentSize =0;
}
/**
* Get current size int.
*
* @return the int
*/
public int getCurrentSize(){
return currentSize;
}
/**
* Is empty boolean.
*
* @return the boolean
*/
public boolean isEmpty(){
return currentSize==0;
}
/**
* Is full boolean.
*
* @return the boolean
*/
public boolean isFull(){
return currentSize == maxSize;
}
/**
* Top v.
*
* @return the v
*/
public V top(){
return array[front];
}
/**
* Enqueue.
*
* @param value the value
*/
public void enqueue(V value){
if(isFull())
return;
back = (back+1)%maxSize;
array[back] = value;
currentSize++;
}
/**
* Dequeue v.
*
* @return the v
*/
public V dequeue(){
if (isEmpty())
return null;
V temp = array[front];
front = (front + 1) % maxSize; //to keep the index in range
currentSize--;
return temp;
}
}