dependencies {
                    'default'('com.acme.external:external:1.0')
                }
            }
        """
        resolve.prepare {
            config('_compileFree', 'checkFree')
            config('_compilePaid', 'checkPaid')
        }

        file('includedBuild/build.gradle') << """
            enum SomeEnum { free, paid }
            interface Thing extends Named { }

			return msgFuture, nil
		}
	}
}

// checkTrees checks that older (from olderNote) is contained in newer (from newerNote).
// If an error occurs, such as malformed data or a network problem, checkTrees returns that error.
// If on the other hand checkTrees finds evidence of misbehavior, it prepares a detailed
// message and calls log.Fatal.

#!/bin/bash
# script to be used for Gradle performance test bisecting
# example usage:
# git bisect start HEAD REL_2.14 --  # HEAD=bad REL_2.14=good
# git bisect run check_rev.sh JavaConfigurationPerformanceTest lotDependencies
TESTNAME=${1:-IdeIntegrationPerformanceTest}
TESTPROJECT=${2:-multi}
./gradlew clean
[ -d ~/.gradle-bisect-override ] && cp -Rdvp ~/.gradle-bisect-override/* .

           ~/.gradle-bisect-override

# check revision
./check_rev.sh RealWorldNativePluginPerformanceTest mediumNativeMonolithic
```

Now you can use the script automatically with `git bisect`.

```bash
git bisect start HEAD REL_2.14 --  # HEAD=bad REL_2.14=good
git bisect run check_rev.sh RealWorldNativePluginPerformanceTest mediumNativeMonolithic
```

	}
	return append(p, th), hashes
}

// CheckTree verifies that p is a valid proof that the tree of size t with hash th
// contains as a prefix the tree of size n with hash h.
func CheckTree(p TreeProof, t int64, th Hash, n int64, h Hash) error {
	if t < 1 || n < 1 || n > t {
		return fmt.Errorf("tlog: invalid inputs in CheckTree")
	}
	h2, th2, err := runTreeProof(p, 0, t, n, h)
	if err != nil {

		//			#next = 0
		//			return rv
		//		}
		// 		return false // or handle returns and gotos
		//	}

		if loop.checkRet {
			// Note: next < 0 also handles gotos handled by outer loops.
			// We set checkRet in that case to trigger this check.
			if r.checkFuncMisuse() {

  // CHECK: %[[CONVERT_1:.*]] = mhlo.bitcast_convert %[[QUANT0]] : (tensor<?x!quant.uniform<i8:f32, 1.000000e+00:3>>) -> tensor<?xi8>
  // CHECK: mhlo.while()
  // CHECK: cond
  // CHECK: %[[CHECK_RES:.*]] = chlo.broadcast_compare
  // CHECK: mhlo.return %[[CHECK_RES]] : tensor<i1>
  // CHECK: %[[CONVERT_2:.*]] = mhlo.bitcast_convert %[[CONVERT_1]] : (tensor<?xi8>) -> tensor<?x!quant.uniform<i8:f32, 1.000000e+00:3>>