P8_STXVB16X(IVEC, IVP, R0) CLEAR_KEYS() RET #define DO1_CIPHER(iv0, keyv, key, op) \ LXVD2X (key), keyv \ ADD $16, key \ op iv0, keyv, iv0 #define DO2_CIPHER(iv0, iv1, keyv, key, op) \ DO1_CIPHER(iv0, keyv, key, op) \ op iv1, keyv, iv1 #define DO4_CIPHER(iv0, iv1, iv2, iv3, keyv, key, op) \ DO2_CIPHER(iv0, iv1, keyv, key, op) \ op iv2, keyv, iv2 \ op iv3, keyv, iv3 #define DO8_CIPHER(iv0, iv1, iv2, iv3, iv4, iv5, iv6, iv7, keyv, key, op) \ DO4_CIPHER(iv0, iv1, iv2, iv3, keyv, key, op) \ op iv4, keyv,...

    resetContainer(mapEntry(k0(), v0()), mapEntry(k0(), v1()), mapEntry(k1(), v0()));
    Multiset<K> keys = multimap().keys();
    assertEquals(2, keys.count(k0()));
    assertEquals(1, keys.count(k1()));
    assertEquals(3, keys.size());
    assertContainsAllOf(keys, k0(), k1());
    assertContainsAllOf(
        keys.entrySet(), Multisets.immutableEntry(k0(), 2), Multisets.immutableEntry(k1(), 1));
  }

	// preceding the original header. This file contains a set of key-value
	// records, which are used to overcome USTAR's shortcomings, in addition to
	// providing the ability to have sub-second resolution for timestamps.
	//
	// Some newer formats add their own extensions to PAX by defining their
	// own keys and assigning certain semantic meaning to the associated values.

    /** The key of the message: </ul> */
    public static final String ERRORS_FOOTER = "{errors.footer}";

    /** The key of the message: <li><i class="fa fa-exclamation-circle"></i> */
    public static final String ERRORS_PREFIX = "{errors.prefix}";

    /** The key of the message: </li> */
    public static final String ERRORS_SUFFIX = "{errors.suffix}";

    /** The key of the message: {item} must be false. */

        int minIndex = 0;
        for (int i = 1; i < keys.size(); i++) {
          if (keys.get(i) < keys.get(minIndex)) {
            minIndex = i;
          }
        }
        Optional<BinaryNode> leftChild = createTreap(keys.subList(0, minIndex));
        Optional<BinaryNode> rightChild = createTreap(keys.subList(minIndex + 1, keys.size()));
        return Optional.of(new BinaryNode(keys.get(minIndex), leftChild, rightChild));
      }

class PacTest {

    private Map<Integer, KerberosKey> keys;

    @BeforeEach
    void setUp() {
        keys = new HashMap<>();
        // Use ARCFOUR-HMAC encryption type (23) which matches KERB_CHECKSUM_HMAC_MD5
        KerberosKey serverKey = new KerberosKey(new KerberosPrincipal("******@****.***"), "serverKey1234567".getBytes(),
                PacSignature.ETYPE_ARCFOUR_HMAC, 1);
        keys.put(PacSignature.ETYPE_ARCFOUR_HMAC, serverKey);
    }

        authVector.add(new DERSequence(elementVector));

        byte[] token = new DERSequence(authVector).getEncoded();
        Map<Integer, KerberosKey> keys = new HashMap<>();

        // 2. WHEN
        KerberosRelevantAuthData relevantAuthData = new KerberosRelevantAuthData(token, keys);

        // 3. THEN
        assertNotNull(relevantAuthData, "The KerberosRelevantAuthData object should not be null.");

        int minIndex = 0;
        for (int i = 1; i < keys.size(); i++) {
          if (keys.get(i) < keys.get(minIndex)) {
            minIndex = i;
          }
        }
        Optional<BinaryNode> leftChild = createTreap(keys.subList(0, minIndex));
        Optional<BinaryNode> rightChild = createTreap(keys.subList(minIndex + 1, keys.size()));
        return Optional.of(new BinaryNode(keys.get(minIndex), leftChild, rightChild));
      }

    }

    /**
     * @param key
     * @return
     * @throws SmbException
     */
    protected Response createNotification(final Long key) throws SmbException {
        if (key == null) {
            // no valid header
            return null;
        }
        if (this.smb2) {
            if (key != -1) {
                return null;
            }

    List<? extends Entry<?, ?>> entries = new ArrayList<>(map.entrySet());
    List<Object> keys = new ArrayList<>(map.keySet());
    List<Object> values = new ArrayList<>(map.values());
    assertEquals(2 * entries.size(), alternatingKeysAndValues.length);
    assertEquals(2 * keys.size(), alternatingKeysAndValues.length);
    assertEquals(2 * values.size(), alternatingKeysAndValues.length);