assertTrue("Empty heap should be OK", mmHeap.isIntact());
    for (int i = 0; i < heapSize; i++) {
      int randomInt = random.nextInt();
      mmHeap.offer(randomInt);
      insertIntoReplica(replica, randomInt);
    }
    assertIntact(mmHeap);
    assertEquals(heapSize, mmHeap.size());
    int currentHeapSize = heapSize;
    for (int i = 0; i < numberOfModifications; i++) {

curve. func GenerateKey[P Point[P]](c *Curve[P], rand io.Reader) (*PrivateKey, error) { fips140.RecordApproved() k, Q, err := randomPoint(c, func(b []byte) error { return drbg.ReadWithReader(rand, b) }) if err != nil { return nil, err } priv := &PrivateKey{ pub: PublicKey{ curve: c.curve, q: Q.Bytes(), }, d: k.Bytes(c.N), } fipsPCT(c, priv) return priv, nil } // randomPoint returns a random scalar and the corresponding point using a // procedure equivalent to FIPS 186-5, Appendix A.2.2 (ECDSA Key...

curve. func GenerateKey[P Point[P]](c *Curve[P], rand io.Reader) (*PrivateKey, error) { fips140.RecordApproved() k, Q, err := randomPoint(c, func(b []byte) error { return drbg.ReadWithReader(rand, b) }) if err != nil { return nil, err } priv := &PrivateKey{ pub: PublicKey{ curve: c.curve, q: Q.Bytes(), }, d: k.Bytes(c.N), } fipsPCT(c, priv) return priv, nil } // randomPoint returns a random scalar and the corresponding point using a // procedure equivalent to FIPS 186-5, Appendix A.2.2 (ECDSA Key...