类 jsr166y.LinkedTransferQueue.Node
的使用

使用LinkedTransferQueue.Node的程序包

程序包	说明
jsr166y

jsr166y中LinkedTransferQueue.Node的使用

声明为LinkedTransferQueue.Node的jsr166y中的字段

限定符和类型	字段和说明
(专用程序包) LinkedTransferQueue.Node	LinkedTransferQueue.head head of the queue; null until first enqueue
private LinkedTransferQueue.Node	LinkedTransferQueue.Itr.lastPred
private LinkedTransferQueue.Node	LinkedTransferQueue.Itr.lastRet
(专用程序包) LinkedTransferQueue.Node	LinkedTransferQueue.Node.next
private LinkedTransferQueue.Node	LinkedTransferQueue.Itr.nextNode
private LinkedTransferQueue.Node	LinkedTransferQueue.tail tail of the queue; null until first append

返回LinkedTransferQueue.Node的jsr166y中的方法

限定符和类型	方法和说明
private LinkedTransferQueue.Node	LinkedTransferQueue.firstOfMode(boolean isData) Returns the first unmatched node of the given mode, or null if none.
(专用程序包) 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.

参数类型为LinkedTransferQueue.Node的jsr166y中的方法

限定符和类型	方法和说明
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)
(专用程序包) 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.
(专用程序包) 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.
(专用程序包) void	LinkedTransferQueue.unsplice(LinkedTransferQueue.Node pred, LinkedTransferQueue.Node s) Unsplices (now or later) the given deleted/cancelled node with the given predecessor.