assertThat(loader.getCount()).isEqualTo(1);
    assertThat(segment.count).isEqualTo(1);
  }

  @AndroidIncompatible // Perhaps emulator clock does not update between the two get() calls?
  public void testComputeExpiredEntry() throws ExecutionException {
    CacheBuilder<Object, Object> builder = createCacheBuilder().expireAfterWrite(1, NANOSECONDS);
    CountingLoader loader = new CountingLoader();

        facetQueryView.init();
        int firstSize = facetQueryView.getQueryMap().size();
        int firstQueriesCount = testFacetInfo.getAddedQueries().size();

        // Call init again
        facetQueryView.init();

        // Size should remain the same
        assertEquals(firstSize, facetQueryView.getQueryMap().size());

    parts.close()

    assertFailsWith<IllegalStateException> {
      part.body.request(10)
    }.also { expected ->
      assertThat(expected).hasMessage("closed")
    }
  }

  @Test fun `cannot call nextPart after calling close`() {
    val parts =
      MultipartReader(
        boundary = "simple boundary",
        source = Buffer(),
      )

    parts.close()

 * @author Robert Konigsberg
 */
@GwtCompatible
@NullMarked
public class UnmodifiableCollectionTests {

  public static void assertMapEntryIsUnmodifiable(Entry<?, ?> entry) {
    try {
      // fine because the call is going to fail without modifying the entry
      @SuppressWarnings("unchecked")
      Entry<?, @Nullable Object> nullableValueEntry = (Entry<?, @Nullable Object>) entry;
      nullableValueEntry.setValue(null);

            ACE ace = mock(ACE.class);
            when(ace.getAccessMask()).thenReturn(ACE.GENERIC_ALL);
            when(ace.isAllow()).thenReturn(true);

            // Multiple calls to same method
            ace.getAccessMask();
            ace.getAccessMask();

            // Different methods called
            ace.isAllow();
            ace.getFlags();

    }

    @Override
    protected HashCode makeHash() {
      if (!finished) {
        // processRemaining does teardown we always want to do -- the folding together of the four
        // rolling CRCs.  So we call it on an empty ByteBuffer if we didn't already.
        processRemaining(EMPTY);
      }
      return HashCode.fromInt(~crc0);
    }

    static final int[] byteTable = {

   *
   * <p>Use this method instead of {@link File#createTempFile(String, String)} when you wish to
   * create a directory, not a regular file. A common pitfall is to call {@code createTempFile},
   * delete the file and create a directory in its place, but this leads a race condition which can
   * be exploited to create security vulnerabilities, especially when executable files are to be

    }
  }

  /**
   * This test attempts to create a situation in which one thread is constantly changing a file from
   * being a real directory to being a symlink to another directory. It then calls
   * deleteDirectoryContents thousands of times on a directory whose subtree contains the file
   * that's switching between directory and symlink to try to ensure that under no circumstance does

          .divide(BigInteger.valueOf(16L))
          .doubleValue();

  /**
   * Returns a stream of a million primitive doubles. The stream is parallel, which should cause
   * {@code collect} calls to run in multithreaded mode, so testing the combiner as well as the
   * supplier and accumulator.
   */
  static DoubleStream megaPrimitiveDoubleStream() {

   * Math#addExact(long, long)} instead. Note that if both arguments are {@code int} values, writing
   * {@code Math.addExact(a, b)} will call the {@link Math#addExact(int, int)} overload, not {@link
   * Math#addExact(long, long)}. Also note that adding two {@code int} values can <b>never</b>
   * overflow a {@code long}, so you can just write {@code (long) a + b}.
   *