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

ConcurrentSkipListMap.findLast介绍

[英]Specialized version of find to get last valid node.
[中]查找的专用版本，以获取最后一个有效节点。

代码示例

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

/**
 * @throws NoSuchElementException {@inheritDoc}
 */
public K lastKey() {
  Node<K,V> n = findLast();
  if (n == null)
    throw new NoSuchElementException();
  return n.key;
}

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

/**
 * Returns a key-value mapping associated with the greatest
 * key in this map, or {@code null} if the map is empty.
 * The returned entry does <em>not</em> support
 * the {@code Entry.setValue} method.
 */
public Map.Entry<K,V> lastEntry() {
  for (;;) {
    Node<K,V> n = findLast();
    if (n == null)
      return null;
    AbstractMap.SimpleImmutableEntry<K,V> e = n.createSnapshot();
    if (e != null)
      return e;
  }
}

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

/**
 * Returns highest node. This node might not be in range, so
 * most usages need to check bounds.
 */
private ConcurrentSkipListMap.Node<K,V> hiNode() {
  if (hi == null)
    return m.findLast();
  else if (hiInclusive)
    return m.findNear(hi, LT|EQ);
  else
    return m.findNear(hi, LT);
}

代码示例来源：origin: MobiVM/robovm

/**
 * @throws NoSuchElementException {@inheritDoc}
 */
public K lastKey() {
  Node<K,V> n = findLast();
  if (n == null)
    throw new NoSuchElementException();
  return n.key;
}

代码示例来源：origin: ibinti/bugvm

/**
 * @throws NoSuchElementException {@inheritDoc}
 */
public K lastKey() {
  Node<K,V> n = findLast();
  if (n == null)
    throw new NoSuchElementException();
  return n.key;
}

代码示例来源：origin: com.mobidevelop.robovm/robovm-rt

/**
 * @throws NoSuchElementException {@inheritDoc}
 */
public K lastKey() {
  Node<K,V> n = findLast();
  if (n == null)
    throw new NoSuchElementException();
  return n.key;
}

代码示例来源：origin: com.bugvm/bugvm-rt

/**
 * @throws NoSuchElementException {@inheritDoc}
 */
public K lastKey() {
  Node<K,V> n = findLast();
  if (n == null)
    throw new NoSuchElementException();
  return n.key;
}

代码示例来源：origin: com.jtransc/jtransc-rt

/**
 * @throws NoSuchElementException {@inheritDoc}
 */
public K lastKey() {
  Node<K,V> n = findLast();
  if (n == null)
    throw new NoSuchElementException();
  return n.key;
}

代码示例来源：origin: com.gluonhq/robovm-rt

/**
 * @throws NoSuchElementException {@inheritDoc}
 */
public K lastKey() {
  Node<K,V> n = findLast();
  if (n == null)
    throw new NoSuchElementException();
  return n.key;
}

代码示例来源：origin: jtulach/bck2brwsr

/**
 * @throws NoSuchElementException {@inheritDoc}
 */
public K lastKey() {
  Node<K,V> n = findLast();
  if (n == null)
    throw new NoSuchElementException();
  return n.key;
}

代码示例来源：origin: org.apidesign.bck2brwsr/emul

/**
 * @throws NoSuchElementException {@inheritDoc}
 */
public K lastKey() {
  Node<K,V> n = findLast();
  if (n == null)
    throw new NoSuchElementException();
  return n.key;
}

代码示例来源：origin: MobiVM/robovm

/**
 * Returns highest node. This node might not be in range, so
 * most usages need to check bounds.
 */
private ConcurrentSkipListMap.Node<K,V> hiNode() {
  if (hi == null)
    return m.findLast();
  else if (hiInclusive)
    return m.findNear(hi, LT|EQ);
  else
    return m.findNear(hi, LT);
}

代码示例来源：origin: com.mobidevelop.robovm/robovm-rt

/**
 * Returns highest node. This node might not be in range, so
 * most usages need to check bounds.
 */
private ConcurrentSkipListMap.Node<K,V> hiNode() {
  if (hi == null)
    return m.findLast();
  else if (hiInclusive)
    return m.findNear(hi, LT|EQ);
  else
    return m.findNear(hi, LT);
}

代码示例来源：origin: com.bugvm/bugvm-rt

/**
 * Returns highest node. This node might not be in range, so
 * most usages need to check bounds.
 */
private ConcurrentSkipListMap.Node<K,V> hiNode() {
  if (hi == null)
    return m.findLast();
  else if (hiInclusive)
    return m.findNear(hi, LT|EQ);
  else
    return m.findNear(hi, LT);
}

代码示例来源：origin: ibinti/bugvm

/**
 * Returns highest node. This node might not be in range, so
 * most usages need to check bounds.
 */
private ConcurrentSkipListMap.Node<K,V> hiNode() {
  if (hi == null)
    return m.findLast();
  else if (hiInclusive)
    return m.findNear(hi, LT|EQ);
  else
    return m.findNear(hi, LT);
}

代码示例来源：origin: FlexoVM/flexovm

/**
 * Returns highest node. This node might not be in range, so
 * most usages need to check bounds.
 */
private ConcurrentSkipListMap.Node<K,V> hiNode() {
  if (hi == null)
    return m.findLast();
  else if (hiInclusive)
    return m.findNear(hi, LT|EQ);
  else
    return m.findNear(hi, LT);
}

代码示例来源：origin: org.codehaus.jsr166-mirror/jsr166

/**
 * Returns highest node. This node might not be in range, so
 * most usages need to check bounds
 */
private ConcurrentSkipListMap.Node<K,V> hiNode() {
  if (hi == null)
    return m.findLast();
  else if (hiInclusive)
    return m.findNear(hi, m.LT|m.EQ);
  else
    return m.findNear(hi, m.LT);
}

代码示例来源：origin: com.gluonhq/robovm-rt

/**
 * Returns highest node. This node might not be in range, so
 * most usages need to check bounds.
 */
private ConcurrentSkipListMap.Node<K,V> hiNode() {
  if (hi == null)
    return m.findLast();
  else if (hiInclusive)
    return m.findNear(hi, LT|EQ);
  else
    return m.findNear(hi, LT);
}

代码示例来源：origin: org.apidesign.bck2brwsr/emul

/**
 * Returns highest node. This node might not be in range, so
 * most usages need to check bounds
 */
private ConcurrentSkipListMap.Node<K,V> hiNode() {
  if (hi == null)
    return m.findLast();
  else if (hiInclusive)
    return m.findNear(hi, m.LT|m.EQ);
  else
    return m.findNear(hi, m.LT);
}

代码示例来源：origin: com.jtransc/jtransc-rt

/**
 * Returns highest node. This node might not be in range, so
 * most usages need to check bounds.
 */
private ConcurrentSkipListMap.Node<K,V> hiNode() {
  if (hi == null)
    return m.findLast();
  else if (hiInclusive)
    return m.findNear(hi, LT|EQ);
  else
    return m.findNear(hi, LT);
}