columnNames  []string               // names of columns
	nameIndexMap map[string]int64       // name to column index
	current      [][]string             // current block of results to be returned
	recordsRead  int                    // number of records read in current slice
	input        chan *queueItem        // input for workers
	queue        chan *queueItem        // output from workers in order

    /**
     * Performs search for duplicate hosts based on form criteria.
     *
     * @param form the search form containing search criteria
     * @return HTML response for the duplicate host list page with search results
     */
    @Execute
    @Secured({ ROLE, ROLE + VIEW })
    public HtmlResponse search(final SearchForm form) {
        copyBeanToBean(form, duplicateHostPager, op -> op.exclude(Constants.PAGER_CONVERSION_RULE));

        assertNotNull(dfsRootEnum.info);
        assertEquals(200, dfsRootEnum.info.level);
        assertNotNull(dfsRootEnum.info.e);
    }

    @Test
    @DisplayName("getEntries should return consistent results on multiple calls")
    void testGetEntries_multipleCallsConsistency() throws Exception {
        // Setup test data
        netdfs.DfsEnumArray200 testArray = new netdfs.DfsEnumArray200();
        testArray.count = 2;

 *   <li>Finally, natural ordering is used (i.e. the result of {@code Bar.compareTo(Bar)} is
 *       returned)
 * </ol>
 *
 * <p>Alas, {@link #reverse} is a little different. As you read backwards through a chain and
 * encounter a call to {@code reverse}, continue working backwards until a result is determined, and
 * then reverse that result.
 *
 * <h3>Additional notes</h3>
 *

   * {@link Collections#sort(List, Comparator) Collections.sort(List, Comparator)} method), prior to
   * making this call. If it is not sorted, the results are undefined.
   *
   * <p>If there are elements in the list which compare as equal to the key, the choice of {@link
   * KeyPresentBehavior} decides which index is returned. If no elements compare as equal to the

        final AccessResult<String> accessResult = new TestAccessResult();

        final Map<String, Object> result = indexUpdater.ingest(accessResult, doc);

        assertNotNull(result);
        // Result should be the same as input doc when ingester is null or doesn't modify
        assertSame(doc, result);
    }

    // Test ingest with exception in ingester
    @Test
    public void test_ingest_withException() {

    if (planToReplace != null) {
      nextRouteToTry = planToReplace.route
      planToReplace.closeQuietly()
    }

    call.eventListener.connectionAcquired(call, result)
    result.connectionListener.connectionAcquired(result, call)
    return ReusePlan(result)
  }

  /** Returns a plan for the first attempt at [route]. This throws if no plan is possible. */
  @Throws(IOException::class)
  internal fun planConnectToRoute(

 *   <li>Finally, natural ordering is used (i.e. the result of {@code Bar.compareTo(Bar)} is
 *       returned)
 * </ol>
 *
 * <p>Alas, {@link #reverse} is a little different. As you read backwards through a chain and
 * encounter a call to {@code reverse}, continue working backwards until a result is determined, and
 * then reverse that result.
 *
 * <h3>Additional notes</h3>
 *

        });
    }

    /**
     * Searches key matches based on the form criteria.
     *
     * @param form the search form
     * @return HTML response for the search results
     */
    @Execute
    @Secured({ ROLE, ROLE + VIEW })
    public HtmlResponse search(final SearchForm form) {
        copyBeanToBean(form, keyMatchPager, op -> op.exclude(Constants.PAGER_CONVERSION_RULE));

    @Override
    public NavigableSet<E> descendingSet() {
      UnmodifiableNavigableSet<E> result = descendingSet;
      if (result == null) {
        result = descendingSet = new UnmodifiableNavigableSet<>(delegate.descendingSet());
        result.descendingSet = this;
      }
      return result;
    }

    @Override
    public Iterator<E> descendingIterator() {