public boolean isEmpty() { return holderSet.isEmpty(); }
@Override public boolean isEmpty() { return treeSet.isEmpty(); }
/** Returns whether there are any spans cached. */ public boolean isEmpty() { return cachedSpans.isEmpty(); }
private synchronized void fetchAvailableVersions(boolean force) { if (force || availableVersions == null || availableVersions.isEmpty()) { availableVersions = fetchAllAvailableProtocolVersionsForAppInfo(this); } } }
@Override public void display(boolean verbose, PrintWriter pw) { if (unkWords.isEmpty()) { pw.printf("UnknownWordPrinter: all words known by DVModel%n"); } else { pw.printf("UnknownWordPrinter: the following words are unknown%n"); for (String word : unkWords) { pw.printf(" %s%n", word); } } }
/** * @return Checks the minimum update counter task from queue. */ private Item peek() { return queue.isEmpty() ? null : queue.first(); }
private void evictCache(Cache cache, long requiredSpace) { while (currentSize + requiredSpace > maxBytes && !leastRecentlyUsed.isEmpty()) { try { cache.removeSpan(leastRecentlyUsed.first()); } catch (CacheException e) { // do nothing. } } }
@Override public int getMaxYear() { if (!selectableDays.isEmpty()) return selectableDays.last().get(Calendar.YEAR); // Ensure no years can be selected outside of the given maximum date return mMaxDate != null && mMaxDate.get(Calendar.YEAR) < mMaxYear ? mMaxDate.get(Calendar.YEAR) : mMaxYear; }
public synchronized FileOffset getCommitPosition() { if (!offsets.isEmpty()) { return offsets.first().clone(); } return null; }
@Override public int getMinYear() { if (!selectableDays.isEmpty()) return selectableDays.first().get(Calendar.YEAR); // Ensure no years can be selected outside of the given minimum date return mMinDate != null && mMinDate.get(Calendar.YEAR) > mMinYear ? mMinDate.get(Calendar.YEAR) : mMinYear; }
public TopologyDetails getRunningTopologyWithLowestPriority(ISchedulingState cluster) { TreeSet<TopologyDetails> queue = getRunningTopologies(cluster); if (queue.isEmpty()) { return null; } return queue.last(); }
public PartitionChunk<T> remove(PartitionChunk<T> chunk) { if (!holderSet.isEmpty()) { // Somewhat funky implementation in order to return the removed object as it exists in the set SortedSet<PartitionChunk<T>> tailSet = holderSet.tailSet(chunk, true); if (!tailSet.isEmpty()) { PartitionChunk<T> element = tailSet.first(); if (chunk.equals(element)) { holderSet.remove(element); return element; } } } return null; }
public boolean hasTopologyNeedSchedule(ISchedulingState cluster) { return (!this.getPendingTopologies(cluster).isEmpty()); }
@Override public ReturnCode filterCell(final Cell c) { if (sortedPrefixes.isEmpty()) { return ReturnCode.INCLUDE; } else { return filterColumn(c); } }
public TreeSet<Integer> getAvailableVersions() { if (availableVersions == null || availableVersions.isEmpty()) { fetchAvailableVersions(false); } return availableVersions; }
@Override public @NonNull Calendar getStartDate() { if (!selectableDays.isEmpty()) return (Calendar) selectableDays.first().clone(); if (mMinDate != null) return (Calendar) mMinDate.clone(); TimeZone timeZone = mController == null ? TimeZone.getDefault() : mController.getTimeZone(); Calendar output = Calendar.getInstance(timeZone); output.set(Calendar.YEAR, mMinYear); output.set(Calendar.DAY_OF_MONTH, 1); output.set(Calendar.MONTH, Calendar.JANUARY); return output; }
private void removeCurrentLatestIfNoLongerActive(Stage stage, TreeSet<Long> ids) { if (!ids.isEmpty()) { if (isNewerThanCurrentLatest(stage, ids) && isCurrentLatestInactive(ids)) { ids.remove(ids.last()); } } }
@Override public EventDataWrap receive() { if (pending.size() >= config.getMaxPendingMsgsPerPartition()) { return null; } EventDataWrap eventDatawrap; if (toResend.isEmpty()) { eventDatawrap = receiver.receive(); } else { eventDatawrap = toResend.pollFirst(); } if (eventDatawrap != null) { lastOffset = eventDatawrap.getMessageId().getOffset(); pending.put(lastOffset, eventDatawrap); } return eventDatawrap; }
public void testNewTreeSetEmptyNonGeneric() { TreeSet<LegacyComparable> set = Sets.newTreeSet(); assertTrue(set.isEmpty()); set.add(new LegacyComparable("foo")); set.add(new LegacyComparable("bar")); assertThat(set) .containsExactly(new LegacyComparable("bar"), new LegacyComparable("foo")) .inOrder(); }
public void testNewTreeSetEmptyDerived() { TreeSet<Derived> set = Sets.newTreeSet(); assertTrue(set.isEmpty()); set.add(new Derived("foo")); set.add(new Derived("bar")); assertThat(set).containsExactly(new Derived("bar"), new Derived("foo")).inOrder(); }