.putShort((short) 0x0000)
        .putShort((short) 0x0000);
    assertEquals(hashCode, hasher.hash().asLong());
  }

  public void testHashFloatIsStable() {
    // Just a spot check.  Better than nothing.
    Hasher hasher = HASH_FN.newHasher();
    hasher.putFloat(0x01000101f).putFloat(0f);
    assertEquals(0x49f9d18ee8ae1b28L, hasher.hash().asLong());

    hasher = HASH_FN.newHasher();

  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);
    }

  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);
    }

         * and increasing the threshold to 2^32 doesn't pay for itself, and adding another enum
         * constant hurts performance further -- I suspect because bimorphic implementation is a
         * sweet spot for the JVM.
         */
        return (a * b) % m;
      }

      @Override
      long squareMod(long a, long m) {
        return (a * a) % m;
      }
    },

				"text/vnd.dmclientscript",
				"text/vnd.esmertec.theme-descriptor",
				"text/vnd.fly",
				"text/vnd.fmi.flexstor",
				"text/vnd.graphviz",
				"text/vnd.in3d.3dml",
				"text/vnd.in3d.spot",
				"text/vnd.iptc.anpa",
				"text/vnd.iptc.newsml",
				"text/vnd.iptc.nitf",
				"text/vnd.latex-z",
				"text/vnd.motorola.reflex",
				"text/vnd.ms-mediapackage",

import configurations.applyDefaults
import configurations.applyTestDefaults
import io.mockk.every
import io.mockk.impl.annotations.MockK
import io.mockk.junit5.MockKExtension
import io.mockk.mockk
import io.mockk.slot
import jetbrains.buildServer.configs.kotlin.BuildStep
import jetbrains.buildServer.configs.kotlin.BuildSteps
import jetbrains.buildServer.configs.kotlin.DslContext
import model.CIBuildModel

,"poster","preload","pubdate","radiogroup","readonly","rel","required","rev","reversed","role","rows","rowspan","spellcheck","scope","selected","shape","size","sizes","slot","span","srclang","start","src","srcset","step","style","summary","tabindex","title","translate","type","usemap","valign","value","width","wrap","xmlns","slot"]),P=i(["accent-height","accumulate","additive","alignment-baseline","amplitude","ascent","attributename","attributetype","azimuth","basefrequency","baseline-shift","be...

    //     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

	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"