import org.junit.jupiter.api.BeforeEach
import org.junit.jupiter.api.Tag
import org.junit.jupiter.api.Test
import org.junit.jupiter.api.Timeout
import org.junit.jupiter.api.io.TempDir

@Timeout(60)
@Tag("Slow")
@Burst
class DiskLruCacheTest(
  subject: Subject = Subject.System,
) {
  private val baseFilesystem: FileSystem = subject.create()
  private val filesystem = FaultyFileSystem(baseFilesystem)

				"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",

     */
    private static <K, V> Entry<K, V> @Nullable [] lastEntryForEachKey(
        Entry<K, V>[] entries, int size) {
      Set<K> seen = new HashSet<>();
      BitSet dups = new BitSet(); // slots that are overridden by a later duplicate key
      for (int i = size - 1; i >= 0; i--) {
        if (!seen.add(entries[i].getKey())) {
          dups.set(i);
        }
      }
      if (dups.isEmpty()) {

    /** Gets the key for this entry. */
    K getKey();

    /** Gets the value for the entry. */
    V getValue();
  }

  /*
   * Note: the following classes have a lot of duplicate code. It sucks, but it saves a lot of
   * memory. If only Java had mixins!
   */

  /** Base class for {@link InternalEntry} implementations for strong keys. */

gov.ng
gov.nl
gov.nr
gov.om
gov.ph
gov.pk
gov.pl
gov.pn
gov.pr
gov.ps
gov.pt
gov.py
gov.qa
gov.rs
gov.ru
gov.rw
gov.sa
gov.sb
gov.sc
gov.scot
gov.sd
gov.sg
gov.sh
gov.sl
gov.so
gov.ss
gov.sx
gov.sy
gov.tj
gov.tl
gov.tm
gov.tn
gov.to
gov.tr
gov.tt
gov.tw
gov.ua
gov.uk
gov.vc

	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"

         * 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;
      }
    },

 *  Upgrade: [Kotlin 1.9.23][kotlin_1_9_23].

 *  Upgrade: [Unicode® IDNA 15.1.0][idna_15_1_0]


## Version 5.0.0-alpha.12

_2023-12-17_

We took too long to cut this release and there's a lot of changes in it. We've been busy.

Although this release is labeled _alpha_, the only unstable thing in it is our new APIs. This
release has many critical bug fixes and is safe to run in production. We're eager to stabilize our

 *
 * @author Mike Bostock
 * @author Jared Levy
 */
@J2ktIncompatible
@GwtCompatible
/*
 * I have decided not to bother adding @ParametricNullness annotations in this class. Adding them is
 * a lot of busy work, and the annotation matters only when the APIs to be annotated are visible to
 * Kotlin code. In this class, nothing is publicly visible (nor exposed indirectly through a

 *
 * @author Mike Bostock
 * @author Jared Levy
 */
@J2ktIncompatible
@GwtCompatible
/*
 * I have decided not to bother adding @ParametricNullness annotations in this class. Adding them is
 * a lot of busy work, and the annotation matters only when the APIs to be annotated are visible to
 * Kotlin code. In this class, nothing is publicly visible (nor exposed indirectly through a