int skipped = advance(iterator, position);
    if (!iterator.hasNext()) {
      throw new IndexOutOfBoundsException(
          "position ("
              + position
              + ") must be less than the number of elements that remained ("
              + skipped
              + ")");
    }
    return iterator.next();
  }

  /**

            when(mockTree.send(any(Request.class), any(RequestParam.class))).thenAnswer(inv -> (CommonServerMessageBlockResponse) smb2Resp);

            byte[] buf = new byte[16];

            // Skip advances internal file pointer; next read should use this offset
            in.skip(2);

            // Act
            int n = in.readDirect(buf, 0, 5);

            // Assert

public class SearchForm extends SearchRequestParams {

    /**
     * Map of additional search fields with their values.
     */
    public Map<String, String[]> fields = new HashMap<>();

    /**
     * Map of advanced search conditions.
     */
    public Map<String, String[]> as = new HashMap<>();

    /**
     * The main search query string.
     */
    @Size(max = 1000)
    public String q;

    /**

  }

  /**
   * Inserts element at current put position, advances, and signals. Call only when occupying
   * monitor.
   */
  private void insert(E x) {
    items[putIndex] = x;
    putIndex = inc(putIndex);
    ++count;
  }

  /**
   * Extracts element at current take position, advances, and signals. Call only when occupying
   * monitor.
   */
  private E extract() {

    Object four = new Object();
    Object five = new Object();

    map.put(one, two);
    ticker.advance(1);
    map.put(two, three);
    ticker.advance(1);
    map.put(three, four);
    assertThat(listener.isEmpty()).isTrue();
    ticker.advance(1);
    map.put(four, five);
    assertNotified(listener, one, two, RemovalCause.EXPIRED);

    Object four = new Object();
    Object five = new Object();

    map.put(one, two);
    ticker.advance(1);
    map.put(two, three);
    ticker.advance(1);
    map.put(three, four);
    assertThat(listener.isEmpty()).isTrue();
    ticker.advance(1);
    map.put(four, five);
    assertNotified(listener, one, two, RemovalCause.EXPIRED);

  public void testElapsed_notRunning() {
    ticker.advance(1);
    stopwatch.start();
    ticker.advance(4);
    stopwatch.stop();
    ticker.advance(9);
    assertEquals(4, stopwatch.elapsed(NANOSECONDS));
  }

  public void testElapsed_multipleSegments() {
    stopwatch.start();
    ticker.advance(9);
    stopwatch.stop();

    ticker.advance(16);

    stopwatch.start();

    // 4 expires
    ticker.advance(1, MILLISECONDS);
    assertThat(keySet).containsExactly(6, 8, 0, 1, 2, 5, 7, 9);
    ticker.advance(1, MILLISECONDS);
    assertThat(keySet).containsExactly(6, 8, 0, 1, 2, 5, 7, 9);

    // 6 expires
    ticker.advance(1, MILLISECONDS);
    assertThat(keySet).containsExactly(8, 0, 1, 2, 5, 7, 9);
    ticker.advance(1, MILLISECONDS);

    cache.put(0, 10);
    cache.put(2, 30);

    fakeTicker.advance(999, MILLISECONDS);
    assertThat(cache.getIfPresent(2)).isEqualTo(30);
    fakeTicker.advance(1, MILLISECONDS);
    assertThat(cache.getIfPresent(2)).isEqualTo(30);
    fakeTicker.advance(1000, MILLISECONDS);
    assertThat(cache.getIfPresent(0)).isNull();
  }

  @Test

      ticker.advance(1, MILLISECONDS);
    }

    assertThat(cache.getUnchecked(0)).isEqualTo(0);
    assertThat(cache.getUnchecked(1)).isEqualTo(1);
    assertThat(cache.getUnchecked(2)).isEqualTo(2);
    assertThat(loader.getLoadCount()).isEqualTo(expectedLoads);
    assertThat(loader.getReloadCount()).isEqualTo(expectedReloads);

    // refresh 0
    ticker.advance(1, MILLISECONDS);