}

    int writeResourceRecordWireFormat(final byte[] dst, int dstIndex) {
        final int start = dstIndex;
        if (recordName == questionName) {
            dst[dstIndex] = (byte) 0xC0; // label string pointer to
            dstIndex++;
            dst[dstIndex++] = (byte) 0x0C; // questionName (offset 12)
        } else {
            dstIndex += recordName.writeWireFormat(dst, dstIndex);
        }

      entries[srcIndex] = 0;

      // also need to update whoever's "next" pointer was pointing to the last entry place
      int tableIndex = smearedHash(key) & mask;
      int next = CompactHashing.tableGet(table, tableIndex);
      int srcNext = srcIndex + 1;
      if (next == srcNext) {
        // we need to update the root pointer
        CompactHashing.tableSet(table, tableIndex, dstIndex + 1);
      } else {

    void testCapacityEdgeValues(long capacity) {
        when(mockAllocInfo.getCapacity()).thenReturn(capacity);
        assertEquals(capacity, mockAllocInfo.getCapacity());
    }

    /**
     * Null pointer scenario – calls on a null reference should raise
     * {@link NullPointerException}. This test is defensive; in real code it
     * would likely be handled elsewhere.
     */
    @Test

     *
     * @return the expiration time of this entry
     */
    long getExpiration();

    /**
     * Get the next referral in the chain
     *
     * @return pointer to next referral, points to self if there is no further referral
     */
    DfsReferralData next();

    /**
     * Get the complete UNC path link for this referral
     *
     * @return the link
     */

        $submitButton[0].submit();
      }
      // ignore enter key down
      return false;
    }
  });

  $(".table tr[data-href]").each(function() {
    $(this)
      .css("cursor", "pointer")
      .hover(
        function() {
          $(this).addClass("active");
        },
        function() {
          $(this).removeClass("active");
        }
      )
      .click(function() {

            if (isFailure.test(e)) {
                onFailure(e);
            } else {
                // Not considered a failure for circuit breaker purposes
                log.debug("[{}] Exception not counted as circuit breaker failure: {}", name, e.getMessage());
            }

            if (e instanceof CIFSException) {
                throw (CIFSException) e;
            }

public class SynchronizedDequeTest extends TestCase {

  protected Deque<String> create() {
    TestDeque<String> inner = new TestDeque<>();
    Deque<String> outer = Synchronized.deque(inner, inner.mutex);
    outer.add("foo"); // necessary because we try to remove elements later on
    return outer;
  }

  private static final class TestDeque<E> implements Deque<E> {
    private final Deque<E> delegate = new LinkedList<>();

  }

  @Override
  public void testNulls() throws Exception {
    try {
      super.testNulls();
    } catch (AssertionError e) {
      assertWithMessage("Method did not throw null pointer OR element not in graph exception.")
          .that(e)
          .hasCauseThat()
          .hasMessageThat()
          .contains(ERROR_ELEMENT_NOT_IN_GRAPH);
    }
  }

  }

  @Throws(EOFException::class)
  private fun skipName(source: Buffer) {
    // 0 - 63 bytes
    var length = source.readByte().toInt()

    if (length < 0) {
      // compressed name pointer, first two bits are 1
      // drop second byte of compression offset
      source.skip(1)
    } else {
      while (length > 0) {
        // skip each part of the domain name
        source.skip(length.toLong())

        // Prepare a byte array with valid NetBIOS name format
        byte[] src = new byte[100];
        int srcIndex = 0;

        // Start with compressed name pointer (0xC0) to use questionName
        src[srcIndex] = (byte) 0xC0;
        src[srcIndex + 1] = 0x0C; // Pointer offset
        // recordType (2 bytes)
        src[srcIndex + 2] = 0x00;
        src[srcIndex + 3] = 0x20; // NB (0x0020)
        // recordClass (2 bytes)