* perform better than its longhand equivalent, but should not perform worse.
   *
   * @since 12.0
   */
  HashCode hashInt(int input);

  /**
   * Shortcut for {@code newHasher().putLong(input).hash()}; returns the hash code for the given
   * {@code long} value, interpreted in little-endian byte order. The implementation <i>might</i>

   * perform better than its longhand equivalent, but should not perform worse.
   *
   * @since 12.0
   */
  HashCode hashInt(int input);

  /**
   * Shortcut for {@code newHasher().putLong(input).hash()}; returns the hash code for the given
   * {@code long} value, interpreted in little-endian byte order. The implementation <i>might</i>

                return message.contains("connection reset") || message.contains("network unreachable")
                        || message.contains("host unreachable") || message.contains("timeout");
            }
            return true; // Generic socket errors might be recoverable
        }

        // Generic IO exceptions might be recoverable

            if (testTransport == null) {
                // No recovery possible, remove synchronously
                removeChannel(failedChannel);
                return;
            }
            // Recovery might be viable, attempt it with pre-created transport
            if (state.shouldRetry()) {
                scheduleRecoveryWithTransport(failedChannel, state, testTransport);
            } else {

        // Test convert with null text - this might throw exception
        String text = null;
        String field = "content";

        try {
            List<String> results = converter.convert(text, field, "en");
            assertNotNull(results);
        } catch (Exception e) {
            // Expected behavior - null text might cause exception
            assertNotNull(e);
        }
    }

     * setException() will be a no-op because the Future is already done.
     *
     * Both scenarios are bad: The output Future might never complete, or, if it does complete, it
     * might not run some of its listeners. The likely result is that the app will hang. (And of
     * course stack overflows are bad news in general. For example, we may have overflowed in the

    if (supportsRemove) {
      // We use a copy of "entryToRemove" in the assertion because "entryToRemove" might be
      // invalidated and have undefined behavior after entrySet.removeAll(entriesToRemove),
      // for example entryToRemove.getValue() might be null.
      Entry<K, V> entryToRemoveCopy = mapEntry(entryToRemove.getKey(), entryToRemove.getValue());

      int initialSize = map.size();

     * setException() will be a no-op because the Future is already done.
     *
     * Both scenarios are bad: The output Future might never complete, or, if it does complete, it
     * might not run some of its listeners. The likely result is that the app will hang. (And of
     * course stack overflows are bad news in general. For example, we may have overflowed in the

 * number of well-known problems. Here is how you might use this class instead:
 *
 * {@snippet :
 * public class MyServer implements Closeable {
 *   private static final FinalizableReferenceQueue frq = new FinalizableReferenceQueue();
 *   // You might also share this between several objects.
 *

  private static final int MAX_BUSY_WAIT_SPINS = 1000;

  @Override
  public final void run() {
    /*
     * Set runner thread before checking isDone(). If we were to check isDone() first, the task
     * might be cancelled before we set the runner thread. That would make it impossible to
     * interrupt, yet it will still run, since interruptTask will leave the runner value null,
     * allowing the CAS below to succeed.
     */