long k1 = 0;
      long k2 = 0;
      length += bb.remaining();
      switch (bb.remaining()) {
        case 15:
          k2 ^= (long) toUnsignedInt(bb.get(14)) << 48; // fall through
        case 14:
          k2 ^= (long) toUnsignedInt(bb.get(13)) << 40; // fall through
        case 13:
          k2 ^= (long) toUnsignedInt(bb.get(12)) << 32; // fall through
        case 12:

"12.4.16 UNIMPLEMENTED"
"12.4.17 UNIMPLEMENTED"
"12.4.18 UNIMPLEMENTED"
"12.4.2 UNIMPLEMENTED"
"12.4.3 UNIMPLEMENTED"
"12.4.4 UNIMPLEMENTED"
"12.4.5 UNIMPLEMENTED"
"12.4.6 UNIMPLEMENTED"
"12.4.7 UNIMPLEMENTED"
"12.4.8 UNIMPLEMENTED"
"12.4.9 UNIMPLEMENTED"
"12.5.1 UNIMPLEMENTED"
"12.5.10 UNIMPLEMENTED"
"12.5.11 UNIMPLEMENTED"
"12.5.12 UNIMPLEMENTED"
"12.5.13 UNIMPLEMENTED"
"12.5.14 UNIMPLEMENTED"
"12.5.15 UNIMPLEMENTED"

  private static final ImmutableList<Integer> LIST_WITH_DUPS =
      ImmutableList.of(1, 1, 2, 4, 4, 4, 8);

  private static final ImmutableList<Integer> LIST_WITHOUT_DUPS = ImmutableList.of(1, 2, 4, 8);

  void assertModelAgrees(
      List<Integer> list,
      Integer key,
      int answer,
      KeyPresentBehavior presentBehavior,
      KeyAbsentBehavior absentBehavior) {
    switch (presentBehavior) {

        final char[] arr = str.toCharArray();
        this.time_low = hex_to_bin(arr, 0, 8);
        this.time_mid = S(hex_to_bin(arr, 9, 4));
        this.time_hi_and_version = S(hex_to_bin(arr, 14, 4));
        this.clock_seq_hi_and_reserved = B(hex_to_bin(arr, 19, 2));
        this.clock_seq_low = B(hex_to_bin(arr, 21, 2));
        this.node = new byte[6];
        this.node[0] = B(hex_to_bin(arr, 24, 2));

    public UUID(final String str) {
        final char[] arr = str.toCharArray();
        time_low = hex_to_bin(arr, 0, 8);
        time_mid = S(hex_to_bin(arr, 9, 4));
        time_hi_and_version = S(hex_to_bin(arr, 14, 4));
        clock_seq_hi_and_reserved = B(hex_to_bin(arr, 19, 2));
        clock_seq_low = B(hex_to_bin(arr, 21, 2));
        node = new byte[6];
        node[0] = B(hex_to_bin(arr, 24, 2));

     * reset.
     *
     * @return the array of bytes for the resulting hash value.
     */
    @Override
    public byte[] engineDigest() {
        // pad output to 56 mod 64; as RFC1320 puts it: congruent to 448 mod 512
        final int bufferNdx = (int) (count % BLOCK_LENGTH);
        final int padLen = bufferNdx < 56 ? 56 - bufferNdx : 120 - bufferNdx;

        // padding is alwas binary 1 followed by binary 0s

    assertThat(compactTable.sections.length).isLessThan(1 shl 14)

    // Less than 65,536 bytes, because we binary search on a 14-bit index with a stride of 4 bytes.
    assertThat(compactTable.ranges.length).isLessThan((1 shl 14) * 4)

    // Less than 16,384 chars, because we index on a 14-bit index in the ranges table.
    assertThat(compactTable.mappings.length).isLessThan(1 shl 14)

    // Confirm the data strings are ASCII.