American English was chosen for the following reasons:

* **Current predominance**: The majority of existing Gradle code and documentation already uses American English
* **Industry standard**: Most widely used programming languages, frameworks, and tools (Java, Kotlin, JavaScript, etc.) use American English in their APIs and documentation
* **Consistency with dependencies**: Gradle's ecosystem and dependencies predominantly use American English

### French instructions about technical terms

Do not try to translate everything. In particular, keep common programming terms (e.g. `framework`, `endpoint`, `plug-in`, `payload`).

Keep class names, function names, modules, file names, and CLI commands unchanged.

### List of English terms and their preferred French translations

    double mean = values.next().doubleValue();
    while (values.hasNext()) {
      double value = values.next().doubleValue();
      count++;
      if (isFinite(value) && isFinite(mean)) {
        // Art of Computer Programming vol. 2, Knuth, 4.2.2, (15)
        mean += (value - mean) / count;
      } else {
        mean = calculateNewMeanNonFinite(mean, value);
      }
    }
    return mean;
  }

  /**

    long count = 1;
    double mean = checkFinite(values[0]);
    for (int index = 1; index < values.length; ++index) {
      checkFinite(values[index]);
      count++;
      // Art of Computer Programming vol. 2, Knuth, 4.2.2, (15)
      mean += (values[index] - mean) / count;
    }
    return mean;
  }

  /**
   * Returns the <a href="http://en.wikipedia.org/wiki/Arithmetic_mean">arithmetic mean</a> of

application/x-sv4cpio          sv4cpio          #
application/x-sv4crc           sv4crc           #
application/x-tar              tar              # UNIX Tape Archive
application/x-tcl              tcl              # TCL Programming Language
application/x-tex              tex              # Tex/LaTeX
application/x-texinfo          texinfo texi     # TexInfo
application/x-troff            t tr roff        # Troff file

   *
   * <p><i>Notes:</i> This is an implementation of the algorithm for Lexicographical Permutations
   * Generation, described in Knuth's "The Art of Computer Programming", Volume 4, Chapter 7,
   * Section 7.2.1.2. The iteration order follows the lexicographical order. This means that the
   * first permutation will be in ascending order, and the last will be in descending order.
   *

  - type: dropdown
    id: author-go-experience
    attributes:
      label: "Go Programming Experience"
      description: "Would you consider yourself a novice, intermediate, or experienced Go programmer?"
      options:
        - "Novice"
        - "Intermediate"
        - "Experienced"
      default: 1

/**
 * The option of a command-line tool where to place the paths to some dependencies.
 * 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.
 *

   *
   * <p><i>Notes:</i> This is an implementation of the algorithm for Lexicographical Permutations
   * Generation, described in Knuth's "The Art of Computer Programming", Volume 4, Chapter 7,
   * Section 7.2.1.2. The iteration order follows the lexicographical order. This means that the
   * first permutation will be in ascending order, and the last will be in descending order.
   *

application/x-sv4cpio          sv4cpio          #
application/x-sv4crc           sv4crc           #
application/x-tar              tar              # UNIX Tape Archive
application/x-tcl              tcl              # TCL Programming Language
application/x-tex              tex              # Tex/LaTeX
application/x-texinfo          texinfo texi     # TexInfo
application/x-troff            t tr roff        # Troff file