*
   * <p>Because the set may be ascending or descending, this test must derive the relative order of
   * these extreme values rather than relying on their regular sort ordering.
   */
  final TestSuite createSubsetSuite(
      FeatureSpecificTestSuiteBuilder<?, ? extends OneSizeTestContainerGenerator<Collection<E>, E>>
          parentBuilder,
      Bound from,
      Bound to) {

    @Required
    @Size(max = 10000)
    public String urlExpr;

    /** Boost expression to apply to matching documents */
    @Required
    @Size(max = 10000)
    public String boostExpr;

    /** Sort order for displaying boost configurations */
    @Required
    @Min(value = 0)
    @Max(value = 2147483647)
    @ValidateTypeFailure
    public Integer sortOrder;

    /** User who created this configuration */

    @Size(max = 10000)
    public String content;

    /**
     * The virtual host for which this related content applies.
     */
    @Size(max = 1000)
    public String virtualHost;

    /**
     * The sort order for this related content (0-2147483647).
     */
    @Min(value = 0)
    @Max(value = 2147483647)
    @ValidateTypeFailure
    public Integer sortOrder;

    /**

        assertEquals("TestAgent", fessConfig.getUserAgentName());
    }

    private void assertArrays(final String[] expected, final String[] actual) {
        Arrays.sort(expected);
        Arrays.sort(actual);
        assertEquals(String.join(",", expected), String.join(",", actual));
    }

    /** The regex pattern. */
    public String regex;

    /** The replacement string. */
    public String replacement;

    /** The process type. */
    public String processType;

    /** The sort order. */
    public String sortOrder;

    /** The creator. */
    public String createdBy;

    /** The creation time. */
    public String createdTime;

    /** The version number. */

 * href="https://en.wikipedia.org/wiki/Graph_(discrete_mathematics)">graph</a>-structured data.
 *
 * <p>This interface is meant to be used as the type of a parameter to graph algorithms (such as
 * topological sort) that only need a way of accessing the predecessors of a node in a graph.
 *
 * <h3>Usage</h3>
 *
 * Given an algorithm, for example:
 *
 * {@snippet :

		</la:select>
	</fieldset>
	<fieldset class="mb-3">
		<legend><la:message key="labels.index_sort" /></legend>
		<label for="sortSearchOption"><la:message key="labels.index_sort" /></label>
		<la:select property="sort" styleId="sortSearchOption"
			styleClass="form-control">
			<option value="">
				<la:message key="labels.search_result_select_sort" />
			</option>
			<la:option value="score.desc">

		</la:select>
	</fieldset>
	<fieldset class="mb-3">
		<legend><la:message key="labels.index_sort" /></legend>
		<label for="sortSearchOption"><la:message key="labels.index_sort" /></label>
		<la:select property="sort" styleId="sortSearchOption"
			styleClass="form-control">
			<option value="">
				<la:message key="labels.search_result_select_sort" />
			</option>
			<la:option value="score.desc">

import org.opensearch.index.query.QueryBuilder;
import org.opensearch.index.query.TermQueryBuilder;
import org.opensearch.index.query.WildcardQueryBuilder;
import org.opensearch.search.sort.SortBuilder;

public class TermQueryCommandTest extends QueryTestBase {
    private static final Logger logger = LogManager.getLogger(TermQueryCommandTest.class);

    private TermQueryCommand queryCommand;

    /**
     * Virtual host names for this web configuration.
     */
    @CustomSize(maxKey = "form.admin.max.input.size")
    public String virtualHosts;

    /**
     * The sort order for this web configuration.
     */
    @Required
    @Min(value = 0)
    @Max(value = 2147483647)
    @ValidateTypeFailure
    public Integer sortOrder;

    /**