abstract ValueGraph<N, V> delegate();

  @Override
  public Set<N> nodes() {
    return delegate().nodes();
  }

  /**
   * Defer to {@link AbstractValueGraph#edges()} (based on {@link #successors(Object)}) for full
   * edges() implementation.
   */
  @Override
  protected long edgeCount() {
    return delegate().edges().size();
  }

  @Override

 * array contains information about special ASCII characters such as {@code \\t} and {@code \\n}
 * while {@link #escapeUnsafe} is overridden to handle general escaping of the form {@code \\uxxxx}.
 *
 * <p>The size of the data structure used by {@link ArrayBasedCharEscaper} is proportional to the
 * highest valued character that requires escaping. For example a replacement map containing the

/**
 * Utility class for {@link Locale}.
 *
 * @author higa
 */
public abstract class LocaleUtil {

    /**
     * Do not instantiate.
     */
    protected LocaleUtil() {
    }

    /**
     * Returns a {@link Locale}.
     *
     * @param localeStr
     *            A string representing the locale
     * @return {@link Locale}
     */

/**
 * A high-performance utility class for encrypting and decrypting data using cached {@link Cipher} instances.
 * <p>
 * This class provides efficient encryption/decryption by pooling and reusing cipher instances,
 * reducing the overhead of repeated cipher initialization. It supports both string-based keys
 * and {@link Key} objects, with configurable algorithms and character encodings.
 * </p>
 * <p>

                                            <c:if test="${pager.existPrePage}">
                                                <li class="page-item"><la:link
                                                        styleClass="page-link"
                                                        href="list/${pager.currentPageNumber - 1}?dictId=${f:u(dictId)}">
                                                    <la:message key="labels.prev_page"/>

        }
        phase.links().forEach(link -> {
            if (link.pointer().type() == Lifecycle.Pointer.Type.PROJECT) {
                if (link.kind() == Lifecycle.Link.Kind.AFTER) {
                    graph.addEdge(graph.addVertex(link.pointer().phase()), ep0);
                } else {
                    graph.addEdge(ep3, graph.addVertex(BEFORE + link.pointer().phase()));
                }
            }

   * Object#equals} and {@link Object#hashCode}, and its construction requires a parameter of {@code
   * type}, the distinct values of {@code type} can be passed as parameters to create {@code Foo}
   * instances that are unequal.
   *
   * <p>Calling {@code setDistinctValues(type, v1, v2)} also sets the default value for {@code type}
   * that's used for {@link #testNulls}.
   *

 */
package org.codelibs.core.exception;

import static org.codelibs.core.collection.ArrayUtil.asArray;

import org.codelibs.core.lang.MethodUtil;

/**
 * Exception that wraps {@link NoSuchMethodException}.
 *
 * @author higa
 */
public class NoSuchMethodRuntimeException extends ClRuntimeException {

    private static final long serialVersionUID = -5673845060079098617L;

    /**

  /**
   * The input futures. After {@link #init}, this field is read only by {@link #afterDone()} (to
   * propagate cancellation) and {@link #toString()}. To access the futures' <i>values</i>, {@code
   * AggregateFuture} attaches listeners that hold references to one or more inputs. And in the case
   * of {@link CombinedFuture}, the user-supplied callback usually has its own references to inputs.
   */

 */
package org.codelibs.core.collection;

import java.util.Map;

/**
 * {@link ArrayMap} that is case-insensitive for keys.
 *
 * @author higa
 * @param <V> the type of values
 */
public class CaseInsensitiveMap<V> extends ArrayMap<String, V> {

    private static final long serialVersionUID = 1L;

    /**
     * Creates a {@link CaseInsensitiveMap}.
     */
    public CaseInsensitiveMap() {
    }

    /**