CONSTANT_VALUES_PAIRED_STATS);

  // Helper methods:

  static void assertStatsApproxEqual(Stats expectedStats, Stats actualStats) {
    assertThat(actualStats.count()).isEqualTo(expectedStats.count());
    if (expectedStats.count() == 0) {
      try {
        actualStats.mean();
        fail("Expected IllegalStateException");
      } catch (IllegalStateException expected) {
      }
      try {

	ErrTooLong         = errors.New("bufio.Scanner: token too long")
	ErrNegativeAdvance = errors.New("bufio.Scanner: SplitFunc returns negative advance count")
	ErrAdvanceTooFar   = errors.New("bufio.Scanner: SplitFunc returns advance count beyond input")
	ErrBadReadCount    = errors.New("bufio.Scanner: Read returned impossible count")
)

const (
	// MaxScanTokenSize is the maximum size used to buffer a token

                    java.util.function.BiFunction<org.opensearch.action.update.UpdateRequestBuilder, org.opensearch.search.SearchHit, org.opensearch.action.update.UpdateRequestBuilder> processor) {
                // Return a fixed count for testing
                return 3L;
            }
        };
        ComponentUtil.register(mockSearchEngineClient, "searchEngineClient");

        // Mock FessConfig

            @Override
            public Void answer(InvocationOnMock invocation) throws Throwable {
                SmbComWriteAndXResponse response = invocation.getArgument(1);
                response.count = 1;
                return null;
            }
        }).when(smbFile).send(any(SmbComWriteAndX.class), any(SmbComWriteAndXResponse.class));

        smbRandomAccessFile.write(42);

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.
 *

            bytesReader.reset(synonym.output.bytes, synonym.output.offset, synonym.output.length);
            final int code = bytesReader.readVInt();
            final int count = code >>> 1;
            for (int i = 0; i < count; i++) {
                synonymMap.words.get(bytesReader.readVInt(), scratchBytes);
                if (scratchChars.chars.length < scratchBytes.length) {

    private int countUniqueBytes(byte[] data) {
        boolean[] seen = new boolean[256];
        int count = 0;

        for (byte b : data) {
            int index = b & 0xFF;
            if (!seen[index]) {
                seen[index] = true;
                count++;
            }
        }

        return count;
    }

        return hasChanges;
    }

    /**
     * Get and increment inconsistency count
     *
     * @return the current inconsistency count
     */
    public int getInconsistencyCount() {
        return inconsistencyCount.getAndIncrement();
    }

    /**
     * Reset inconsistency count
     */
    public void resetInconsistencyCount() {
        inconsistencyCount.set(0);
    }

                    this.session.release();
                }
            }
        } else if (usage < 0) {
            log.error("Usage count dropped below zero " + this);
            dumpResource();
            throw new RuntimeCIFSException("Usage count dropped below zero");
        }
    }

    /**
     * @param stackTrace
     * @return
     */

            throw new IllegalArgumentException("Array must be a multiple of 8 bytes for DES encryption");
        }

        final byte[] cipherText = new byte[length];
        final int count = length / 8;

        for (int i = 0; i < count; i++) {
            encrypt(clearText, i * 8, cipherText, i * 8);
        }

        return cipherText;
    }

    /**