本文整理了Java中java.util.concurrent.ConcurrentHashMap.setEntryAt()
方法的一些代码示例,展示了ConcurrentHashMap.setEntryAt()
的具体用法。这些代码示例主要来源于Github
/Stackoverflow
/Maven
等平台,是从一些精选项目中提取出来的代码,具有较强的参考意义,能在一定程度帮忙到你。ConcurrentHashMap.setEntryAt()
方法的具体详情如下:
包路径:java.util.concurrent.ConcurrentHashMap
类名称:ConcurrentHashMap
方法名:setEntryAt
[英]Sets the ith element of given table, with volatile write semantics. (See above about use of putOrderedObject.)
[中]使用volatile write语义设置给定表的第i个元素。(有关putOrderedObject的使用,请参见上文。)
代码示例来源:origin: robovm/robovm
final void clear() {
lock();
try {
HashEntry<K,V>[] tab = table;
for (int i = 0; i < tab.length ; i++)
setEntryAt(tab, i, null);
++modCount;
count = 0;
} finally {
unlock();
}
}
}
代码示例来源:origin: robovm/robovm
if (value == null || value == v || value.equals(v)) {
if (pred == null)
setEntryAt(tab, index, next);
else
pred.setNext(next);
代码示例来源:origin: robovm/robovm
rehash(node);
else
setEntryAt(tab, index, node);
++modCount;
count = c;
代码示例来源:origin: MobiVM/robovm
final void clear() {
lock();
try {
HashEntry<K,V>[] tab = table;
for (int i = 0; i < tab.length ; i++)
setEntryAt(tab, i, null);
++modCount;
count = 0;
} finally {
unlock();
}
}
}
代码示例来源:origin: ibinti/bugvm
final void clear() {
lock();
try {
HashEntry<K,V>[] tab = table;
for (int i = 0; i < tab.length ; i++)
setEntryAt(tab, i, null);
++modCount;
count = 0;
} finally {
unlock();
}
}
}
代码示例来源:origin: com.bugvm/bugvm-rt
final void clear() {
lock();
try {
HashEntry<K,V>[] tab = table;
for (int i = 0; i < tab.length ; i++)
setEntryAt(tab, i, null);
++modCount;
count = 0;
} finally {
unlock();
}
}
}
代码示例来源:origin: com.jtransc/jtransc-rt
final void clear() {
lock();
try {
HashEntry<K, V>[] tab = table;
for (int i = 0; i < tab.length; i++)
setEntryAt(tab, i, null);
++modCount;
count = 0;
} finally {
unlock();
}
}
}
代码示例来源:origin: org.codehaus.jsr166-mirror/jsr166
final void clear() {
lock();
try {
HashEntry<K,V>[] tab = table;
for (int i = 0; i < tab.length ; i++)
setEntryAt(tab, i, null);
++modCount;
count = 0;
} finally {
unlock();
}
}
}
代码示例来源:origin: com.mobidevelop.robovm/robovm-rt
final void clear() {
lock();
try {
HashEntry<K,V>[] tab = table;
for (int i = 0; i < tab.length ; i++)
setEntryAt(tab, i, null);
++modCount;
count = 0;
} finally {
unlock();
}
}
}
代码示例来源:origin: com.gluonhq/robovm-rt
final void clear() {
lock();
try {
HashEntry<K,V>[] tab = table;
for (int i = 0; i < tab.length ; i++)
setEntryAt(tab, i, null);
++modCount;
count = 0;
} finally {
unlock();
}
}
}
代码示例来源:origin: FlexoVM/flexovm
final void clear() {
lock();
try {
HashEntry<K,V>[] tab = table;
for (int i = 0; i < tab.length ; i++)
setEntryAt(tab, i, null);
++modCount;
count = 0;
} finally {
unlock();
}
}
}
代码示例来源:origin: MobiVM/robovm
if (value == null || value == v || value.equals(v)) {
if (pred == null)
setEntryAt(tab, index, next);
else
pred.setNext(next);
代码示例来源:origin: ibinti/bugvm
if (value == null || value == v || value.equals(v)) {
if (pred == null)
setEntryAt(tab, index, next);
else
pred.setNext(next);
代码示例来源:origin: com.bugvm/bugvm-rt
if (value == null || value == v || value.equals(v)) {
if (pred == null)
setEntryAt(tab, index, next);
else
pred.setNext(next);
代码示例来源:origin: com.jtransc/jtransc-rt
if (value == null || value == v || value.equals(v)) {
if (pred == null)
setEntryAt(tab, index, next);
else
pred.setNext(next);
代码示例来源:origin: com.gluonhq/robovm-rt
if (value == null || value == v || value.equals(v)) {
if (pred == null)
setEntryAt(tab, index, next);
else
pred.setNext(next);
代码示例来源:origin: com.mobidevelop.robovm/robovm-rt
if (value == null || value == v || value.equals(v)) {
if (pred == null)
setEntryAt(tab, index, next);
else
pred.setNext(next);
代码示例来源:origin: FlexoVM/flexovm
if (value == null || value == v || value.equals(v)) {
if (pred == null)
setEntryAt(tab, index, next);
else
pred.setNext(next);
代码示例来源:origin: org.codehaus.jsr166-mirror/jsr166
if (value == null || value == v || value.equals(v)) {
if (pred == null)
setEntryAt(tab, index, next);
else
pred.setNext(next);
代码示例来源:origin: ibinti/bugvm
rehash(node);
else
setEntryAt(tab, index, node);
++modCount;
count = c;
内容来源于网络,如有侵权,请联系作者删除!