@Override
  @SuppressWarnings("unchecked")
  public final Entry<String, String>[] createArray(int length) {
    return (Entry<String, String>[]) new Entry<?, ?>[length];
  }

  @Override
  public final String[] createKeyArray(int length) {
    return new String[length];
  }

  @Override
  public final String[] createValueArray(int length) {
    return new String[length];
  }

        MsrpcShareInfo1(final srvsvc.ShareInfo1 info1) {
            this.netName = info1.netname;
            this.type = info1.type;
            this.remark = info1.remark;
        }
    }

    /**
     * Creates a new request to enumerate shares on a server.
     *
     * @param server the server name to enumerate shares from
     */
    public MsrpcShareEnum(final String server) {

        MsrpcShareInfo1(final srvsvc.ShareInfo1 info1) {
            this.netName = info1.netname;
            this.type = info1.type;
            this.remark = info1.remark;
        }
    }

    /**
     * Creates a new request to enumerate shares on a server.
     *
     * @param server the server name to enumerate shares from
     */
    public MsrpcShareEnum(final String server) {

        exception.expectMessage(is("remove"));
        final EmptyIterator<String> emptyIterator = new EmptyIterator<String>();
        emptyIterator.remove();
    }

    /**
     * Test method for
     * {@link org.codelibs.core.collection.EmptyIterator#hasNext()}.
     */
    @Test
    public void testHasNext() {
        final EmptyIterator<String> emptyIterator = new EmptyIterator<String>();

/** Tests for repeated node and edge addition and removal in a {@link Network}. */
@RunWith(JUnit4.class)

@NullUnmarked
public final class NetworkMutationTest {
  private static final int NUM_TRIALS = 5;
  private static final int NUM_NODES = 20;
  private static final int NUM_EDGES = 100;
  private static final int NODE_POOL_SIZE = 1000; // must be >> NUM_NODES

  @Test
  public void directedNetwork() {

/** Tests for repeated node and edge addition and removal in a {@link Graph}. */
@RunWith(JUnit4.class)

@NullUnmarked
public final class GraphMutationTest {
  private static final int NUM_TRIALS = 50;
  private static final int NUM_NODES = 100;
  private static final int NUM_EDGES = 1000;
  private static final int NODE_POOL_SIZE = 1000; // must be >> NUM_NODES

  @Test
  public void directedGraph() {

  }

  @Override
  boolean isPartialView() {
    return false;
  }

  @Override
  public final boolean isEmpty() {
    return delegate.isEmpty();
  }

  @Override
  public final boolean containsKey(@Nullable Object key) {
    return Maps.safeContainsKey(delegate, key);
  }

  @Override
  public final boolean containsValue(@Nullable Object value) {
    return delegate.containsValue(value);
  }

  @Override

 */
public class ChannelManager {

    private static final Logger log = LoggerFactory.getLogger(ChannelManager.class);

    private final CIFSContext context;
    private final SmbSession session;
    private final Map<String, ChannelInfo> channels;
    private final List<NetworkInterfaceInfo> localInterfaces;
    private final List<NetworkInterfaceInfo> remoteInterfaces;
    private final ScheduledExecutorService scheduler;

import java.lang.reflect.Method;

/**
 * Context for an exception thrown by a subscriber.
 *
 * @since 16.0
 */
public class SubscriberExceptionContext {
  private final EventBus eventBus;
  private final Object event;
  private final Object subscriber;
  private final Method subscriberMethod;

  /**
   * @param eventBus The {@link EventBus} that handled the event and the subscriber. Useful for

/**
 * An ordering that orders elements by applying an order to the result of a function on those
 * elements.
 */
@GwtCompatible
final class ByFunctionOrdering<F extends @Nullable Object, T extends @Nullable Object>
    extends Ordering<F> implements Serializable {
  final Function<F, ? extends T> function;
  final Ordering<T> ordering;

  ByFunctionOrdering(Function<F, ? extends T> function, Ordering<T> ordering) {