@Override public void clear() { entriesByLowerBound.clear(); }
@Override public void clear() { delegate.clear(); }
@Override public void clear() { entriesByLowerBound.clear(); }
@Override public void clear() { entriesByLowerBound.clear(); }
/** * Removes all elements from this {@code TreeSet}, leaving it empty. * * @see #isEmpty * @see #size */ @Override public void clear() { backingMap.clear(); }
@Override public void clear() { this.delegatee.clear(); }
@Override public void clear() { entriesByLowerBound.clear(); }
public void clear() { translations.clear(); copyTranslations.clear(); enabled = false; } }
@Override public void truncate(long index) { positions.tailMap(index, false).clear(); } }
public void clear() { translations.clear(); copyTranslations.clear(); enabled = false; } }
public void clear() { this.posts.clear(); this.users.clear(); // we keep the other details (like order, scraperInfo and query) to be able to test with zero-size pushes }
private void refreshMoveIteratorMap() { moveIteratorMap.clear(); double probabilityWeightOffset = 0.0; for (ProbabilityItem probabilityItem : probabilityItemMap.values()) { if (probabilityItem.probabilityWeight != 0.0 && probabilityItem.moveIterator.hasNext()) { moveIteratorMap.put(probabilityWeightOffset, probabilityItem.moveIterator); probabilityWeightOffset += probabilityItem.probabilityWeight; } } probabilityWeightTotal = probabilityWeightOffset; }
@Resetter public static void reset() { currentAppStandbyBucket = UsageStatsManager.STANDBY_BUCKET_ACTIVE; eventsByTimeStamp.clear(); appStandbyBuckets.clear(); appUsageObserversById.clear(); }
/** * Clears all nodes from consistent hash. */ public void clear() { rw.writeLock().lock(); try { nodes.clear(); circle.clear(); } finally { rw.writeLock().unlock(); } }
/** * reset to an empty bitmap; result occupies as much space a newly created bitmap. */ public void clear() { this.highToBitmap.clear(); resetPerfHelpers(); }
public void stop() { running=false; unblockAll(); stopFlusher(); forward_table.clear(); }
delColMap.clear(); for (Map.Entry<Long, DeleteVersionsNode> e : delFamMap.entrySet()) { delColMap.put(e.getKey(), e.getValue().getDeepCopy());
/** * Resets and returns the first segment in the journal. * * @param index the starting index of the journal * @return the first segment */ JournalSegment<E> resetSegments(long index) { assertOpen(); // If the index already equals the first segment index, skip the reset. JournalSegment<E> firstSegment = getFirstSegment(); if (index == firstSegment.index()) { return firstSegment; } for (JournalSegment<E> segment : segments.values()) { segment.close(); segment.delete(); } segments.clear(); JournalSegmentDescriptor descriptor = JournalSegmentDescriptor.builder() .withId(1) .withIndex(index) .withMaxSegmentSize(maxSegmentSize) .withMaxEntries(maxEntriesPerSegment) .build(); currentSegment = createSegment(descriptor); segments.put(index, currentSegment); return currentSegment; }
updatedCells.add(updatedCell); m.getFamilyCellMap().clear();