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

ConcurrentSkipListMap.lowerKey介绍

暂无

代码示例

代码示例来源：origin: lealone/Lealone

@Override
public K lowerKey(K key) { // 小于给定key的最大key
  try {
    return skipListMap.lowerKey(key);
  } catch (NoSuchElementException e) {
    return null;
  }
}

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

@Test
public void testLowerKey() throws Exception {
 assertEquals(csm.lowerKey(400L), m.lowerKey(400L));
 assertEquals(csm.lowerKey(-1L), m.lowerKey(-1L));
 for ( int i =0 ; i < 100; i ++) {
  Long key = ThreadLocalRandom.current().nextLong();
  assertEquals(csm.lowerKey(key), m.lowerKey(key));
 }
}

代码示例来源：origin: lealone/Lealone

} else {
  if (excluding)
    k1 = buffer.lowerKey(key);
  else
    k1 = buffer.floorKey(key);

代码示例来源：origin: cinchapi/concourse

@Override
public K lowerKey(K key) {
  long[] stamps = grabAllSegmentWriteLocks();
  try {
    sort();
    return sorted.lowerKey(key);
  }
  finally {
    releaseSegmentLocks(stamps);
  }
}

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

@Test
public void testLowerKey() throws Exception {
 assertEquals(csm.lowerKey(400L), m.lowerKey(400L));
 assertEquals(csm.lowerKey(-1L), m.lowerKey(-1L));
 for ( int i =0 ; i < 100; i ++) {
  Long key = ThreadLocalRandom.current().nextLong();
  assertEquals(csm.lowerKey(key), m.lowerKey(key));
 }
}

代码示例来源：origin: com.aliyun.hbase/alihbase-common

@Test
public void testLowerKey() throws Exception {
 assertEquals(csm.lowerKey(400L), m.lowerKey(400L));
 assertEquals(csm.lowerKey(-1L), m.lowerKey(-1L));
 for ( int i =0 ; i < 100; i ++) {
  Long key = ThreadLocalRandom.current().nextLong();
  assertEquals(csm.lowerKey(key), m.lowerKey(key));
 }
}

代码示例来源：origin: com.github.jnthnclt/os.lab.core

tailMap = indexes.tailMap(indexes.lastKey());
} else {
  byte[] priorKey = indexes.lowerKey(tailMap.firstKey());
  if (priorKey == null) {
    FileBackMergableIndexes moved;