: newArrayList(elements.iterator());
  }

  /**
   * Creates a <i>mutable</i> {@code ArrayList} instance containing the given elements; a very thin
   * shortcut for creating an empty list and then calling {@link Iterators#addAll}.
   *
   * <p><b>Note:</b> if mutability is not required and the elements are non-null, use {@link
   * ImmutableList#copyOf(Iterator)} instead.
   */

   * close the open underlying stream.
   *
   * <p>Note: The input {@code Iterator} will be copied to an {@code ImmutableList} when this method
   * is called. This will fail if the iterator is infinite and may cause problems if the iterator
   * eagerly fetches data for each source when iterated (rather than producing sources that only

      }

      int oldCount = values.size();
      if (occurrences >= oldCount) {
        values.clear();
      } else {
        Iterator<V> iterator = values.iterator();
        for (int i = 0; i < occurrences; i++) {
          iterator.next();
          iterator.remove();
        }
      }
      return oldCount;
    }

    @Override
    public void clear() {
      multimap.clear();

      Comparator<?> comparator = set.comparator();
      if (Ordering.<C>natural().equals(comparator) || comparator == null) {
        return closed(set.first(), set.last());
      }
    }
    Iterator<C> valueIterator = values.iterator();
    C min = checkNotNull(valueIterator.next());
    C max = min;
    while (valueIterator.hasNext()) {
      C value = checkNotNull(valueIterator.next());

import java.io.ObjectInputStream;
import java.io.Serializable;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collection;
import java.util.Collections;
import java.util.Comparator;
import java.util.Iterator;
import java.util.List;
import java.util.function.Function;
import java.util.function.ToIntFunction;
import java.util.stream.Collector;
import org.jspecify.annotations.Nullable;

/**

import java.io.ObjectInputStream;
import java.io.Serializable;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collection;
import java.util.Collections;
import java.util.Comparator;
import java.util.Iterator;
import java.util.List;
import java.util.function.Function;
import java.util.function.ToIntFunction;
import java.util.stream.Collector;
import org.jspecify.annotations.Nullable;

/**

                    boolean notified = false;
                    final Iterator<Entry<Long, Response>> iterator = this.response_map.entrySet().iterator();
                    while (iterator.hasNext()) {
                        final Response resp = iterator.next().getValue();
                        resp.exception(ex);
                        iterator.remove();
                        notified = true;

                    }

     */
    long createTime() throws CIFSException;

    /**
     * Create a new file but fail if it already exists. The check for
     * existence of the file and it's creation are an atomic operation with
     * respect to other filesystem activities.
     *
     * @throws CIFSException if an error occurs creating the file
     */
    void createNewFile() throws CIFSException;

    /**

     * Returns the access mask associated with this ACE. Use the
     * constants for <code>FILE_READ_DATA</code>, <code>FILE_WRITE_DATA</code>,
     * <code>READ_CONTROL</code>, <code>GENERIC_ALL</code>, etc with bitwise
     * operators to determine which bits of the mask are on or off.
     *
     * @return the access mask
     */
    int getAccessMask();

    /**
     * Returns the 'Apply To' text for inheritance of ACEs on

     * Returns the access mask accociated with this ACE. Use the
     * constants for <code>FILE_READ_DATA</code>, <code>FILE_WRITE_DATA</code>,
     * <code>READ_CONTROL</code>, <code>GENERIC_ALL</code>, etc with bitwise
     * operators to determine which bits of the mask are on or off.
     * @return the access mask for this ACE
     */
    public int getAccessMask() {
        return access;
    }

    /**