*/
    void store(DataStoreParams paramMap, Map<String, Object> dataMap);

    /**
     * Returns the total number of documents processed by this callback.
     *
     * @return the document count
     */
    long getDocumentSize();

    /**
     * Returns the total execution time for index update operations.
     *
     * @return the execution time in milliseconds
     */
    long getExecuteTime();

        /**
         * Expiry time threshold for file deletion.
         */
        protected final long expiry;

        /**
         * Count of processed files.
         */
        protected long count;

        /**
         * Maximum number of files to purge in a single operation.
         */
        protected final int maxPurgeSize;

        /**

    super(
        asList(ConstructionPathway.values()),
        n -> n * log(n),
        ImmutableList.of(
            QueryOp.create(
                "count",
                (ms, o) -> {
                  int unused = ms.count(o);
                },
                Math::log)));
  }

  /** All the ways to create an ImmutableMultiset. */
  enum ConstructionPathway implements Construction<Multiset<Object>> {

    }
    var count = 0
    while (!data.exhausted()) {
      assertFailsWith<ProtocolException> {
        clientReader.processNextFrame()
      }.also { expected ->
        assertThat(expected.message!!)
          .matches(Regex("Code \\d+ is reserved and may not be used."))
      }
      count++
    }
    assertThat(count).isEqualTo(1988)
  }

	var companies []Company
	if DB.Model(&users).Association("Company").Find(&companies); len(companies) != 3 {
		t.Errorf("companies count should be %v, but got %v", 3, len(companies))
	}

	var managers []User
	if DB.Model(&users).Association("Manager").Find(&managers); len(managers) != 2 {
		t.Errorf("managers count should be %v, but got %v", 2, len(managers))
	}

	// Append
	DB.Model(&users).Association("Company").Append(

	p := participle.MustBuild(
		&FuncExpr{},
		participle.Lexer(sqlLexer),
		participle.CaseInsensitive("Keyword"),
		participle.CaseInsensitive("Timeword"),
	)

	validCases := []string{
		"count(*)",
		"sum(2 + s.id)",
		"sum(t)",
		"avg(s.id[1])",
		"coalesce(s.id[1], 2, 2 + 3)",

		"cast(s as string)",
		"cast(s AS INT)",
		"cast(s as DECIMAL)",
		"extract(YEAR from '2018-01-09')",

import org.jspecify.annotations.NullMarked;
import org.jspecify.annotations.Nullable;

/**
 * {@code ObjectCountHashMap} uses arrays to store key objects and count values. Comparing to using
 * a traditional {@code HashMap} implementation which stores keys and count values as map entries,
 * {@code ObjectCountHashMap} minimizes object allocation and reduces memory footprint.
 *

            fileCache.put(path, new WeakReference<>(file));
        }
    }

    /**
     * Evict oldest leases based on LRU
     *
     * @param count number of leases to evict
     */
    private void evictOldestLeases(int count) {
        if (count <= 0 || leases.isEmpty()) {
            return;
        }

        // Find oldest leases by last access time
        leases.entrySet()

        AtomicInteger count = new AtomicInteger(0);
        queryFieldConfig.highlightedFields(stream -> {
            stream.forEach(field -> {
                count.incrementAndGet();
                assertTrue(field.equals("field1") || field.equals("field2") || field.equals("field3"));
            });
        });

        assertEquals(3, count.get());
    }

    @Test

     */
    protected boolean noWaitOnFolder = false;

    /**
     * Increments the active thread count using atomic operation.
     */
    protected void startCrawling() {
        crawlerContext.incrementAndGetActiveThreadCount();
    }

    /**
     * Decrements the active thread count using atomic operation.
     */
    protected void finishCrawling() {