/** Context ID for compression capabilities */
    public static final int NEGO_CTX_COMPRESSION_TYPE = 0x3;

    // SMB3 Compression Algorithms
    /** No compression */
    public static final int COMPRESSION_NONE = 0x0;
    /** LZ77 compression */
    public static final int COMPRESSION_LZ77 = 0x1;
    /** LZ77 + Huffman compression */
    public static final int COMPRESSION_LZ77_HUFFMAN = 0x2;
    /** LZNT1 compression (Windows standard) */

            Ints.indexOf(
                new int[] {(int) 2, (int) 3, (int) 2, (int) 3, (int) 4, (int) 2, (int) 3},
                new int[] {(int) 2, (int) 3, (int) 4}))
        .isEqualTo(2);
    assertThat(
            Ints.indexOf(
                new int[] {(int) 2, (int) 2, (int) 3, (int) 4, (int) 2, (int) 3, (int) 4},
                new int[] {(int) 2, (int) 3, (int) 4}))
        .isEqualTo(1);
    assertThat(

    /**
     * Directory lease flag for recursive caching
     */
    public static final int DIRECTORY_LEASE_FLAG_RECURSIVE = 0x00000001;

    /**
     * Directory lease flag for enabling notifications
     */
    public static final int DIRECTORY_LEASE_FLAG_NOTIFICATIONS = 0x00000002;

    private Smb2LeaseKey leaseKey;
    private int leaseState;
    private DirectoryCacheScope cacheScope;
    private long maxCacheAge;

        }

        public int hashCode() {
            return parent.hashCode();
        }

        public E get(final int index) {
            return parent.get(index);
        }

        public E set(final int index, final E element) {
            return parent.set(index, element);
        }

        public void add(final int index, final E element) {

        this.took = took;
    }

    public int getTotalShards() {
        return totalShards;
    }

    public void setTotalShards(int totalShards) {
        this.totalShards = totalShards;
    }

    public int getSuccessfulShards() {
        return successfulShards;
    }

    public void setSuccessfulShards(int successfulShards) {
        this.successfulShards = successfulShards;
    }

    }

    /** Default page size for pagination */
    public static final int DEFAULT_PAGE_SIZE = 20;

    /** Default current page number for pagination */
    public static final int DEFAULT_CURRENT_PAGE_NUMBER = 1;

    /** Total number of records across all pages */
    private int allRecordCount;

    /** Total number of pages */
    private int allPageCount;

    /** Flag indicating if a previous page exists */

            _src.align(4);
            final int _netnamep = _src.dec_ndr_long();
            this.type = _src.dec_ndr_long();
            final int _remarkp = _src.dec_ndr_long();
            this.permissions = _src.dec_ndr_long();
            this.max_uses = _src.dec_ndr_long();
            this.current_uses = _src.dec_ndr_long();
            final int _pathp = _src.dec_ndr_long();
            final int _passwordp = _src.dec_ndr_long();

    /** Default current page number constant. */
    public static final int DEFAULT_CURRENT_PAGE_NUMBER = 1;

    /** Total number of records across all pages. */
    private int allRecordCount;

    /** Total number of pages calculated from record count and page size. */
    private int allPageCount;

    /** Flag indicating whether a previous page exists. */
    private boolean existPrePage;

     * Test that the constructor initializes all fields correctly
     */
    @Test
    public void testConstructor() {
        // Arrange
        int fid = 0x1234;
        int offset = 100;
        int remaining = 50;
        byte[] buffer = new byte[100];
        int off = 10;
        int len = 40;

        // Act
        SmbComWrite write = new SmbComWrite(fid, offset, remaining, buffer, off, len);

        // Assert

  static void checkAvalanche(HashFunction function, int trials, double epsilon) {
    Random rand = new Random(0);
    int keyBits = 32;
    int hashBits = function.bits();
    for (int i = 0; i < keyBits; i++) {
      int[] same = new int[hashBits];
      int[] diff = new int[hashBits];
      // go through trials to compute probability
      for (int j = 0; j < trials; j++) {
        int key1 = rand.nextInt();