* @param obj
     *            the object to search for
     * @param fromIndex
     *            the index to start the search from
     * @return the index of the first occurrence of the object in the array, or {@literal -1} if not found
     */
    public static <T> int indexOf(final T[] array, final T obj, final int fromIndex) {
        if (array != null) {
            for (int i = fromIndex; i < array.length; ++i) {

            return null; // Not relevant for AbstractCIFSContext tests
        }

        @Override
        public SidResolver getSIDResolver() {
            return null; // Not relevant for AbstractCIFSContext tests
        }

        @Override
        public DfsResolver getDfs() {
            return null; // Not relevant for AbstractCIFSContext tests
        }

        @Override

            assertEquals(4, buffer.size()); // 2 bytes for level + 2 bytes for null terminator
        }

        @Test
        @DisplayName("Should create buffer with null path")
        void testConstructorWithNullPath() {
            String path = null;
            int maxReferralLevel = 2;

            // The implementation doesn't check for null in constructor

 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * Lesser General Public License for more details.
 */
package jcifs.internal.smb2.persistent;

/**
 * Constants for SMB2/3 durable and persistent handle capabilities.
 */
public final class Smb2HandleCapabilities {

    /**

t&&"default"in t?t:{default:t}}var o=i(e),a=i(n);function s(t,e){for(var n=0;n<e.length;n++){var i=e[n];i.enumerable=i.enumerable||!1,i.configurable=!0,"value"in i&&(i.writable=!0),Object.defineProperty(t,i.key,i)}}function l(t,e,n){return e&&s(t.prototype,e),n&&s(t,n),Object.defineProperty(t,"prototype",{writable:!1}),t}function r(){return r=Object.assign?Object.assign.bind():function(t){for(var e=1;e<arguments.length;e++){var n=arguments[e];for(var i in n)Object.prototype.hasOwnProperty.call(n,i)&&(t[i]=n[i])}return...

     */
    public QueryStringBuilder params(final SearchRequestParams params) {
        this.params = params;
        return this;
    }

    /**
     * Sets the sort field for the query.
     * This method follows the builder pattern for method chaining.
     *
     * @param sortField the field name to sort by
     * @return this QueryStringBuilder instance for method chaining

        // This is a simplified HMAC-MD5 calculation for comparison, not a full RFC 2104 implementation.
        // The HMACT64 implementation is what we are testing.
        MessageDigest md5 = MessageDigest.getInstance("MD5");
        byte[] ipad = new byte[64];
        byte[] opad = new byte[64];

        for (int i = 0; i < key.length; i++) {

    }

    /**
     * Gets the delay time in milliseconds for waiting for new URLs.
     *
     * @return the delay time in milliseconds for waiting for new URLs
     */
    public long getDelayMillisForWaitingNewUrl() {
        return delayMillisForWaitingNewUrl;
    }

    /**
     * Sets the delay time in milliseconds for waiting for new URLs.
     *

	if err != nil {
		t.Fatal(err)
	}

	for f := range 2 {
		diskErrors := make(map[int]error)
		for i := 0; i <= f; i++ {
			diskErrors[i] = nil
		}
		erasureDisks := xl.getDisks()
		for i := range erasureDisks[:9] {
			switch diskType := erasureDisks[i].(type) {
			case *naughtyDisk:

    // Add one-ended ranges
    for (int i = MIN_BOUND; i <= MAX_BOUND; i++) {
      for (BoundType type : BoundType.values()) {
        builder.add(Range.upTo(i, type));
        builder.add(Range.downTo(i, type));
      }
    }

    // Add two-ended ranges
    for (int i = MIN_BOUND; i <= MAX_BOUND; i++) {
      for (int j = i; j <= MAX_BOUND; j++) {
        for (BoundType lowerType : BoundType.values()) {