* Set to -1 to disable automatic purging of search logs.
     */
    @Min(-1)
    @Max(100000)
    @ValidateTypeFailure
    public Integer purgeSearchLogDay;

    /**
     * Number of days to keep job logs before purging.
     * Set to -1 to disable automatic purging of job logs.
     */
    @Min(-1)
    @Max(100000)
    @ValidateTypeFailure
    public Integer purgeJobLogDay;

    /**

labels.facet_contentLength_10k=content_length:[0 TO 9999]\t\
labels.facet_contentLength_10kto100k=content_length:[10000 TO 99999]\t\
labels.facet_contentLength_100kto500k=content_length:[100000 TO 499999]\t\
labels.facet_contentLength_500kto1m=content_length:[500000 TO 999999]\t\
labels.facet_contentLength_1m=content_length:[1000000 TO *]\n\
labels.facet_filetype_title:\
labels.facet_filetype_html=filetype:html\t\

     * labels.facet_filetype_title:labels.facet_filetype_html=filetype:html	labels.facet_filetype_word=filetype:word	labels.face...

                        {
                            "required": True,
                            "schema": {
                                "title": "The ID of the item to get",
                                "maximum": 1000.0,
                                "minimum": 0.0,
                                "type": "integer",
                            },
                            "name": "item_id",
                            "in": "path",

  public void testSetFuture_stackOverflow() {
    SettableFuture<String> orig = SettableFuture.create();
    SettableFuture<String> prev = orig;
    for (int i = 0; i < 100000; i++) {
      SettableFuture<String> curr = SettableFuture.create();
      prev.setFuture(curr);
      prev = curr;
    }
    // prev represents the 'innermost' future
    prev.set("done");

      this.multiset = multiset;
      this.keys = keys;
    }

    @Override
    public int[] call() {
      int iterations = 100000;
      int nKeys = keys.size();
      int[] deltas = new int[nKeys];
      Operation[] operations = Operation.values();
      for (int i = 0; i < iterations; i++) {
        int keyIndex = random.nextInt(nKeys);

    /** Default encoding for CSV files. */
    protected String encoding = Constants.UTF_8;

    /** Maximum number of rows to extract. */
    protected int maxRows = 10000;

    /** Delimiter character for CSV parsing. */
    protected Character delimiter = null;

    /** Whether the first row contains headers. */
    protected boolean hasHeader = true;

  public void testSetFuture_stackOverflow() {
    SettableFuture<String> orig = SettableFuture.create();
    SettableFuture<String> prev = orig;
    for (int i = 0; i < 100000; i++) {
      SettableFuture<String> curr = SettableFuture.create();
      prev.setFuture(curr);
      prev = curr;
    }
    // prev represents the 'innermost' future
    prev.set("done");

    assertThat(Doubles.ensureCapacity(ARRAY1, 0, 1)).isSameInstanceAs(ARRAY1);
    assertThat(Doubles.ensureCapacity(ARRAY1, 1, 1)).isSameInstanceAs(ARRAY1);
    assertThat(Arrays.equals(new double[] {1.0, 0.0, 0.0}, Doubles.ensureCapacity(ARRAY1, 2, 1)))
        .isTrue();
  }

  public void testEnsureCapacity_fail() {
    assertThrows(IllegalArgumentException.class, () -> Doubles.ensureCapacity(ARRAY1, -1, 1));

  }

  public void testByteArrayRoundTrips() {
    Random r = new Random(5);
    byte[] b = new byte[Ints.BYTES];

    // total overkill, but, it takes 0.1 sec so why not...
    for (int i = 0; i < 10000; i++) {
      int num = r.nextInt();
      assertThat(Ints.fromByteArray(Ints.toByteArray(num))).isEqualTo(num);

      r.nextBytes(b);
      assertThat(Ints.toByteArray(Ints.fromByteArray(b))).isEqualTo(b);
    }