}

  @Override
  public HashCode hashInt(int input) {
    return hashBytes(ByteBuffer.allocate(4).order(ByteOrder.LITTLE_ENDIAN).putInt(input).array());
  }

  @Override
  public HashCode hashLong(long input) {
    return hashBytes(ByteBuffer.allocate(8).order(ByteOrder.LITTLE_ENDIAN).putLong(input).array());
  }

  @Override
  public HashCode hashUnencodedChars(CharSequence input) {

import com.google.common.math.StatsTesting.ManyValues;
import com.google.common.testing.EqualsTester;
import com.google.common.testing.SerializableTester;
import java.nio.ByteBuffer;
import java.nio.ByteOrder;
import junit.framework.TestCase;
import org.jspecify.annotations.NullUnmarked;

/**
 * Tests for {@link PairedStats}. This tests instances created by {@link
 * PairedStatsAccumulator#snapshot}.
 *

import com.google.common.math.StatsTesting.ManyValues;
import com.google.common.testing.EqualsTester;
import com.google.common.testing.SerializableTester;
import java.nio.ByteBuffer;
import java.nio.ByteOrder;
import junit.framework.TestCase;
import org.jspecify.annotations.NullUnmarked;

/**
 * Tests for {@link PairedStats}. This tests instances created by {@link
 * PairedStatsAccumulator#snapshot}.
 *

encoded // form is reduced modulo l. func isReduced(s []byte) bool { if len(s) != 32 { return false } s0 := byteorder.LEUint64(s[:8]) s1 := byteorder.LEUint64(s[8:16]) s2 := byteorder.LEUint64(s[16:24]) s3 := byteorder.LEUint64(s[24:]) l0 := byteorder.LEUint64(scalarMinusOneBytes[:8]) l1 := byteorder.LEUint64(scalarMinusOneBytes[8:16]) l2 := byteorder.LEUint64(scalarMinusOneBytes[16:24]) l3 := byteorder.LEUint64(scalarMinusOneBytes[24:]) // Do a constant time subtraction chain scalarMinusOneBytes - s. If...