assertFalse(awaitLatchUninterruptibly(timeoutMillis, MILLISECONDS));
      completed.assertCompletionNotExpected(timeoutMillis);
    }

    abstract void awaitLatchUninterruptibly();

    abstract boolean awaitLatchUninterruptibly(long timeout, TimeUnit unit);

    abstract long getCount();
  }

  /** Manages a {@link CountDownLatch} and associated timings. */

 * if you would like to manage any threading manually.
 *
 * @author Jesse Wilson
 * @since 1.0
 */
@GwtIncompatible
@J2ktIncompatible
public abstract class AbstractExecutionThreadService implements Service {
  /* use AbstractService for state management */
  private final Service delegate =
      new AbstractService() {
        @Override

      @Override
      @ParametricNullness
      E transform(Entry<E> entry) {
        return entry.getElement();
      }
    };
  }

  abstract static class ElementSet<E extends @Nullable Object> extends Sets.ImprovedAbstractSet<E> {
    abstract Multiset<E> multiset();

    @Override
    public void clear() {
      multiset().clear();
    }

    @Override

      @Override
      @ParametricNullness
      E transform(Entry<E> entry) {
        return entry.getElement();
      }
    };
  }

  abstract static class ElementSet<E extends @Nullable Object> extends Sets.ImprovedAbstractSet<E> {
    abstract Multiset<E> multiset();

    @Override
    public void clear() {
      multiset().clear();
    }

    @Override

  }

  /** An immutable map implementation backed by an indexed nullable array. */
  private abstract static class ImmutableArrayMap<K, V> extends IteratorBasedImmutableMap<K, V> {
    private final int size;

    ImmutableArrayMap(int size) {
      this.size = size;
    }

    abstract ImmutableMap<K, Integer> keyToIndex();

    // True if getValue never returns null.
    private boolean isFull() {

    }
    return copy;
  }

  /**
   * Abstracts away the difference between traversing a graph vs. a tree. For a tree, we just take
   * the next element from the next non-empty iterator; for graph, we need to loop through the next
   * non-empty iterator to find first unvisited node.
   */
  private abstract static class Traversal<N> {
    final SuccessorsFunction<N> successorFunction;

package com.google.common.base;

import com.google.common.annotations.GwtCompatible;

/**
 * Holder for extra methods of {@code Objects} only in web. Intended to be empty for regular
 * version.
 */
@GwtCompatible

import com.google.common.annotations.GwtCompatible;

/**
 * Holder for web specializations of methods of {@code Floats}. Intended to be empty for regular
 * version.
 */
@GwtCompatible

import com.google.common.annotations.GwtCompatible;

/**
 * Holder for web specializations of methods of {@code Shorts}. Intended to be empty for regular
 * version.
 */
@GwtCompatible

import org.eclipse.aether.repository.RemoteRepository;
import org.junit.jupiter.api.BeforeEach;

import static org.codehaus.plexus.testing.PlexusExtension.getTestFile;

@PlexusTest
public abstract class AbstractRepositoryTestCase {
    @Inject
    protected RepositorySystem system;

    @Inject
    protected PlexusContainer container;

    protected RepositorySystemSession session;

    @BeforeEach