public int inc(int bom, int dis) {
bom %= size;
if (bom == 0) {
bom = size;
}
Deque<Integer> tempStack = new LinkedList<Integer>();
for (int i = 0; i < bom; i++) {
tempStack.offerLast(stack.pollFirst() + dis);
}
for (int i = 0; i < bom; i++) {
stack.offerFirst(tempStack.pollLast());
}
return stack.peekLast();
}
/**
* Return a worker, returning it to the worker pool.
*
* @param worker the worker to be released
*/
void returnWorker(RingoWorker worker) {
if (!workers.offerFirst(worker)) {
worker.shutdown();
}
}
