assertTrue(queryFieldConfig.facetFieldSet.contains("facet3"));
    }

    /**
     * Test that setting sort fields creates both array and Set.
     */
    @Test
    public void test_setSortFields_createsSet() {
        String[] fields = { "sort1", "sort2", "sort3" };
        queryFieldConfig.setSortFields(fields);

        // Verify array is set
        assertNotNull(queryFieldConfig.sortFields);

    public void test_getSortFields() {
        String[] fields = { "sort1", "sort2", "sort3" };
        queryFieldConfig.setSortFields(fields);

        String[] result = queryFieldConfig.getSortFields();
        assertSame(fields, result);
    }

    @Test
    public void test_setSortFields() {
        String[] fields = { "sort1", "sort2", "sort3" };
        queryFieldConfig.setSortFields(fields);

        List<SortBuilder<?>> sorts = queryContext.sortBuilders();
        assertNotNull(sorts);
        assertTrue(sorts.isEmpty());

        SortBuilder<?> sort = SortBuilders.fieldSort("field");
        queryContext.addSorts(sort);

        sorts = queryContext.sortBuilders();
        assertEquals(1, sorts.size());
        assertEquals(sort, sorts.get(0));
    }

      return "UnsignedLongs.lexicographicalComparator()";
    }
  }

  /**
   * Sorts the array, treating its elements as unsigned 64-bit integers.
   *
   * @since 23.1
   */
  public static void sort(long[] array) {
    checkNotNull(array);
    sort(array, 0, array.length);
  }

  /**
   * Sorts the array between {@code fromIndex} inclusive and {@code toIndex} exclusive, treating its

  private static byte flip(byte b) {
    return (byte) (b ^ 0x80);
  }

  /**
   * Sorts the array, treating its elements as unsigned bytes.
   *
   * @since 23.1
   */
  public static void sort(byte[] array) {
    checkNotNull(array);
    sort(array, 0, array.length);
  }

  /**
   * Sorts the array between {@code fromIndex} inclusive and {@code toIndex} exclusive, treating its

@GwtIncompatible
@J2ktIncompatible
@NullUnmarked
enum QuantilesAlgorithm {

  /**
   * Sorts the dataset, and picks values from it. When computing multiple quantiles, we sort once
   * and pick multiple values.
   */
  SORTING {

    @Override
    double singleQuantile(int index, int scale, double[] dataset) {
      Arrays.sort(dataset);
      return singleQuantileFromSorted(index, scale, dataset);
    }

    @Override

      return "UnsignedInts.lexicographicalComparator()";
    }
  }

  /**
   * Sorts the array, treating its elements as unsigned 32-bit integers.
   *
   * @since 23.1
   */
  public static void sort(int[] array) {
    checkNotNull(array);
    sort(array, 0, array.length);
  }

  /**
   * Sorts the array between {@code fromIndex} inclusive and {@code toIndex} exclusive, treating its

@GwtIncompatible
@J2ktIncompatible
@NullUnmarked
enum QuantilesAlgorithm {

  /**
   * Sorts the dataset, and picks values from it. When computing multiple quantiles, we sort once
   * and pick multiple values.
   */
  SORTING {

    @Override
    double singleQuantile(int index, int scale, double[] dataset) {
      Arrays.sort(dataset);
      return singleQuantileFromSorted(index, scale, dataset);
    }

    @Override

    }

    /**
     * Sorts both the current inputs and new inputs arrays in place.
     * This ensures consistent ordering for comparison and equality operations.
     */
    public void sort() {
        if (inputs != null) {
            Arrays.sort(inputs);
        }
        if (newInputs != null) {
            Arrays.sort(newInputs);
        }
    }

    /**

            method.setAccessible(true);

            org.opensearch.search.sort.SortBuilder<?> result = (org.opensearch.search.sort.SortBuilder<?>) method.invoke(queryHelper,
                    "timestamp", org.opensearch.search.sort.SortOrder.DESC);

            assertNotNull(result);