How to use

succ

method

in

jsr166y.LinkedTransferQueue

/**
 * Returns {@code true} if this queue contains the specified element.
 * More formally, returns {@code true} if and only if this queue contains
 * at least one element {@code e} such that {@code o.equals(e)}.
 *
 * @param o object to be checked for containment in this queue
 * @return {@code true} if this queue contains the specified element
 */
public boolean contains(Object o) {
  if (o == null) return false;
  for (Node p = head; p != null; p = succ(p)) {
    Object item = p.item;
    if (p.isData) {
      if (item != null && item != p && o.equals(item))
        return true;
    }
    else if (item == null)
      break;
  }
  return false;
}

/**
 * Returns {@code true} if this queue contains no elements.
 *
 * @return {@code true} if this queue contains no elements
 */
public boolean isEmpty() {
  for (Node p = head; p != null; p = succ(p)) {
    if (!p.isMatched())
      return !p.isData;
  }
  return true;
}

/**
 * Returns the first unmatched node of the given mode, or null if
 * none.  Used by methods isEmpty, hasWaitingConsumer.
 */
private Node firstOfMode(boolean isData) {
  for (Node p = head; p != null; p = succ(p)) {
    if (!p.isMatched())
      return (p.isData == isData) ? p : null;
  }
  return null;
}

/**
 * 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;
}

/**
 * Returns {@code true} if this queue contains the specified element.
 * More formally, returns {@code true} if and only if this queue contains
 * at least one element {@code e} such that {@code o.equals(e)}.
 *
 * @param o object to be checked for containment in this queue
 * @return {@code true} if this queue contains the specified element
 */
public boolean contains(Object o) {
  if (o == null) return false;
  for (Node p = head; p != null; p = succ(p)) {
    Object item = p.item;
    if (p.isData) {
      if (item != null && item != p && o.equals(item))
        return true;
    }
    else if (item == null)
      break;
  }
  return false;
}

/**
 * Returns {@code true} if this queue contains no elements.
 *
 * @return {@code true} if this queue contains no elements
 */
public boolean isEmpty() {
  for (Node p = head; p != null; p = succ(p)) {
    if (!p.isMatched())
      return !p.isData;
  }
  return true;
}

/**
 * Returns the first unmatched node of the given mode, or null if
 * none.  Used by methods isEmpty, hasWaitingConsumer.
 */
private Node firstOfMode(boolean isData) {
  for (Node p = head; p != null; p = succ(p)) {
    if (!p.isMatched())
      return (p.isData == isData) ? p : null;
  }
  return null;
}

/**
 * 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;
}