int expectedSize) {
    return new CompactLinkedHashSet<>(expectedSize);
  }

  private static final int ENDPOINT = -2;

  // TODO(user): predecessors and successors should be collocated (reducing cache misses).
  // Might also explore collocating all of [hash, next, predecessor, successor] fields of an
  // entry in a *single* long[], though that reduces the maximum size of the set by a factor of 2

  /**

            ResourceHolder holder = entry.getValue();

            // Check if resource is abandoned
            if (!holder.closed && !holder.isAlive()) {
                // Resource object has been garbage collected but not closed
                reportLeak(holder);
                activeResources.remove(entry.getKey());
                cleaned++;
            } else if (!holder.closed && holder.getAge() > maxResourceAge * 2) {

    public void close() throws Exception {
        cleanup();
    }

    /**
     * Get total number of regions allocated
     *
     * @return total allocated regions
     */
    public long getTotalAllocated() {
        return totalAllocated.get();
    }

    /**
     * Get total number of regions released
     *
     * @return total released regions
     */
    public long getTotalReleased() {

    private final int pointer;

    /**
     * Constructs a new PacUnicodeString instance.
     *
     * @param length the actual length of the string in bytes
     * @param maxLength the maximum allocated length for the string in bytes
     * @param pointer the pointer/offset to the string data
     */
    public PacUnicodeString(final short length, final short maxLength, final int pointer) {
        this.length = length;

	// md5sum of the data to written is required as input for PutObject.

	md5hex := getMD5Hash(textData)
	sha256hex := ""

	// benchmark utility which helps obtain number of allocations and bytes allocated per ops.
	b.ReportAllocs()
	// the actual benchmark for PutObject starts here. Reset the benchmark timer.

	for i := 0; b.Loop(); i++ {
		// insert the object.

     * 2. the child project lists a dependency on project a only
     * 3. a depends on b (which is transitive to the child project),
     *    and b depends on c.
     *
     * We should see that the resulting size of collected artifacts is two:
     * a & b only.
     */
    @Test
    void testDependencyManagementExclusionsExcludeTransitively() throws Exception {
        File localRepo = getLocalRepositoryPath();

   * An entry in a hash table of a {@link Segment}.
   *
   * <p>Entries in the map can be in the following states:
   *
   * <p>Valid: - Live: valid key/value are set
   *
   * <p>Invalid: - Collected: key/value was partially collected, but not yet cleaned up
   */
  interface InternalEntry<K, V, E extends InternalEntry<K, V, E>> {
    /** Gets the next entry in the chain. */
    E getNext();

    /** Gets the entry's hash. */

            assertNotNull(sendBuffer, "Send buffer should be allocated");
            assertTrue(sendBuffer.getSize() >= 8192, "Send buffer should be at least 8KB");

            RdmaMemoryRegion recvBuffer = bufferManager.getReceiveRegion();
            assertNotNull(recvBuffer, "Receive buffer should be allocated");
            assertTrue(recvBuffer.getSize() > 0, "Receive buffer should have positive size");

        RdmaMemoryRegion region2 = bufferManager.getSendRegion(131072); // Another large allocation

        assertTrue(bufferManager.getTotalAllocated() > initialAllocated, "Total allocated should increase");
        assertTrue(bufferManager.getActiveRegions() > 0, "Active regions should be positive");

        // Release regions
        bufferManager.releaseSendRegion(region1);

            }
        };

        // When
        BufferCache.getBuffers(req, rsp);

        // Then
        assertNotNull(req.txn_buf, "Request buffer should be allocated");
        assertNotNull(rsp.txn_buf, "Response buffer should be allocated");
        assertEquals(SmbComTransaction.TRANSACTION_BUF_SIZE, req.txn_buf.length, "Request buffer should have correct size");