"search_analyzer": "standard_search_analyzer",
        "term_vector": "with_positions_offsets"
      },
      "content": {
        "type": "text",
        "analyzer": "standard_analyzer",
        "search_analyzer": "standard_search_analyzer",
        "term_vector": "with_positions_offsets"
      },
      "content_minhash": {
        "type": "keyword",
        "index": false
      },

        "search_analyzer": "standard_search_analyzer",
        "term_vector": "with_positions_offsets"
      },
      "content": {
        "type": "text",
        "analyzer": "standard_analyzer",
        "search_analyzer": "standard_search_analyzer",
        "term_vector": "with_positions_offsets"
      },
      "content_minhash": {
        "type": "keyword",
        "index": false
      },

        "search_analyzer": "standard_search_analyzer",
        "term_vector": "with_positions_offsets"
      },
      "content": {
        "type": "text",
        "analyzer": "standard_analyzer",
        "search_analyzer": "standard_search_analyzer",
        "term_vector": "with_positions_offsets",
        "copy_to": ["content_minhash_bits"]
      },
      "content_minhash": {

   * equivalent to RegularImmutableSet, save that instead of having a hash table containing the
   * elements directly and null for empty positions, we store indices of the keys in the hash table,
   * and ABSENT for empty positions.  We then look up the keys in alternatingKeysAndValues.
   *
   * (The index actually stored is the index of the key in alternatingKeysAndValues, which is

                int separatorLength = separator.length();

                positions:
                for (int p = start, last = toSplit.length() - separatorLength; p <= last; p++) {
                  for (int i = 0; i < separatorLength; i++) {
                    if (toSplit.charAt(i + p) != separator.charAt(i)) {
                      continue positions;
                    }
                  }
                  return p;

        }
      }
      return false;
    }

    /**
     * If more than this many consecutive positions are filled in a table of the specified size,
     * report probable hash flooding. ({@link #hashFloodingDetected} may also report hash flooding
     * if fewer consecutive positions are filled; see that method for details.)
     */
    static int maxRunBeforeFallback(int tableSize) {

                int separatorLength = separator.length();

                positions:
                for (int p = start, last = toSplit.length() - separatorLength; p <= last; p++) {
                  for (int i = 0; i < separatorLength; i++) {
                    if (toSplit.charAt(i + p) != separator.charAt(i)) {
                      continue positions;
                    }
                  }
                  return p;

  //   - 'set': `X + Y` performs a union where the array positions of all elements in `X` are preserved and
  //     non-intersecting elements in `Y` are appended, retaining their partial order.
  //   - 'map': `X + Y` performs a merge where the array positions of all keys in `X` are preserved but the values

   * printing space backward on the same printing line. (Applicable also to display devices.)
   *
   * @since 8.0
   */
  public static final byte BS = 8;

  /**
   * Horizontal Tabulation ('\t'): A format effector which controls the movement of the printing
   * position to the next in a series of predetermined positions along the printing line.

   * printing space backward on the same printing line. (Applicable also to display devices.)
   *
   * @since 8.0
   */
  public static final byte BS = 8;

  /**
   * Horizontal Tabulation ('\t'): A format effector which controls the movement of the printing
   * position to the next in a series of predetermined positions along the printing line.