import java.util.Iterator;
import java.util.NavigableSet;
import org.jspecify.annotations.Nullable;

/**
 * This class provides a skeletal implementation of the {@link SortedMultiset} interface.
 *
 * <p>The {@link #count} and {@link #size} implementations all iterate across the set returned by
 * {@link Multiset#entrySet()}, as do many methods acting on the set returned by {@link
 * #elementSet()}. Override those methods for better performance.
 *

	count := len(testCases)
	for i := 4; i < len(testCases); i++ {
		tc := testCases[i]
		dataDir, err := xl.DeleteVersion(fileInfos[i])
		failOnErr(count+1, err)
		if dataDir != tc.expectedDataDir {
			t.Fatalf("Expected %s but got %s", tc.expectedDataDir, dataDir)
		}
		count++
	}
}

func Benchmark_mergeXLV2Versions(b *testing.B) {

	peerLocks := globalNotificationSys.GetLocks(ctx, r)

	topLocks := topLockEntries(peerLocks, stale)

	// Marshal API response upto requested count.
	if len(topLocks) > count && count > 0 {
		topLocks = topLocks[:count]
	}

	jsonBytes, err := json.Marshal(topLocks)
	if err != nil {
		writeErrorResponseJSON(ctx, w, toAdminAPIErr(ctx, err), r.URL)
		return
	}

        // Default constructor
    }

    private static final Logger logger = LogManager.getLogger(CrawlingInfoHelper.class);

    /**
     * Key used for facet count aggregations.
     */
    public static final String FACET_COUNT_KEY = "count";

    /**
     * Map containing crawling information parameters.
     */
    protected Map<String, String> infoMap;

    /**

		// a row, then make sure we print it to call attention.
		if m[err.Error()] > 2 {
			peersLogAlwaysIf(ctx, fmt.Errorf("Following error has been printed %d times.. %w", m[err.Error()], err))
			// Reduce the count to introduce further delay in printing
			// but let it again print after the 2th attempt
			m[err.Error()]--
			m[err.Error()]--
		}
		m[err.Error()]++
	}
}()

// Cleans up tmp directory of the local disk.

        assertEquals(testString.length() + 1, Encdec.dec_uint32le(buffer, 0)); // Actual count
        assertEquals(0, Encdec.dec_uint32le(buffer, 4)); // Offset
        assertEquals(testString.length() + 1, Encdec.dec_uint32le(buffer, 8)); // Max count

        ndrBuffer.setIndex(0);
        String decodedString = ndrBuffer.dec_ndr_string();
        assertEquals(testString, decodedString);

            accessResult.setUrl("http://www.example.com/page" + i);

            dataService.store(accessResult);
        }

        // Verify count
        assertEquals(5, dataService.getCount(sessionId));

        dataService.delete(sessionId);

        // After delete, count should be 0
        assertEquals(0, dataService.getCount(sessionId));
    }

import org.codelibs.fess.suggest.request.Response;

/**
 * Represents a response for a suggest request.
 * This class holds the details of the response including the index, time taken, words, total count, and suggested items.
 */
public class SuggestResponse implements Response {
    /** The index name. */
    protected final String index;

    /** The time taken in milliseconds. */
    protected final long tookMs;

	if objectAPI == nil {
		return
	}

	vars := mux.Vars(r)
	count, err := strconv.Atoi(vars["count"])
	if err != nil {
		writeErrorResponseJSON(ctx, w, toAdminAPIErr(ctx, err), r.URL)
		return
	}

	chEntries, err := listServerConfigHistory(ctx, objectAPI, true, count)
	if err != nil {
		writeErrorResponseJSON(ctx, w, toAdminAPIErr(ctx, err), r.URL)
		return
	}

        }

        @Test
        @DisplayName("Binary constructor happy path and round-trip via toByteArray")
        void testBinaryConstructorAndToByteArray() {
            // Arrange: revision=1, count=2, identAuth zeros except last byte, subauth 10, 20
            byte[] ident = new byte[] { 0, 0, 0, 0, 0, 5 };
            rpc.sid_t st = buildSidT((byte) 1, ident, 10, 20);

            byte[] bytes = SID.toByteArray(st);