if (array[i] > max) {
        max = array[i];
      }
    }
    return max;
  }

  /**
   * Returns the value nearest to {@code value} which is within the closed range {@code [min..max]}.
   *
   * <p>If {@code value} is within the range {@code [min..max]}, {@code value} is returned
   * unchanged. If {@code value} is less than {@code min}, {@code min} is returned, and if {@code

            // Job should handle exception gracefully
            assertNotNull(result);
        } catch (Exception e) {
            // Exception is expected to be caught within the job
            assertTrue(e.getMessage().contains("Connection failed"));
        }
    }

    // Helper method to create mock ClusterHealthResponse

        </field>
      </fields>
    </class>

    <class java.clone="deep">
      <name>Plugin</name>
      <version>1.0.0+</version>
      <description>Mapping information for a single plugin within this group.</description>
      <comment>NOTE: plugin version is _NOT_ included here, since it is resolved using a separate algorithm in plugins' artifact.</comment>
      <fields>
        <field>
          <name>name</name>

immediate and non-disruptive to the applications. Each group of servers in the command-line is called a pool. There are 2 server pools in this example. New objects are placed in server pools in proportion to the amount of free space in each pool. Within each pool, the location of the erasure-set of drives is determined based on a deterministic hashing algorithm.

> **NOTE:** **Each pool you add must have the same erasure coding parity configuration as the original pool, so the same data redundancy...

            this.pageRangeSize = pageRangeSize;
        }

        /**
         * Creates a list of page numbers for navigation.
         *
         * @return a list of page numbers within the page range
         */
        public List<Integer> createPageNumberList() {
            int startPage = currentPageNumber - pageRangeSize;
            if (startPage < 1) {
                startPage = 1;

   * higher value than you need can waste space and time, and a significantly lower value can lead
   * to thread contention. But overestimates and underestimates within an order of magnitude do not
   * usually have much noticeable impact. A value of one permits only one thread to modify the map
   * at a time, but since read operations can proceed concurrently, this still yields higher

	Recursive bool

	// ReportNotFound will return errFileNotFound if all disks reports the BaseDir cannot be found.
	ReportNotFound bool

	// FilterPrefix will only return results with given prefix within folder.
	// Should never contain a slash.
	FilterPrefix string

	// ForwardTo will forward to the given object path.
	ForwardTo string

	// Limit the number of returned objects if > 0.
	Limit int

    knownTypes.put(mediaType, mediaType);
    return mediaType;
  }

  /*
   * The following constants are grouped by their type and ordered alphabetically by the constant
   * name within that type. The constant name should be a sensible identifier that is closest to the
   * "common name" of the media. This is often, but not necessarily the same as the subtype.
   *

        assertTrue(result instanceof BoolQueryBuilder);
        BoolQueryBuilder boolQueryBuilder = (BoolQueryBuilder) result;
        // BoostQueryCommand doesn't apply boost to BooleanQuery, it's applied within the clauses
        assertEquals(1.0f, boolQueryBuilder.boost());
    }

    @Test
    public void test_execute_withPrefixQuery() {
        // Test executing BoostQuery with a PrefixQuery inside

import org.lastaflute.job.LaScheduledJob;
import org.lastaflute.job.key.LaJobUnique;
import org.lastaflute.job.subsidiary.CronParamsSupplier;

/**
 * Helper class for managing scheduled jobs within the Fess system.
 * This class provides functionality for registering, unregistering, and monitoring scheduled jobs.
 */
public class JobHelper {
    /** Logger instance for this class */