}

  /**
   * Creates a {@code ObjectCountHashMap} instance, with a high enough "initial capacity" that it
   * <i>should</i> hold {@code expectedSize} elements without growth.
   *
   * @param expectedSize the number of elements you expect to add to the returned set
   * @return a new, empty {@code ObjectCountHashMap} with enough capacity to hold {@code
   *     expectedSize} elements without resizing

import org.jspecify.annotations.Nullable;

/**
 * An implementation of {@link GraphConnections} for directed graphs.
 *
 * @author James Sexton
 * @author Jens Nyman
 * @param <N> Node parameter type
 * @param <V> Value parameter type
 */
final class DirectedGraphConnections<N, V> implements GraphConnections<N, V> {
  /**
   * A wrapper class to indicate a node is both a predecessor and successor while still providing

 *
 * <p>The time complexity of all collection-returning accessors is O(1), since views are returned.
 *
 * @author James Sexton
 * @author Joshua O'Madadhain
 * @author Omar Darwish
 * @param <N> Node parameter type
 * @param <E> Edge parameter type
 */
class StandardNetwork<N, E> extends AbstractNetwork<N, E> {
  private final boolean isDirected;
  private final boolean allowsParallelEdges;

@GwtIncompatible
final class AppendableWriter extends Writer {
  private final Appendable target;
  private boolean closed;

  /**
   * Creates a new writer that appends everything it writes to {@code target}.
   *
   * @param target target to which to append output
   */
  AppendableWriter(Appendable target) {
    this.target = checkNotNull(target);
  }

  /*
   * Abstract methods from Writer
   */

  @Override

    private static final long serialVersionUID = -3176447530746274091L;

    /**
     * Creates a {@link NoSuchAlgorithmRuntimeException}.
     *
     * @param cause
     *            The cause of the exception
     */
    public NoSuchAlgorithmRuntimeException(final NoSuchAlgorithmException cause) {
        super("ECL0067", asArray(cause), cause);
    }

    private static final long serialVersionUID = -4610465906028959083L;

    /**
     * Creates a {@link ParserConfigurationRuntimeException}.
     *
     * @param cause the underlying exception
     */
    public ParserConfigurationRuntimeException(final ParserConfigurationException cause) {
        super("ECL0053", asArray(cause), cause);
    }

    private static final long serialVersionUID = 1L;

    /**
     * Creates a new {@link UnsupportedEncodingRuntimeException} with the specified cause.
     *
     * @param cause
     *            the cause
     */
    public UnsupportedEncodingRuntimeException(final UnsupportedEncodingException cause) {
        super("ECL0105", new Object[] { cause.getMessage() }, cause);
    }

    public boolean isValid(final String value, final ConstraintValidatorContext context) {
        return determineValid(value);
    }

    /**
     * Determines if the given value is a valid cron expression.
     * @param value the value to validate
     * @return true if valid, false otherwise
     */
    protected boolean determineValid(final String value) {
        if (StringUtil.isNotBlank(value) && !LaCronUtil.isCronExpValid(value)) {

    protected CommonPoolUtil() {
        // nothing
    }

    /**
     * Executes the given task in the common ForkJoinPool.
     *
     * @param task
     *            the task to execute
     */
    public static void execute(final Runnable task) {
        ForkJoinPool.commonPool().execute(() -> {
            final Thread currentThread = Thread.currentThread();

import java.util.concurrent.Future;
import org.jspecify.annotations.Nullable;

/**
 * A future whose value is derived from a collection of input futures.
 *
 * @param <InputT> the type of the individual inputs
 * @param <OutputT> the type of the output (i.e. this) future
 */
@GwtCompatible
@SuppressWarnings(
    // Whenever both tests are cheap and functional, it's faster to use &, | instead of &&, ||