本文整理了Java中java.util.TreeSet.isEmpty()
方法的一些代码示例,展示了TreeSet.isEmpty()
的具体用法。这些代码示例主要来源于Github
/Stackoverflow
/Maven
等平台,是从一些精选项目中提取出来的代码,具有较强的参考意义,能在一定程度帮忙到你。TreeSet.isEmpty()
方法的具体详情如下:
包路径:java.util.TreeSet
类名称:TreeSet
方法名:isEmpty
[英]Returns true if this TreeSet has no element, otherwise false.
[中]
代码示例来源:origin: apache/incubator-druid
public boolean isEmpty()
{
return holderSet.isEmpty();
}
代码示例来源:origin: apache/flink
@Override
public boolean isEmpty() {
return treeSet.isEmpty();
}
代码示例来源:origin: google/ExoPlayer
/** Returns whether there are any spans cached. */
public boolean isEmpty() {
return cachedSpans.isEmpty();
}
代码示例来源:origin: facebook/facebook-android-sdk
private synchronized void fetchAvailableVersions(boolean force) {
if (force || availableVersions == null || availableVersions.isEmpty()) {
availableVersions = fetchAllAvailableProtocolVersionsForAppInfo(this);
}
}
}
代码示例来源:origin: stanfordnlp/CoreNLP
@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);
}
}
}
代码示例来源:origin: apache/ignite
/**
* @return Checks the minimum update counter task from queue.
*/
private Item peek() {
return queue.isEmpty() ? null : queue.first();
}
代码示例来源:origin: google/ExoPlayer
private void evictCache(Cache cache, long requiredSpace) {
while (currentSize + requiredSpace > maxBytes && !leastRecentlyUsed.isEmpty()) {
try {
cache.removeSpan(leastRecentlyUsed.first());
} catch (CacheException e) {
// do nothing.
}
}
}
代码示例来源:origin: wdullaer/MaterialDateTimePicker
@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;
}
代码示例来源:origin: apache/storm
public synchronized FileOffset getCommitPosition() {
if (!offsets.isEmpty()) {
return offsets.first().clone();
}
return null;
}
代码示例来源:origin: wdullaer/MaterialDateTimePicker
@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;
}
代码示例来源:origin: apache/storm
public TopologyDetails getRunningTopologyWithLowestPriority(ISchedulingState cluster) {
TreeSet<TopologyDetails> queue = getRunningTopologies(cluster);
if (queue.isEmpty()) {
return null;
}
return queue.last();
}
代码示例来源:origin: apache/incubator-druid
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;
}
代码示例来源:origin: apache/storm
public boolean hasTopologyNeedSchedule(ISchedulingState cluster) {
return (!this.getPendingTopologies(cluster).isEmpty());
}
代码示例来源:origin: apache/hbase
@Override
public ReturnCode filterCell(final Cell c) {
if (sortedPrefixes.isEmpty()) {
return ReturnCode.INCLUDE;
} else {
return filterColumn(c);
}
}
代码示例来源:origin: facebook/facebook-android-sdk
public TreeSet<Integer> getAvailableVersions() {
if (availableVersions == null || availableVersions.isEmpty()) {
fetchAvailableVersions(false);
}
return availableVersions;
}
代码示例来源:origin: wdullaer/MaterialDateTimePicker
@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;
}
代码示例来源:origin: gocd/gocd
private void removeCurrentLatestIfNoLongerActive(Stage stage, TreeSet<Long> ids) {
if (!ids.isEmpty()) {
if (isNewerThanCurrentLatest(stage, ids) && isCurrentLatestInactive(ids)) {
ids.remove(ids.last());
}
}
}
代码示例来源:origin: apache/storm
@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;
}
代码示例来源:origin: google/guava
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();
}
代码示例来源:origin: google/guava
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();
}
内容来源于网络,如有侵权,请联系作者删除!