* Sets the number of data shards.
     * @param dataShards The number of data shards.
     */
    public void setDataShards(final int dataShards) {
        this.dataShards = dataShards;
    }

    /**
     * Returns the number of filter shards.
     * @return The number of filter shards.
     */
    public int getFilterShards() {
        return filterShards;
    }

    /**

- *If total drives has many common divisors the algorithm chooses the minimum amounts of erasure sets possible for a erasure set size of any N*.  In the example with 1024 drives - 4, 8, 16 are GCD factors. With 16 drives we get a total of 64 possible sets, with 8 drives we get a total of 128 possible sets, with 4 drives we get a total of 256 possible sets. So algorithm automatically chooses 64 sets, which is *16* 64 = 1024* drives in total.

        super(config, andxResp);
    }

    /**
     * Gets the file identifier.
     *
     * @return the fid
     */
    public final int getFid() {
        return this.fid;
    }

    /**
     * Gets the file data size.
     *
     * @return the dataSize
     */
    public final int getDataSize() {
        return this.fileDataSize;

    }

    /**
     * Gets a String value from the map.
     *
     * @param map The source map
     * @param key The key to look up
     * @return The string value, or null if the key doesn't exist or value is null
     */
    public static String getString(final Map<String, Object> map, final String key) {
        return getString(map, key, null);
    }

    /**

   */
  interface InternalEntry<K, V, E extends InternalEntry<K, V, E>> {
    /** Gets the next entry in the chain. */
    E getNext();

    /** Gets the entry's hash. */
    int getHash();

    /** Gets the key for this entry. */
    K getKey();

    /** Gets the value for the entry. */
    V getValue();
  }

  /*

     */
    String getSource();

    /**
     * Gets the one-based index of the line containing the problem. The line number should refer to some text file that
     * is given by {@link #getSource()}.
     *
     * @return The one-based index of the line containing the problem or a non-positive value if unknown.
     */
    int getLineNumber();

    /**

    /**
     * Sets the suggest settings.
     * @param settings The suggest settings.
     * @return This builder instance.
     */
    public SuggesterBuilder settings(final SuggestSettings settings) {
        this.settings = settings;
        settingsBuilder = null;
        return this;
    }

    /**
     * Sets the suggest settings builder.

     * @return the tree is connected
     */
    boolean isConnected();

    /**
     * Gets the server timezone offset in milliseconds
     * @return server timezone offset
     * @throws CIFSException if an error occurs retrieving the timezone offset
     */
    long getServerTimeZoneOffset() throws CIFSException;

    /**
     * Gets the OEM domain name reported by the server
     * @return server reported domain name

  @SuppressWarnings("GoodTime")
  long getAccessTime();

  /** Sets the entry access time in ns. */
  @SuppressWarnings("GoodTime") // b/122668874
  void setAccessTime(long time);

  /** Returns the next entry in the access queue. */
  ReferenceEntry<K, V> getNextInAccessQueue();

  /** Sets the next entry in the access queue. */
  void setNextInAccessQueue(ReferenceEntry<K, V> next);

     */
    String getSource();

    /**
     * Gets the one-based index of the line containing the problem. The line number should refer to some text file that
     * is given by {@link #getSource()}.
     *
     * @return The one-based index of the line containing the problem or a non-positive value if unknown.
     */
    int getLineNumber();

    /**