@Override public T poll() { initMergedQueue(); if (mergedQueue != null && !mergedQueue.isEmpty()) { MappedByteBufferSegmentQueue<T> queue = mergedQueue.poll(); T re = queue.poll(); if (queue.peek() != null) { mergedQueue.add(queue); } return re; } return null; }
@Override public T poll() { initMergedQueue(); if (mergedQueue != null && !mergedQueue.isEmpty()) { MappedByteBufferSegmentQueue<T> queue = mergedQueue.poll(); T re = queue.poll(); if (queue.peek() != null) { mergedQueue.add(queue); } return re; } return null; }
private void initMergedQueue() { if (mergedQueue == null && currentIndex >= 0) { mergedQueue = MinMaxPriorityQueue.<MappedByteBufferSegmentQueue<T>> orderedBy( getSegmentQueueComparator()).maximumSize(currentIndex + 1).create(); for (MappedByteBufferSegmentQueue<T> queue : getSegmentQueues()) { T re = queue.peek(); if (re != null) { mergedQueue.add(queue); } } } }
@Override public T poll() { T ret = peek(); if (!isClosed) { current = next(); } else { current = null; } return ret; }
@Override public T poll() { T ret = peek(); if (!isClosed) { current = next(); } else { current = null; } return ret; }
private void initMergedQueue() { if (mergedQueue == null && currentIndex >= 0) { mergedQueue = MinMaxPriorityQueue.<MappedByteBufferSegmentQueue<T>> orderedBy( getSegmentQueueComparator()).maximumSize(currentIndex + 1).create(); for (MappedByteBufferSegmentQueue<T> queue : getSegmentQueues()) { T re = queue.peek(); if (re != null) { mergedQueue.add(queue); } } } }
@Override public T peek() { initMergedQueue(); if (mergedQueue != null && !mergedQueue.isEmpty()) { return mergedQueue.peek().peek(); } return null; }
@Override public T peek() { initMergedQueue(); if (mergedQueue != null && !mergedQueue.isEmpty()) { return mergedQueue.peek().peek(); } return null; }
@Override public T poll() { initMergedQueue(); if (mergedQueue != null && !mergedQueue.isEmpty()) { MappedByteBufferSegmentQueue<T> queue = mergedQueue.poll(); T re = queue.poll(); if (queue.peek() != null) { mergedQueue.add(queue); } return re; } return null; }
@Override public T poll() { T ret = peek(); if (!isClosed) { current = next(); } else { current = null; } return ret; }
@Override public T peek() { initMergedQueue(); if (mergedQueue != null && !mergedQueue.isEmpty()) { return mergedQueue.peek().peek(); } return null; }
private void initMergedQueue() { if (mergedQueue == null && currentIndex >= 0) { mergedQueue = MinMaxPriorityQueue.<MappedByteBufferSegmentQueue<T>> orderedBy( getSegmentQueueComparator()).maximumSize(currentIndex + 1).create(); for (MappedByteBufferSegmentQueue<T> queue : getSegmentQueues()) { T re = queue.peek(); if (re != null) { mergedQueue.add(queue); } } } }