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:

          196.0);

  private static final ImmutableList<Long> SIXTEEN_SQUARES_LONGS =
      ImmutableList.of(
          25L, 100L, 0L, 144L, 9L, 121L, 4L, 225L, 169L, 64L, 49L, 16L, 36L, 1L, 81L, 196L);
  private static final ImmutableList<Integer> SIXTEEN_SQUARES_INTEGERS =
      ImmutableList.of(25, 100, 0, 144, 9, 121, 4, 225, 169, 64, 49, 16, 36, 1, 81, 196);

          196.0);

  private static final ImmutableList<Long> SIXTEEN_SQUARES_LONGS =
      ImmutableList.of(
          25L, 100L, 0L, 144L, 9L, 121L, 4L, 225L, 169L, 64L, 49L, 16L, 36L, 1L, 81L, 196L);
  private static final ImmutableList<Integer> SIXTEEN_SQUARES_INTEGERS =
      ImmutableList.of(25, 100, 0, 144, 9, 121, 4, 225, 169, 64, 49, 16, 36, 1, 81, 196);

  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) {

    X432,
    X433,
    X434,
    X435,
    X436,
    X437,
    X438,
    X439,
    X440,
    X441,
    X442,
    X443,
    X444,
    X445,
    X446,
    X447,
    X448,
    X449,
    X450,
    X451,
    X452,
    X453,
    X454,
    X455,
    X456,
    X457,
    X458,
    X459,
    X460,
    X461,
    X462,
    X463,
    X464,

        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

            Type2Message.writeUShort(truncatedMessage, 12, 0); // length
            Type2Message.writeUShort(truncatedMessage, 14, 0); // max length
            Type2Message.writeULong(truncatedMessage, 16, 48); // offset (past the end)
            // Set flags
            Type2Message.writeULong(truncatedMessage, 20, Type2Message.NTLMSSP_NEGOTIATE_UNICODE);
            // Challenge bytes would be at 24-31 but we're truncated

        SMBUtil.writeInt2(0, buffer, offset + 58); // Length

        // Negotiate context offset
        SMBUtil.writeInt4(144, buffer, offset + 60); // Point to contexts

        // Add negotiate contexts at offset 144
        int ctxOffset = 144;

        // Preauth integrity context
        SMBUtil.writeInt2(PreauthIntegrityNegotiateContext.NEGO_CTX_PREAUTH_TYPE, buffer, ctxOffset);