/** * {@inheritDoc} */ @Override public void destroy() { viewActionQueue.clear(); presenterDestroyed = false; }
public void clear() { cache.clear(); clock.clear(); currentSize.set( 0 ); }
public synchronized List<PrioritizedSplitRunner> destroy() { destroyed = true; ImmutableList.Builder<PrioritizedSplitRunner> builder = ImmutableList.builder(); builder.addAll(runningIntermediateSplits); builder.addAll(runningLeafSplits); builder.addAll(queuedLeafSplits); runningIntermediateSplits.clear(); runningLeafSplits.clear(); queuedLeafSplits.clear(); return builder.build(); }
private ByteBuffer assembleChunksAndReset() { ByteBuffer result; if (this.chunks.size() == 1) { result = this.chunks.remove(); } else { result = ByteBuffer.allocate(getBufferSize()); for (ByteBuffer partial : this.chunks) { result.put(partial); } result.flip(); } this.chunks.clear(); this.expectedContentLength = null; return result; }
public void requestSucceeded() { backoff.success(); errorsSinceLastSuccess.clear(); }
@Override public void onComplete() { if (!done) { for (GroupedUnicast<K, V> g : groups.values()) { g.onComplete(); } groups.clear(); if (evictedGroups != null) { evictedGroups.clear(); } done = true; finished = true; drain(); } }
void reset() { releasedIds.clear(); lastId = IdSpace.MIN_TREE_NODE_ID - 1; }
void clearEventsList() { eventsList.clear(); }
/** Resets internal lists of active trace sections. */ @Resetter public static void reset() { synchronized (lock) { currentSections.clear(); previousSections.clear(); } crashOnIncorrectUsage = CRASH_ON_INCORRECT_USAGE_DEFAULT; } }
@Override public void clear() { assertTrue(Thread.holdsLock(mutex)); delegate.clear(); }
protected void complete(final MapReduce<?, ?, OK, OV, ?> mapReduce) { if (mapReduce.getReduceKeySort().isPresent()) { final Comparator<OK> comparator = mapReduce.getReduceKeySort().get(); final List<KeyValue<OK, OV>> list = new ArrayList<>(this.reduceQueue); Collections.sort(list, Comparator.comparing(KeyValue::getKey, comparator)); this.reduceQueue.clear(); this.reduceQueue.addAll(list); } } }
@Override public void onError(Throwable t) { if (done) { RxJavaPlugins.onError(t); return; } done = true; for (GroupedUnicast<K, V> g : groups.values()) { g.onError(t); } groups.clear(); if (evictedGroups != null) { evictedGroups.clear(); } error = t; finished = true; drain(); }
@Override public void onComplete() { if (!done) { for (GroupedUnicast<K, V> g : groups.values()) { g.onComplete(); } groups.clear(); if (evictedGroups != null) { evictedGroups.clear(); } done = true; drain(); } }
@Override public void close() { objects.clear(); poolSize.set(0); } }
@Test(dataProvider = "empty") public void clear_whenEmpty(Queue<?> queue) { queue.clear(); assertThat(queue, is(deeplyEmpty())); }
@Test(dataProvider = "populated") public void clear_whenPopulated(Queue<?> queue) { queue.clear(); assertThat(queue, is(deeplyEmpty())); }
void reset() { learnerHandler.getQueuedPackets().clear(); learnerHandler.threadStarted = false; learnerHandler.setFirstPacket(true); }
public void testHoldsLockOnAllOperations() { create().element(); create().offer("foo"); create().peek(); create().poll(); create().remove(); create().add("foo"); create().addAll(ImmutableList.of("foo")); create().clear(); create().contains("foo"); create().containsAll(ImmutableList.of("foo")); create().equals(new ArrayDeque<>(ImmutableList.of("foo"))); create().hashCode(); create().isEmpty(); create().iterator(); create().remove("foo"); create().removeAll(ImmutableList.of("foo")); create().retainAll(ImmutableList.of("foo")); create().size(); create().toArray(); create().toArray(new String[] {"foo"}); } }