- **Assertion-based validation** - All methods validate inputs using `AssertionUtil.assertArgumentNotNull()` and `AssertionUtil.assertArgumentNotEmpty()`
- **Exception wrapping** - Checked exceptions are consistently wrapped in runtime exceptions (e.g., `ClassNotFoundException` → `ClassNotFoundRuntimeException`)

        assertNotSame(response1, response2);
        assertEquals(100, response1.getAvailable());
        assertEquals(0, response2.getAvailable());
    }

    @Test
    @DisplayName("All write methods should consistently return 0")
    void testAllWriteMethodsReturnZero() {
        // Arrange
        byte[] buffer = new byte[100];

        // Act & Assert
        assertEquals(0, response.writeSetupWireFormat(buffer, 0));

   *
   * <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.
   *

            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.

   *
   * <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.
   *

 *       in the hash code should be as evenly "spread out" through the hash code's bits as possible.
 *       The result is that, for example, when choosing a bucket in a hash table of size 2^8,
 *       <i>any</i> eight bits could be consistently used.
 *   <li><b>cryptographic:</b> certain hash functions such as {@link Hashing#sha512} are designed to
 *       make it as infeasible as possible to reverse-engineer the input that produced a given hash

            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()];

            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);

   * <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.