Package | Description |
---|---|
com.mongodb.internal.connection |
Modifier and Type | Field and Description |
---|---|
private ConcurrentLinkedDeque.Node<E> |
ConcurrentLinkedDeque.header
List header.
|
(package private) ConcurrentLinkedDeque.Node<E> |
ConcurrentLinkedDeque.CLDIterator.last |
(package private) ConcurrentLinkedDeque.Node<E> |
ConcurrentLinkedDeque.CLDIterator.next |
private ConcurrentLinkedDeque.Node<E> |
ConcurrentLinkedDeque.Node.prev |
private ConcurrentLinkedDeque.Node<E> |
ConcurrentLinkedDeque.trailer
List trailer.
|
Modifier and Type | Method and Description |
---|---|
(package private) ConcurrentLinkedDeque.Node<E> |
ConcurrentLinkedDeque.Node.append(E element)
Tries to insert a node holding element as successor, failing
if this node is deleted.
|
(package private) ConcurrentLinkedDeque.Node<E> |
ConcurrentLinkedDeque.Node.back()
Returns previous node containing a nondeleted user element, if
possible.
|
private ConcurrentLinkedDeque.Node<E> |
ConcurrentLinkedDeque.Node.findPredecessorOf(ConcurrentLinkedDeque.Node<E> target)
Returns the apparent predecessor of target by searching
forward for it, starting at this node, patching up pointers
while traversing.
|
(package private) ConcurrentLinkedDeque.Node<E> |
ConcurrentLinkedDeque.Node.forward()
Returns the next node containing a nondeleted user element.
|
private ConcurrentLinkedDeque.Node<E> |
ConcurrentLinkedDeque.Node.getNext()
Gets next link (which is actually the value held
as atomic reference).
|
private ConcurrentLinkedDeque.Node<E> |
ConcurrentLinkedDeque.Node.getPrev()
Gets prev link.
|
private ConcurrentLinkedDeque.Node<E> |
ConcurrentLinkedDeque.Node.nextNonmarker()
Returns next node, ignoring deletion marker.
|
(package private) ConcurrentLinkedDeque.Node<E> |
ConcurrentLinkedDeque.Node.predecessor()
Returns the previous non-deleted node, patching up pointers
as needed.
|
(package private) ConcurrentLinkedDeque.Node<E> |
ConcurrentLinkedDeque.Node.prepend(E element)
Tries to insert a node holding element as predecessor, failing
if no live predecessor can be found to link to.
|
(package private) ConcurrentLinkedDeque.Node<E> |
ConcurrentLinkedDeque.Node.replace(E newElement)
Tries to insert a node holding element to replace this node.
|
(package private) ConcurrentLinkedDeque.Node<E> |
ConcurrentLinkedDeque.Node.successor()
Returns the next non-deleted node, swinging next pointer
around any encountered deleted nodes, and also patching up
successor's prev link to point back to this.
|
Modifier and Type | Method and Description |
---|---|
private boolean |
ConcurrentLinkedDeque.Node.casNext(ConcurrentLinkedDeque.Node<E> cmp,
ConcurrentLinkedDeque.Node<E> val)
compareAndSet next link
|
private boolean |
ConcurrentLinkedDeque.Node.casNext(ConcurrentLinkedDeque.Node<E> cmp,
ConcurrentLinkedDeque.Node<E> val)
compareAndSet next link
|
private ConcurrentLinkedDeque.Node<E> |
ConcurrentLinkedDeque.Node.findPredecessorOf(ConcurrentLinkedDeque.Node<E> target)
Returns the apparent predecessor of target by searching
forward for it, starting at this node, patching up pointers
while traversing.
|
(package private) void |
ConcurrentLinkedDeque.Node.setNext(ConcurrentLinkedDeque.Node<E> n)
Sets next link.
|
(package private) void |
ConcurrentLinkedDeque.Node.setPrev(ConcurrentLinkedDeque.Node<E> b)
Sets prev link.
|
private static boolean |
ConcurrentLinkedDeque.usable(ConcurrentLinkedDeque.Node<?> n)
Returns true if given reference is non-null and isn't a header,
trailer, or marker.
|
Constructor and Description |
---|
Node(ConcurrentLinkedDeque.Node<E> next)
Creates a marker node with given successor.
|
Node(E element,
ConcurrentLinkedDeque.Node<E> next,
ConcurrentLinkedDeque.Node<E> prev)
Creates a node with given contents.
|
Node(E element,
ConcurrentLinkedDeque.Node<E> next,
ConcurrentLinkedDeque.Node<E> prev)
Creates a node with given contents.
|