}\n\n    // Static\n\n    _getContainerId() {\n      if (this._config.position == Position.TOP_RIGHT) {\n        return Selector.CONTAINER_TOP_RIGHT;\n      } else if (this._config.position == Position.TOP_LEFT) {\n        return Selector.CONTAINER_TOP_LEFT;\n      } else if (this._config.position == Position.BOTTOM_RIGHT) {\n        return Selector.CONTAINER_BOTTOM_RIGHT;\n      } else if (this._config.position == Position.BOTTOM_LEFT) {\n        return Selector.CONTAINER_BOTTOM_LEFT;\n      }\n...

        "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": {

  // The first `size` elements are non-null.
  @VisibleForTesting final transient @Nullable Object[] elements;
  private final transient int hashCode;
  // the same values as `elements` in hashed positions (plus nulls)
  @VisibleForTesting final transient @Nullable Object[] table;
  // 'and' with an int to get a valid table index.
  private final transient int mask;
  private final transient int size;

		if offsetBeginString[0] == '+' {
			return nil, fmt.Errorf("Byte position ('%s') must not have a sign", offsetBeginString)
		} else if offsetBegin, err = strconv.ParseInt(offsetBeginString, 10, 64); err != nil {
			return nil, fmt.Errorf("'%s' does not have a valid first byte position value", rangeString)
		} else if offsetBegin < 0 {
			return nil, fmt.Errorf("First byte position is negative ('%d')", offsetBegin)
		}
	}

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

                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) {