}
    }
  }

  /** getAndAccumulate with sum adds given value to current, and returns previous value */
  public void testGetAndAccumulateWithSum() {
    for (double x : VALUES) {
      for (double y : VALUES) {
        AtomicDouble a = new AtomicDouble(x);
        double z = a.getAndAccumulate(y, Double::sum);
        assertBitEquals(x, z);
        assertBitEquals(x + y, a.get());
      }

				}
			}
			if sum := r.contentHasher.Sum(nil); !bytes.Equal(r.contentHash.Raw, sum) {
				err := ChecksumMismatch{
					Want: r.contentHash.Encoded,
					Got:  base64.StdEncoding.EncodeToString(sum),
				}
				return n, err
			}
		} else if r.ServerSideHasher != nil {
			sum := r.ServerSideHasher.Sum(nil)

      "targets": [
        {
          "datasource": {
            "type": "prometheus",
            "uid": "${DS_PROMETHEUS}"
          },
          "exemplar": true,
          "expr": "sum by (server) (minio_node_replication_average_active_workers{job=\"$scrape_jobs\"})",
          "interval": "1m",
          "intervalFactor": 2,
          "legendFormat": "{{server}}",
          "refId": "A"
        }

 */
@NullUnmarked
public class MessageDigestAlgorithmBenchmark {
  @Param({"10", "1000", "100000", "1000000"})
  int size;

  @Param Algorithm algorithm;
  @Param HashMethod hashMethod;

  private enum HashMethod {
    MESSAGE_DIGEST_API() {
      @Override
      public byte[] hash(Algorithm algorithm, byte[] input) {
        MessageDigest md = algorithm.getMessageDigest();
        md.update(input);

  private Class<? extends Enum> enumType;

  private String[] sampleData;

  @BeforeExperiment
  void setUp() throws ClassNotFoundException {
    Preconditions.checkArgument(hitRate >= 0 && hitRate <= 1, "hitRate must be in the range [0,1]");

    enumType =
        Class.forName(EnumsBenchmark.class.getCanonicalName() + "$" + enumSize + "Enum")
            .asSubclass(Enum.class);

import static com.google.common.hash.Hashing.sipHash24;

import org.jspecify.annotations.NullUnmarked;

/**
 * An enum that contains all of the known hash functions.
 *
 * @author Kurt Alfred Kluever
 */
@SuppressWarnings("deprecation") // We still need to test our deprecated APIs.
@NullUnmarked
enum HashFunctionEnum {
  ADLER32(adler32()),
  CRC32(crc32()),
  GOOD_FAST_HASH_32(goodFastHash(32)),

		sid_t *sid;
	} LsarDomainInfo;

	typedef struct {
		unicode_string name;
		unicode_string dns_domain;
		unicode_string dns_forest;
		uuid_t domain_guid;
		sid_t *sid;
	} LsarDnsDomainInfo;

	enum {
		POLICY_INFO_AUDIT_EVENTS   = 2,
		POLICY_INFO_PRIMARY_DOMAIN = 3,
		POLICY_INFO_ACCOUNT_DOMAIN = 5,
		POLICY_INFO_SERVER_ROLE    = 6,
		POLICY_INFO_MODIFICATION   = 9,
		POLICY_INFO_DNS_DOMAIN     = 12
	};

		sid_t *sid;
	} LsarDomainInfo;

	typedef struct {
		unicode_string name;
		unicode_string dns_domain;
		unicode_string dns_forest;
		uuid_t domain_guid;
		sid_t *sid;
	} LsarDnsDomainInfo;

	enum {
		POLICY_INFO_AUDIT_EVENTS   = 2,
		POLICY_INFO_PRIMARY_DOMAIN = 3,
		POLICY_INFO_ACCOUNT_DOMAIN = 5,
		POLICY_INFO_SERVER_ROLE    = 6,
		POLICY_INFO_MODIFICATION   = 9,
		POLICY_INFO_DNS_DOMAIN     = 12
	};

          ^ strideTable[1][(word >>> 16) & 0xFF]
          ^ strideTable[0][word >>> 24];
    }

    static int combine(int csum, int crc) {
      csum ^= crc;
      for (int i = 0; i < 4; i++) {
        csum = (csum >>> 8) ^ byteTable[csum & 0xFF];
      }
      return csum;
    }

    private static final ByteBuffer EMPTY = ByteBuffer.allocate(0);
  }

        }
        sum -= segment.modCount;
      }
      return sum == 0L;
    }
    return true;
  }

  long longSize() {
    Segment<K, V>[] segments = this.segments;
    long sum = 0;
    for (Segment<K, V> segment : segments) {
      sum += Math.max(0, segment.count); // see https://github.com/google/guava/issues/2108
    }
    return sum;
  }

  @Override