private PipelineTimelineEntry naturalOrderAfter(PipelineTimelineEntry pipelineTimelineEntry) { naturalOrderLock.readLock().lock(); try { return naturalOrderPmm.get(new CaseInsensitiveString(pipelineTimelineEntry.getPipelineName())).higher(pipelineTimelineEntry); } finally { naturalOrderLock.readLock().unlock(); } }
@Override public E higher(E e) { return set().higher(e); }
private synchronized void trimHead() { if (offsets.size() <= 1) { return; } FileOffset head = offsets.first(); FileOffset head2 = offsets.higher(head); if (head.isNextOffset(head2)) { offsets.pollFirst(); trimHead(); } return; }
public ReturnCode filterColumn(Cell cell) { byte [] qualifier = CellUtil.cloneQualifier(cell); TreeSet<byte []> lesserOrEqualPrefixes = (TreeSet<byte []>) sortedPrefixes.headSet(qualifier, true); if (lesserOrEqualPrefixes.size() != 0) { byte [] largestPrefixSmallerThanQualifier = lesserOrEqualPrefixes.last(); if (Bytes.startsWith(qualifier, largestPrefixSmallerThanQualifier)) { return ReturnCode.INCLUDE; } if (lesserOrEqualPrefixes.size() == sortedPrefixes.size()) { return ReturnCode.NEXT_ROW; } else { hint = sortedPrefixes.higher(largestPrefixSmallerThanQualifier); return ReturnCode.SEEK_NEXT_USING_HINT; } } else { hint = sortedPrefixes.first(); return ReturnCode.SEEK_NEXT_USING_HINT; } }
byte[] holeStopKey = sc.getSplits().higher(key);
TreeSet<Integer> ts = new TreeSet<Integer>(); ts.add(1); ts.add(4); ts.add(4); ts.add(3); for (Integer i : ts) { System.out.println("current: " + i + " next: " + ts.higher(i)); }
public ReturnCode filterColumn(Cell cell) { byte [] qualifier = CellUtil.cloneQualifier(cell); TreeSet<byte []> lesserOrEqualPrefixes = (TreeSet<byte []>) sortedPrefixes.headSet(qualifier, true); if (lesserOrEqualPrefixes.size() != 0) { byte [] largestPrefixSmallerThanQualifier = lesserOrEqualPrefixes.last(); if (Bytes.startsWith(qualifier, largestPrefixSmallerThanQualifier)) { return ReturnCode.INCLUDE; } if (lesserOrEqualPrefixes.size() == sortedPrefixes.size()) { return ReturnCode.NEXT_ROW; } else { hint = sortedPrefixes.higher(largestPrefixSmallerThanQualifier); return ReturnCode.SEEK_NEXT_USING_HINT; } } else { hint = sortedPrefixes.first(); return ReturnCode.SEEK_NEXT_USING_HINT; } }
long minAfter50 = Long.MAX_VALUE; for (TreeSet<Long> set : sets) { final Long higher = set.higher(50L); if (higher != null && higher < minAfter50) { minAfter50 = higher; } }
count++; } else { ByteSequence higherCF = sortedColFams.higher(source.getTopKey().getColumnFamilyData()); if (higherCF == null) {
private void updateRankedExpls () { FullExplSummary sum; if (iterDoneElem == null) finishRanking(); sum = (rankedExpls.size() == 0) ? iterHead : rankedExpls.get(rankedExpls.size() - 1); while (iterDone >= rankedExpls.size()) { sum = ranking.higher(sum); rankedExpls.add(sum); } }
TreeSet<String> set = new TreeSet<>( Arrays.asList("a", "z", "b", "y")); String cur; cur = set.first(); // a cur = set.higher(cur); // b cur = set.higher(cur); // y cur = set.higher(cur); // z cur = set.lower(cur); // y cur = set.lower(cur); // b cur = set.lower(cur); // a cur = set.lower(cur); // null
@Override public Object higher(Object e) { if (!_directAccess && isDelayLoad()) { load(); } return super.higher(e); }
@Override public Object higher(Object e) { if (!_directAccess && isDelayLoad()) { load(); } return super.higher(e); }
@Override public IExplanationSet next() { assert(iterPos < numExplSets - 1); if (iterDone < ++iterPos) generateUpTo(iterPos); curIterElem = ranking.higher(curIterElem); if (log.isDebugEnabled()) {log.debug("cur elem: " + curIterElem.toString());}; return generateExplanation (curIterElem); }
private synchronized void trimHead() { if(offsets.size()<=1) { return; } FileOffset head = offsets.first(); FileOffset head2 = offsets.higher(head); if( head.isNextOffset(head2) ) { offsets.pollFirst(); trimHead(); } return; }
@Override public Object higher(Object e) { if (!_directAccess && isDelayLoad()) { load(); } return super.higher(e); }
@Override public Object higher(Object e) { if (!_directAccess && isDelayLoad()) { load(); } return super.higher(e); }
DecisionNavigatorItem nextItem(final DecisionNavigatorItem item) { final DecisionNavigatorItem parent = getIndexedItems().get(item.getParentUUID()); final TreeSet<DecisionNavigatorItem> children = parent.getChildren(); return children.higher(item); }
public ActionForward moveDown(ActionMapping mapping, ActionForm actionForm, HttpServletRequest request, HttpServletResponse response) { final PhdThesisProcess process = getProcess(request); final ThesisJuryElement juryElement = getJuryElement(request); final ThesisJuryElement higher = process.getOrderedThesisJuryElements().higher(juryElement); if (higher != null) { swapJuryElements(request, juryElement, higher); } return manageThesisJuryElements(mapping, actionForm, request, response); }
@Test public void testLoopNestTree() { TreeSet<String> lnt = loopFinder.getLoopNestTreeSet(); Assert.assertTrue(lnt.lower("5").equals("8")); Assert.assertTrue(lnt.higher("8").equals("5")); Assert.assertTrue(lnt.higher("2")==null); // while (!lnt.isEmpty()) { // System.err.println(lnt.pollFirst()); //TODO more testing needed. }