assertEquals(200L, SMBUtil.readInt8(smallBuffer, 8));
            assertEquals(1, SMBUtil.readInt4(smallBuffer, 16));
        }

        @ParameterizedTest
        @DisplayName("Should encode consistently with various flag values")
        @ValueSource(ints = { 0, 1, 2, 4, 16, 0xFF, 0xFFFF, 0xFFFFFF, 0x7FFFFFFF, -1 })
        void testEncodingWithVariousFlags(int flags) {
            lock = new Smb2Lock(1024L, 2048L, flags);

            assertEquals(13312L, SMBUtil.readInt8(buffer, offset + 8));
            assertEquals(16384, SMBUtil.readInt4(buffer, offset + 16));
        }

        @Test
        @DisplayName("Should encode consistently with size method")
        void testEncodeSizeConsistency() {
            // Given
            byte[] sourceKey = new byte[SOURCE_KEY_SIZE];
            Arrays.fill(sourceKey, (byte) 0x55);

            jcifs.CIFSContext context = createDefaultContext();

            // Create transport with multi-channel specific settings
            // Multi-channel transports should use signing consistently with the main session
            boolean forceSigning = context.getConfig().isSigningEnforced();

   * <p>The {@code hash} has the following properties:
   *
   * <ul>
   *   <li>It is <i>consistent</i>: for any reference {@code x}, multiple invocations of {@code
   *       hash(x}} consistently return the same value provided {@code x} remains unchanged
   *       according to the definition of the equivalence. The hash need not remain consistent from
   *       one execution of an application to another execution of the same application.

            byte[] encodedPath = new byte[pathBytes.length];
            bb.get(encodedPath);
            assertArrayEquals(pathBytes, encodedPath);
        }

        @Test
        @DisplayName("Should encode consistently on multiple calls")
        void testEncodeIdempotency() {
            String path = "\\\\server\\share";
            buffer = new DfsReferralRequestBuffer(path, 3);

            byte[] dst1 = new byte[buffer.size()];

   *
   * <p><b>Note:</b> if you won't be adding any elements to the list, use {@link ImmutableList#of()}
   * instead.
   *
   * <p><b>Performance note:</b> {@link ArrayList} and {@link java.util.ArrayDeque} consistently
   * outperform {@code LinkedList} except in certain rare and specific situations. Unless you have
   * spent a lot of time benchmarking your specific needs, use one of those instead.
   *

        }
      };
    }

    /**
     * Uses a {@link LinkedList} to store value collections.
     *
     * <p><b>Performance note:</b> {@link ArrayList} and {@link java.util.ArrayDeque} consistently
     * outperform {@code LinkedList} except in certain rare and specific situations. Unless you have
     * spent a lot of time benchmarking your specific needs, use one of those instead. (However, we

        }
      };
    }

    /**
     * Uses a {@link LinkedList} to store value collections.
     *
     * <p><b>Performance note:</b> {@link ArrayList} and {@link java.util.ArrayDeque} consistently
     * outperform {@code LinkedList} except in certain rare and specific situations. Unless you have
     * spent a lot of time benchmarking your specific needs, use one of those instead. (However, we

    assertEquals(1, IntMath.saturatedAbs(-1));
    assertEquals(10, IntMath.saturatedAbs(10));
    assertEquals(10, IntMath.saturatedAbs(-10));
  }

  private static int force32(int value) {
    // GWT doesn't consistently overflow values to make them 32-bit, so we need to force it.
    return value & 0xffffffff;
  }

    long div = p / q; // throws if q == 0
    long rem = p - q * div; // equals p % q

    if (rem == 0) {
      return div;
    }

    /*
     * Normal Java division rounds towards 0, consistently with RoundingMode.DOWN. We just have to
     * deal with the cases where rounding towards 0 is wrong, which typically depends on the sign of
     * p / q.
     *