*
   * <p><b>Warning:</b> Be extremely careful what you do with the {@code asSet} view of a large
   * range set (such as {@code ImmutableRangeSet.of(Range.greaterThan(0))}). Certain operations on
   * such a set can be performed efficiently, but others (such as {@link Set#hashCode} or {@link
   * Collections#frequency}) can cause major performance problems.
   *

import com.google.common.collect.Maps;
import com.google.common.collect.Sets;
import com.google.j2objc.annotations.Weak;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.EnumMap;
import java.util.List;
import java.util.Map;
import java.util.Map.Entry;
import java.util.Set;
import java.util.concurrent.ConcurrentMap;
import java.util.concurrent.TimeUnit;

                  @Override
                  protected Set<String> create(String[] elements) {
                    return TreeMultiset.create(asList(elements)).elementSet();
                  }

                  @Override
                  public List<String> order(List<String> insertionOrder) {
                    return new ArrayList<>(Sets.newTreeSet(insertionOrder));
                  }
                })

    }

    @Override
    int expectedValueCollectionSize(int defaultExpectedValues, Iterable<?> values) {
      // Only trust the size of `values` if it is a Set and therefore probably already deduplicated.
      if (values instanceof Set<?>) {
        Set<?> collection = (Set<?>) values;
        return max(defaultExpectedValues, collection.size());
      } else {
        return defaultExpectedValues;
      }
    }

    /**

      }
    }
  }

  public abstract static class AbstractFilteredSetTest<C extends Set<Integer>>
      extends AbstractFilteredCollectionTest<C> {
    public void testEqualsAndHashCode() {
      for (List<Integer> contents : SAMPLE_INPUTS) {
        Set<Integer> expected = new HashSet<>();
        for (Integer i : contents) {
          if (EVEN.apply(i)) {
            expected.add(i);

            this.indexUpdateCallback = indexUpdateCallback;
            this.initParamMap = initParamMap;
        }

        /**
         * Executes the crawling thread.
         * Sets the running flag, processes the data store, and ensures
         * proper cleanup regardless of success or failure.
         */
        @Override
        public void run() {
            running = true;

   * optimistic retry code, relying on rechecked sets of reads.
   *
   * @param x the value
   * @param hc the hash code holder
   * @param wasUncontended false if CAS failed before call
   */
  final void retryUpdate(long x, int @Nullable [] hc, boolean wasUncontended) {
    int h;
    if (hc == null) {
      threadHashCode.set(hc = new int[1]); // Initialize randomly

          .put(ImmutableList.class, ImmutableList.of())
          .put(Set.class, ImmutableSet.of())
          .put(ImmutableSet.class, ImmutableSet.of())
          .put(SortedSet.class, ImmutableSortedSet.of())
          .put(ImmutableSortedSet.class, ImmutableSortedSet.of())
          .put(NavigableSet.class, Sets.unmodifiableNavigableSet(Sets.newTreeSet()))
          .put(Map.class, ImmutableMap.of())

     */
    public boolean isAsyncHandled() {
        return this.asyncHandled;
    }

    /**
     * Sets whether the asynchronous interim response has been handled.
     *
     * @param asyncHandled
     *            the asyncHandled to set
     */
    public void setAsyncHandled(final boolean asyncHandled) {
        this.asyncHandled = asyncHandled;
    }

    /**

        assertEquals(newPosition, smbRandomAccessFile.getFilePointer());
    }

    @Test
    void testSeekNegativePosition() throws SmbException {
        // seek doesn't throw exception for negative position, it just sets it
        smbRandomAccessFile.seek(-1);
        assertEquals(-1, smbRandomAccessFile.getFilePointer());
    }

    @Test
    void testReadByte() throws SmbException {