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) {

 * java.lang.ref.Cleaner Cleaner}; see example <a href="#cleaner">below</a>.
 *
 * <p>Keep a strong reference to this object until all of the associated referents have been
 * finalized. If this object is garbage collected earlier, the backing thread will not invoke {@code
 * finalizeReferent()} on the remaining references.
 *
 * <p>As an example of how this is used, imagine you have a class {@code MyServer} that creates a

            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");

   * errors, for better performance.
   *
   * <p>For a new instance, where the arrays above have not yet been allocated, the value of {@code
   * metadata} is the size that the arrays should be allocated with. Once the arrays have been
   * allocated, the value of {@code metadata} combines the number of bits in the "short hash", in

   * array is that of the specified array. The returned array elements are in no particular order.
   * If the queue fits in the specified array, it is returned therein. Otherwise, a new array is
   * allocated with the runtime type of the specified array and the size of this queue.
   *
   * <p>If this queue fits in the specified array with room to spare (i.e., the array has more

   * type of the returned array is that of the specified array. If the queue fits in the specified
   * array, it is returned therein. Otherwise, a new array is allocated with the runtime type of the
   * specified array and the size of this queue.
   *
   * <p>If this queue fits in the specified array with room to spare (i.e., the array has more

   * errors, for better performance.
   *
   * <p>For a new instance, where the arrays above have not yet been allocated, the value of {@code
   * metadata} is the size that the arrays should be allocated with. Once the arrays have been
   * allocated, the value of {@code metadata} combines the number of bits in the "short hash", in

            // Default constructor
        }

        /**
         * The actual length of the string in bytes.
         */
        public short length;
        /**
         * The maximum allocated length of the string in bytes.
         */
        public short maximum_length;
        /**
         * The buffer containing the Unicode characters.
         */
        public short[] buffer;

     *
     * @return active connection count
     */
    public long getConnectionsActive() {
        return connectionsActive.get();
    }

    /**
     * Get total number of memory regions allocated
     *
     * @return memory region count
     */
    public long getMemoryRegionsAllocated() {
        return memoryRegionsAllocated.get();
    }

    /**

  }

  /** Returns whether arrays need to be allocated. */
  boolean needsAllocArrays() {
    return table == null;
  }

  /** Handle lazy allocation of arrays. */
  @CanIgnoreReturnValue
  int allocArrays() {
    Preconditions.checkState(needsAllocArrays(), "Arrays already allocated");

    int expectedSize = metadata;
    int buckets = CompactHashing.tableSize(expectedSize);