public boolean
queue_isEmpty ()
{
- //int pop = queuePtr.pop;
- //int push = queuePtr.push;
- //int capacity = queuePtr.capacity;
-
return (((pop + 1) % capacity == push) ? true : false);
}
}
}
- //elements = null;
elements = newElements;
pop = newCapacity - 1;
capacity = newCapacity;
* =============================================================================
*/
public int
- //queue_pop (Queue queuePtr)
queue_pop ()
{
- //int pop = queuePtr.pop;
- //int push = queuePtr.push;
- //int capacity = queuePtr.capacity;
-
int newPop = (pop + 1) % capacity;
if (newPop == push) {
return 0;
}
- //int dataPtr = queuePtr.elements[newPop];
- //queuePtr.pop = newPop;
int dataPtr = elements[newPop];
pop = newPop;