* The priority length is the number of characters before any wildcard.
         *
         * @param pattern the path pattern
         * @return the priority length
         */
        private static int calculatePriorityLength(final String pattern) {
            // For priority, we count the pattern length, treating * as having length 0
            // and $ as having length 1
            int length = 0;

     * Tests the {@link PacUnicodeString#check(String)} method with a string of incorrect length.
     */
    @Test
    void testCheck_withInvalidLength_throwsException() {
        // Length is 10 bytes, so expected string length is 5 characters
        PacUnicodeString pacString = new PacUnicodeString((short) 10, (short) 20, 100);
        String testString = "too-long"; // Length is 8

        // Expect a PACDecodingException to be thrown

    private int length; // 4 bytes: Length of buffer

    /**
     * Create SMB2 RDMA Transform
     *
     * @param offset offset within registered buffer
     * @param token RDMA provider token (steering tag/memory handle)
     * @param length length of buffer
     */
    public Smb2RdmaTransform(long offset, int token, int length) {
        this.offset = offset;
        this.token = token;

// If length <= 0, the access key length is chosen automatically.
//
// GenerateAccessKey returns an error if length is too small for a valid
// access key.
func GenerateAccessKey(length int, random io.Reader) (string, error) {
	if random == nil {
		random = rand.Reader
	}
	if length <= 0 {
		length = accessKeyMaxLen
	}
	if length < accessKeyMinLen {

      if (x.length() != (originalString.length() * count)) {
        throw new RuntimeException("Wrong length: " + x);
      }
    }
  }

  private static String oldRepeat(String string, int count) {
    // If this multiplication overflows, a NegativeArraySizeException or
    // OutOfMemoryError is not far behind
    int len = string.length();
    int size = len * count;
    char[] array = new char[size];

            buffer[SmbConstants.SMB1_HEADER_LENGTH] = 0;
            SMBUtil.writeInt2(0, buffer, SmbConstants.SMB1_HEADER_LENGTH + 1);

            int length = testBlock.decode(buffer, 0);

            assertNotNull(testBlock.getRawPayload());
            assertEquals(length, testBlock.getRawPayload().length);
        }
    }

    @Nested

        final String[] roles = new String[roles1.length + roles2.length];

        if (roles1.length > 0) {
            System.arraycopy(roles1, 0, roles, 0, roles1.length);
        }
        if (roles2.length > 0) {
            System.arraycopy(roles2, 0, roles, roles1.length, roles2.length);
        }

        final List<SuggestItem> items = new ArrayList<>(fields.length);
        try {

    }

    @Override
    public K[] createKeyArray(int length) {
      return ((TestMultimapGenerator<K, V, M>) multimapGenerator.getInnerGenerator())
          .createKeyArray(length);
    }

    @SuppressWarnings("unchecked")
    @Override
    public Collection<V>[] createValueArray(int length) {
      return (Collection<V>[]) new Collection<?>[length];
    }
  }

    @Override
    public boolean isRoot() {
        // length == 0 should not happen
        return getShare() == null && getUNCPath().length() <= 1;
    }

    boolean isRootOrShare() {
        // length == 0 should not happen
        return getUNCPath().length() <= 1;
    }

    /**
     * @throws MalformedURLException
     *
     */
    private synchronized void canonicalizePath() {

   */
  public static boolean equalsIgnoreCase(CharSequence s1, CharSequence s2) {
    // Calling length() is the null pointer check (so do it before we can exit early).
    int length = s1.length();
    if (s1 == s2) {
      return true;
    }
    if (length != s2.length()) {
      return false;
    }
    for (int i = 0; i < length; i++) {
      char c1 = s1.charAt(i);
      char c2 = s2.charAt(i);
      if (c1 == c2) {