if (advanceTo(nextEntry) || nextInChain()) {
            return true;
          }
        }
      }
      return false;
    }

    /**
     * Advances to the given entry. Returns {@code true} if the entry was valid, {@code false} if it
     * should be skipped.
     */
    boolean advanceTo(E entry) {
      try {
        K key = entry.getKey();

          if (advanceTo(nextEntry) || nextInChain()) {
            return true;
          }
        }
      }
      return false;
    }

    /**
     * Advances to the given entry. Returns true if the entry was valid, false if it should be
     * skipped.
     */
    boolean advanceTo(ReferenceEntry<K, V> entry) {
      try {

	<script type="text/javascript" src="${fe:url('/js/bootstrap.min.js')}"></script>
	<script type="text/javascript" src="${fe:url('/js/suggestor.js')}"></script>
	<script type="text/javascript" src="${fe:url('/js/advance.js')}"></script>
</body>

    }

    @Test
    void testAdvance() {
        ndrBuffer.advance(10);
        assertEquals(10, ndrBuffer.getIndex());
        assertEquals(10, ndrBuffer.getLength());

        ndrBuffer.advance(5);
        assertEquals(15, ndrBuffer.getIndex());
        assertEquals(15, ndrBuffer.getLength());

        // Advance past current length
        ndrBuffer.setLength(10);
        ndrBuffer.setIndex(10);

     */
    public void setLength(final int length) {
        deferred.length = length;
    }

    /**
     * Advances the buffer index by the specified number of bytes.
     *
     * @param n the number of bytes to advance
     */
    public void advance(final int n) {
        index += n;
        if (index - start > deferred.length) {
            deferred.length = index - start;
        }

     */
    public void setLength(final int length) {
        this.deferred.length = length;
    }

    /**
     * Advances the buffer index by the specified number of bytes.
     *
     * @param n the number of bytes to advance
     */
    public void advance(final int n) {
        this.index += n;
        if (this.index - this.start > this.deferred.length) {

            return false;
        }
    }

    /**
     * Advances to the next file entry in the enumeration.
     *
     * @param last whether this is the last attempt to advance
     * @return the next file entry, or null if no more entries
     * @throws CIFSException if an error occurs during enumeration
     */
    protected final FileEntry advance(final boolean last) throws CIFSException {

    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;

    /**