auth1.equals(auth2);
        }
    }

    /**
     * Test that password comparison is constant-time by comparing execution times
     * for passwords that differ at different positions.
     */
    @Test
    public void testConstantTimePasswordComparison() throws Exception {

              *)    false ;;
            esac
        then
            arg=$( cygpath --path --ignore --mixed "$arg" )
        fi
        # Roll the args list around exactly as many times as the number of
        # args, so each arg winds up back in the position where it started, but
        # possibly modified.
        #
        # NB: a `for` loop captures its iteration list before it begins, so

    /**
     * Establishes a connection to the remote endpoint.
     *
     * @param timeout the maximum time to wait for the connection in milliseconds
     * @throws TransportException if the connection fails or times out
     */
    public synchronized void connect(final long timeout) throws TransportException {
        try {
            switch (state) {
            case 0:

  /**
   * Returns the result of multiplying this and {@code val}. If the result would have more than 64
   * bits, returns the low 64 bits of the result.
   *
   * @since 14.0
   */
  public UnsignedLong times(UnsignedLong val) {
    return fromLongBits(value * checkNotNull(val).value);
  }

  /**
   * Returns the result of dividing this by {@code val}.
   *
   * @since 14.0
   */

        decoded.decode(buffer, 0, 36); // decode reads 36 bytes

        // Note: When encoding time 0, SMBUtil.writeTime writes 0 directly,
        // but SMBUtil.readTime interprets 0 as Jan 1, 1601 in Unix time (-11644473600000)
        // This is the expected behavior for Windows FILETIME
        long expectedTime = -11644473600000L; // Jan 1, 1601 in Unix time
        assertEquals(expectedTime, decoded.getCreateTime());

   *         .putEdgeValue(BERLIN, BRUSSELS, kilometers(764))
   *         .addNode(REYKJAVIK)
   *         .build();
   * }
   *
   * <p>Builder instances can be reused; it is safe to call {@link #build} multiple times to build
   * multiple graphs in series. Each new graph contains all the elements of the ones created before
   * it.
   *
   * @since 28.0
   */
  public static class Builder<N, V> {

import static org.mockito.ArgumentMatchers.anyInt;
import static org.mockito.ArgumentMatchers.eq;
import static org.mockito.ArgumentMatchers.isNull;
import static org.mockito.Mockito.mock;
import static org.mockito.Mockito.times;
import static org.mockito.Mockito.verify;

import org.junit.jupiter.api.BeforeEach;
import org.junit.jupiter.api.DisplayName;
import org.junit.jupiter.api.Nested;
import org.junit.jupiter.api.Test;

    /**
     * Set the last access time of the file. The time is specified as milliseconds
     * from Jan 1, 1970 which is the same as that which is returned by the
     * <code>lastAccess()</code> method.
     * <br>
     * This method does not apply to workgroups, servers, or shares.
     *
     * @param time
     *            the last access time as milliseconds since Jan 1, 1970

   * e]}.
   */
  @Override
  String toString();

  // Refined Collection Methods

  /**
   * {@inheritDoc}
   *
   * <p>Elements that occur multiple times in the multiset will appear multiple times in this
   * iterator, though not necessarily sequentially.
   */
  @Override
  Iterator<E> iterator();

  /**
   * Determines whether this multiset contains the specified element.

    private byte[] createMockFileBasicInfoBuffer() {
        // Create a buffer that represents FileBasicInfo data
        // FileBasicInfo typically contains creation time, last access time, last write time, change time, and attributes
        byte[] buffer = new byte[40];

        // Mock times (8 bytes each)
        for (int i = 0; i < 32; i++) {
            buffer[i] = (byte) (i % 256);
        }

        // Mock attributes (4 bytes)