token {
                        token = "%github.bot-teamcity.token%"
                    }
                filterAuthorRole = PullRequests.GitHubRoleFilter.EVERYBODY
                filterTargetBranch = "+:refs/heads/${VersionedSettingsBranch.fromDslContext().branchName}"
            }
    }
}

fun BaseGradleBuildType.tcParallelTests(numberOfBatches: Int) {
    if (numberOfBatches > 1) {
        params {

        if (patterns == null) {
            final String refs = getApiSearchAcceptReferers();
            if (StringUtil.isBlank(refs)) {
                patterns = new Pattern[0];
            } else {
                patterns = split(refs, "\n").get(

            final long expiration = System.currentTimeMillis() + ctx.getConfig().getDfsTtl() * 1000;
            final Referral[] refs = dfsResp.getReferrals();
            for (int di = 0; di < rn; di++) {
                final DfsReferralDataImpl dr = DfsReferralDataImpl.fromReferral(refs[di], path, expiration, dfsResp.getPathConsumed());
                dr.setDomain(targetDomain);

  }

  @Benchmark
  int hashUtf8(int reps) {
    int res = 0;
    for (int i = 0; i < reps; i++) {
      res +=
          System.identityHashCode(
              hashFunctionEnum.getHashFunction().hashString(strings[i & SAMPLE_MASK], UTF_8));
    }
    return res;
  }

  @Benchmark
  int hashUtf8Hasher(int reps) {
    int res = 0;
    for (int i = 0; i < reps; i++) {
      res +=

import java.util.concurrent.BrokenBarrierException;
import java.util.concurrent.ExecutionException;
import java.util.concurrent.Future;
import java.util.concurrent.TimeoutException;
import java.util.prefs.BackingStoreException;
import java.util.prefs.InvalidPreferencesFormatException;
import java.util.zip.DataFormatException;
import javax.security.auth.RefreshFailedException;
import org.jspecify.annotations.NullUnmarked;

Guillaume Nodet <******@****.***> 1669127925 +0100

        <constraint name="__context__" within="" contains="" />

    }
  }

  @Benchmark
  int arrayIndexed(int reps) {
    int sum = 0;
    for (int i = 0; i < reps; i++) {
      for (int index = 0; index < size; index++) {
        sum += array[index].hashCode();
      }
    }
    return sum;
  }

  @Benchmark
  int arrayIndexedLength(int reps) {
    int sum = 0;
    for (int i = 0; i < reps; i++) {
      for (int index = 0; index < array.length; index++) {

  @Benchmark
  int branchFreeLtIntInlined(int reps) {
    int tmp = 0;
    for (int i = 0; i < reps; i++) {
      int j = i & SAMPLE_MASK;
      int x = xInts[j];
      int y = yInts[j];
      int z = constant[j];
      tmp += z + ((x - y) >>> (Integer.SIZE - 1));
    }
    return tmp;
  }

  @Benchmark
  int branchFreeLtInt(int reps) {
    int tmp = 0;
    for (int i = 0; i < reps; i++) {
      int j = i & SAMPLE_MASK;

    }
  }

  @Benchmark
  void unorderedPlainLocks(int reps) {
    lockAndUnlock(new ReentrantLock(), reps);
  }

  @Benchmark
  void unorderedCycleDetectingLocks(int reps) {
    lockAndUnlock(factory.newReentrantLock("foo"), reps);
  }

  private static void lockAndUnlock(Lock lock, int reps) {
    for (int i = 0; i < reps; i++) {
      lock.lock();
      lock.unlock();
    }
  }