} else {
      int k = 20;
      return BigInteger.valueOf(LongMath.factorial(k)).multiply(oldSlowFactorial(k, n));
    }
  }

  /** Returns the product of {@code n1} exclusive through {@code n2} inclusive. */
  @SuppressWarnings("UseCorrectAssertInTests") // TODO(b/345814817): Remove or convert assertion.
  private static BigInteger oldSlowFactorial(int n1, int n2) {
    assert n1 <= n2;

     * Creates a DCERPC pipe handle for named pipe communication
     * @param url the DCERPC URL specifying the endpoint
     * @param tc the CIFS context for connection configuration
     * @param unshared whether to use an exclusive connection
     * @throws DcerpcException if DCERPC initialization fails
     * @throws MalformedURLException if the URL is malformed
     */

    /**
     * Flag indicating a shared lock that allows concurrent read access.
     */
    public static final int SMB2_LOCKFLAG_SHARED_LOCK = 0x1;

    /**
     * Flag indicating an exclusive lock that prevents any other access.
     */
    public static final int SMB2_LOCKFLAG_EXCLUSIVE_LOCK = 0x2;

    /**
     * Flag indicating an unlock operation to release a previously held lock.
     */

            SmbTransport exclusive = transportPool.getSmbTransport(context, address, DEFAULT_PORT, true);
            SmbTransport signed = transportPool.getSmbTransport(context, address, DEFAULT_PORT, false, true);

            // Then
            assertEquals(sharedTransport, shared);
            assertEquals(exclusiveTransport, exclusive);
            assertEquals(signedTransport, signed);

 * A {@code PathType} can identify the Java class-path, the Java module path,
 * or another kind of path for another programming language for example.
 * Path types are often exclusive. For example, a dependency should not be
 * both on the Java class path and on the Java module path.
 *
 * @see org.apache.maven.api.services.DependencyResolverResult#getDispatchedPaths()
 *
 * @since 4.0.0
 */

    checkNotNull(array);
    sortDescending(array, 0, array.length);
  }

  /**
   * Sorts the elements of {@code array} between {@code fromIndex} inclusive and {@code toIndex}
   * exclusive in descending order.
   *
   * @since 23.1
   */
  public static void sortDescending(char[] array, int fromIndex, int toIndex) {
    checkNotNull(array);

    checkNotNull(array);
    sortDescending(array, 0, array.length);
  }

  /**
   * Sorts the elements of {@code array} between {@code fromIndex} inclusive and {@code toIndex}
   * exclusive in descending order.
   *
   * @since 23.1
   */
  public static void sortDescending(short[] array, int fromIndex, int toIndex) {
    checkNotNull(array);

    checkNotNull(array);
    sortDescending(array, 0, array.length);
  }

  /**
   * Sorts the elements of {@code array} between {@code fromIndex} inclusive and {@code toIndex}
   * exclusive in descending order.
   *
   * @since 23.1
   */
  public static void sortDescending(short[] array, int fromIndex, int toIndex) {
    checkNotNull(array);

      subsequently incorporated within the Work.

   2. Grant of Copyright License. Subject to the terms and conditions of
      this License, each Contributor hereby grants to You a perpetual,
      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
      copyright license to reproduce, prepare Derivative Works of,
      publicly display, publicly perform, sublicense, and distribute the

      subsequently incorporated within the Work.

   2. Grant of Copyright License. Subject to the terms and conditions of
      this License, each Contributor hereby grants to You a perpetual,
      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
      copyright license to reproduce, prepare Derivative Works of,
      publicly display, publicly perform, sublicense, and distribute the