}
}

val gradleModule = the<GradleModuleExtension>()
the<JvmCompileExtension>().apply {
    compilations {
        configureEach {
            // Everything compiles to Java 17 by default
            targetJvmVersion = 17
        }
    }
    addCompilationFrom(sourceSets.main) {

        /*
         * a * b == aHi * bHi * 2^64 + (aHi * bLo + aLo * bHi) * 2^32 + aLo * bLo.
         *       == (aHi * bHi * 2^32 + aHi * bLo + aLo * bHi) * 2^32 + aLo * bLo
         *
         * We carry out this computation in modular arithmetic. Since times2ToThe32Mod accepts any
         * unsigned long, we don't have to do a mod on every operation, only when intermediate
         * results can exceed 2^63.
         */

        if (session == null) {
            session = createMaven4Session();
        }
        return session;
    }

    /**
     * Creates a new Maven 4 session for effective POM computation.
     */
    private Session createMaven4Session() {
        Session session = ApiRunner.createSession(injector -> {
            injector.bindInstance(Dispatcher.class, new LegacyDispatcher());

    // clear absent
    assertFalse(segment.clearValueForTesting(key, hash, valueRef));

    segment.setTableEntryForTesting(0, entry);
    // don't increment count; this is used during computation
    assertTrue(segment.clearValueForTesting(key, hash, valueRef));
    // no notification sent with clearValue
    assertEquals(0, segment.count);
    assertThat(table.get(0)).isNull();

    // clear absent
    assertFalse(segment.clearValueForTesting(key, hash, valueRef));

    segment.setTableEntryForTesting(0, entry);
    // don't increment count; this is used during computation
    assertTrue(segment.clearValueForTesting(key, hash, valueRef));
    // no notification sent with clearValue
    assertEquals(0, segment.count);
    assertThat(table.get(0)).isNull();

 *       SMALL_DELAY_MS}, {@code MEDIUM_DELAY_MS}, {@code LONG_DELAY_MS}. The idea here is that a
 *       SHORT is always discriminable from zero time, and always allows enough time for the small
 *       amounts of computation (creating a thread, calling a few methods, etc) needed to reach a
 *       timeout point. Similarly, a SMALL is always discriminable as larger than SHORT and smaller

        .isEqualTo(EntryFactory.WEAK_WRITE);
    assertThat(EntryFactory.getFactory(Strength.WEAK, true, true))
        .isEqualTo(EntryFactory.WEAK_ACCESS_WRITE);
  }

  // computation tests

  public void testCompute() throws ExecutionException {
    CountingLoader loader = new CountingLoader();
    LocalCache<Object, Object> map = makeLocalCache(createCacheBuilder());

        .isEqualTo(EntryFactory.WEAK_WRITE);
    assertThat(EntryFactory.getFactory(Strength.WEAK, true, true))
        .isEqualTo(EntryFactory.WEAK_ACCESS_WRITE);
  }

  // computation tests

  public void testCompute() throws ExecutionException {
    CountingLoader loader = new CountingLoader();
    LocalCache<Object, Object> map = makeLocalCache(createCacheBuilder());

X0 // H * 2 PSHUFD $0xff, X0, X11 MOVOU X0, X12 PSRAL $0x1f, X11 PAND X14, X11 PSRLL $0x1f, X12 PSLLDQ $0x04, X12 PSLLL $0x01, X0 PXOR X11, X0 PXOR X12, X0 // Karatsuba pre-computations MOVOU X0, 224(DI) PSHUFD $0x4e, X0, X1 PXOR X0, X1 MOVOU X1, 240(DI) MOVOU X0, X2 MOVOU X1, X3 // Now prepare powers of H and pre-computations for them MOVQ $0x00000007, AX initLoop: MOVOU X2, X11 MOVOU X2, X12 MOVOU X3, X13 PCLMULQDQ $0x00, X0, X11 PCLMULQDQ $0x11, X0, X12 PCLMULQDQ $0x00, X1, X13 PXOR X11, X13 PXOR...

X0 // H * 2 PSHUFD $0xff, X0, X11 MOVOU X0, X12 PSRAL $0x1f, X11 PAND X14, X11 PSRLL $0x1f, X12 PSLLDQ $0x04, X12 PSLLL $0x01, X0 PXOR X11, X0 PXOR X12, X0 // Karatsuba pre-computations MOVOU X0, 224(DI) PSHUFD $0x4e, X0, X1 PXOR X0, X1 MOVOU X1, 240(DI) MOVOU X0, X2 MOVOU X1, X3 // Now prepare powers of H and pre-computations for them MOVQ $0x00000007, AX initLoop: MOVOU X2, X11 MOVOU X2, X12 MOVOU X3, X13 PCLMULQDQ $0x00, X0, X11 PCLMULQDQ $0x11, X0, X12 PCLMULQDQ $0x00, X1, X13 PXOR X11, X13 PXOR...