assertEquals("1.2.840.113554.1.2.2", SpnegoConstants.KERBEROS_MECHANISM, "KERBEROS_MECHANISM mismatch");
        assertEquals("1.2.840.48018.1.2.2", SpnegoConstants.LEGACY_KERBEROS_MECHANISM, "LEGACY_KERBEROS_MECHANISM mismatch");
        assertEquals("1.3.6.1.4.1.311.2.2.10", SpnegoConstants.NTLMSSP_MECHANISM, "NTLMSSP_MECHANISM mismatch");
    }

    @Test

    if (getList().size() != expectedList.size()) {
      fail("size mismatch: " + reportContext(expectedList));
    }
    for (int i = 0; i < expectedList.size(); i++) {
      E expected = expectedList.get(i);
      E actual = getList().get(i);
      if (expected != actual && (expected == null || !expected.equals(actual))) {
        fail("mismatch at index " + i + ": " + reportContext(expectedList));
      }
    }
  }

    if (getList().size() != expectedList.size()) {
      fail("size mismatch: " + reportContext(expectedList));
    }
    for (int i = 0; i < expectedList.size(); i++) {
      E expected = expectedList.get(i);
      E actual = getList().get(i);
      if (expected != actual && (expected == null || !expected.equals(actual))) {
        fail("mismatch at index " + i + ": " + reportContext(expectedList));
      }
    }
  }

        final int actual = getLength();
        if (exp != actual) {
            // Log the size mismatch for debugging but don't throw exception
            // This can occur due to padding alignment differences between size8() and pad8()
            if (log.isDebugEnabled()) {
                log.debug("Size calculation mismatch: expected {} but got {} (difference: {})", exp, actual, actual - exp);
            }
        }

        for (int i = 0; i < testStringTrue.length(); i++) {
            assertEquals(testStringTrue.charAt(i), (char) unicodeStringTrue.buffer[i], "Character mismatch");
        }
        assertEquals(0, unicodeStringTrue.buffer[testStringTrue.length()], "Last character should be zero");

        // Test with a non-empty string and zterm = false
        String testStringFalse = "Hello";

    /**
     * NDR encoding error fault code
     */
    int DCERPC_FAULT_NDR = 0x000006F7;
    /**
     * Invalid tag fault code
     */
    int DCERPC_FAULT_INVALID_TAG = 0x1C000006;
    /**
     * Context mismatch fault code
     */
    int DCERPC_FAULT_CONTEXT_MISMATCH = 0x1C00001A;
    /**
     * Operation range error fault code
     */
    int DCERPC_FAULT_OP_RNG_ERROR = 0x1C010002;
    /**

    /**
     * NDR encoding error fault code
     */
    int DCERPC_FAULT_NDR = 0x000006F7;
    /**
     * Invalid tag fault code
     */
    int DCERPC_FAULT_INVALID_TAG = 0x1C000006;
    /**
     * Context mismatch fault code
     */
    int DCERPC_FAULT_CONTEXT_MISMATCH = 0x1C00001A;
    /**
     * Operation range error fault code
     */
    int DCERPC_FAULT_OP_RNG_ERROR = 0x1C010002;
    /**

                urlMatch = responseData.getUrl().matches(urlPattern);
            }

            boolean mimeMatch = true;
            if (mimeTypePattern != null && responseData.getMimeType() != null) {
                mimeMatch = responseData.getMimeType().matches(mimeTypePattern);
            }

            return urlMatch && mimeMatch;
        }

        public void setUrlPattern(String urlPattern) {

            }
            byte[] expected = calculateMIC(data);
            if (mic.length != expected.length || mic[0] != expected[0]) {
                throw new CIFSException("MIC mismatch");
            }
        }

        @Override
        public boolean isMICAvailable() {
            // Available if context is established and integrity is supported

          + "adjacentNode(node) if you already have a node, or nodeU()/nodeV() if you don't.";
  static final String EDGE_ALREADY_EXISTS = "Edge %s already exists in the graph.";
  static final String ENDPOINTS_MISMATCH =
      "Mismatch: endpoints' ordering is not compatible with directionality of the graph";

  /** Singleton edge value for {@link Graph} implementations backed by {@link ValueGraph}s. */
  enum Presence {
    EDGE_EXISTS
  }