// array.
        while (mid > -1 && this[mid] != '\n'.code.toByte()) {
          mid--
        }
        mid++

        // Now look for the ending '\n'.
        var end = 1
        while (this[mid + end] != '\n'.code.toByte()) {
          end++
        }
        val publicSuffixLength = mid + end - mid

            description,
            cls,
            explicitTestNames.get(0),
            cls.getName());
    return new AssertionError(message, e);
  }

  /**
   * Finds the classes not ending with a test suffix and not covered by an explicit test whose name
   * is {@code explicitTestNames}.
   */
  @VisibleForTesting
  List<Class<?>> findClassesToTest(

    public long getCurrentStartRecordNumber() {
        return currentStartRecordNumber;
    }

    /**
     * Gets the record number of the last record on the current page (1-based).
     *
     * @return the ending record number of the current page
     */
    public long getCurrentEndRecordNumber() {
        return currentEndRecordNumber;
    }

    /**
     * Gets a list of page numbers for pagination display.

    /** Flag indicating if there is a previous page */
    public boolean existPrevPage;

    /** Starting record number for current page */
    public String currentStartRecordNumber;

    /** Ending record number for current page */
    public String currentEndRecordNumber;

    /** List of page numbers for pagination */
    public List<String> pageNumberList;

    /** Search execution time in milliseconds */

        context.addHighlightedQuery(text);
        return QueryBuilders.wildcardQuery(urlField, queryString).boost(boost);
    }

    /**
     * Converts a term query ending with asterisk to a prefix query.
     *
     * @param fessConfig the Fess configuration
     * @param context the query context
     * @param termQuery the term query to convert

     * for (Lock lock : locks) {
     *   lock.unlock();
     * }
     *
     * If we only held the int[] stripes, translating it on the fly to L's, the original locks might
     * be garbage collected after locking them, ending up in a huge mess.
     */
    @SuppressWarnings("unchecked") // we carefully replaced all keys with their respective L's
    List<L> asStripes = (List<L>) result;
    return Collections.unmodifiableList(asStripes);
  }

        protected boolean prevPage;
        /**
         * The starting record number for the current page of search results.
         */
        protected long startRecordNumber;
        /**
         * The ending record number for the current page of search results.
         */
        protected long endRecordNumber;
        /**
         * The list of page numbers for pagination.
         */

    assertThat(letters).containsExactly("a", "b", "c", "").inOrder();
  }

  public void testCharacterSplitWithLeadingDelimiter() {
    String leading = ",a,b,c";
    Iterable<String> letters = COMMA_SPLITTER.split(leading);
    assertThat(letters).containsExactly("", "a", "b", "c").inOrder();
  }

  public void testCharacterSplitWithMultipleLetters() {
    Iterable<String> testCharacteringMotto =

   * returned, rather than round-trip encoding. Subclasses that override this method should behave
   * the same way.
   */
  public CharSource asCharSource(Charset charset) {
    return new AsCharSource(charset);
  }

  /**
   * Opens a new {@link InputStream} for reading from this source. This method returns a new,
   * independent stream each time it is called.
   *

      if (!seen.add(this)) {
        return null; // Already traversed this node.
      }
      ExampleStackTrace found = allowedPriorLocks.get(node);
      if (found != null) {
        return found; // Found a path ending at the node!
      }
      // Recurse the edges.
      for (Entry<LockGraphNode, ExampleStackTrace> entry : allowedPriorLocks.entrySet()) {
        LockGraphNode preAcquiredLock = entry.getKey();