if (i > 0) {
                    assertTrue(messages[0].chain(messages[i]));
                }
            }

            // Verify chain is properly linked
            ServerMessageBlock2 current = messages[0];
            for (int i = 1; i < messages.length; i++) {
                current = current.getNext();
                assertEquals(messages[i], current);

 *       ImmutableList#subList} may retain a reference to the entire data set, preventing it from
 *       being garbage collected. If some of the data is no longer reachable through other means,
 *       this constitutes a memory leak. Pass the view collection to the appropriate {@code copyOf}
 *       method to obtain a correctly-sized copy.

      return true;
    }
  }

  /**
   * Per <a href="https://github.com/google/guava/issues/1635">issue 1635</a>, In JDK 1.7.0_51-b13,
   * {@link TypeVariableImpl#equals(Object)} is changed to no longer be equal to custom TypeVariable
   * implementations. As a result, we need to make sure our TypeVariable implementation respects
   * symmetry. Moreover, we don't want to reconstruct a native type variable {@code <A>} using our

What’s changing now:

* 🚫 We’re no longer accepting new community-submitted translation PRs.

* ⏳ Existing open PRs will be reviewed and can still be merged if completed within the next 3 weeks (since July 11 2025).

		// ReadSlice, and it's that function that handles
		// the last byte.
	}

	// Try all readers with UnreadByte.
	for rno, read := range readers {
		// Some input data that is longer than the minimum reader buffer size.
		const n = 10
		var buf bytes.Buffer
		for i := 0; i < n; i++ {
			buf.WriteString("abcdefg")
		}

		r := NewReaderSize(&buf, minReadBufferSize)

 * done by determining whether the domain ended with a {@linkplain #isPublicSuffix() public suffix}
 * but was not itself a public suffix. However, this test is no longer accurate. There are many
 * domains which are both public suffixes and addressable as hosts; {@code "uk.com"} is one example.
 * Using the subset of public suffixes that are {@linkplain #isRegistrySuffix() registry suffixes},

   * Comparisons between the two should take this into account.
   *
   * <p>Fingerprint2011() is a form of Murmur2 on strings up to 32 bytes and a form of CityHash for
   * longer strings. It could have been one or the other throughout. The main advantage of the
   * combination is that CityHash has a bunch of special cases for short strings that don't need to

        indexUpdater.start();

        // Let it run briefly
        ThreadUtil.sleep(100);

        // Stop the indexer
        indexUpdater.setFinishCrawling(true);

        // Wait for completion with longer timeout
        indexUpdater.join(3000);

        assertFalse(errorOccurred.get());
        // Thread may still be alive in test environment, just check no errors

      } catch (_: FileNotFoundException) {
        // A file must have been deleted manually!
        for (source in sources) {
          source.closeQuietly()
        }
        // Since the entry is no longer valid, remove it so the metadata is accurate (i.e. the cache
        // size.)
        try {
          removeEntry(this)
        } catch (_: IOException) {
        }
        return null
      }

        }
    }

    /**
     * Purges old thumbnail files based on the expiry time.
     *
     * @param expiry the expiry time threshold
     * @return the number of files purged
     */
    public long purge(final long expiry) {
        if (!baseDir.exists()) {
            return 0;
        }
        try {