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

ConcurrentSkipListMap.casHead介绍

[英]compareAndSet head node
[中]比较数据集头节点

代码示例

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

d.right == null &&
h.right == null &&
casHead(h, d) && // try to set
casHead(d, h);   // try to backout

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

for (int j = oldLevel+1; j <= level; ++j)
  newh = new HeadIndex<K,V>(oldbase, newh, idxs[j], j);
if (casHead(oldh, newh)) {
  k = oldLevel;
  break;

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

d.right == null &&
h.right == null &&
casHead(h, d) && // try to set
casHead(d, h);   // try to backout

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

d.right == null &&
h.right == null &&
casHead(h, d) && // try to set
casHead(d, h);   // try to backout

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

d.right == null &&
h.right == null &&
casHead(h, d) && // try to set
casHead(d, h);   // try to backout

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

d.right == null &&
h.right == null &&
casHead(h, d) && // try to set
casHead(d, h);   // try to backout

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

d.right == null &&
h.right == null &&
casHead(h, d) && // try to set
casHead(d, h);   // try to backout

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

d.right == null &&
h.right == null &&
casHead(h, d) && // try to set
casHead(d, h);   // try to backout

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

d.right == null &&
h.right == null &&
casHead(h, d) && // try to set
casHead(d, h);   // try to backout

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

d.right == null &&
h.right == null &&
casHead(h, d) && // try to set
casHead(d, h);   // try to backout

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

d.right == null &&
h.right == null &&
casHead(h, d) && // try to set
casHead(d, h);   // try to backout

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

d.right == null &&
h.right == null &&
casHead(h, d) && // try to set
casHead(d, h);   // try to backout

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

for (int j = oldLevel+1; j <= level; ++j)
  newh = new HeadIndex<K,V>(oldbase, newh, idxs[j], j);
if (casHead(oldh, newh)) {
  k = oldLevel;
  break;

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

for (int j = oldLevel+1; j <= level; ++j)
  newh = new HeadIndex<K,V>(oldbase, newh, idxs[j], j);
if (casHead(oldh, newh)) {
  k = oldLevel;
  break;

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

for (int j = oldLevel+1; j <= level; ++j)
  newh = new HeadIndex<K,V>(oldbase, newh, idxs[j], j);
if (casHead(oldh, newh)) {
  k = oldLevel;
  break;

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

for (int j = oldLevel+1; j <= level; ++j)
  newh = new HeadIndex<K,V>(oldbase, newh, idxs[j], j);
if (casHead(oldh, newh)) {
  k = oldLevel;
  break;

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

for (int j = oldLevel+1; j <= level; ++j)
  newh = new HeadIndex<K,V>(oldbase, newh, idxs[j], j);
if (casHead(oldh, newh)) {
  k = oldLevel;
  break;

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

for (int j = oldLevel+1; j <= level; ++j)
  newh = new HeadIndex<K,V>(oldbase, newh, idxs[j], j);
if (casHead(oldh, newh)) {
  k = oldLevel;
  break;

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

for (int j = oldLevel+1; j <= level; ++j)
  newh = new HeadIndex<K,V>(oldbase, newh, idxs[j], j);
if (casHead(oldh, newh)) {
  k = oldLevel;
  break;

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

for (int j = oldLevel+1; j <= level; ++j)
  newh = new HeadIndex<K,V>(oldbase, newh, idxs[j], j);
if (casHead(oldh, newh)) {
  k = oldLevel;
  break;