return apiResponseFieldSet.contains(field);
    }

    /**
     * Gets the fields that are included in standard search responses.
     *
     * @return array of field names for standard search responses
     */
    public String[] getResponseFields() {
        return responseFields;
    }

    /**
     * Sets the fields that are included in standard search responses.
     *

    /**
     * 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.

- *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.

        return DEFAULT_CURRENT_PAGE_NUMBER;
    }

    /**
     * Gets the total number of records across all pages.
     *
     * @return the total record count
     */
    public int getAllRecordCount() {
        return allRecordCount;
    }

    /**
     * Sets the total number of records across all pages.
     *
     * @param allRecordCount the total record count
     */

        }
        return new File(baseDir, filePath);
    }

    /**
     * Gets the base path for storing files.
     *
     * @return the base path
     */
    public String getPath() {
        return path;
    }

    /**
     * Sets the base path for storing files.
     *
     * @param path the base path to set
     */

        }
    }

    /**
     * Gets the URL for this request.
     * @return the URL
     */
    public String getUrl() {
        return url;
    }

    /**
     * Sets the URL for this request.
     * @param url the URL
     */
    public void setUrl(final String url) {
        this.url = url;
    }

    /**
     * Gets the weight/priority of this request.
     * @return the weight

     */
    public boolean isSuccess() {
        return returnCode == 0;
    }

    /**
     * Gets the sequence number.
     *
     * @return the sequence number
     */
    public long getSequenceNumber() {
        return sequenceNumber;
    }

    /**
     * Sets the sequence number.
     *
     * @param sequenceNumber the sequence number
     */

    }

    /**
     * Gets the return code.
     *
     * @return the return code
     */
    public int getReturnCode() {
        return returnCode;
    }

    /**
     * Sets the return code.
     *
     * @param returnCode the return code
     */
    public void setReturnCode(int returnCode) {
        this.returnCode = returnCode;
    }

    /**
     * Gets the context handle.
     *

            }
            bulkRequestBuilder = null;
        }
    }

    /**
     * Gets the priority of this score booster.
     * @return The priority.
     */
    public int getPriority() {
        return priority;
    }

    /**
     * Sets the priority of this score booster.
     * @param priority The priority.
     */
    public void setPriority(final int priority) {

/**
 * GWT emulated version of {@link com.google.common.collect.ImmutableSet}. For the unsorted sets,
 * they are thin wrapper around {@link java.util.Collections#emptySet()}, {@link
 * Collections#singleton(Object)} and {@link java.util.LinkedHashSet} for empty, singleton and
 * regular sets respectively. For the sorted sets, it's a thin wrapper around {@link
 * java.util.TreeSet}.
 *
 * @see ImmutableSortedSet
 * @author Hayward Chan