public class QueueEx { private Object[] tArr; private int fCur, rCur, capacity; private boolean full; QueueEx() { fCur = rCur = 0; tArr = new Object[capacity]; } QueueEx(int capacity) { this.capacity = capacity; fCur = rCur = 0; tArr = new Object[capacity]; } public boolean offer(T tVal) { if (size() == capacity) System.out.println("데이터 가득 참"); tArr[rCur] = tVal; rCur = (rCur + 1 + capacity) % c..