private BufferCache() {
        // Utility class - not instantiable
    }

    private static final int MAX_BUFFERS = Config.getInt("jcifs.smb1.smb.maxBuffers", 16);
    private static final int MAX_BUFFER_SIZE = 0x100000; // 1MB maximum

    // Use concurrent queue for lock-free operations
    private static final java.util.concurrent.ConcurrentLinkedQueue<byte[]> bufferQueue =
            new java.util.concurrent.ConcurrentLinkedQueue<>();

    joinHelper(10, 20);
    joinHelper(10, 0, 20);
    joinHelper(0, 10, 20);
    joinHelper(10, 20, 0);
    joinHelper(10, 20, 1);
    joinHelper(1, 1, 1, 1, 1, 1, 1, 1);
    joinHelper(1, 0, 1, 0, 1, 0, 1, 0);
  }

  public void testOnlyOneOpen() throws Exception {
    ByteSource source = newByteSource(0, 50);
    int[] counter = new int[1];
    ByteSource checker =
        new ByteSource() {

        when(mockHandle.getTree()).thenReturn(mockTree);
        when(mockHandle.getFileId()).thenReturn(new byte[16]);

        when(mockTree.getReceiveBufferSize()).thenReturn(0x10000);
        when(mockTree.getMaximumBufferSize()).thenReturn(0x10000);
        when(mockTree.getConfig()).thenReturn(mockConfig);
        when(mockTree.isConnected()).thenReturn(true);
        when(mockTree.getTreeId()).thenReturn(1L);

        }
        return new MeanAndVariance(mean, s / values.length);
      }
    };

    abstract MeanAndVariance variance(double[] values, MeanAlgorithm meanAlgorithm);
  }

  @Param({"100", "10000"})
  int n;

  @Param MeanAlgorithm meanAlgorithm;
  @Param VarianceAlgorithm varianceAlgorithm;

  private final double[][] values = new double[0x100][];

  @BeforeExperiment
  void setUp() {

  @Param private ComparatorType comparator;

  // TODO(kevinb): add 1000000 back when we have the ability to throw
  // NotApplicableException in the expensive comparator case.
  @Param({"100", "10000"})
  private int size;

  @Param private HeapType heap;

  private Queue<Integer> queue;

  private final Random random = new Random();

  @BeforeExperiment
  void setUp() {

    assertEscaping(e, "%00", '\u0000'); // nul
    assertEscaping(e, "%7F", '\u007f'); // del
    assertEscaping(e, "%C2%80", '\u0080'); // xx-00010,x-000000
    assertEscaping(e, "%DF%BF", '\u07ff'); // xx-11111,x-111111
    assertEscaping(e, "%E0%A0%80", '\u0800'); // xxx-0000,x-100000,x-00,0000
    assertEscaping(e, "%EF%BF%BF", '\uffff'); // xxx-1111,x-111111,x-11,1111
    assertUnicodeEscaping(e, "%F0%90%80%80", '\uD800', '\uDC00');

    @Test
    @DisplayName("writeWireFormat should handle large lengths correctly")
    void testWriteWireFormatLargeLength() {
        packet.type = SessionServicePacket.SESSION_MESSAGE;
        packet.trailerLength = 0x10000; // Length requiring extended bit

        byte[] dst = new byte[100];
        packet.writeWireFormat(dst, 0);

        assertEquals((byte) 0x01, dst[1]); // Extended length bit should be set
    }

    assertEscaping(e, "%00", '\u0000'); // nul
    assertEscaping(e, "%7F", '\u007f'); // del
    assertEscaping(e, "%C2%80", '\u0080'); // xx-00010,x-000000
    assertEscaping(e, "%DF%BF", '\u07ff'); // xx-11111,x-111111
    assertEscaping(e, "%E0%A0%80", '\u0800'); // xxx-0000,x-100000,x-00,0000
    assertEscaping(e, "%EF%BF%BF", '\uffff'); // xxx-1111,x-111111,x-11,1111
    assertUnicodeEscaping(e, "%F0%90%80%80", '\uD800', '\uDC00');

            return "[" + address + "]";
        }
        return address;
    }

    /**
     * Compresses an IPv6 address string to its canonical compressed form.
     * For example, "0:0:0:0:0:0:0:1" becomes "::1"
     *
     * @param ipv6Address the IPv6 address string to compress
     * @return the compressed IPv6 address string
     */
    protected static String compressIPv6(final String ipv6Address) {

            val low = (if (i + 1 < limit) this[i + 1] else '\u0000')
            if (c.isLowSurrogate() || !low.isLowSurrogate()) {
              '?'.code
            } else {
              i++
              0x010000 + (c.code and 0x03ff shl 10 or (low.code and 0x03ff))
            }
          }

          else -> c.code
        }
      i++
    }
    return result
  }