80(DX), X11 PXOR X11, X5 MOVOU 96(DX), X11 PXOR X11, X6 MOVOU 112(DX), X11 PXOR X11, X7 MOVOU X0, (SI) MOVOU X1, 16(SI) MOVOU X2, 32(SI) MOVOU X3, 48(SI) MOVOU X4, 64(SI) MOVOU X5, 80(SI) MOVOU X6, 96(SI) MOVOU X7, 112(SI) LEAQ 128(SI), SI LEAQ 128(DX), DX JMP gcmAesDecOctetsLoop gcmAesDecEndOctets: SUBQ $0x07, R10 gcmAesDecSingles: MOVOU 16(AX), X1 MOVOU 32(AX), X2 MOVOU 48(AX), X3 MOVOU 64(AX), X4 MOVOU 80(AX), X5 MOVOU 96(AX), X6 MOVOU 112(AX), X7 MOVOU 224(DI), X13 gcmAesDecSinglesLoop: CMPQ R9,...

     */
    fun ecdsa256() =
      apply {
        keyAlgorithm = "EC"
        keySize = 256
      }

    /**
     * Configure the certificate to generate a 2048-bit RSA key, which provides about 112 bits of
     * security. RSA keys are interoperable with very old clients that don't support ECDSA.
     */
    fun rsa2048() =
      apply {
        keyAlgorithm = "RSA"
        keySize = 2048
      }

Yuri Schimke <******@****.***> 1769963735 +0000

Austin Clements <******@****.***> 1765479333 -0500

cpovirk <******@****.***> 1773676600 -0700

- [CHANGELOG-1.16.md](./CHANGELOG-1.16.md)
- [CHANGELOG-1.15.md](./CHANGELOG-1.15.md)
- [CHANGELOG-1.14.md](./CHANGELOG-1.14.md)
- [CHANGELOG-1.13.md](./CHANGELOG-1.13.md)
- [CHANGELOG-1.12.md](./CHANGELOG-1.12.md)
- [CHANGELOG-1.11.md](./CHANGELOG-1.11.md)
- [CHANGELOG-1.10.md](./CHANGELOG-1.10.md)
- [CHANGELOG-1.9.md](./CHANGELOG-1.9.md)
- [CHANGELOG-1.8.md](./CHANGELOG-1.8.md)
- [CHANGELOG-1.7.md](./CHANGELOG-1.7.md)

  }

  public void testPermutationSetThreeRepeatedElements() {
    Iterator<List<Integer>> permutations =
        Collections2.permutations(newArrayList(1, 1, 2)).iterator();
    assertNextPermutation(newArrayList(1, 1, 2), permutations);
    assertNextPermutation(newArrayList(1, 2, 1), permutations);
    assertNextPermutation(newArrayList(2, 1, 1), permutations);

  }

  public void testPermutationSetThreeRepeatedElements() {
    Iterator<List<Integer>> permutations =
        Collections2.permutations(newArrayList(1, 1, 2)).iterator();
    assertNextPermutation(newArrayList(1, 1, 2), permutations);
    assertNextPermutation(newArrayList(1, 2, 1), permutations);
    assertNextPermutation(newArrayList(2, 1, 1), permutations);

    assertTrue("Heap is not intact after removeAll()", mmHeap.isIntact());
  }

  public void testContains() {
    MinMaxPriorityQueue<Integer> mmHeap = MinMaxPriorityQueue.create();
    mmHeap.addAll(Lists.newArrayList(1, 1, 2));
    assertEquals(3, mmHeap.size());
    assertFalse("Heap does not contain null", mmHeap.contains(null));
    assertFalse("Heap does not contain 3", mmHeap.contains(3));

    assertTrue("Heap is not intact after removeAll()", mmHeap.isIntact());
  }

  public void testContains() {
    MinMaxPriorityQueue<Integer> mmHeap = MinMaxPriorityQueue.create();
    mmHeap.addAll(Lists.newArrayList(1, 1, 2));
    assertEquals(3, mmHeap.size());
    assertFalse("Heap does not contain null", mmHeap.contains(null));
    assertFalse("Heap does not contain 3", mmHeap.contains(3));