/**
 * Resolves conflicting artifacts by always selecting the farthest declaration. Farthest is defined as the
 * declaration that has the most transitive steps away from the project being built.
 *
 * @since 3.0
 */
@Named("farthest")
@Singleton
@Deprecated
public class FarthestConflictResolver implements ConflictResolver {
    // ConflictResolver methods -----------------------------------------------

#LimitMEMLOCK=infinity

# Shutdown delay in seconds, before process is tried to be killed with KILL (if configured)
TimeoutStopSec=20

[Install]
WantedBy=multi-user.target

          <key>-Dmaven.repo.local=/path/to/local/repo</key>
          <value>Override the local repository location on a per-build basis.</value>
        </cliOption>
      </cliOptions>
    </expression>
    <expression>
      <syntax>reactorProjects</syntax>
      <description>This is the current list of projects being built by
        Maven.</description>
    </expression>
  </expressions>

    /**
     * Gets the build summary for the specified project.
     *
     * @param project The project to get the build summary for, must not be {@code null}.
     * @return The build summary for the project or {@code null} if the project has not been built (yet).
     */
    BuildSummary getBuildSummary(MavenProject project);

    /**
     * Add the specified build summary.
     *

     * Associates {@code key} with {@code value} in the built map. Duplicate keys are not allowed,
     * and will cause {@link #build} to fail.
     */
    @CanIgnoreReturnValue
    public <T extends B> Builder<B> put(Class<T> key, T value) {
      mapBuilder.put(key, value);
      return this;
    }

    /**
     * Associates all of {@code map's} keys and values in the built map. Duplicate keys are not

   * place, or a different list.
   *
   * <p>If the order is non-deterministic, as with {@link java.util.HashSet}, this method can return
   * its input unmodified. Provided that the test suite is built without {@link
   * com.google.common.collect.testing.features.CollectionFeature#KNOWN_ORDER}, the tests will look
   * only at the returned contents without regard for order.
   */
  Iterable<E> order(List<E> insertionOrder);

/**
 * Resolves conflicting artifacts by always selecting the nearest declaration. Nearest is defined as the
 * declaration that has the least transitive steps away from the project being built.
 *
 * @since 3.0
 */
@Named("nearest")
@Singleton
@Deprecated
public class NearestConflictResolver implements ConflictResolver {
    // ConflictResolver methods -----------------------------------------------

 * user-defined properties.
 *
 * <p>A {@code Network} built by this class has the following default properties:
 *
 * <ul>
 *   <li>does not allow parallel edges
 *   <li>does not allow self-loops
 *   <li>orders {@link Network#nodes()} and {@link Network#edges()} in the order in which the
 *       elements were added (insertion order)
 * </ul>
 *
 * <p>{@code Network}s built by this class also guarantee that each collection-returning accessor

        // guaranteed to be >= newCapacity
      }
      return newCapacity;
    }

    Builder() {}

    /**
     * Adds {@code element} to the {@code ImmutableCollection} being built.
     *
     * <p>Note that each builder class covariantly returns its own type from this method.
     *
     * @param element the element to add
     * @return this {@code Builder} instance

import com.google.common.annotations.J2ktIncompatible;
import java.math.BigDecimal;
import java.math.RoundingMode;

/**
 * A class for arithmetic on {@link BigDecimal} that is not covered by its built-in methods.
 *
 * @author Louis Wasserman
 * @since 30.0
 */
@J2ktIncompatible
@GwtIncompatible
@ElementTypesAreNonnullByDefault
public class BigDecimalMath {
  private BigDecimalMath() {}

  /**