queue.addListener(listener, directExecutor());

    Multiset<Object> counters = ConcurrentHashMultiset.create();
    queue.enqueue(incrementingEvent(counters, listener, 1));
    queue.enqueue(incrementingEvent(counters, listener, 2));
    queue.enqueue(incrementingEvent(counters, listener, 3));
    queue.enqueue(incrementingEvent(counters, listener, 4));
    assertEquals(0, counters.size());
    queue.dispatch();

    queue.addListener(listener, directExecutor());

    Multiset<Object> counters = ConcurrentHashMultiset.create();
    queue.enqueue(incrementingEvent(counters, listener, 1));
    queue.enqueue(incrementingEvent(counters, listener, 2));
    queue.enqueue(incrementingEvent(counters, listener, 3));
    queue.enqueue(incrementingEvent(counters, listener, 4));
    assertEquals(0, counters.size());
    queue.dispatch();

     * and the counter returned by {@link #totalProblemsReported()} are not equal (latter is bigger than former).
     *
     * @return true if the problem collector has overflowed and some problems were not preserved
     */
    boolean problemsOverflow();

    /**
     * Reports a problem: always maintains the counters, but whether problem is preserved in memory, depends on

}

func (k *KMS) updateMetrics(err error, latency time.Duration) {
	// First, update the latency histogram
	// Therefore, find the first bucket that holds the counter for
	// requests with a latency at least as large as the given request
	// latency and update its and all subsequent counters.
	bucket := slices.IndexFunc(k.latencyBuckets, func(b time.Duration) bool { return latency < b })
	if bucket < 0 {
		bucket = len(k.latencyBuckets) - 1
	}

    public String createdTime;

    /** Version number for optimistic locking. */
    public String versionNo;

    /**
     * Clears all pagination state and filter parameters.
     * Resets pagination counters to default values and clears all filter fields.
     */
    public void clear() {
        allRecordCount = 0;
        allPageCount = 0;
        existPrePage = false;
        existNextPage = false;

    public String createdTime;

    /** Search parameter: version number */
    public String versionNo;

    /**
     * Clears all pagination data and search parameters.
     * Resets counters, flags, and search form fields to their default values.
     */
    public void clear() {
        allRecordCount = 0;
        allPageCount = 0;
        existPrePage = false;
        existNextPage = false;

        long currentWindow = System.currentTimeMillis() / rateLimitWindow;
        String windowKey = key + "_" + currentWindow;

        AtomicLong counter = rateLimitCounters.computeIfAbsent(windowKey, k -> new AtomicLong(0));
        long currentCount = counter.incrementAndGet();

        // Clean up old windows periodically
        if (currentCount == 1) {
            cleanupOldRateLimitCounters(currentWindow);
        }

        logger.resetStatistics();

        Map<EventType, Long> statsAfter = logger.getStatistics();
        // After reset, all counters should be 0
        for (Long count : statsAfter.values()) {
            assertEquals(Long.valueOf(0), count, "All statistics should be 0 after reset");
        }
    }

    @Test

**Template Method**: `AbstractCrawlerClient`, `AbstractExtractor` - common logic with overrides
**DI**: LastaFlute container with `@Resource` and XML config

### Core Principles

**Thread Safety**:
- `AtomicLong` for counters (`CrawlerContext.accessCount`)
- `volatile` for status flags
- Synchronized blocks for critical sections
- Thread-local storage via `CrawlingParameterUtil`

**Resource Management**:
- `AutoCloseable` throughout

    private static long negativeToMaxValue(long value) {
      return (value >= 0) ? value : Long.MAX_VALUE;
    }

    /** Increments all counters by the values in {@code other}. */
    public void incrementBy(StatsCounter other) {
      CacheStats otherStats = other.snapshot();
      hitCount.add(otherStats.hitCount());
      missCount.add(otherStats.missCount());