*
   * @since 16.0
   */
  public static <K0 extends Enum<K0>> MultimapBuilderWithKeys<K0> enumKeys(Class<K0> keyClass) {
    checkNotNull(keyClass);
    return new MultimapBuilderWithKeys<K0>() {
      @SuppressWarnings("unchecked")
      @Override
      <K extends K0, V extends @Nullable Object> Map<K, Collection<V>> createMap() {
        // K must actually be K0, since enums are effectively final

	VPSHUFBITQMB X0, X13, K6, K0                       // 62f2150e8fc0
	VPSHUFBITQMB (R8), X13, K6, K0                     // 62d2150e8f00
	VPSHUFBITQMB 15(DX)(BX*2), X13, K6, K0             // 62f2150e8f845a0f000000
	VPSHUFBITQMB X24, X8, K6, K0                       // 62923d0e8fc0
	VPSHUFBITQMB X7, X8, K6, K0                        // 62f23d0e8fc7
	VPSHUFBITQMB X0, X8, K6, K0                        // 62f23d0e8fc0

//
//	// schema has a "k0" relation and a "k7.k8" embedded relation
//	parsePreloadMap(schema, map[string][]interface{}{
//		clause.Associations: {"arg1"},
//		"k1":                {"arg2"},
//		"k2.k3":             {"arg3"},
//		"k4.k5.k6":          {"arg4"},
//	})
//	// preloadMap is
//	map[string]map[string][]interface{}{
//		"k0": {},
//		"k7": {
//			"k8": {},
//		},
//		"k1": {},

	VPBROADCASTMW2D K4, Y23                            // 62e27e283afc
	VPBROADCASTMW2D K6, Y23                            // 62e27e283afe
	VPBROADCASTMW2D K0, Z16                            // 62e27e483ac0
	VPBROADCASTMW2D K7, Z16                            // 62e27e483ac7
	VPBROADCASTMW2D K0, Z9                             // 62727e483ac8
	VPBROADCASTMW2D K7, Z9                             // 62727e483acf

   * SipHash-2-4 algorithm</a> using the given seed.
   *
   * @since 15.0
   */
  public static HashFunction sipHash24(long k0, long k1) {
    return new SipHashFunction(2, 4, k0, k1);
  }

  /**
   * Returns a hash function implementing the MD5 hash algorithm (128 hash bits).
   *

	if cardinality <= 0 {
		return -1
	}
	// use the faster version as per siphash docs
	// https://github.com/dchest/siphash#usage
	k0, k1 := binary.LittleEndian.Uint64(id[0:8]), binary.LittleEndian.Uint64(id[8:16])
	sum64 := siphash.Hash(k0, k1, []byte(key))
	return int(sum64 % uint64(cardinality))
}

func crcHashMod(key string, cardinality int) int {
	if cardinality <= 0 {
		return -1
	}