/**
     * Returns the current index position in the buffer.
     *
     * @return the current index
     */
    public int getIndex() {
        return this.index;
    }

    /**
     * Sets the current index position in the buffer.
     *
     * @param index the new index position
     */
    public void setIndex(final int index) {
        this.index = index;
    }

    /**

        // Instead, we verify the interaction with the DcerpcHandle and the return value.
        // The fact that the constructor completes without exception and sets 'opened' to true
        // implies the correct parameters were used internally.
    }

    @Test
    void constructor_shouldThrowSmbExceptionOnOpenFailure() throws IOException {
        // Arrange

 * Unit tests for {@link NtlmChallenge}.
 */
class NtlmChallengeTest {

    @Nested
    @DisplayName("Constructor and Field Tests")
    class ConstructorTests {

        @Test
        @DisplayName("Constructor sets fields correctly")
        void testConstructorSetsFields() {
            byte[] challenge = new byte[] { 1, 2, 3 };
            UniAddress dc = mock(UniAddress.class);

        queryList.add(candidate);
      }
    }
    shuffle(queryList, random);
    return queryList.toArray(new Element[0]);
  }

  private Set<Element> createData() {
    Set<Element> set = Sets.newHashSetWithExpectedSize(size);
    while (set.size() < size) {
      set.add(newElement());
    }
    return set;
  }

  private Element newElement() {
    int value = random.nextInt();

```

### Create a Pull Request

Pull requests can be created via GitHub. Refer to [this document](https://help.github.com/articles/creating-a-pull-request/) for detailed steps on how to create a pull request. After a Pull Request gets peer reviewed and approved, it will be merged.

## FAQs

### How does ``MinIO`` manage dependencies?

``MinIO`` uses `go mod` to manage its dependencies.

        && isHashCodeFast()
        && ((ImmutableSet<?>) object).isHashCodeFast()
        && hashCode() != object.hashCode()) {
      return false;
    }
    return Sets.equalsImpl(this, object);
  }

  @Override
  public int hashCode() {
    return Sets.hashCodeImpl(this);
  }

  // This declaration is needed to make Set.iterator() and
  // ImmutableCollection.iterator() consistent.
  @Override

  /**
   * Constructs a new {@code MapMaker} instance with default settings, including strong keys, strong
   * values, and no automatic eviction of any kind.
   */
  public MapMaker() {}

  /**
   * Sets a custom {@code Equivalence} strategy for comparing keys.
   *
   * <p>By default, the map uses {@link Equivalence#identity} to determine key equality when {@link

    void testSizeWithEmptyPath() {
        request = new Smb2CreateRequest(mockConfig, "");

        int expectedSize = Smb2Constants.SMB2_HEADER_LENGTH + 56;
        expectedSize += 8; // size8(1) - empty name gets 1 byte
        expectedSize = ((expectedSize + 7) / 8) * 8; // size8(size)

        assertEquals(expectedSize, request.size());
    }

    @Test
    @DisplayName("Test createResponse")

   *
   * ```
   * [5] EXPLICIT UTF8String
   * ```
   *
   * @param forceConstructed non-null to set the constructed bit to the specified value, even if the
   *     writing process sets something else. This is used to encode SEQUENCES in values that are
   *     declared to have non-constructed values, like OCTET STRING values.
   */

points to the public IP address where each cluster might be accessible, this is unique for each cluster.

NOTE: `mybucket` only exists on one cluster either `cluster1` or `cluster2` this is random and
is decided by how `domain.com` gets resolved, if there is a round-robin DNS on `domain.com` then
it is randomized which cluster might provision the bucket.

### 3. Test your setup