ensureOperations();
        return deletionOps.deleteOldWords(index, threshold);
    }

    /**
     * Sets the index name.
     * @param index The index name.
     * @return This SuggestIndexer instance.
     */
    public SuggestIndexer setIndexName(final String index) {
        this.index = index;
        return this;
    }

    /**
     * Sets the supported fields.

  }

  private static double expectedLargeDatasetPercentile(int index) {
    // We have q=100, k=index, and N=9951. Therefore k*(N-1)/q is 99.5*index. If index is even, that
    // is an integer 199*index/2. If index is odd, that is halfway between floor(199*index/2) and
    // ceil(199*index/2).
    if (index % 2 == 0) {
      int position = IntMath.divide(199 * index, 2, UNNECESSARY);
      return PSEUDORANDOM_DATASET_SORTED.get(position);

  }

  private static double expectedLargeDatasetPercentile(int index) {
    // We have q=100, k=index, and N=9951. Therefore k*(N-1)/q is 99.5*index. If index is even, that
    // is an integer 199*index/2. If index is odd, that is halfway between floor(199*index/2) and
    // ceil(199*index/2).
    if (index % 2 == 0) {
      int position = IntMath.divide(199 * index, 2, UNNECESSARY);
      return PSEUDORANDOM_DATASET_SORTED.get(position);

	Name8        string `gorm:"index:,length:10;index:,collate:utf8"`

	CompName1 string `gorm:"index:,unique,composite:idx_compname_1,option:NULLS NOT DISTINCT;not null"`
	CompName2 string `gorm:"index:,composite:idx_compname_1"`

	// Composite Index: Flattened structure.
	Data0A string `gorm:"index:,composite:comp_id0"`
	Data0B string `gorm:"index:,composite:comp_id0"`

	// Composite Index: Nested structure.

            return indexingOps.index(index, item, badWordsSupplier.get());
        }
        return new SuggestIndexResponse(0, 0, null, 0);
    }

    /**
     * Deletes an elevate word.
     *
     * @param index The index name
     * @param elevateWord The elevate word to delete
     * @param apply Whether to apply the change immediately (delete from index)
     * @return The SuggestDeleteResponse

    /**
     * Indexes a single suggest item.
     *
     * @param index The index name
     * @param item The suggest item to index
     * @param badWords The list of bad words to filter against
     * @return The SuggestIndexResponse
     */
    public SuggestIndexResponse index(final String index, final SuggestItem item, final String[] badWords) {
        return index(index, new SuggestItem[] { item }, badWords);
    }

    /**

   * @param index the index of the first character to decode
   * @param end the index beyond the last valid character to decode
   * @return the Unicode code point for the given index or the negated value of the trailing high
   *     surrogate character at the end of the sequence
   */
  protected static int codePointAt(CharSequence seq, int index, int end) {
    checkNotNull(seq);

      }
      queue[index] = x;
      return index;
    }

    /**
     * Returns the index of minimum value between {@code index} and {@code index + len}, or {@code
     * -1} if {@code index} is greater than {@code size}.
     */
    int findMin(int index, int len) {
      if (index >= size) {
        return -1;
      }
      checkState(index > 0);
      int limit = min(index, size - len) + len;

                args[index] = ByteConversionUtil.toByte(args[index]);
                return true;
            } else if (paramTypes[index] == Short.class) {
                args[index] = ShortConversionUtil.toShort(args[index]);
                return true;
            } else if (paramTypes[index] == Integer.class) {
                args[index] = IntegerConversionUtil.toInteger(args[index]);
                return true;

      }
      queue[index] = x;
      return index;
    }

    /**
     * Returns the index of minimum value between {@code index} and {@code index + len}, or {@code
     * -1} if {@code index} is greater than {@code size}.
     */
    int findMin(int index, int len) {
      if (index >= size) {
        return -1;
      }
      checkState(index > 0);
      int limit = min(index, size - len) + len;