/** * Returns a {@code SortedSet} of the specified portion of this {@code TreeSet} which * contains elements greater or equal to the start element. The returned * SortedSet is backed by this TreeSet so changes to one are reflected by * the other. * * @param start * the start element * @return a subset where the elements are greater or equal to * <code>start</code> * * @exception ClassCastException * when the start object cannot be compared with the elements * in this TreeSet * @exception NullPointerException * when the start object is null and the comparator cannot * handle null */ @SuppressWarnings("unchecked") public SortedSet<E> tailSet(E start) { return tailSet(start, true); }
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 MutableSortedSet<T> tailSet(T fromElement) { return SortedSetAdapter.adapt(this.treeSet.tailSet(fromElement)); }
@Override public SortedSet<E> tailSet(E fromElement) { return set().tailSet(fromElement); }
public BugInstance getMatching(BugInstance bugInstance) { SortedSet<BugInstance> tailSet = bugSet.tailSet(bugInstance); if (tailSet.isEmpty()) { return null; } BugInstance first = tailSet.first(); return bugInstance.equals(first) ? first : null; }
@Override public NavigableSet<E> tailSet(E fromElement, boolean inclusive) { return set().tailSet(fromElement, inclusive); }
@Override public MutableSortedSet<T> tailSet(T fromElement) { return SortedSetAdapter.adapt(this.treeSet.tailSet(fromElement)); }
@Override public MutableSortedSet<T> tailSet(T fromElement) { return SortedSetAdapter.adapt(this.treeSet.tailSet(fromElement)); }
long currentEndPosition = span.position + span.length; if (currentEndPosition < queryEndPosition) { for (SimpleCacheSpan next : cachedSpans.tailSet(span, false)) { if (next.position > currentEndPosition) {
private List<CTCol> getOverlappingCols(final CTCol newCol, final TreeSet<CTCol> trackedCols) { CTCol lower = trackedCols.lower(newCol); NavigableSet<CTCol> potentiallyOverlapping = lower == null ? trackedCols : trackedCols.tailSet(lower, overlaps(lower, newCol)); List<CTCol> overlapping = new ArrayList<>(); for (CTCol existing : potentiallyOverlapping) { if (overlaps(newCol, existing)) { overlapping.add(existing); } else { break; } } return overlapping; }
public void added(PipelineTimelineEntry newlyAddedEntry, TreeSet<PipelineTimelineEntry> timeline) { for (PipelineTimelineEntry pipelineTimelineEntry : timeline.tailSet(newlyAddedEntry)) { goCache.remove(key.forFbhOfStagesUnderPipeline(pipelineTimelineEntry.getPipelineLocator())); } } }
st = seconds.tailSet(sec); if (st != null && st.size() != 0) { sec = st.first(); st = minutes.tailSet(min); if (st != null && st.size() != 0) { t = min; st = hours.tailSet(hr); if (st != null && st.size() != 0) { t = hr; boolean dayOfWSpec = !daysOfWeek.contains(NO_SPEC); if (dayOfMSpec && !dayOfWSpec) { // get day by day of month rule st = daysOfMonth.tailSet(day); if (lastdayOfMonth) { if(!nearestWeekday) { st = daysOfWeek.tailSet(cDow); if (st != null && st.size() > 0) { dow = st.first(); st = months.tailSet(mon); if (st != null && st.size() != 0) { t = mon; st = years.tailSet(year); if (st != null && st.size() != 0) { t = year;
st = seconds.tailSet(sec); if (st != null && st.size() != 0) { sec = st.first(); st = minutes.tailSet(min); if (st != null && st.size() != 0) { t = min; st = hours.tailSet(hr); if (st != null && st.size() != 0) { t = hr; boolean dayOfWSpec = !daysOfWeek.contains(NO_SPEC); if (dayOfMSpec && !dayOfWSpec) { // get day by day of month rule st = daysOfMonth.tailSet(day); if (lastdayOfMonth) { if(!nearestWeekday) { st = daysOfWeek.tailSet(cDow); if (st != null && st.size() > 0) { dow = st.first(); st = months.tailSet(mon); if (st != null && st.size() != 0) { t = mon; st = years.tailSet(year); if (st != null && st.size() != 0) { t = year;
st = seconds.tailSet(sec); if (st.size() != 0) { sec = st.first(); st = minutes.tailSet(min); if (st.size() != 0) { t = min; st = hours.tailSet(hr); if (st.size() != 0) { t = hr; boolean dayOfWSpec = !daysOfWeek.contains(NO_SPEC); if (dayOfMSpec && !dayOfWSpec) { // get day by day of month rule st = daysOfMonth.tailSet(day); if (lastdayOfMonth) { if (!nearestWeekday) { st = daysOfWeek.tailSet(cDow); if (st.size() > 0) { dow = st.first(); st = months.tailSet(mon); if (st.size() != 0) { t = mon; st = years.tailSet(year); if (st.size() != 0) { t = year;
st = seconds.tailSet(sec); if (st.size() != 0) { sec = st.first(); st = minutes.tailSet(min); if (st.size() != 0) { t = min; st = hours.tailSet(hr); if (st.size() != 0) { t = hr; boolean dayOfWSpec = !daysOfWeek.contains(NO_SPEC); if (dayOfMSpec && !dayOfWSpec) { // get day by day of month rule st = daysOfMonth.tailSet(day); if (lastdayOfMonth) { if (!nearestWeekday) { st = daysOfWeek.tailSet(cDow); if (st.size() > 0) { dow = st.first(); st = months.tailSet(mon); if (st.size() != 0) { t = mon; st = years.tailSet(year); if (st.size() != 0) { t = year;
st = seconds.tailSet(Integer.valueOf(sec)); if (st != null && !st.isEmpty()) { sec = ((Integer) st.first()).intValue(); st = minutes.tailSet(Integer.valueOf(min)); if (st != null && !st.isEmpty()) { t = min; st = hours.tailSet(Integer.valueOf(hr)); if (st != null && !st.isEmpty()) { t = hr; boolean dayOfWSpec = !daysOfWeek.contains(NO_SPEC); if (dayOfMSpec && !dayOfWSpec) { // get day by day of month rule st = daysOfMonth.tailSet(Integer.valueOf(day)); if (lastdayOfMonth) { if (!nearestWeekday) { st = daysOfWeek.tailSet(Integer.valueOf(cDow)); if (st != null && !st.isEmpty()) { dow = ((Integer) st.first()).intValue(); st = months.tailSet(Integer.valueOf(mon)); if (st != null && !st.isEmpty()) { t = mon; st = years.tailSet(Integer.valueOf(year)); if (st != null && !st.isEmpty()) { t = year;
st = seconds.tailSet(sec); if (st != null && st.size() != 0) { sec = st.first(); st = minutes.tailSet(min); if (st != null && st.size() != 0) { t = min; st = hours.tailSet(hr); if (st != null && st.size() != 0) { t = hr; boolean dayOfWSpec = !daysOfWeek.contains(NO_SPEC); if (dayOfMSpec && !dayOfWSpec) { // get day by day of month rule st = daysOfMonth.tailSet(day); if (lastdayOfMonth) { if(!nearestWeekday) { st = daysOfWeek.tailSet(cDow); if (st != null && st.size() > 0) { dow = st.first(); st = months.tailSet(mon); if (st != null && st.size() != 0) { t = mon; st = years.tailSet(year); if (st != null && st.size() != 0) { t = year;
st = seconds.tailSet(sec); if (st != null && st.size() != 0) { sec = st.first(); st = minutes.tailSet(min); if (st != null && st.size() != 0) { t = min; st = hours.tailSet(hr); if (st != null && st.size() != 0) { t = hr; boolean dayOfWSpec = !daysOfWeek.contains(NO_SPEC); if (dayOfMSpec && !dayOfWSpec) { // get day by day of month rule st = daysOfMonth.tailSet(day); if (lastdayOfMonth) { if(!nearestWeekday) { st = daysOfWeek.tailSet(cDow); if (st != null && st.size() > 0) { dow = st.first(); st = months.tailSet(mon); if (st != null && st.size() != 0) { t = mon; st = years.tailSet(year); if (st != null && st.size() != 0) { t = year;
gcCandidateSet.removeAll(new TreeSet<Integer>(gcCandidateSet.tailSet(lastUpdate.getDataFileId())));
NavigableSet<Long> tailSet = setIdx.tailSet(pageId, false); Long next = tailSet.isEmpty() ? null : tailSet.first();