level = DeprecationLevel.ERROR,
  )
  fun socketAddress(): InetSocketAddress = socketAddress

  /**
   * Returns true if this route tunnels HTTPS or HTTP/2 through an HTTP proxy.
   * See [RFC 2817, Section 5.2][rfc_2817].
   *
   * [rfc_2817]: http://www.ietf.org/rfc/rfc2817.txt
   */
  fun requiresTunnel(): Boolean {
    if (proxy.type() != Proxy.Type.HTTP) return false
    return (address.sslSocketFactory != null) ||

   * typically useful for {@code return} statements. That leaves the code with two options: Either
   * add the suppression to the whole method (which turns off checking for a large section of code),
   * or extract a variable, and put the suppression on that. However, a local variable typically
   * doesn't work: Because nullness analyses typically infer the nullness of local variables,

   * typically useful for {@code return} statements. That leaves the code with two options: Either
   * add the suppression to the whole method (which turns off checking for a large section of code),
   * or extract a variable, and put the suppression on that. However, a local variable typically
   * doesn't work: Because nullness analyses typically infer the nullness of local variables,

        assertNotNull(notifications);
        assertTrue(notifications.isEmpty());
    }

    @Test
    @DisplayName("Test NotifyResponse with different file actions")
    void testNotifyResponseWithDifferentFileActions() {
        // Create mock notifications for different actions
        FileNotifyInformation addedFile = mock(FileNotifyInformation.class);
        when(addedFile.getAction()).thenReturn(FileNotifyInformation.FILE_ACTION_ADDED);

                    FileNotifyInformation.FILE_ACTION_REMOVED_BY_DELETE };

            // Verify sequential values from 1 to 9
            for (int i = 0; i < actions.length; i++) {
                assertEquals(i + 1, actions[i], String.format("Action at index %d should have value %d", i, i + 1));
            }
        }
    }

    @Nested
    @DisplayName("Interface Methods Tests")

   *
   * <p>If you are designing a new system that needs HMAC, prefer {@link #hmacSha256} or other
   * future-proof algorithms <a
   * href="https://datatracker.ietf.org/doc/html/rfc6151#section-2.3">over {@code hmacMd5}</a>.
   *
   * @param key the secret key
   * @throws IllegalArgumentException if the given key is inappropriate for initializing this MAC
   * @since 20.0
   */

  private val deflatedBytes = Buffer()

  // Lazily-created.
  private var inflater: Inflater? = null
  private var inflaterSource: InflaterSource? = null

  /** Inflates [buffer] in place as described in RFC 7692 section 7.2.2. */
  @Throws(IOException::class)
  fun inflate(buffer: Buffer) {
    require(deflatedBytes.size == 0L)

    val inflater =
      this.inflater
        ?: Inflater(true).also { this.inflater = it }

    // places left to rotate.
    int m = -distance % length;
    m = (m < 0) ? m + length : m;
    // The current index of what will become the first element of the rotated section.
    int newFirstIndex = m + fromIndex;
    if (newFirstIndex == fromIndex) {
      return;
    }

    reverse(array, fromIndex, newFirstIndex);
    reverse(array, newFirstIndex, toIndex);

 */
package jcifs.internal.smb2.persistent;

import jcifs.internal.smb2.create.CreateContextRequest;
import jcifs.internal.util.SMBUtil;

/**
 * SMB2 Durable Handle Request Create Context (DHnQ)
 *
 * MS-SMB2 Section 2.2.13.2.3
 */
public class DurableHandleRequest implements CreateContextRequest {

    /**
     * Context name for durable handle request
     */
    public static final String CONTEXT_NAME = "DHnQ";

   *
   * <p><i>Notes:</i> This is an implementation of the algorithm for Lexicographical Permutations
   * Generation, described in Knuth's "The Art of Computer Programming", Volume 4, Chapter 7,
   * Section 7.2.1.2. The iteration order follows the lexicographical order. This means that the
   * first permutation will be in ascending order, and the last will be in descending order.
   *