byte[] buffer = new byte[22];
        int idFileSystem = 0;
        int sectPerAlloc = 1000;
        int alloc = 1000000; // Large allocation count
        int free = 500000;
        int bytesPerSect = 4096;

        // Encode test data
        int offset = 0;
        SMBUtil.writeInt4(idFileSystem, buffer, offset);
        offset += 4;

                        throw new SmbException(rpc.retval, false);
                    }

                    final Map<jcifs.SID, List<jcifs.SID>> map = new HashMap<>();

                    for (int ei = 0; ei < rpc.sam.count; ei++) {
                        final samr.SamrSamEntry entry = rpc.sam.entries[ei];

                        final SID[] mems = getGroupMemberSids(tc, authorityServerName, domSid, entry.idx, flags);

    void release_belowZero_throws() {
        SmbTreeConnection c = newConn();
        RuntimeCIFSException ex = assertThrows(RuntimeCIFSException.class, c::release);
        assertTrue(ex.getMessage().toLowerCase().contains("usage count"));
    }

    @Test
    @DisplayName("isConnected reflects underlying tree state")
    void isConnected_usesTree() {
        SmbTreeConnection c = newConn();
        // No tree -> false

import java.util.List;
import java.util.Set;
import junit.framework.TestCase;
import org.jspecify.annotations.NullUnmarked;

/**
 * Tests relating to cache eviction: what does and doesn't count toward maximumSize, what happens
 * when maximumSize is reached, etc.
 *
 * @author mike nonemacher
 */
@NullUnmarked
public class CacheEvictionTest extends TestCase {
  static final int MAX_SIZE = 100;

      notifyStarted();
    }

    @Override
    protected void doStop() {
      notifyStopped();
    }
  }

  /*
   * A NoOp service that will delay the startup and shutdown notification for a configurable amount
   * of time.
   */
  private static class NoOpDelayedService extends NoOpService {
    private final long delay;

    NoOpDelayedService(long delay) {
      this.delay = delay;
    }

    @Override

        boolean exceptionThrown = false;
        String exceptionMessage = null;
        try {
            suggester.switchIndex();
            fail("Should throw SuggesterException for unexpected update indices count");
        } catch (SuggesterException e) {
            exceptionThrown = true;
            exceptionMessage = e.getMessage();
            // Check if the message contains the expected text

        throw new RuntimeException("Unexpected interrupt while waiting for latch", ie);
      }
    } while (System.nanoTime() - deadline < 0);
    throw formatRuntimeException(
        "Latch failed to count down within %d second timeout", timeoutSeconds);
  }

  /**
   * Creates a garbage object that counts down the latch in its finalizer. Sequestered into a

            int result = emptyNameRequest.encode(testBuffer, 0);
            assertTrue(result >= 8); // At least header size
        }

        @Test
        @DisplayName("Should count method calls correctly")
        void testMethodCallCounting() {
            assertEquals(0, testRequest.getSizeCallCount());
            assertEquals(0, testRequest.getEncodeCallCount());

            testRequest.size();

   * #aboutToAcquire(CycleDetectingLock)} and {@link #lockStateChanged(CycleDetectingLock)}.
   */
  // This is logically a Set, but an ArrayList is used to minimize the amount
  // of allocation done on lock()/unlock().
  private static final ThreadLocal<List<LockGraphNode>> acquiredLocks =
      new ThreadLocal<List<LockGraphNode>>() {
        @Override

     * @param type the SID type
     * @param domainName the domain name for this SID
     * @param acctName the account name for this SID
     * @param decrementAuthority whether to decrement the authority count
     */
    public SID(final rpc.sid_t sid, final int type, final String domainName, final String acctName, final boolean decrementAuthority) {
        this.revision = sid.revision;