AtomicReferenceFieldUpdater.<Waiter, @Nullable Waiter>newUpdater(
            Waiter.class, Waiter.class, "next");
    private static final AtomicReferenceFieldUpdater<
            ? super AbstractFutureState<?>, @Nullable Waiter>
        waitersUpdater = newUpdater(AbstractFutureState.class, Waiter.class, "waitersField");
    private static final AtomicReferenceFieldUpdater<

    // they have been left as independent tests for clarity.

    if (part.length() < 1 || part.length() > MAX_DOMAIN_PART_LENGTH) {
      return false;
    }

    /*
     * GWT claims to support java.lang.Character's char-classification methods, but it actually only
     * works for ASCII. So for now, assume any non-ASCII characters are valid. The only place this
     * seems to be documented is here:

    //                                                                    Helper Classes
    //                                                                    ================

    /**
     * Testable subclass that bypasses ComponentUtil dependencies.
     * This allows testing the filter logic without requiring the DI container.
     */
    private static class TestableLoadControlFilter extends LoadControlFilter {

 * </ul>
 *
 * <h3>Building a {@code Network}</h3>
 *
 * <p>The implementation classes that {@code common.graph} provides are not public, by design. To
 * create an instance of one of the built-in implementations of {@code Network}, use the {@link
 * NetworkBuilder} class:
 *
 * {@snippet :
 * MutableNetwork<Integer, MyEdge> network = NetworkBuilder.directed().build();
 * }
 *

 *       #toString} behavior you expect.
 *   <li>Offers useful operations beyond just {@code get} and {@code length}, so you don't have to
 *       hunt through classes like {@link Arrays} and {@link Doubles} for them.
 *   <li>Supports a copy-free {@link #subArray} view, so methods that accept this type don't need to
 *       add overloads that accept start and end indexes.

 *       #toString} behavior you expect.
 *   <li>Offers useful operations beyond just {@code get} and {@code length}, so you don't have to
 *       hunt through classes like {@link Arrays} and {@link Ints} for them.
 *   <li>Supports a copy-free {@link #subArray} view, so methods that accept this type don't need to
 *       add overloads that accept start and end indexes.

    }

    @Override
    void setBits(BitSet bitSet) {
      bitSet.or(table);
    }
  }

  // Static constant implementation classes

  /** Implementation of {@link #any()}. */
  private static final class Any extends NamedFastMatcher {

    static final CharMatcher INSTANCE = new Any();

    private Any() {
      super("CharMatcher.any()");
    }

  // simplest instance, though very similar descriptions apply to many other classes in this file.
  //
  // In the constructor of AbstractCatchingFuture, the delegate future is assigned to a field
  // 'inputFuture'. That field is non-final and non-volatile. There are 2 places where the
  // 'inputFuture' field is read and where we will have to consider visibility of the write

            // Do nothing in test
        }
    }

    private static class TestClickLogBhv extends ClickLogBhv {
        // Mock implementation
    }

    private static class TestFavoriteLogBhv extends FavoriteLogBhv {
        // Mock implementation
    }

    private static class TestIngestFactory extends IngestFactory {
        private boolean throwException = false;

     * If the class is a wrapper class, returns its corresponding primitive class; otherwise, returns the class itself.
     *
     * @param clazz
     *            The class. Must not be {@literal null}.
     * @return The primitive class if the argument is a wrapper class, otherwise the class passed as the argument.
     */
    public static Class<?> getPrimitiveClassIfWrapper(final Class<?> clazz) {
        assertArgumentNotNull("clazz", clazz);