return transferElement(nextElements, previousElements);
    }

    @Override
    public int nextIndex() {
      return previousElements.size();
    }

    @Override
    public E previous() {
      return transferElement(previousElements, nextElements);
    }

    @Override
    public int previousIndex() {
      return nextIndex() - 1;
    }

    @Override
    public void remove() {

        for (int i = 0; i < num; i++) {
          list.add((double) counter.getAndIncrement());
        }
        builder.addAll(iterable(list));
      }
    },
    ADD_STREAM {
      @Override
      void doIt(ImmutableDoubleArray.Builder builder, AtomicInteger counter) {
        double[] array = new double[random.nextInt(10)];
        for (int i = 0; i < array.length; i++) {

    } else {
      return JdkBackedImmutableMultiset.create(entries);
    }
  }

  @Override
  public int count(@Nullable Object element) {
    throw new AssertionError();
  }

  @Override
  public ImmutableSet<E> elementSet() {
    throw new AssertionError();
  }

  @Override
  Entry<E> getEntry(int index) {
    throw new AssertionError();
  }

  @Override
  boolean isPartialView() {

        return Arrays.equals(key, other.key);
    }

    @Override
    public int hashCode() {
        return Arrays.hashCode(key);
    }

    @Override
    public String toString() {
        StringBuilder sb = new StringBuilder("LeaseKey[");
        for (int i = 0; i < key.length; i++) {
            if (i > 0) {
                sb.append(' ');
            }

      this.entries = entries;
    }

    @Override
    ImmutableMap<K, V> map() {
      return map;
    }

    @Override
    @GwtIncompatible("not used in GWT")
    int copyIntoArray(@Nullable Object[] dst, int offset) {
      return entries.copyIntoArray(dst, offset);
    }

    @Override
    public UnmodifiableIterator<Entry<K, V>> iterator() {
      return entries.iterator();
    }

     */
    protected int scrollTimeout = 60000;

    /**
     * Scroll size for search requests.
     */
    protected int scrollSize = 100;

    /**
     * Buffer size for bulk operations.
     */
    protected int bulkBufferSize = 10;

    /**
     * Number of shards for the index.
     */
    protected int numberOfShards = 5;

    /**

    /**
     * Size of the thumbnail path cache.
     */
    protected int thumbnailPathCacheSize = 10;

    /**
     * File extension for generated thumbnail images.
     */
    protected String imageExtention = "png";

    /**
     * Number of subdirectories for organizing thumbnails.
     */
    protected int splitSize = 10;

    /**
     * Maximum size of the thumbnail generation task queue.

    int nThreads = 100;
    int nTasks = 1000;
    int nSeededEntries = 100;
    Set<String> expectedKeys = Sets.newHashSetWithExpectedSize(nTasks + nSeededEntries);
    // seed the map, so its segments have a count>0; otherwise, clear() won't visit the in-progress
    // entries
    for (int i = 0; i < nSeededEntries; i++) {
      String s = "b" + i;

     * @param len the number of SIDs to resolve
     * @throws CIFSException if there is an error resolving the SIDs
     */
    void resolveSids(CIFSContext tc, String authorityServerName, SID[] sids, int off, int len) throws CIFSException;

    /**
     * Gets the SIDs of members of a group.
     *
     * @param tc the CIFS context to use
     * @param authorityServerName the server to use for resolution

  static byte[] newPreFilledByteArray(int size) {
    return newPreFilledByteArray(0, size);
  }

  /** Returns a byte array of length size that has values offset .. offset + size - 1. */
  static byte[] newPreFilledByteArray(int offset, int size) {
    byte[] array = new byte[size];
    for (int i = 0; i < size; i++) {
      array[i] = (byte) (offset + i);
    }
    return array;