}

        @Test
        @DisplayName("Should reject null data buffer in sign method")
        void testSignNullDataBuffer() {
            assertThrows(IllegalArgumentException.class, () -> digest.sign(null, 0, 100, request, response),
                    "Should throw IllegalArgumentException for null data buffer");
        }

        @Test

            }

            final ByteBuffer buffer = ByteBuffer.allocate((int) fileSize);
            ChannelUtil.read(channel, buffer);
            return buffer.array();
        } finally {
            CloseableUtil.close(is);
        }
    }

    /**
     * Reads text from a file using the default encoding.

  internal const val CLOSE_NO_STATUS_CODE = 1005

  fun toggleMask(
    cursor: Buffer.UnsafeCursor,
    key: ByteArray,
  ) {
    var keyIndex = 0
    val keyLength = key.size
    do {
      val buffer = cursor.data
      var i = cursor.start
      val end = cursor.end
      if (buffer != null) {
        while (i < end) {

    /**
     * Performs RDMA read operation.
     *
     * @param buffer the buffer to read into
     * @param remoteAddress remote memory address
     * @param remoteKey remote access key
     * @param length number of bytes to read
     * @return number of bytes read
     * @throws IOException if operation fails
     */
    public int rdmaRead(ByteBuffer buffer, long remoteAddress, int remoteKey, int length) throws IOException {

            assertNotNull(bufferManager, "Buffer manager should be created");

            // Test buffer allocation for data transfer
            RdmaMemoryRegion sendBuffer = bufferManager.getSendRegion(8192);
            assertNotNull(sendBuffer, "Send buffer should be allocated");
            assertTrue(sendBuffer.getSize() >= 8192, "Send buffer should be at least 8KB");

                        }
                        if (buffer[buffer.length - 1] === "") {
                            // A last single <br> won't have effect
                            // so put an additional one
                            buffer.push("");
                        }
                        const bufferValue = buffer.join("<br>");
                        dataValue["value"] = bufferValue;

    private static final Pattern INVALID_PATH_CHARS = Pattern.compile("[\\x00-\\x1f\"*:<>?|]");

    /**
     * Validates buffer size to prevent overflow
     *
     * @param size the buffer size to validate
     * @param maxSize the maximum allowed size
     * @param fieldName the field name for error reporting
     * @throws IllegalArgumentException if size is invalid
     */

     */
    public List<Problem> getProblems() {
        return problems;
    }

    private static String toMessage(List<Problem> problems) {
        StringWriter buffer = new StringWriter(1024);

        PrintWriter writer = new PrintWriter(buffer);

        writer.print(problems.size());
        writer.print((problems.size() == 1) ? " problem was " : " problems were ");

      val name = "SocksProxy $fromAddress to $toAddress"
      threadName(name) {
        val buffer = Buffer()
        try {
          sink.use {
            source.use {
              while (true) {
                val byteCount = source.read(buffer, 8192L)
                if (byteCount == -1L) break
                sink.write(buffer, byteCount)
                sink.emit()
              }
            }
          }

 * attempting to add new elements onto the queue and it is full. This queue orders elements FIFO
 * (first-in-first-out). This data structure is logically equivalent to a circular buffer (i.e.,
 * cyclic buffer or ring buffer).
 *
 * <p>An evicting queue must be configured with a maximum size. Each time an element is added to a
 * full queue, the queue automatically removes its head element. This is different from conventional