本文整理了Java中java.util.concurrent.ConcurrentSkipListMap.findPredecessor()
方法的一些代码示例,展示了ConcurrentSkipListMap.findPredecessor()
的具体用法。这些代码示例主要来源于Github
/Stackoverflow
/Maven
等平台,是从一些精选项目中提取出来的代码,具有较强的参考意义,能在一定程度帮忙到你。ConcurrentSkipListMap.findPredecessor()
方法的具体详情如下:
包路径:java.util.concurrent.ConcurrentSkipListMap
类名称:ConcurrentSkipListMap
方法名:findPredecessor
[英]Returns a base-level node with key strictly less than given key, or the base-level header if there is no such node. Also unlinks indexes to deleted nodes found along the way. Callers rely on this side-effect of clearing indices to deleted nodes.
[中]返回键严格小于给定键的基本级别节点,如果没有这样的节点,则返回基本级别头。还将索引与沿途发现的已删除节点解除链接。调用者依赖于清除已删除节点的索引这一副作用。
代码示例来源:origin: robovm/robovm
Node<K,V> b = findPredecessor(key);
Node<K,V> n = b.next;
for (;;) {
代码示例来源:origin: robovm/robovm
findPredecessor(ck); // Clean index
if (head.right == null)
tryReduceLevel();
代码示例来源:origin: com.gluonhq/robovm-rt
findPredecessor(ck); // Clean index
if (head.right == null)
tryReduceLevel();
代码示例来源:origin: robovm/robovm
Comparable<? super K> key = comparable(kkey);
for (;;) {
Node<K,V> b = findPredecessor(key);
Node<K,V> n = b.next;
for (;;) {
代码示例来源:origin: MobiVM/robovm
findPredecessor(ck); // Clean index
if (head.right == null)
tryReduceLevel();
代码示例来源:origin: robovm/robovm
Comparable<? super K> key = comparable(okey);
for (;;) {
Node<K,V> b = findPredecessor(key);
Node<K,V> n = b.next;
for (;;) {
findPredecessor(key); // Clean index
if (head.right == null)
tryReduceLevel();
代码示例来源:origin: ibinti/bugvm
findPredecessor(ck); // Clean index
if (head.right == null)
tryReduceLevel();
代码示例来源:origin: robovm/robovm
Comparable<? super K> key = comparable(kkey);
for (;;) {
Node<K,V> b = findPredecessor(key);
Node<K,V> n = b.next;
for (;;) {
代码示例来源:origin: com.bugvm/bugvm-rt
findPredecessor(ck); // Clean index
if (head.right == null)
tryReduceLevel();
代码示例来源:origin: ibinti/bugvm
Comparable<? super K> key = comparable(kkey);
for (;;) {
Node<K,V> b = findPredecessor(key);
Node<K,V> n = b.next;
for (;;) {
代码示例来源:origin: org.codehaus.jsr166-mirror/jsr166
findPredecessor(ck); // Clean index
if (head.right == null)
tryReduceLevel();
代码示例来源:origin: FlexoVM/flexovm
Comparable<? super K> key = comparable(kkey);
for (;;) {
Node<K,V> b = findPredecessor(key);
Node<K,V> n = b.next;
for (;;) {
代码示例来源:origin: MobiVM/robovm
Comparable<? super K> key = comparable(kkey);
for (;;) {
Node<K,V> b = findPredecessor(key);
Node<K,V> n = b.next;
for (;;) {
代码示例来源:origin: jtulach/bck2brwsr
Comparable<? super K> key = comparable(kkey);
for (;;) {
Node<K,V> b = findPredecessor(key);
Node<K,V> n = b.next;
for (;;) {
代码示例来源:origin: com.jtransc/jtransc-rt
Comparable<? super K> key = comparable(kkey);
for (;;) {
Node<K,V> b = findPredecessor(key);
Node<K,V> n = b.next;
for (;;) {
代码示例来源:origin: org.codehaus.jsr166-mirror/jsr166
Comparable<? super K> key = comparable(kkey);
for (;;) {
Node<K,V> b = findPredecessor(key);
Node<K,V> n = b.next;
for (;;) {
代码示例来源:origin: com.mobidevelop.robovm/robovm-rt
Comparable<? super K> key = comparable(kkey);
for (;;) {
Node<K,V> b = findPredecessor(key);
Node<K,V> n = b.next;
for (;;) {
代码示例来源:origin: com.bugvm/bugvm-rt
Comparable<? super K> key = comparable(kkey);
for (;;) {
Node<K,V> b = findPredecessor(key);
Node<K,V> n = b.next;
for (;;) {
代码示例来源:origin: org.apidesign.bck2brwsr/emul
Comparable<? super K> key = comparable(kkey);
for (;;) {
Node<K,V> b = findPredecessor(key);
Node<K,V> n = b.next;
for (;;) {
代码示例来源:origin: com.gluonhq/robovm-rt
Comparable<? super K> key = comparable(kkey);
for (;;) {
Node<K,V> b = findPredecessor(key);
Node<K,V> n = b.next;
for (;;) {
内容来源于网络,如有侵权,请联系作者删除!