* i, i + target.length)} contains exactly the same elements as {@code target}.
   *
   * @param array the array to search for the sequence {@code target}
   * @param target the array to search for as a sub-sequence of {@code array}
   */
  public static int indexOf(short[] array, short[] target) {
    checkNotNull(array, "array");
    checkNotNull(target, "target");

   * amount has been skipped. Does not close the reader.
   *
   * @param reader the reader to read from
   * @param n the number of characters to skip
   * @throws EOFException if this stream reaches the end before skipping all the characters
   * @throws IOException if an I/O error occurs
   */
  public static void skipFully(Reader reader, long n) throws IOException {
    checkNotNull(reader);
    while (n > 0) {

 * for document data. This class wraps an existing map and provides custom behavior
 * for the entrySet method to ensure language fields appear first in iteration order.
 * Used throughout the Fess search system for document data manipulation.
 *
 */
public class DocMap implements Map<String, Object> {

    /** The key used for language field identification */
    private static final String LANG_KEY = "lang";

        }
    }

    /**
     * Extracts the token value from the content using the given pattern.
     * @param tokenPattern The regex pattern.
     * @param content The content to search.
     * @return The extracted token value.
     */
    protected String getTokenValue(final String tokenPattern, final String content) {
        final Matcher matcher = Pattern.compile(tokenPattern).matcher(content);

labels.sidebar.placeholder_search=搜尋...
labels.menu_plugin=外掛程式
labels.menu_storage=儲存
labels.sidebar.menu=選單
labels.footer.copyright=&copy;2024 <a href="https://github.com/codelibs">CodeLibs專案</a>.
labels.search=搜尋
labels.similar_doc_result_status=顯示相似結果。
labels.search_result_status=<b>{0}</b> 的搜尋結果<span class="br-phone"></span> <b>{1}</b> 條中的 <b>{2}</b> - <b>{3}</b> 條

  static double getMinValue(double[] array, int from) {
    // This is basically a copy of com.google.math.Rank#getMinValue, with a small change in the
    // method signature: we always search to the end of the array.
    int min = from;
    for (int i = from + 1; i < array.length; i++) {
      if (array[min] > array[i]) {
        min = i;
      }
    }
    return array[min];
  }

    private int pageSize;

    /** Current page number being displayed. */
    private int currentPageNumber;

    /** Related content ID for filtering. */
    public String id;

    /** Search term for filtering related content. */
    public String term;

    /** Content text for filtering related content. */
    public String content;

    /** User who created the related content. */

    /** The role service for managing role settings. */
    @Resource
    private RoleService roleService;

    /**
     * Retrieves role settings with pagination.
     *
     * @param body the search parameters for filtering and pagination
     * @return JSON response containing role settings list
     */
    // GET /api/admin/role/settings
    // PUT /api/admin/role/settings
    @Execute

   *
   * @param in the input stream to read from.
   * @param b the buffer into which the data is read.
   * @throws EOFException if this stream reaches the end before reading all the bytes.
   * @throws IOException if an I/O error occurs.
   */
  public static void readFully(InputStream in, byte[] b) throws IOException {
    readFully(in, b, 0, b.length);
  }

   * with the corresponding value in the table. Changes to the returned map will update the
   * underlying table, and vice versa.
   *
   * @param columnKey key of column to search for in the table
   * @return the corresponding map from row keys to values
   */
  @Override
  public Map<R, @Nullable V> column(C columnKey) {
    checkNotNull(columnKey);