@NullUnmarked
public class ContiguousSetTest extends TestCase {
  private static final DiscreteDomain<Integer> NOT_EQUAL_TO_INTEGERS =
      new DiscreteDomain<Integer>() {
        @Override
        public Integer next(Integer value) {
          return integers().next(value);
        }

        @Override
        public Integer previous(Integer value) {
          return integers().previous(value);
        }

        @Override

    @Override
    public DfsReferralDataImpl next() {
        return this.next;
    }

    /**
     * Append another referral to this referral chain
     *
     * @param dr the referral to append
     */
    @Override
    public void append(final DfsReferralDataInternal dr) {
        final DfsReferralDataImpl dri = (DfsReferralDataImpl) dr;
        dri.next = this.next;
        this.next = dri;
    }

    void setRequestCredits(int credits);

    /**
     * Checks if this is a cancel request.
     *
     * @return whether this is a cancel request
     */
    boolean isCancel();

    /**
     * Gets the next request in the chain.
     *
     * @return chained request
     */
    Request getNext();

    /**
     * Gets the response for this request.
     *
     * @return the response for this request
     */

 *
 * @author Kevin Bourrillion
 */
@NullUnmarked
public class SetContainsBenchmark {
  // Start at 4.88 then multiply by 2*2^phi <evil cackle> - The goal is be uniform
  // yet visit a variety of "values-relative-to-the-next-power-of-2"
  @Param({"5", "30", "180", "1100", "6900", "43000", "260000"}) // "1600000", "9800000"
  private int size;

  // TODO(kevinb): look at exact (==) hits vs. equals() hits?
  @Param({"0.2", "0.8"})

    return Iterators.pollNext(descendingIterator());
  }

  @ParametricNullness
  protected E standardFirst() {
    return iterator().next();
  }

  @ParametricNullness
  protected E standardLast() {
    return descendingIterator().next();
  }

  @Override
  public NavigableSet<E> descendingSet() {
    return delegate().descendingSet();
  }

  /**

    return Multisets.immutableEntry(element, count);
  }

  private static <E extends @Nullable Object> Entry<E> control(E element, int count) {
    return HashMultiset.create(nCopies(count, element)).entrySet().iterator().next();
  }

  public void testToString() {
    assertThat(entry("foo", 1).toString()).isEqualTo("foo");
    assertThat(entry("bar", 2).toString()).isEqualTo("bar x 2");
  }

  public void testToStringNull() {

                final CommonServerMessageBlockRequest next = chain.getNext();
                if (log.isTraceEnabled()) {
                    log.trace(String.format("%s costs %d avail %d (%s)", chain.getClass().getName(), cost, this.credits.availablePermits(),
                            this.name));
                }
                if ((next == null || chain.allowChain(next)) && totalSize + size < maxSize && this.credits.tryAcquire(cost)) {

Either side can use `rb.CloseWithError(err error)` to signal an error and close the ring buffer. 
Any reads or writes will return the error on next call.

		if offset >= int64(len(block)) {
			// Decrement offset.
			offset -= int64(len(block))
			continue
		}

		// Skip until offset.
		block = block[offset:]

		// Reset the offset for next iteration to read everything
		// from subsequent blocks.
		offset = 0

		// We have written all the blocks, write the last remaining block.
		if write < int64(len(block)) {
			n, err := dst.Write(block[:write])

     */
    @Override
    public void prepare(final CommonServerMessageBlockRequest next) {
        final CommonServerMessageBlockResponse n = getNextResponse();
        if (n != null) {
            n.prepare(next);
        }
    }

    /**
     * {@inheritDoc}
     *
     * @see jcifs.internal.smb2.ServerMessageBlock2#reset()
     */
    @Override