* It can then do something to that **request** or run any needed code.
* Then it passes the **request** to be processed by the rest of the application (by some *path operation*).
* It then takes the **response** generated by the application (by some *path operation*).
* It can do something to that **response** or run any needed code.
* Then it returns the **response**.

/// note | Technical Details

    // appendCodePoint(). The Punycode algorithm processes code points in increasing code-point
    // order, not in increasing index order.
    val codePoints = mutableListOf<Int>()

    // consume all code points before the last delimiter (if there is one)
    //  and copy them to output, fail on any non-basic code point
    val lastDelimiter = string.lastIndexOf('-', limit)
    if (lastDelimiter >= pos) {

              new BigDecimal(valueOf(p)).divide(new BigDecimal(valueOf(q)), 0, mode).intValue();
          assertEquals(p + "/" + q, force32(expected), IntMath.divide(p, q, mode));
          // Check the assertions we make in the javadoc.
          if (mode == DOWN) {
            assertEquals(p + "/" + q, p / q, IntMath.divide(p, q, mode));
          } else if (mode == FLOOR) {

 * This exception includes an HTTP status code to indicate the nature of the error.
 */
public class WebApiException extends FessSystemException {

    private static final long serialVersionUID = 1L;

    /**
     * The HTTP status code associated with this exception.
     */
    private final int statusCode;

    /**
     * Gets the HTTP status code associated with this exception.
     *

    if match is found, the toolchain instance is made available to other Maven plugins.</p>
    <p>With {@code jdk} toolchain, for example, instead of being stuck with the JDK used to run Maven, all plugins can use
    the same other JDK instance without hardcoding absolute paths into the {@code pom.xml}

  }

  @Override
  public @Nullable V value(N node) {
    return adjacentNodeValues.get(node);
  }

  @Override
  public void removePredecessor(N node) {
    @SuppressWarnings("unused")
    V unused = removeSuccessor(node);
  }

  @Override
  public @Nullable V removeSuccessor(N node) {
    return adjacentNodeValues.remove(node);
  }

  @Override

    }

    private static final Logger logger = Logger.getLogger(JarFileUtil.class);

    /**
     * Creates and returns a <code>JarFile</code> to read the specified JAR file.
     *
     * @param file the file path (must not be {@literal null})
     * @return a <code>JarFile</code> to read the specified JAR file
     */
    public static JarFile create(final String file) {
        assertArgumentNotNull("file", file);

import java.io.InputStream;

/**
 * An implementation of {@link DataInput} that uses little-endian byte ordering for reading {@code
 * short}, {@code int}, {@code float}, {@code double}, and {@code long} values.
 *
 * <p><b>Note:</b> This class intentionally violates the specification of its supertype {@code
 * DataInput}, which explicitly requires big-endian byte order.
 *
 * @author Chris Nokleberg
 * @author Keith Bottner

                Arguments.of(NbtException.ERR_NAM_SRVC, NbtException.SRV_ERR, "ERR_NAM_SRVC/Unknown error code: 2"),
                Arguments.of(NbtException.ERR_NAM_SRVC, NbtException.IMP_ERR, "ERR_NAM_SRVC/Unknown error code: 4"),
                Arguments.of(NbtException.ERR_NAM_SRVC, NbtException.RFS_ERR, "ERR_NAM_SRVC/Unknown error code: 5"),

     * The matching is based on tag name, and optionally ID, CSS class, or custom attributes.
     *
     * @param node the DOM node to check against this pruned tag configuration
     * @return true if the node matches this pruned tag configuration, false otherwise
     */
    public boolean matches(final Node node) {
        if (tag.equalsIgnoreCase(node.getNodeName())) {