// Complex nested structure
        Map<String, Object> complexMap = new HashMap<>();
        complexMap.put("strings", Arrays.asList("test1", "test2"));
        complexMap.put("numbers", Arrays.asList(1, 2, 3));
        complexMap.put("nested", Maps.map("inner", "value").$());
        complexMap.put("array", new String[] { "array1", "array2" });

        // Calculate expected size based on actual behavior

    public List<Map<String, Object>> documentItems;

    /** Number of results per page */
    public String pageSize;

    /** Current page number for pagination */
    public String currentPageNumber;

    /** Total number of records found */
    public String allRecordCount;

    /** Total number of pages for pagination */
    public String allPageCount;

        Map<String, Object> source1 = event.toSource();
        Map<String, Object> source2 = event.toSource();
        assertSame(source1, source2);
    }

    // Test edge cases for version numbers
    public void test_versionNumberEdgeCases() {
        TestSearchLogEvent event = new TestSearchLogEvent("id", 0L, "type");

        // Test minimum value
        event.setVersionNo(Long.MIN_VALUE);

import org.jspecify.annotations.Nullable;

/**
 * Implementation detail for the internal structure of {@link Range} instances. Represents a unique
 * way of "cutting" a "number line" (actually of instances of type {@code C}, not necessarily
 * "numbers") into two sections; this can be done below a certain value, above a certain value,
 * below all values or above all values. With this object defined in this way, an interval can

  }

  /**
   * Constructs an empty {@code LinkedHashMultimap} with enough capacity to hold the specified
   * numbers of keys and values without rehashing.
   *
   * @param expectedKeys the expected number of distinct keys
   * @param expectedValuesPerKey the expected average number of values per key
   * @throws IllegalArgumentException if {@code expectedKeys} or {@code expectedValuesPerKey} is
   *     negative
   */

      fun run() {
        val requestBody = object : RequestBody() {
          override fun contentType() = MEDIA_TYPE_MARKDOWN

          override fun writeTo(sink: BufferedSink) {
            sink.writeUtf8("Numbers\n")
            sink.writeUtf8("-------\n")
            for (i in 2..997) {
              sink.writeUtf8(String.format(" * $i = ${factor(i)}\n"))
            }
          }

   */
  public void testEviction_maxWeight_zero() {
    CountingRemovalListener<Integer, Integer> removalListener = countingRemovalListener();
    IdentityLoader<Integer> loader = identityLoader();

    // Even numbers are free, odd are too expensive
    Weigher<Integer, Integer> evensOnly =
        new Weigher<Integer, Integer>() {
          @Override
          public int weigh(Integer k, Integer v) {
            return k % 2;

   *
   * <ul>
   *   <li>You want to assign the same fraction of inputs to each bucket.
   *   <li>When you reduce the number of buckets, you can accept that the most recently added
   *       buckets will be removed first. More concretely, if you are dividing traffic among tasks,
   *       you can decrease the number of tasks from 15 and 10, killing off the final 5 tasks, and

 * @param valueCount the number of values per cache entry. Must be positive.
 * @param maxSize the maximum number of bytes this cache should use to store.
 */
class DiskLruCache(
  fileSystem: FileSystem,
  /** Returns the directory where this cache stores its data. */
  val directory: Path,
  private val appVersion: Int,
  internal val valueCount: Int,

        /**
         * The starting record number for the current page of search results.
         */
        protected long startRecordNumber;
        /**
         * The ending record number for the current page of search results.
         */
        protected long endRecordNumber;
        /**
         * The list of page numbers for pagination.
         */
        protected List<String> pageNumbers;
        /**