// EVEX: embedded broadcasting.
	VADDPD.BCST (AX), X2, K1, X1   // 62f1ed195808
	VADDPD.BCST.Z (AX), X2, K1, X1 // 62f1ed995808
	VADDPD.BCST (AX), Y2, K1, Y1   // 62f1ed395808
	VADDPD.BCST.Z (AX), Y2, K1, Y1 // 62f1edb95808
	VADDPD.BCST (AX), Z2, K1, Z1   // 62f1ed595808
	VADDPD.BCST.Z (AX), Z2, K1, Z1 // 62f1edd95808
	VMAXPD.BCST (AX), Z2, K1, Z1   // 62f1ed595f08

    initMapWithNullValue();

    getMap().forcePut(k1(), null);

    expectContents(mapEntry(k1(), (V) null));

    assertFalse(getMap().containsKey(k0()));

    assertTrue(getMap().containsKey(k1()));
    assertTrue(getMap().inverse().containsKey(null));
    assertNull(getMap().get(k1()));
    assertEquals(k1(), getMap().inverse().get(null));
    assertEquals(1, getMap().size());
  }

    this.d = d;
    this.k0 = k0;
    this.k1 = k1;
  }

  @Override
  public int bits() {
    return 64;
  }

  @Override
  public Hasher newHasher() {
    return new SipHasher(c, d, k0, k1);
  }

  // TODO(kak): Implement and benchmark the hashFoo() shortcuts.

  @Override
  public String toString() {
    return "Hashing.sipHash" + c + "" + d + "(" + k0 + ", " + k1 + ")";
  }

  @Override

	VPCMPEQW 15(R8)(R14*4), Z5, K1, K6                 // 6291554975b4b00f000000 or 6291d54975b4b00f000000
	VPCMPEQW -7(CX)(DX*4), Z5, K1, K6                  // 62f1554975b491f9ffffff or 62f1d54975b491f9ffffff
	VPCMPGTB X26, X8, K1, K1                           // 62913d0964ca or 6291bd0964ca
	VPCMPGTB (BX), X8, K1, K1                          // 62f13d09640b or 62f1bd09640b

      k ^= k >>> 33;
      k *= 0xc4ceb9fe1a85ec53L;
      k ^= k >>> 33;
      return k;
    }

    private static long mixK1(long k1) {
      k1 *= C1;
      k1 = Long.rotateLeft(k1, 31);
      k1 *= C2;
      return k1;
    }

    private static long mixK2(long k2) {
      k2 *= C2;
      k2 = Long.rotateLeft(k2, 33);
      k2 *= C1;
      return k2;
    }
  }

	VPERMB X0, X2, K1, X23                             // 62e26d098df8
	VPERMB 7(SI)(DI*4), X2, K1, X23                    // 62e26d098dbcbe07000000
	VPERMB -7(DI)(R8*2), X2, K1, X23                   // 62a26d098dbc47f9ffffff
	VPERMB X26, X9, K1, X23                            // 628235098dfa
	VPERMB X19, X9, K1, X23                            // 62a235098dfb

	VPDPWSSDS Y31, Y1, K1, Y9                          // 6212752953cf
	VPDPWSSDS (R8), Y1, K1, Y9                         // 625275295308
	VPDPWSSDS 15(DX)(BX*2), Y1, K1, Y9                 // 62727529538c5a0f000000
	VPDPWSSDS Y0, Y9, K1, Y9                           // 6272352953c8
	VPDPWSSDS Y19, Y9, K1, Y9                          // 6232352953cb

    }
  }

  @CollectionSize.Require(SEVERAL)
  public void testEquals() {
    resetContainer(mapEntry(k0(), v0()), mapEntry(k1(), v0()), mapEntry(k0(), v3()));
    Map<K, Collection<V>> expected = new HashMap<>();
    expected.put(k0(), newHashSet(v0(), v3()));
    expected.put(k1(), newHashSet(v0()));
    new EqualsTester().addEqualityGroup(expected, multimap().asMap()).testEquals();
  }

  @CollectionSize.Require(SEVERAL)

  public static <K, V> ImmutableBiMap<K, V> of(K k1, V v1) {
    return new SingletonImmutableBiMap<>(k1, v1);
  }

  /**
   * Returns an immutable map containing the given entries, in order.
   *
   * @throws IllegalArgumentException if duplicate keys or values are added
   */
  public static <K, V> ImmutableBiMap<K, V> of(K k1, V v1, K k2, V v2) {
    return RegularImmutableBiMap.fromEntries(entryOf(k1, v1), entryOf(k2, v2));
  }

  /**

	VPSHUFBITQMB Z3, Z6, K7, K1                        // 62f24d4f8fcb
	VPSHUFBITQMB Z21, Z6, K7, K1                       // 62b24d4f8fcd
	VPSHUFBITQMB -15(R14)(R15*1), Z6, K7, K1           // 62924d4f8f8c3ef1ffffff
	VPSHUFBITQMB -15(BX), Z6, K7, K1                   // 62f24d4f8f8bf1ffffff
	VPSHUFBITQMB Z3, Z25, K7, K1                       // 62f235478fcb
	VPSHUFBITQMB Z21, Z25, K7, K1                      // 62b235478fcd