protected void doActivate() throws Exception { if (firstItemId == -1) firstItemId = 0; this.index = new CircularIndex(keyUtil.getMaxItems(), firstItemId, queueSize, true); this.size.set(queueSize); this.putCount.set(queueSize); }
protected void doActivate() throws Exception { // default the queue to the backQueue queue = backQueue; // do we need to merge the front and back queues together? if (frontQueue.size() > 0) { // add the front part of the list first queue = new LinkedList<E>(frontQueue); // then add the back list queue.addAll(backQueue); } if (firstItemId == -1) firstItemId = 0; this.index = new CircularIndex(keyUtil.getMaxItems(), firstItemId, queue.size(), true); this.size.set(queue.size()); this.putCount.set(queue.size()); }