List<String> parentCommits = parentCommitsOf(commit);
        if (parentCommits.size() != 2) {
            System.out.println(commit + " is not a merge commit we're looking for. Parents: " + parentCommits);
            return;
        }

        List<String> commitBranches = branchesOf(commit);
        if (commitBranches.stream().anyMatch(b -> b.startsWith("origin/release"))) {

to ask any questions.

## Finding issues to work on

If you are looking for good first issues, take a look at the list of [good first issues](https://github.com/gradle/gradle/labels/good%20first%20issue) that should be actionable and ready for a contribution.

   */
  private static void selectInPlace(int required, double[] array, int from, int to) {
    // If we are looking for the least element in the range, we can just do a linear search for it.
    // (We will hit this whenever we are doing quantile interpolation: our first selection finds
    // the lower value, our second one finds the upper value by looking for the next least element.)
    if (required == from) {
      int min = from;

    *   Added complex128 support to FFT, FFT2D, FFT3D, IFFT, IFFT2D, and IFFT3D.
    *   Making ids unique in `nn.embedding_lookup_sparse`. This helps to reduce
        RPC calls for looking up the embeddings when there are repeated ids in
        the batch.
    *   Support indicator column in boosted trees.
    *   Prevent `tf.gradients()` from backpropagating through integer tensors.