Public

Inserts the specified element at the tail of this queue. As the queue is
unbounded, this method will

offer

poll

Creates a LinkedTransferQueueinitially containing the elements of the given
collection, added in tra

<init>

addAll

Spins/yields/blocks until node s is matched or caller gives up.

awaitMatch

casHead

casSweepVotes

casTail

cast

Traverses and counts unmatched nodes of the given mode. Used by methods size and
getWaitingConsumerC

countOfMode

findAndRemove

Returns the item in the first unmatched node with isData; or null if none. Used
by peek.

firstDataItem

Returns the first unmatched node of the given mode, or null if none. Used by
methods isEmpty, hasWai

firstOfMode

Returns spin/yield value for a node with given predecessor and data mode. See
above for explanation.

spinsFor

Returns the successor of p, or the head node if p.next has been linked to self,
which will only be t

succ

Unlinks matched (typically cancelled) nodes encountered in a traversal from
head.

sweep

tryAppend

Unsplices (now or later) the given deleted/cancelled node with the given
predecessor.

unsplice

Implements all queuing methods. See above for explanation.

xfer

clear

StringBuilder

Making http post requests using okhttp

This class implements a simple HTTP server. A HttpServer is bound to an IP
address and port number a

com.sun.net.httpserver.HttpServer

A flow layout arranges components in a left-to-right flow, much like lines of
text in a paragraph. F

java.awt.FlowLayout

Wraps either an existing OutputStream or an existing Writerand provides
convenience methods for prin

java.io.PrintWriter

Breaks a string into tokens; new code should probably use String#split.>  
// Legacy code: 
StringTo

java.util.StringTokenizer

Walk the nodes of the tree left-to-right or right-to-left. Note that in
descending iterations, next 

java.util.TreeMap

TreeSet is an implementation of SortedSet. All optional operations (adding and
removing) are support

java.util.TreeSet

setScale

compareTo

requestLocationUpdates

/**
     * Tries to append node s as tail.
     *
     * @param s the node to append
     * @param haveData true if appending in data mode
     * @return null on failure due to losing race with append in
     * different mode, else s's predecessor, or s itself if no
     * predecessor
     */

/**
     * Implements all queuing methods. See above for explanation.
     *
     * @param e the item or null for take
     * @param haveData true if this is a put, else a take
     * @param how NOW, ASYNC, SYNC, or TIMED
     * @param nanos timeout in nanosecs, used only if mode is TIMED
     * @return an item if matched, else e
     * @throws NullPointerException if haveData mode but e is null
     */

/**
     * Unsplices (now or later) the given deleted/cancelled node with
     * the given predecessor.
     *
     * @param pred a node that was at one time known to be the
     * predecessor of s, or null or s itself if s is/was at head
     * @param s the node to be unspliced
     */

/*
         * See above for rationale. Briefly: if pred still points to
         * s, try to unlink s.  If s cannot be unlinked, because it is
         * trailing node or pred might be unlinked, and neither pred
         * nor s are head or offlist, add to sweepVotes, and if enough
         * votes have accumulated, sweep.
         */

How to use casHeadmethodin jsr166y.LinkedTransferQueue

Best Java code snippets using jsr166y.LinkedTransferQueue.casHead (Showing top 6 results out of 315)

How to use
casHead
method
in
jsr166y.LinkedTransferQueue