// We only ever register ArrayReferences with the queue so this is always safe.
        ArrayReference<? extends L> arrayRef = (ArrayReference<? extends L>) ref;
        // Try to clear out the array slot, n.b. if we fail that is fine, in either case the
        // arrayRef will be out of the array after this step.
        locks.compareAndSet(arrayRef.index, arrayRef, null);
      }
    }

    @Override

    //     fgha[c]|[b]de -> fgha[b]|[c]de. Because these two blocks are the same size, we are done.
    // The Dolphin algorithm is attractive because it does the fewest array reads and writes: each
    // array slot is read and written exactly once. However, it can have very poor memory locality:
    // benchmarking shows it can take 7 times longer than the other two in some cases. The other two

  private static final class TimedPutQueue {
    final BlockingQueue<String> queue;
    final Completion completed;

    /**
     * Creates a {@link EnableWrites} which open up a spot for a {@code put} to succeed in {@code
     * countdownInMillis}.
     */
    static TimedPutQueue createWithDelay(long countdownInMillis) {
      return new TimedPutQueue(countdownInMillis);
    }

    assertThat(response.body.string()).isEqualTo("Hello response!")
    applicationLogs
      .assertLogEqual("""--> POST $url""")
      .assertLogEqual("""--> END POST (one-shot body omitted)""")
      .assertLogMatch(Regex("""<-- 200 OK $url \(\d+ms\)"""))
      .assertLogEqual("""Content-Length: 15""")
      .assertLogEqual("")
      .assertLogEqual("""Hello response!""")

     * If there are Maven3 passwords presents in settings, this results in doubled warnings emitted. So Plexus DI
     * creation call keeps "emitSettingsWarnings" false. If there are fatal issues, it will anyway "die" at that
     * spot before warnings would be emitted.
     * <p>
     * The method returns a "cleaner" runnable, as during extension loading the context needs to be "cleaned", restored
     * to previous state (as it was before extension loading).

	if cannotHeal && quorumETag != "" {
		// This is an object that is supposed to be removed by the dangling code
		// but we noticed that ETag is the same for all objects, let's give it a shot
		cannotHeal = false
	}

	if !latestMeta.Deleted && !latestMeta.IsRemote() {
		// check if there is a part that lost its quorum
		for _, partErrs := range dataErrsByPart {

Yu, PinkySan, pks, powderluv, Qiao Hai-Jun, Qiao Longfei, Rajendra Arora, Ralph
Tang, resec, Robin Richtsfeld, Rohan Varma, Ryohei Kuroki, SaintNazaire, Samuel
He, Sandeep Dcunha, sandipmgiri, Sang Han, scott, Scott Mudge, Se-Won Kim, Simon
Perkins, Simone Cirillo, Steffen Schmitz, Suvojit Manna, Sylvus, Taehoon Lee,
Ted Chang, Thomas Deegan, Till Hoffmann, Tim, Toni Kunic, Toon Verstraelen,

  * Bootstrap reworked to be more similar to GCE; better supports reboots/restarts
  * Use an elastic IP for the master by default
  * Experimental support for node spot instances (set NODE\_SPOT\_PRICE=0.05)

#### GCE

  * Ubuntu Trusty support added

	ZSDIVR Z25.S, Z2.S, P1.M, Z2.S                    // 22079604
	ZSDOT Z15.B, Z0.B, Z12.S                          // 0c008f44
	ZSDOT Z7.H, Z6.H, Z23.S                           // d7c80744
	// TODO: SDOT  <Zda>.H, <Zn>.B, <Zm>.B
	ZSEL Z23.B, Z21.B, P14, Z2.B                      // a2fa3705
	ZSHADD Z15.B, Z0.B, P3.M, Z0.B                    // e08d1044
	ZSHSUB Z15.B, Z0.B, P3.M, Z0.B                    // e08d1244

	ZSDOT Z1.S, Z26.S, Z11.B                          // ERROR "illegal combination from SVE"
	ZSDOT Z1.S, Z26.S, Z11.B                          // ERROR "illegal combination from SVE"
	// TODO: SDOT  <Zda>.H, <Zn>.B, <Zm>.B
	ZSEL Z1.S, Z26.S, P14.M, Z7.D                     // ERROR "illegal combination from SVE"
	ZSHADD Z1.S, Z26.S, P14.M, Z7.D                   // ERROR "illegal combination from SVE"