* and the time taken to complete the operation.
 */
public class SuggestIndexResponse implements Response {
    /** The number of suggest documents. */
    protected final int numberOfSuggestDocs;
    /** The number of input documents. */
    protected final int numberOfInputDocs;
    /** Flag indicating if there are errors. */
    protected final boolean hasError;
    /** List of errors. */

    /** Constant representing the pre-processing state. */
    int PRE_PROCESSING = 1;

    /** Constant representing the post-processing state. */
    int POST_PROCESSING = 2;

    /** Constant indicating that there are no URLs in the queue. */
    int NO_URL_IN_QUEUE = 4;

    /** Constant indicating that the crawler is waiting for new URLs. */
    int WAIT_NEW_URL = 8;

    /**

 * @author shinsuke
 *
 */
public class CrawlerWebServer {
    private int port = 8080;

    private File docRoot;

    private Server server;

    private boolean tempDocRoot = false;

    public CrawlerWebServer(final int port) {
        this(port, createDocRoot(3));
        tempDocRoot = true;
    }

    public CrawlerWebServer(final int port, final File docRoot) {
        this.port = port;

        return tempFile;
    }

    /*
     * (non-Javadoc)
     *
     * @see java.io.InputStream#read()
     */
    @Override
    public int read() throws IOException {
        return fileInputStream.read();
    }

    @Override
    public int available() throws IOException {
        return fileInputStream.available();
    }

    /**

    /**
     * Number of shards for the queue index.
     */
    protected int queueShards = Runtime.getRuntime().availableProcessors() * 2;

    /**
     * Number of shards for the data index.
     */
    protected int dataShards = Runtime.getRuntime().availableProcessors() * 2;

    /**
     * Number of shards for the filter index.
     */
    protected int filterShards = Runtime.getRuntime().availableProcessors() * 2;

    /**

 */
fun <T, R> splitIntoBuckets(
    list: LinkedList<T>,
    toIntFunction: (T) -> Int,
    largeElementSplitFunction: (T, Int) -> List<R>,
    smallElementAggregateFunction: (List<T>) -> R,
    expectedBucketNumber: Int,
    maxNumberInBucket: Int,
    noElementSplitFunction: (Int) -> List<R> = { throw IllegalArgumentException("More buckets than things to split") },

                    || PRIORITY_ELEMENT.equals(qName)) {
                buf = new StringBuilder();
            }
        }

        @Override
        public void characters(final char[] ch, final int offset, final int length) {
            if (buf != null) {
                buf.append(new String(ch, offset, length));
            }
        }

        @Override

    /** Scroll size. */
    protected int scrollSize = 1;
    /** Maximum retry count. */
    protected int maxRetryCount = 5;
    /** Limit of document size. */
    protected long limitOfDocumentSize = 50000;
    /** Query builder. */
    protected QueryBuilder queryBuilder = QueryBuilders.matchAllQuery();
    /** Limit percentage. */
    protected int limitPercentage = 100;
    /** Limit number. */

     */
    public static final int OK_STATUS = 0;

    /**
     * The status code for Not Modified.
     */
    public static final int NOT_MODIFIED_STATUS = 304;

    /**
     * The HTTP status code for OK.
     */
    public static final int OK_STATUS_CODE = 200;

    /**
     * The HTTP status code for Not Modified.
     */
    public static final int NOT_MODIFIED_STATUS_CODE = 304;

    /**

        private final Reader reader;

        private int initialCapacity = 10000;

        private int maxAlphanumTermSize = -1;

        private int maxSymbolTermSize = -1;

        private boolean duplicateTermRemoved = false;

        /**
         * Array of space characters. Default includes common space characters.
         */
        private int[] spaceChars = { '\u0020', '\u00a0', '\u3000', '\ufffd' };