Hithomelabs/Princeton1
4
0
Fork 3
Code Issues Pull Requests 1 Actions Packages Projects Releases Wiki Activity

queue wrapping bug fixes
All checks were successful
sample gradle build and test / build (pull_request) Successful in 1m3s
Details

Browse Source
This commit is contained in:
Kruti Shah 2025-02-13 22:48:38 +05:30
parent 026b6c1d09
commit e24ed7cf50
1 changed files with 6 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

11
module4/src/main/java/com/hithomelabs/princeton1/module4/ArrayQueue.java
View File

@ -6,7 +6,7 @@ import javax.annotation.Nonnull;
public class ArrayQueue<E> extends Queue<E>{ public class ArrayQueue<E> extends Queue<E>{
private E[] queueArray = (E[]) new Object[1]; private E[] queueArray = (E[]) new Object[5];
private int startPtr; private int startPtr;
private int endPtr; private int endPtr;
private int size; private int size;
@ -50,8 +50,9 @@ public class ArrayQueue<E> extends Queue<E>{
int oldArraySize = tempArray.length; int oldArraySize = tempArray.length;
queueArray = (E[]) new Object[targetSize]; queueArray = (E[]) new Object[targetSize];
int j = 0; int j = 0;
for(int i=startPtr; i<endPtr; i++)
queueArray[j++]=tempArray[i]; for(int i=0; i<size; i++)
queueArray[j++]=tempArray[(startPtr+i)%oldArraySize];
endPtr = size(); endPtr = size();
startPtr = 0; startPtr = 0;
queueArrayLength = queueArray.length; queueArrayLength = queueArray.length;
@ -69,12 +70,12 @@ public class ArrayQueue<E> extends Queue<E>{
@Override @Override
public boolean hasNext() { public boolean hasNext() {
return iteratorIndex<endPtr; return iteratorIndex % queueArrayLength < endPtr % queueArrayLength;
} }
@Override @Override
public E next() { public E next() {
return queueArray[iteratorIndex++]; return queueArray[iteratorIndex++ % queueArrayLength];
} }
} }
} }