Refine search
private boolean needEvents(int count) { int level = 0; Iterator<Event> iter = events.iterator(); iter.next(); while (iter.hasNext()) { Event event = iter.next(); if (event instanceof DocumentStartEvent || event instanceof CollectionStartEvent) { level++; } else if (event instanceof DocumentEndEvent || event instanceof CollectionEndEvent) { level--; } else if (event instanceof StreamEndEvent) { level = -1; } if (level < 0) { return false; } } return events.size() < count + 1; }
public boolean canAllocate(int slices) { if (regionsUsed < maxRegions) return true; if (sliceQueue.isEmpty()) return false; Iterator iterator = sliceQueue.iterator(); for (int i = 0; i < slices; i++) { if (! iterator.hasNext()) { return false; } try { iterator.next(); } catch (NoSuchElementException e) { return false; } } return true; }
mapReduce.addResultToMemory(this.memory, reduceEmitter.reduceQueue.iterator()); } else { mapReduce.addResultToMemory(this.memory, mapEmitter.mapQueue.iterator()); resultgraph = graph.newTransaction(); for (Map.Entry<Long, Map<String, Object>> vprop : mutatedProperties.entrySet()) { Vertex v = resultgraph.vertices(vprop.getKey()).next(); for (Map.Entry<String, Object> prop : vprop.getValue().entrySet()) { v.property(VertexProperty.Cardinality.single, prop.getKey(), prop.getValue());
private ListenableFuture<PrestoThriftPageResult> getAndRemoveNextCompletedRequest() { Iterator<ListenableFuture<PrestoThriftPageResult>> iterator = dataRequests.iterator(); while (iterator.hasNext()) { ListenableFuture<PrestoThriftPageResult> future = iterator.next(); if (future.isDone()) { iterator.remove(); return future; } } throw new IllegalStateException("No completed splits in the queue"); }
private boolean needEvents(int count) { int level = 0; Iterator<Event> iter = events.iterator(); iter.next(); while (iter.hasNext()) { Event event = iter.next(); if (event instanceof DocumentStartEvent || event instanceof CollectionStartEvent) { level++; } else if (event instanceof DocumentEndEvent || event instanceof CollectionEndEvent) { level--; } else if (event instanceof StreamEndEvent) { level = -1; } if (level < 0) { return false; } } return events.size() < count + 1; }
mapReduce.addResultToMemory(this.memory, reduceEmitter.reduceQueue.iterator()); } else { mapReduce.addResultToMemory(this.memory, mapEmitter.mapQueue.iterator()); resultgraph = graph.newTransaction(); for (Map.Entry<Long, Map<String, Object>> vertexProperty : mutatedProperties.entrySet()) { Vertex v = resultgraph.vertices(vertexProperty.getKey()).next(); for (Map.Entry<String, Object> prop : vertexProperty.getValue().entrySet()) { if (prop.getValue() instanceof List) {
/** * */ void cleanup() { Iterator<PendingMessage> msgIt = msgs.iterator(); boolean skipMsg = discardId != null; boolean skipCustomMsg = customDiscardId != null; while (msgIt.hasNext()) { PendingMessage msg = msgIt.next(); if (msg.customMsg) { if (skipCustomMsg) { assert customDiscardId != null; if (F.eq(customDiscardId, msg.id)) { msg.msg = null; return; } } } else { if (skipMsg) { assert discardId != null; if (F.eq(discardId, msg.id)) { msg.msg = null; return; } } } } }
private PooledSession findSessionToKeepAlive( Queue<PooledSession> queue, Instant keepAliveThreshold) { Iterator<PooledSession> iterator = queue.iterator(); while (iterator.hasNext()) { PooledSession session = iterator.next(); if (session.lastUseTime.isBefore(keepAliveThreshold)) { iterator.remove(); return session; } } return null; }
@Test public void iteratorModificationPoll() throws Exception { Queue<Integer> queue = new ConcurrentEvictingQueue<>(2); queue.addAll(asList(4, 5)); Iterator<Integer> iterator = queue.iterator(); assertThat(iterator.hasNext()).isTrue(); Integer element = iterator.next(); assertThat(element).isEqualTo(4); queue.poll(); exception.expect(ConcurrentModificationException.class); iterator.next(); }
/** * Prunes the blockedQueue by removing all DWPT that are associated with the given flush queue. */ private void pruneBlockedQueue(final DocumentsWriterDeleteQueue flushingQueue) { Iterator<BlockedFlush> iterator = blockedFlushes.iterator(); while (iterator.hasNext()) { BlockedFlush blockedFlush = iterator.next(); if (blockedFlush.dwpt.deleteQueue == flushingQueue) { iterator.remove(); assert !flushingWriters.containsKey(blockedFlush.dwpt) : "DWPT is already flushing"; // Record the flushing DWPT to reduce flushBytes in doAfterFlush flushingWriters.put(blockedFlush.dwpt, Long.valueOf(blockedFlush.bytes)); // don't decr pending here - it's already done when DWPT is blocked flushQueue.add(blockedFlush.dwpt); } } }
@Test public void iteratorModificationAdd() throws Exception { Queue<Integer> queue = new ConcurrentEvictingQueue<>(2); queue.addAll(asList(4, 5)); Iterator<Integer> iterator = queue.iterator(); queue.peek(); assertThat(iterator.hasNext()).isTrue(); Integer first = iterator.next(); assertThat(first).isEqualTo(4); queue.add(6); assertThat(iterator.hasNext()).isTrue(); exception.expect(ConcurrentModificationException.class); iterator.next(); }
/** * Polls running tasks to see if a task has ended. * * @return The result object for any completed/failed task */ public synchronized TaskRunner pollFinished() throws InterruptedException { while (!shutdown) { Iterator<TaskRunner> it = running.iterator(); while (it.hasNext()) { TaskRunner runner = it.next(); if (runner != null && !runner.isRunning()) { it.remove(); return runner; } } wait(SLEEP_TIME); } return null; }