@Override public Iterator<E> iterator() { return queue.iterator(); }
@Override public Iterator<DimValHolder> getTopNIterator() { return pQueue.iterator(); }
@Override public Iterator<DimValHolder> getTopNIterator() { return pQueue.iterator(); }
/** * Remove a runnable from the queue. * * @param runnable Runnable to remove. */ public synchronized void remove(Runnable runnable) { Iterator<ScheduledRunnable> iterator = runnables.iterator(); while (iterator.hasNext()) { if (iterator.next().runnable == runnable) { iterator.remove(); } } }
/** * Identity-based version for use in Itr.remove */ void removeEQ(Object o) { final ReentrantLock lock = this.lock; lock.lock(); try { for (Iterator<E> it = q.iterator(); it.hasNext(); ) { if (o == it.next()) { it.remove(); break; } } } finally { lock.unlock(); } }
@Override public Iterator<IntermediateSampleData<T>> sampleInPartition(Iterator<T> input) { if (numSamples == 0) { return emptyIntermediateIterable; } // This queue holds fixed number elements with the top K weight for current partition. PriorityQueue<IntermediateSampleData<T>> queue = new PriorityQueue<IntermediateSampleData<T>>(numSamples); int index = 0; IntermediateSampleData<T> smallest = null; while (input.hasNext()) { T element = input.next(); if (index < numSamples) { // Fill the queue with first K elements from input. queue.add(new IntermediateSampleData<T>(random.nextDouble(), element)); smallest = queue.peek(); } else { double rand = random.nextDouble(); // Remove the element with the smallest weight, and append current element into the queue. if (rand > smallest.getWeight()) { queue.remove(); queue.add(new IntermediateSampleData<T>(rand, element)); smallest = queue.peek(); } } index++; } return queue.iterator(); } }
return queue.iterator();
final Iterator<IntermediateSampleData<T>> itr = reservoir.iterator();
@Override public Iterator<T> iterator() { return priorityQueue.iterator(); } }
((HRegion.RegionScannerImpl)s).storeHeap.getHeap().iterator(); while (scanners.hasNext()) { StoreScanner ss = (StoreScanner)scanners.next();
@Override public byte[] serialize(String topic, PriorityQueue<T> queue) { final int size = queue.size(); final ByteArrayOutputStream baos = new ByteArrayOutputStream(); final DataOutputStream out = new DataOutputStream(baos); final Iterator<T> iterator = queue.iterator(); try { out.writeInt(size); while (iterator.hasNext()) { final byte[] bytes = valueSerializer.serialize(topic, iterator.next()); out.writeInt(bytes.length); out.write(bytes); } out.close(); } catch (IOException e) { throw new RuntimeException("unable to serialize PriorityQueue", e); } return baos.toByteArray(); }
@Override public Iterator<DimValHolder> getTopNIterator() { return pQueue.iterator(); }
@Override public Iterator<DimValHolder> getTopNIterator() { return pQueue.iterator(); }
@Override public Iterator<DimValHolder> getTopNIterator() { return pQueue.iterator(); }
@Override public Iterator<DimValHolder> getTopNIterator() { return pQueue.iterator(); }
@Override public synchronized void unscheduleCollection(Set<Integer> resourceIds) { Iterator<ScheduledMeasurementInfo> itr = this.scheduledRequests.iterator(); while (itr.hasNext()) { ScheduledMeasurementInfo info = itr.next(); if (resourceIds.contains(info.getResourceId())) { itr.remove(); } } }