}

    /**
     * Sets the command array for user update operations.
     * @param updateCommand The update command array.
     */
    public void setUpdateCommand(final String[] updateCommand) {
        this.updateCommand = updateCommand;
    }

    /**
     * Sets the command array for user deletion operations.
     * @param deleteCommand The delete command array.
     */

      }
      Class<?> returnType = method.getReturnType();
      assertTrue(
          rootLocaleFormat("%s.%s() must return an array.", annotationClass, propertyName),
          returnType.isArray());
      assertSame(
          rootLocaleFormat(
              "%s.%s() must return an array of %s.",
              annotationClass, propertyName, annotationClass.getDeclaringClass()),
          annotationClass.getDeclaringClass(),

    /**
     * The number of search results to return per page.
     */
    @ValidateTypeFailure
    public Integer num;

    /**
     * Array of language codes to filter search results.
     */
    public String[] lang;

    /**
     * Array of additional query strings to exclude from search.
     */
    public String[] ex_q;

    /**
     * The starting position for search results pagination.
     */

    @Test
    @DisplayName("getEntries should return empty array when no DFS roots exist")
    void testGetEntries_emptyArray() throws Exception {
        // Create empty DfsEnumArray200
        netdfs.DfsEnumArray200 emptyArray = new netdfs.DfsEnumArray200();
        emptyArray.count = 0;
        emptyArray.s = new netdfs.DfsInfo200[0];

        // Replace the info.e field with our empty array
        setDfsEnumArray(dfsRootEnum, emptyArray);

  }

  /** Convenience method to compute a fingerprint on a full bytes array. */
  private static long fingerprint(byte[] bytes) {
    return fingerprint(bytes, bytes.length);
  }

  /** Convenience method to compute a fingerprint on a subset of a byte array. */
  private static long fingerprint(byte[] bytes, int length) {
    return HASH_FN.hashBytes(bytes, 0, length).asLong();
  }

/**
 * Read and write HPACK v10.
 *
 * http://tools.ietf.org/html/draft-ietf-httpbis-header-compression-12
 *
 * This implementation uses an array for the dynamic table and a list for indexed entries. Dynamic
 * entries are added to the array, starting in the last position moving forward. When the array
 * fills, it is doubled.
 */
@Suppress("NAME_SHADOWING")
object Hpack {
  private const val PREFIX_4_BITS = 0x0f

    }

    /**
     * Get the referral flags
     *
     * @return the tflags
     */
    public final int getTflags() {
        return this.tflags;
    }

    /**
     * Get the array of referral entries
     *
     * @return the referrals
     */
    public final Referral[] getReferrals() {
        return this.referrals;
    }

    @Override

    }

    /**
     * Validates array is not null and has expected length
     *
     * @param array the array to validate
     * @param expectedLength the expected length
     * @param fieldName the field name for error reporting
     * @throws IllegalArgumentException if array is invalid
     */
    public static void validateArrayLength(byte[] array, int expectedLength, String fieldName) {

    }

    /**
     * Simplifies the array.
     *
     * @param values The array.
     * @return The simplified array.
     */
    protected static String[] simplifyArray(final String[] values) {
        return stream(values).get(stream -> stream.filter(StringUtil::isNotBlank).distinct().toArray(n -> new String[n]));
    }

    /**
     * Returns the parameter value array.
     *
     * @param request The request.

   * lies outside the stated safe range. Subclasses should override this method to provide
   * generalized escaping for characters.
   *
   * <p>Note that arrays returned by this method must not be modified once they have been returned.
   * However it is acceptable to return the same array multiple times (even for different input
   * characters).
   *