本文整理了Java中java.util.TreeSet.higher()方法的一些代码示例，展示了TreeSet.higher()的具体用法。这些代码示例主要来源于Github/Stackoverflow/Maven等平台，是从一些精选项目中提取出来的代码，具有较强的参考意义，能在一定程度帮忙到你。TreeSet.higher()方法的具体详情如下：
包路径：java.util.TreeSet
类名称：TreeSet
方法名：higher

TreeSet.higher介绍

暂无

代码示例

代码示例来源：origin: gocd/gocd

private PipelineTimelineEntry naturalOrderAfter(PipelineTimelineEntry pipelineTimelineEntry) {
  naturalOrderLock.readLock().lock();
  try {
    return naturalOrderPmm.get(new CaseInsensitiveString(pipelineTimelineEntry.getPipelineName())).higher(pipelineTimelineEntry);
  } finally {
    naturalOrderLock.readLock().unlock();
  }
}

代码示例来源：origin: atomix/atomix

@Override
public E higher(E e) {
 return set().higher(e);
}

代码示例来源：origin: apache/storm

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;
}

代码示例来源：origin: apache/hbase

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;
 }
}

代码示例来源：origin: apache/hbase

byte[] holeStopKey = sc.getSplits().higher(key);

代码示例来源：origin: stackoverflow.com

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));
}

代码示例来源：origin: org.apache.hbase/hbase-client

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;
 }
}

代码示例来源：origin: stackoverflow.com

long minAfter50 = Long.MAX_VALUE;
for (TreeSet<Long> set : sets) {
  final Long higher = set.higher(50L);
  if (higher != null && higher < minAfter50) {
    minAfter50 = higher;
  }
}

代码示例来源：origin: apache/accumulo

count++;
} else {
 ByteSequence higherCF = sortedColFams.higher(source.getTopKey().getColumnFamilyData());
 if (higherCF == null) {

代码示例来源：origin: org.bitbucket.ibencher/vagabond

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);
  }
}

代码示例来源：origin: stackoverflow.com

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

代码示例来源：origin: org.apache.openjpa/openjpa-all

@Override
public Object higher(Object e) {
  if (!_directAccess && isDelayLoad()) {
    load();
  }
  return super.higher(e);
}

代码示例来源：origin: org.apache.openejb.patch/openjpa

@Override
public Object higher(Object e) {
  if (!_directAccess && isDelayLoad()) {
    load();
  }
  return super.higher(e);
}

代码示例来源：origin: org.bitbucket.ibencher/vagabond

@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);
}

代码示例来源：origin: org.apache.storm/storm-hdfs

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;
}

代码示例来源：origin: org.apache.openjpa/openjpa-kernel

@Override
public Object higher(Object e) {
  if (!_directAccess && isDelayLoad()) {
    load();
  }
  return super.higher(e);
}

代码示例来源：origin: org.apache.openejb.patch/openjpa-kernel

@Override
public Object higher(Object e) {
  if (!_directAccess && isDelayLoad()) {
    load();
  }
  return super.higher(e);
}

代码示例来源：origin: org.kie.workbench/kie-wb-common-dmn-client

DecisionNavigatorItem nextItem(final DecisionNavigatorItem item) {
  final DecisionNavigatorItem parent = getIndexedItems().get(item.getParentUUID());
  final TreeSet<DecisionNavigatorItem> children = parent.getChildren();
  return children.higher(item);
}

代码示例来源：origin: FenixEdu/fenixedu-academic

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);
}

代码示例来源：origin: jayhorn/jayhorn

@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.
  }