| Package | Description |
|---|---|
| org.jboss.util.collection |
Extentions to the Java Collections framework.
|
| Modifier and Type | Field and Description |
|---|---|
(package private) ConcurrentSkipListMap.Node<K,V> |
ConcurrentSkipListMap.Iter.last
the last node returned by next()
|
(package private) ConcurrentSkipListMap.Node<K,V> |
ConcurrentSkipListMap.Node.next |
(package private) ConcurrentSkipListMap.Node<K,V> |
ConcurrentSkipListMap.Iter.next
the next node to return from next();
|
(package private) ConcurrentSkipListMap.Node<K,V> |
ConcurrentSkipListMap.Index.node |
| Modifier and Type | Field and Description |
|---|---|
(package private) static java.util.concurrent.atomic.AtomicReferenceFieldUpdater<ConcurrentSkipListMap.Node,ConcurrentSkipListMap.Node> |
ConcurrentSkipListMap.Node.nextUpdater
Updater for casNext
|
(package private) static java.util.concurrent.atomic.AtomicReferenceFieldUpdater<ConcurrentSkipListMap.Node,ConcurrentSkipListMap.Node> |
ConcurrentSkipListMap.Node.nextUpdater
Updater for casNext
|
(package private) static java.util.concurrent.atomic.AtomicReferenceFieldUpdater<ConcurrentSkipListMap.Node,java.lang.Object> |
ConcurrentSkipListMap.Node.valueUpdater |
| Modifier and Type | Method and Description |
|---|---|
(package private) ConcurrentSkipListMap.Node<K,V> |
ConcurrentSkipListMap.findCeiling(K key)
Return ceiling, or first node if key is null
|
(package private) ConcurrentSkipListMap.Node<K,V> |
ConcurrentSkipListMap.findFirst()
Specialized variant of findNode to get first valid node
|
(package private) ConcurrentSkipListMap.Node<K,V> |
ConcurrentSkipListMap.findLast()
Specialized version of find to get last valid node
|
(package private) ConcurrentSkipListMap.Node<K,V> |
ConcurrentSkipListMap.findLower(K key)
Return lower node, or last node if key is null
|
(package private) ConcurrentSkipListMap.Node<K,V> |
ConcurrentSkipListMap.findNear(K kkey,
int rel)
Utility for ceiling, floor, lower, higher methods.
|
private ConcurrentSkipListMap.Node<K,V> |
ConcurrentSkipListMap.findNode(java.lang.Comparable<K> key)
Return node holding key or null if no such, clearing out any
deleted nodes seen along the way.
|
private ConcurrentSkipListMap.Node<K,V> |
ConcurrentSkipListMap.findPredecessor(java.lang.Comparable<K> key)
Return a base-level node with key strictly less than given key,
or the base-level header if there is no such node.
|
private ConcurrentSkipListMap.Node<K,V> |
ConcurrentSkipListMap.findPredecessorOfLast()
Specialized variant of findPredecessor to get predecessor of
last valid node.
|
(package private) ConcurrentSkipListMap.Node<K,V> |
ConcurrentSkipListMap.ConcurrentSkipListSubMap.firstNode() |
(package private) ConcurrentSkipListMap.Node<K,V> |
ConcurrentSkipListMap.ConcurrentSkipListSubMap.lastNode() |
| Modifier and Type | Method and Description |
|---|---|
(package private) boolean |
ConcurrentSkipListMap.Node.appendMarker(ConcurrentSkipListMap.Node<K,V> f)
Tries to append a deletion marker to this node.
|
(package private) boolean |
ConcurrentSkipListMap.Node.casNext(ConcurrentSkipListMap.Node<K,V> cmp,
ConcurrentSkipListMap.Node<K,V> val)
compareAndSet next field
|
(package private) boolean |
ConcurrentSkipListMap.Node.casNext(ConcurrentSkipListMap.Node<K,V> cmp,
ConcurrentSkipListMap.Node<K,V> val)
compareAndSet next field
|
(package private) void |
ConcurrentSkipListMap.Node.helpDelete(ConcurrentSkipListMap.Node<K,V> b,
ConcurrentSkipListMap.Node<K,V> f)
Helps out a deletion by appending marker or unlinking from
predecessor.
|
(package private) void |
ConcurrentSkipListMap.Node.helpDelete(ConcurrentSkipListMap.Node<K,V> b,
ConcurrentSkipListMap.Node<K,V> f)
Helps out a deletion by appending marker or unlinking from
predecessor.
|
private void |
ConcurrentSkipListMap.insertIndex(ConcurrentSkipListMap.Node<K,V> z,
int level)
Create and add index nodes for given node.
|
(package private) boolean |
ConcurrentSkipListMap.ConcurrentSkipListSubMap.isBeforeEnd(ConcurrentSkipListMap.Node<K,V> n) |
| Constructor and Description |
|---|
HeadIndex(ConcurrentSkipListMap.Node<K,V> node,
ConcurrentSkipListMap.Index<K,V> down,
ConcurrentSkipListMap.Index<K,V> right,
int level) |
Index(ConcurrentSkipListMap.Node<K,V> node,
ConcurrentSkipListMap.Index<K,V> down,
ConcurrentSkipListMap.Index<K,V> right)
Creates index node with given values
|
Node(ConcurrentSkipListMap.Node<K,V> next)
Creates a new marker node.
|
Node(K key,
java.lang.Object value,
ConcurrentSkipListMap.Node<K,V> next)
Creates a new regular node.
|