long r = 0;
    List<Facade<Integer>> list = new ArrayList<>(reps);
    for (int i = 0; i < reps; i++) {
      Facade<Integer> localFuture = impl.newFacade();
      list.add(localFuture);
      localFuture.setException(exception);
    }
    for (int i = 0; i < reps; i++) {
      Facade<Integer> facade = list.get(i);
      try {
        facade.get();
        r++;

                    type: integer
                    format: int64
                    example: 0
                  page_size:
                    type: integer
                    example: 20
                  page_number:
                    type: integer
                    example: 1
                  record_count:
                    type: integer
                    format: int64

        assertEquals(1, result.getRelevantIndexes().size());
        assertEquals(Integer.valueOf(1), result.getRelevantIndexes().get(0));
    }

    @Test
    public void test_withRelevantDocs_emptyLists() {
        List<String> docIds = Collections.emptyList();
        List<Integer> indexes = Collections.emptyList();

import org.jspecify.annotations.NullMarked;

/**
 * Create integer sets for testing collections that are sorted by natural ordering.
 *
 * @author Chris Povirk
 * @author Jared Levy
 */
@GwtCompatible
@NullMarked
public abstract class TestIntegerSortedSetGenerator extends TestIntegerSetGenerator {
  @Override
  protected abstract SortedSet<Integer> create(Integer[] elements);

  /** Sorts the elements by their natural ordering. */

    super(true, true, true, true, true);
  }

  @Override
  protected SortedMap<String, Integer> makeEmptyMap() {
    return new SimpleForwardingSortedMap<>(
        new TreeMap<String, Integer>(Ordering.<String>natural().nullsFirst()));
  }

  @Override
  protected SortedMap<String, Integer> makePopulatedMap() {
    SortedMap<String, Integer> sortedMap = makeEmptyMap();
    sortedMap.put("one", 1);
    sortedMap.put("two", 2);

    assertEquals(
        ContiguousSet.closed(Integer.MIN_VALUE, Integer.MAX_VALUE),
        ContiguousSet.create(Range.atLeast(Integer.MIN_VALUE), integers()));
    assertEquals(
        ContiguousSet.closed(Integer.MIN_VALUE, Integer.MAX_VALUE),
        ContiguousSet.create(Range.atMost(Integer.MAX_VALUE), integers()));
  }

  @GwtIncompatible // SerializableTester

 */

package jcifs.dcerpc.ndr;

/**
 * NDR representation of a short integer (2-byte signed integer).
 */
public class NdrShort extends NdrObject {

    /**
     * The short integer value.
     */
    public int value;

    /**
     * Constructs an NdrShort with the specified value.
     *
     * @param value the short integer value
     */
    public NdrShort(final int value) {

 */

package jcifs.smb1.dcerpc.ndr;

/**
 * NDR representation of a short integer (2-byte signed integer).
 */
public class NdrShort extends NdrObject {

    /**
     * The short integer value.
     */
    public int value;

    /**
     * Constructs an NdrShort with the specified value.
     *
     * @param value the short integer value
     */
    public NdrShort(final int value) {

        return this;
    }

    public void setSortOrder_Equal(Integer sortOrder) {
        setSortOrder_Term(sortOrder, null);
    }

    public void setSortOrder_Equal(Integer sortOrder, ConditionOptionCall<TermQueryBuilder> opLambda) {
        setSortOrder_Term(sortOrder, opLambda);
    }

    public void setSortOrder_Term(Integer sortOrder) {
        setSortOrder_Term(sortOrder, null);
    }

                return wrap((Table<?, ?, ?>) delegate);
              }
            });
  }

  public void testEquals() {
    Table<Integer, Integer, String> table1 = ImmutableTable.of(1, 1, "one");
    Table<Integer, Integer, String> table2 = ImmutableTable.of(2, 2, "two");
    new EqualsTester()
        .addEqualityGroup(table1, wrap(table1), wrap(table1))
        .addEqualityGroup(table2, wrap(table2))