Uses of Class
org.glassfish.jersey.internal.util.collection.LinkedTransferQueue.Node
-
Packages that use LinkedTransferQueue.Node Package Description org.glassfish.jersey.internal.util.collection Common set of Jersey collection classes. -
-
Uses of LinkedTransferQueue.Node in org.glassfish.jersey.internal.util.collection
Fields in org.glassfish.jersey.internal.util.collection declared as LinkedTransferQueue.Node Modifier and Type Field Description (package private) LinkedTransferQueue.Node
LinkedTransferQueue. head
head of the queue; null until first enqueueprivate LinkedTransferQueue.Node
LinkedTransferQueue.Itr. lastPred
private LinkedTransferQueue.Node
LinkedTransferQueue.Itr. lastRet
(package private) LinkedTransferQueue.Node
LinkedTransferQueue.Node. next
private LinkedTransferQueue.Node
LinkedTransferQueue.Itr. nextNode
private LinkedTransferQueue.Node
LinkedTransferQueue. tail
tail of the queue; null until first appendMethods in org.glassfish.jersey.internal.util.collection that return LinkedTransferQueue.Node Modifier and Type Method Description private LinkedTransferQueue.Node
LinkedTransferQueue. firstOfMode(boolean isData)
Returns the first unmatched node of the given mode, or null if none.(package private) LinkedTransferQueue.Node
LinkedTransferQueue. succ(LinkedTransferQueue.Node p)
Returns the successor of p, or the head node if p.next has been linked to self, which will only be true if traversing with a stale pointer that is now off the list.private LinkedTransferQueue.Node
LinkedTransferQueue. tryAppend(LinkedTransferQueue.Node s, boolean haveData)
Tries to append node s as tail.Methods in org.glassfish.jersey.internal.util.collection with parameters of type LinkedTransferQueue.Node Modifier and Type Method Description private void
LinkedTransferQueue.Itr. advance(LinkedTransferQueue.Node prev)
Moves to next node after prev, or first node if prev null.private E
LinkedTransferQueue. awaitMatch(LinkedTransferQueue.Node s, LinkedTransferQueue.Node pred, E e, boolean timed, long nanos)
Spins/yields/blocks until node s is matched or caller gives up.private boolean
LinkedTransferQueue. casHead(LinkedTransferQueue.Node cmp, LinkedTransferQueue.Node val)
(package private) boolean
LinkedTransferQueue.Node. casNext(LinkedTransferQueue.Node cmp, LinkedTransferQueue.Node val)
private boolean
LinkedTransferQueue. casTail(LinkedTransferQueue.Node cmp, LinkedTransferQueue.Node val)
private static int
LinkedTransferQueue. spinsFor(LinkedTransferQueue.Node pred, boolean haveData)
Returns spin/yield value for a node with given predecessor and data mode.(package private) LinkedTransferQueue.Node
LinkedTransferQueue. succ(LinkedTransferQueue.Node p)
Returns the successor of p, or the head node if p.next has been linked to self, which will only be true if traversing with a stale pointer that is now off the list.private LinkedTransferQueue.Node
LinkedTransferQueue. tryAppend(LinkedTransferQueue.Node s, boolean haveData)
Tries to append node s as tail.(package private) void
LinkedTransferQueue. unsplice(LinkedTransferQueue.Node pred, LinkedTransferQueue.Node s)
Unsplices (now or later) the given deleted/cancelled node with the given predecessor.
-