// The number of compression rounds.
  private final int c;
  // The number of finalization rounds.
  private final int d;
  // Two 64-bit keys (represent a single 128-bit key).
  private final long k0;
  private final long k1;

  /**
   * @param c the number of compression rounds (must be positive)
   * @param d the number of finalization rounds (must be positive)

"1.1.1 OK"
"1.1.2 OK"
"1.1.3 OK"
"1.1.4 OK"
"1.1.5 OK"
"1.1.6 OK"
"1.1.7 OK"
"1.1.8 OK"
"1.2.1 OK"
"1.2.2 OK"
"1.2.3 OK"
"1.2.4 OK"
"1.2.5 OK"
"1.2.6 OK"
"1.2.7 OK"
"1.2.8 OK"
"10.1.1 OK"
"12.1.1 UNIMPLEMENTED"
"12.1.10 UNIMPLEMENTED"
"12.1.11 UNIMPLEMENTED"
"12.1.12 UNIMPLEMENTED"
"12.1.13 UNIMPLEMENTED"
"12.1.14 UNIMPLEMENTED"
"12.1.15 UNIMPLEMENTED"
"12.1.16 UNIMPLEMENTED"
"12.1.17 UNIMPLEMENTED"

  private final int seed;

  Murmur3_128HashFunction(int seed) {
    this.seed = seed;
  }

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

  @Override
  public Hasher newHasher() {
    return new Murmur3_128Hasher(seed);
  }

  @Override
  public String toString() {
    return "Hashing.murmur3_128(" + seed + ")";
  }

    }
  }

  private static long codePointToFourUtf8Bytes(int codePoint) {
    // codePoint has at most 21 bits
    return ((0xFL << 4) | (codePoint >>> 18))
        | ((0x80L | (0x3F & (codePoint >>> 12))) << 8)
        | ((0x80L | (0x3F & (codePoint >>> 6))) << 16)
        | ((0x80L | (0x3F & codePoint)) << 24);
  }

  private static long charToThreeUtf8Bytes(char c) {
    return ((0x7L << 5) | (c >>> 12))

      next = (next >>> 8) ^ Crc32cHashFunction.Crc32cHasher.byteTable[next & 0xFF];
    }
    int[][] expected = new int[4][256];
    for (int b = 0; b < 4; ++b) {
      for (int bit = 128; bit != 0; bit >>= 1) {
        expected[b][bit] = next;
        next = advanceOneBit(next);
      }
    }
    for (int b = 0; b < 4; ++b) {
      expected[b][0] = 0;

 * bits.
 *
 * We split each code point into a 14-bit prefix and a 7-bit suffix. All code points with the same
 * prefix are called a 'section'. There are 128 code points per section.
 *
 * Ranges Data (32,612 bytes)
 * ==========================
 *
 * Each entry is 4 bytes, and represents a _range_ of code points that all share a common 14-bit

    assertThat(formEncode(124)).isEqualTo("%7C")
    assertThat(formEncode(125)).isEqualTo("%7D")
    assertThat(formEncode(126)).isEqualTo("%7E")
    assertThat(formEncode(127)).isEqualTo("%7F")
    assertThat(formEncode(128)).isEqualTo("%C2%80")
    assertThat(formEncode(255)).isEqualTo("%C3%BF")
  }

  @Throws(IOException::class)
  private fun formEncode(codePoint: Int): String {

    - [Client Binaries](#client-binaries-1)
    - [Server Binaries](#server-binaries-1)
    - [Node Binaries](#node-binaries-1)
  - [Changelog since v1.12.8](#changelog-since-v1128)
    - [Other notable changes](#other-notable-changes-1)
- [v1.12.8](#v1128)
  - [Downloads for v1.12.8](#downloads-for-v1128)
    - [Client Binaries](#client-binaries-2)
    - [Server Binaries](#server-binaries-2)
    - [Node Binaries](#node-binaries-2)

    assertMinSize(difference(setSize(2), setSize(3)), 0);
    assertMinSize(difference(setSize(3), setSize(2)), 1);
    assertMinSize(difference(setSizeRange(10, 20), setSizeRange(1, 2)), 8);
    assertMinSize(difference(setSizeRange(1, 2), setSizeRange(10, 20)), 0);
    assertMinSize(difference(setSizeRange(10, 20), setSizeRange(11, 12)), 0);

        // This is a multibyte value. Read 7 bits at a time.
        var result = prefixMask
        var shift = 0
        while (true) {
          val b = readByte()
          if (b and 0x80 != 0) { // Equivalent to (b >= 128) since b is in [0..255].
            result += b and 0x7f shl shift
            shift += 7
          } else {
            result += b shl shift // Last byte.
            break
          }
        }