writeInt8(buffer, dataOffset + 24, leaseDuration);  // LeaseDuration
        
        if (isV2()) {
            System.arraycopy(parentLeaseKey.getKey(), 0, buffer, dataOffset + 32, 16);  // ParentLeaseKey
            writeInt2(buffer, dataOffset + 48, epoch);  // Epoch
            writeInt2(buffer, dataOffset + 50, 0);  // Reserved
        }
    }
    
    @Override

 */

package jcifs.smb1.smb1;

import jcifs.smb1.Config;

/**
 * Buffer cache implementation for SMB1 protocol operations.
 * Manages a pool of byte buffers to reduce garbage collection overhead.
 *
 * Performance optimizations:
 * - Uses ConcurrentLinkedQueue for O(1) operations
 * - Lock-free operations for better concurrency
 * - Proper buffer validation and limits
 */
public class BufferCache {

    /**

 * 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

            deflater.finish();

            ByteArrayOutputStream baos = new ByteArrayOutputStream(length);
            byte[] buffer = new byte[1024];

            while (!deflater.finished()) {
                int compressedSize = deflater.deflate(buffer);
                baos.write(buffer, 0, compressedSize);
            }

            deflater.end();
            return baos.toByteArray();

* Then check if the question (the vast majority are questions) is **clear**.

* In many cases the question asked is about an imaginary solution from the user, but there might be a **better** one. If you can understand the problem and use case better, you might be able to suggest a better **alternative solution**.

* If you can't understand the question, ask for more **details**.

### Reproduce the problem { #reproduce-the-problem }

			// with dead end because tcp-keepalive is not fired when there is data in the socket buffer.
			//    https://blog.cloudflare.com/when-tcp-sockets-refuse-to-die/
			// This is a sensitive configuration, it is better to set it to high values, > 60 secs since it can
			// affect clients reading data with a very slow pace  (disappropriate with socket buffer sizes)
			if opts.UserTimeout > 0 {

 * 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

    T pivotValue = uncheckedCastNullableTToT(buffer[pivotIndex]);
    buffer[pivotIndex] = buffer[right];

    int pivotNewIndex = left;
    for (int i = left; i < right; i++) {
      if (comparator.compare(uncheckedCastNullableTToT(buffer[i]), pivotValue) < 0) {
        swap(pivotNewIndex, i);
        pivotNewIndex++;
      }
    }
    buffer[right] = buffer[pivotNewIndex];
    buffer[pivotNewIndex] = pivotValue;

            throw new IllegalArgumentException("Signature field exceeds data buffer size");
        }

        // Use fine-grained locking for better concurrency
        this.signingLock.lock();
        try {
            if (this.closed) {
                throw new IllegalStateException("SigningDigest is closed");
            }

            // zero out signature field

  dependencies:
    glob "^7.1.3"

safe-buffer@^5.1.0:
  version "5.2.1"
  resolved "https://registry.yarnpkg.com/safe-buffer/-/safe-buffer-5.2.1.tgz#1eaf9fa9bdb1fdd4ec75f58f9cdb4e6b7827eec6"
  integrity sha512-rp3So07KcdmmKbGvgaNxQSJr7bGVSVk5S9Eq1F+ppbRo70+YeaDxkw5Dd8NPN+GD6bjnYm2VuPuCXmpuYvmCXQ==

"safer-buffer@>= 2.1.2 < 3", "safer-buffer@>= 2.1.2 < 3.0.0":
  version "2.1.2"