* but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * Lesser General Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public
 * License along with this library; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 */

 *
 * <p>This class does <i>not</i> forward the {@code hashCode} and {@code equals} methods through to
 * the backing object, but relies on {@code Object}'s implementation. This is necessary to preserve
 * the symmetry of {@code equals}. Custom definitions of equality are usually based on an interface,
 * such as {@code Set} or {@code List}, so that the implementation of {@code equals} can cast the

        // Act
        SMBSignatureValidationException ex = new SMBSignatureValidationException("msg", mocked);

        // Assert
        assertSame(mocked, ex.getCause(), "Mocked cause should be preserved");
        verifyNoInteractions(mocked);
    }

    // Reflection-based check: ensure serialVersionUID remains the declared constant
    @Test
    @DisplayName("serialVersionUID matches declared constant")

        for (String pipeName : pipeNames) {
            TransWaitNamedPipe pipe = new TransWaitNamedPipe(pipeName);
            assertEquals(pipeName, pipe.name, "Pipe name should be preserved: " + pipeName);
            assertEquals(ServerMessageBlock.SMB_COM_TRANSACTION, pipe.command);
            assertEquals(SmbComTransaction.TRANS_WAIT_NAMED_PIPE, pipe.subCommand);
        }
    }

  // * Future completion can be observed if the waitersField field contains a TOMBSTONE

  // Timed Get
  // There are a few design constraints to consider
  // * We want to be responsive to small timeouts, unpark() has non trivial latency overheads (I
  //   have observed 12 micros on 64-bit linux systems to wake up a parked thread). So if the

   * only become known via CAS failures, convergence can be slow,
   * and because threads are typically not bound to CPUS forever,
   * may not occur at all. However, despite these limitations,
   * observed contention rates are typically low in these cases.
   *
   * It is possible for a Cell to become unused when threads that
   * once hashed to it terminate, as well as in the case where

  // * Future completion can be observed if the waitersField field contains a TOMBSTONE

  // Timed Get
  // There are a few design constraints to consider
  // * We want to be responsive to small timeouts, unpark() has non trivial latency overheads (I
  //   have observed 12 micros on 64-bit linux systems to wake up a parked thread). So if the

                    assertTrue(e instanceof TransportException);
                }
            });
        }

        @Test
        @DisplayName("Should preserve IOException behavior")
        void testIOExceptionBehavior() {
            String message = "IO operation failed";
            TransportException exception = new TransportException(message);

        // Encode to set headerStart
        req.encode(buffer, 0);

        // Then
        byte[] pathBytes = unicodePath.getBytes(StandardCharsets.UTF_16LE);

        // Verify Unicode path is preserved
        byte[] actualPath = new byte[pathBytes.length];
        System.arraycopy(buffer, Smb2Constants.SMB2_HEADER_LENGTH + 8, actualPath, 0, pathBytes.length);
        assertArrayEquals(pathBytes, actualPath);
    }

        NdrBuffer decodeBuffer = new NdrBuffer(buffer, 0);
        lsarpc.LsarDomainInfo decodedInfo = new lsarpc.LsarDomainInfo();
        decodedInfo.decode(decodeBuffer);

        // Verify nulls are preserved
        assertEquals(0, decodedInfo.name.length);
        assertEquals(0, decodedInfo.name.maximum_length);
        assertNull(decodedInfo.name.buffer);
        assertNull(decodedInfo.sid);
    }

    @Test