* `description`: The description of your API, this can include markdown and will be shown in the docs.
* `routes`: A list of routes, these are each of the registered *path operations*. They are taken from `app.routes`.

/// info

The parameter `summary` is available in OpenAPI 3.1.0 and above, supported by FastAPI 0.99.0 and above.

///

## Overriding the defaults { #overriding-the-defaults }

    /**
     * Compile, runtime and test.
     */
    COMPILE("compile", true),

    /**
     * Runtime and test.
     */
    RUNTIME("runtime", true),

    /**
     * Provided.
     */
    PROVIDED("provided", false),

    /**
     * Test compile only.
     */
    TEST_ONLY("test-only", false),

    /**
     * Test compile and test runtime.
     */
    TEST("test", false),

     * Default constructor for DocList.
     * Creates a new empty document list with zero content size and processing time.
     */
    public DocList() {
        super();
    }

    /**
     * Clears all documents from the list and resets metrics.
     * Removes all documents and resets content size and processing time to zero.
     */
    @Override
    public void clear() {
        super.clear();
        contentSize = 0;

 * governing permissions and limitations under the License.
 */
package org.codelibs.fess.ds.callback;

import java.util.Map;

import org.codelibs.fess.entity.DataStoreParams;

/**
 * Callback interface for handling index update operations during data store processing.
 * This interface provides methods for storing documents, tracking processing metrics,
 * and committing changes to the search index.
 */

    // Every node is, at a minimum, reachable from itself. Since the resulting transitive closure
    // will have no isolated nodes, we can skip adding nodes explicitly and let putEdge() do it.

    if (graph.isDirected()) {
      // Note: works for both directed and undirected graphs, but we only use in the directed case.
      for (N node : graph.nodes()) {
        for (N reachableNode : reachableNodes(graph, node)) {

    // Every node is, at a minimum, reachable from itself. Since the resulting transitive closure
    // will have no isolated nodes, we can skip adding nodes explicitly and let putEdge() do it.

    if (graph.isDirected()) {
      // Note: works for both directed and undirected graphs, but we only use in the directed case.
      for (N node : graph.nodes()) {
        for (N reachableNode : reachableNodes(graph, node)) {

                break;
            }
        }
        assertTrue(foundTestMethod);
    }

    public void test_throwAndCatch() {
        // Test throwing and catching the exception
        String message = "Throw and catch test";

        try {
            throw new SearchEngineClientException(message);
        } catch (SearchEngineClientException e) {
            assertEquals(message, e.getMessage());

    val b1: Int
      get() {
        val b3bit8 = mappedTo[0] and 0x80 != 0
        return if (b3bit8) 123 else 122
      }

    val b2: Int
      get() = mappedTo[0] and 0x7f
  }

  data class Inline2(
    override val rangeStart: Int,
    private val mappedTo: ByteString,
  ) : MappedRange {
    val b1: Int
      get() {
        val b2bit8 = mappedTo[0] and 0x80 != 0
        val b3bit8 = mappedTo[1] and 0x80 != 0

Templates, while typically come with a specific setup, are designed to be flexible and customizable. This allows you to modify and adapt them to your project's requirements, making them an excellent starting point. 🏁

You can use this template to get started, as it includes a lot of the initial set up, security, database and some API endpoints already done for you.

 * governing permissions and limitations under the License.
 */
package org.codelibs.fess.exception;

import org.codelibs.fess.unit.UnitFessTestCase;

public class WebApiExceptionTest extends UnitFessTestCase {

    public void test_constructor_withStatusCodeAndMessage() {
        // Test constructor with status code and message
        int statusCode = 404;