How to use

LinkedTransferQueue

in

jsr166y

/**
 * Reconstitutes the Queue instance from a stream (that is,
 * deserializes it).
 *
 * @param s the stream
 */
private void readObject(java.io.ObjectInputStream s)
  throws java.io.IOException, ClassNotFoundException {
  s.defaultReadObject();
  for (;;) {
    @SuppressWarnings("unchecked")
    E item = (E) s.readObject();
    if (item == null)
      break;
    else
      offer(item);
  }
}

/**
 * @throws NullPointerException     {@inheritDoc}
 * @throws IllegalArgumentException {@inheritDoc}
 */
public int drainTo(Collection<? super E> c) {
  if (c == null)
    throw new NullPointerException();
  if (c == this)
    throw new IllegalArgumentException();
  int n = 0;
  for (E e; (e = poll()) != null;) {
    c.add(e);
    ++n;
  }
  return n;
}

/**
 * Creates a {@code LinkedTransferQueue}
 * initially containing the elements of the given collection,
 * added in traversal order of the collection's iterator.
 *
 * @param c the collection of elements to initially contain
 * @throws NullPointerException if the specified collection or any
 *         of its elements are null
 */
public LinkedTransferQueue(Collection<? extends E> c) {
  this();
  addAll(c);
}

/**
 * Returns the item in the first unmatched node with isData; or
 * null if none.  Used by peek.
 */
private E firstDataItem() {
  for (Node p = head; p != null; p = succ(p)) {
    Object item = p.item;
    if (p.isData) {
      if (item != null && item != p)
        return LinkedTransferQueue.<E>cast(item);
    }
    else if (item == null)
      return null;
  }
  return null;
}

if (casHead(null, s))
  return s;                 // initialize
  while ((tail != t || !casTail(t, s)) &&
      (t = tail)   != null &&

    for (Node q = p; q != h;) {
      if (head == h && casHead(h, n == null ? q : n)) {
        h.forgetNext();
        break;
    return LinkedTransferQueue.<E>cast(item);
if (s == null)
  s = new Node(e, haveData);
Node pred = tryAppend(s, haveData);
if (pred == null)
  continue retry;           // lost race vs opposite mode
if (how != ASYNC)
  return awaitMatch(s, pred, e, (how == TIMED), nanos);

if (hn == null)
  return;          // now empty
if (hn != h && casHead(h, hn))
  int v = sweepVotes;
  if (v < SWEEP_THRESHOLD) {
    if (casSweepVotes(v, v + 1))
      break;
  else if (casSweepVotes(v, 0)) {
    sweep();
    break;

return LinkedTransferQueue.<E>cast(item);
unsplice(pred, s);
return e;
if ((spins = spinsFor(pred, s.isData)) > 0)
  randomYields = ThreadLocalRandom.current();

public int getWaitingConsumerCount() {
  return countOfMode(false);
}

protected BlockingQueue<ConcurrentSprite> createQueue() {
 return new LinkedTransferQueue<ConcurrentSprite>();
}

    for (Node q = p; q != h;) {
      if (head == h && casHead(h, n == null ? q : n)) {
        h.forgetNext();
        break;
    return this.<E>cast(item);
if (s == null)
  s = new Node(e, haveData);
Node pred = tryAppend(s, haveData);
if (pred == null)
  continue retry;           // lost race vs opposite mode
if (how != ASYNC)
  return awaitMatch(s, pred, e, (how == TIMED), nanos);

if (hn == null)
  return;          // now empty
if (hn != h && casHead(h, hn))
  int v = sweepVotes;
  if (v < SWEEP_THRESHOLD) {
    if (casSweepVotes(v, v + 1))
      break;
  else if (casSweepVotes(v, 0)) {
    sweep();
    break;

return this.<E>cast(item);
unsplice(pred, s);
return e;
if ((spins = spinsFor(pred, s.isData)) > 0)
  randomYields = ThreadLocalRandom.current();

/**
 * Returns the item in the first unmatched node with isData; or
 * null if none.  Used by peek.
 */
private E firstDataItem() {
  for (Node p = head; p != null; p = succ(p)) {
    Object item = p.item;
    if (p.isData) {
      if (item != null && item != p)
        return this.<E>cast(item);
    }
    else if (item == null)
      return null;
  }
  return null;
}

if (casHead(null, s))
  return s;                 // initialize
  while ((tail != t || !casTail(t, s)) &&
      (t = tail)   != null &&

/**
 * Returns the number of elements in this queue.  If this queue
 * contains more than {@code Integer.MAX_VALUE} elements, returns
 * {@code Integer.MAX_VALUE}.
 *
 * <p>Beware that, unlike in most collections, this method is
 * <em>NOT</em> a constant-time operation. Because of the
 * asynchronous nature of these queues, determining the current
 * number of elements requires an O(n) traversal.
 *
 * @return the number of elements in this queue
 */
public int size() {
  return countOfMode(true);
}

public M1() {
  this.x = new LinkedTransferQueue<TransferObject>();
  this.y = new LinkedTransferQueue<TransferObject>();
}

/**
 * @throws NullPointerException     {@inheritDoc}
 * @throws IllegalArgumentException {@inheritDoc}
 */
public int drainTo(Collection<? super E> c, int maxElements) {
  if (c == null)
    throw new NullPointerException();
  if (c == this)
    throw new IllegalArgumentException();
  int n = 0;
  for (E e; n < maxElements && (e = poll()) != null;) {
    c.add(e);
    ++n;
  }
  return n;
}

/**
 * Reconstitutes the Queue instance from a stream (that is,
 * deserializes it).
 *
 * @param s the stream
 */
private void readObject(java.io.ObjectInputStream s)
  throws java.io.IOException, ClassNotFoundException {
  s.defaultReadObject();
  for (;;) {
    @SuppressWarnings("unchecked") E item = (E) s.readObject();
    if (item == null)
      break;
    else
      offer(item);
  }
}

public int getWaitingConsumerCount() {
  return countOfMode(false);
}