@Override
      public Set<N> adjacentNodes(N node) {
        return AbstractValueGraph.this.adjacentNodes(node);
      }

      @Override
      public Set<N> predecessors(N node) {
        return AbstractValueGraph.this.predecessors(node);
      }

      @Override
      public Set<N> successors(N node) {
        return AbstractValueGraph.this.successors(node);
      }

      @Override

 *
 * <p>This class does <i>not</i> forward the {@code hashCode} and {@code equals} methods through to
 * the backing object, but relies on {@code Object}'s implementation. This is necessary to preserve
 * the symmetry of {@code equals}. Custom definitions of equality are usually based on an interface,
 * such as {@code Set} or {@code List}, so that the implementation of {@code equals} can cast the

     *
     * @param method
     *            The method. Cannot be {@literal null}
     * @return <code>static</code> if the method is static
     */
    public static boolean isStatic(final Method method) {
        assertArgumentNotNull("method", method);

        return Modifier.isStatic(method.getModifiers());
    }

    /**
     * Returns whether the method is <code>final</code>.
     *

public class InvokerException extends MavenException {
    /**
     * Constructs a new {@code InvokerException} with the specified detail message.
     *
     * @param message the detail message explaining the cause of the exception
     */
    public InvokerException(@Nullable String message) {
        super(message);
    }

    /**
     * Constructs a new {@code InvokerException} with the specified detail message and cause.
     *

 *     <li><code>alpha</code> or <code>a</code></li>
 *     <li><code>beta</code> or <code>b</code></li>
 *     <li><code>milestone</code> or <code>m</code></li>
 *     <li><code>rc</code> or <code>cr</code></li>
 *     <li><code>snapshot</code></li>
 *     <li><code>ga</code> or <code>final</code></li>
 *     <li><code>sp</code></li>
 *     </ol>

  public N removeOutEdge(E edge) {
    N node = super.removeOutEdge(edge);
    Multiset<N> adjacentNodes = getReference(adjacentNodesReference);
    if (adjacentNodes != null) {
      checkState(adjacentNodes.remove(node));
    }
    return node;
  }

  @Override
  public void addInEdge(E edge, N node, boolean isSelfLoop) {
    if (!isSelfLoop) {
      addOutEdge(edge, node);
    }
  }

  @Override

    // 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) {

                .get(stream -> stream.map(String::trim).filter(StringUtil::isNotEmpty).toArray(n -> new String[n]));
        nodeManager = new NodeManager(hosts, node -> request(new CurlRequest(Method.GET, node.getUrl("/"))));
        nodeManager.setHeartbeatInterval(fessConfig.getFesenHeartbeatInterval());
    }

    /**
     * Creates a GET request for the specified path.

        return flags;
    }

    /**
     * Gets the new node address.
     *
     * @return the new node address
     */
    public String getNewNodeAddress() {
        return newNodeAddress;
    }

    /**
     * Sets the new node address.
     *
     * @param newNodeAddress the new node address
     */
    public void setNewNodeAddress(String newNodeAddress) {

* 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