assertThat(Chars.constrainToRange((char) 1, (char) 3, (char) 5)).isEqualTo((char) 3);
    assertThat(Chars.constrainToRange((char) 255, (char) 250, (char) 254)).isEqualTo((char) 254);
    assertThat(Chars.constrainToRange((char) 5, (char) 2, (char) 2)).isEqualTo((char) 2);
    assertThrows(
        IllegalArgumentException.class, () -> Chars.constrainToRange((char) 1, (char) 3, (char) 2));
  }

	_ = x[ErrLexerInvalidChar-249]
	_ = x[ErrLexerInvalidOperator-250]
	_ = x[ErrLexerInvalidLiteral-251]
	_ = x[ErrLexerInvalidIONLiteral-252]
	_ = x[ErrParseExpectedDatePart-253]
	_ = x[ErrParseExpectedKeyword-254]
	_ = x[ErrParseExpectedTokenType-255]
	_ = x[ErrParseExpected2TokenTypes-256]
	_ = x[ErrParseExpectedNumber-257]
	_ = x[ErrParseExpectedRightParenBuiltinFunctionCall-258]
	_ = x[ErrParseExpectedTypeName-259]

  "durations" : [ {
    "testProject" : "bigCppApp",
    "linux" : 288
  }, {
    "testProject" : "bigCppMulti",
    "linux" : 616
  }, {
    "testProject" : "bigNative",
    "linux" : 254
  } ]
}, {
  "scenario" : "org.gradle.performance.regression.buildcache.TaskOutputCachingSwiftPerformanceTest.clean assemble with local cache (swift)",
  "durations" : [ {
    "testProject" : "bigSwiftApp",

    if (log2 < Double.MAX_EXPONENT) {
      sqrt0 = sqrtApproxWithDoubles(x);
    } else {
      int shift = (log2 - DoubleUtils.SIGNIFICAND_BITS) & ~1; // even!
      /*
       * We have that x / 2^shift < 2^54. Our initial approximation to sqrtFloor(x) will be
       * 2^(shift/2) * sqrtApproxWithDoubles(x / 2^shift).
       */
      sqrt0 = sqrtApproxWithDoubles(x.shiftRight(shift)).shiftLeft(shift >> 1);
    }

    checkInitialCapacity(2, 0, 1);
    checkInitialCapacity(2, 1, 1);
    checkInitialCapacity(2, 2, 1);
    checkInitialCapacity(2, 3, 2);
    checkInitialCapacity(2, 4, 2);
    checkInitialCapacity(2, 5, 4);
    checkInitialCapacity(2, 6, 4);
    checkInitialCapacity(2, 7, 4);
    checkInitialCapacity(2, 8, 4);

    checkInitialCapacity(4, 0, 1);
    checkInitialCapacity(4, 1, 1);

    checkInitialCapacity(2, 0, 1);
    checkInitialCapacity(2, 1, 1);
    checkInitialCapacity(2, 2, 1);
    checkInitialCapacity(2, 3, 2);
    checkInitialCapacity(2, 4, 2);
    checkInitialCapacity(2, 5, 4);
    checkInitialCapacity(2, 6, 4);
    checkInitialCapacity(2, 7, 4);
    checkInitialCapacity(2, 8, 4);

    checkInitialCapacity(4, 0, 1);
    checkInitialCapacity(4, 1, 1);

*   Introduces base implementations of ClusterResolvers.
*   Unify memory representations of TensorShape and PartialTensorShape. As a
    consequence, tensors now have a maximum of 254 dimensions, not 255.
*   Changed references to LIBXSMM to use version 1.8.1.
*   TensorFlow Debugger (tfdbg):
    *   Display summaries of numeric tensor values with the `-s` flag to command