assertEquals(specialNames[i], entries[i].getName());
            assertEquals(8, entries[i].getType()); // TYPE_SHARE constant value
        }
    }

    @Test
    @DisplayName("getEntries should handle large number of DFS roots")
    void testGetEntries_largeNumberOfRoots() throws Exception {
        // Create array with many entries
        int count = 100;
        netdfs.DfsEnumArray200 largeArray = new netdfs.DfsEnumArray200();

                { 10, 90 }, // 10 byte offset, 90 bytes
                { 50, 50 }, // 50 byte offset, 50 bytes
                { 0, 0 }, // Empty buffer
                { 100, 100 } // Large values
        };

        for (int[] testCase : testCases) {
            // Arrange
            byte[] buffer = new byte[200];
            int bufferIndex = testCase[0];
            int len = testCase[1];

        SMBUtil.writeInt2(9, buffer, bufferIndex);
        // Set large buffer offset
        SMBUtil.writeInt2(1000, buffer, bufferIndex + 2);
        // Set buffer length
        SMBUtil.writeInt4(8, buffer, bufferIndex + 4);

        response = spy(response);
        when(response.getHeaderStart()).thenReturn(0);

        // Write FileInternalInfo data at the large offset
        SMBUtil.writeInt8(0x123456789ABCDEFL, buffer, 1000);

    }
  }

  // Incorrect expected present count.

  @CollectionFeature.Require(SUPPORTS_ADD)
  public void testSetCountConditional_oldCountTooLarge() {
    assertFalse(
        "setCount() with a too-large oldCount should return false",
        getMultiset().setCount(e0(), 2, 3));
    expectUnchanged();
  }

  @CollectionSize.Require(absent = ZERO)
  @CollectionFeature.Require(SUPPORTS_ADD)

## Cloud Scale Deployment

	r := &netperfReader{eof: make(chan struct{})}
	r.buf = make([]byte, 128*humanize.KiByte)
	rand.Read(r.buf)

	connectionsPerPeer := 16

	if len(globalNotificationSys.peerClients) > 16 {
		// For a large cluster it's enough to have 1 connection per peer to saturate the network.
		connectionsPerPeer = 1
	}

	errStr := ""
	var wg sync.WaitGroup
	for index := range globalNotificationSys.peerClients {

 * This job removes old crawling sessions, search logs, job logs, and user info logs
 * based on configured retention periods. It helps maintain system performance by
 * preventing log tables from growing too large.
 */
public class PurgeLogJob {

    /** Logger instance for this class */
    private static final Logger logger = LogManager.getLogger(PurgeLogJob.class);

    /**
     * Default constructor for PurgeLogJob.

        byte[] buffer = createBasicNegotiateResponseBuffer();

        // Set security buffer offset close to Integer.MAX_VALUE to test overflow protection
        SMBUtil.writeInt2(32767, buffer, 56); // Large offset (will be added to header start)
        SMBUtil.writeInt2(1000, buffer, 58); // Some length

        SMBProtocolDecodingException exception = assertThrows(SMBProtocolDecodingException.class, () -> {

            assertEquals("1.0.0", gav.version());
        }

        @Test
        @DisplayName("should handle large number of POMs efficiently")
        void shouldHandleLargeNumberOfPOMsEfficiently() throws Exception {
            // Create a large number of POM documents for performance testing
            Map<Path, Document> largePomMap = new HashMap<>();

            for (int i = 0; i < 100; i++) {

   * modeled by "storedPermits" variable. This variable is zero when there is no underutilization,
   * and it can grow up to maxStoredPermits, for sufficiently large underutilization. So, the
   * requested permits, by an invocation acquire(permits), are served from:
   *
   * - stored permits (if available)
   *
   * - fresh permits (for any remaining permits)
   *