*
 * @author Louis Wasserman
 */
@NullUnmarked
public class ComparatorDelegationOverheadBenchmark {
  private final Integer[][] inputArrays = new Integer[0x100][];

  @Param({"10000"})
  int n;

  @BeforeExperiment
  void setUp() throws Exception {
    Random rng = new Random();
    for (int i = 0; i < 0x100; i++) {
      Integer[] array = new Integer[n];
      for (int j = 0; j < n; j++) {

 * Tests for the default implementations of {@code ByteSink} methods.
 *
 * @author Colin Decker
 */
@NullUnmarked
public class ByteSinkTest extends IoTestCase {

  private final byte[] bytes = newPreFilledByteArray(10000);

  private TestByteSink sink;

  @Override
  protected void setUp() throws Exception {
    sink = new TestByteSink();
  }

  public void testOpenBufferedStream() throws IOException {

    .engineVersion(1)
    .build()
)
  .withRetries(5, 1000)
  .auth()
  .loginByAppRole("approle", System.env.VAULT_ROLE_ID, System.env.VAULT_SECRET_ID)
  .getAuthClientToken()

final Vault vault = new Vault(
  new VaultConfig()
    .address(System.env.VAULT_ADDR)
    .engineVersion(1)
    .token(vaultToken)
    .build()
)
  .withRetries(5, 1000)


if (USE_ARTIFACTORY) {

    public Integer crudMode;

    /** The regular canonical hostname that should be used */
    @Required
    @Size(max = 1000)
    public String regularName;

    /** The duplicate hostname that should be redirected to the regular name */
    @Required
    @Size(max = 1000)
    public String duplicateHostName;

    /** The sort order for displaying this duplicate host entry */
    @Required
    @Min(value = 0)

        long endTime = System.currentTimeMillis();
        long duration = endTime - startTime;

        // Then - should complete quickly (this is more of a performance indicator)
        assertTrue(duration < 1000, "Creating and using 10000 EmptyIterators should be fast (took " + duration + "ms)");
    }

    @Test
    @DisplayName("EmptyIterator should work correctly in nested iteration")
    void testNestedIteration() {

  val s =
    when {
      ns <= -999_500_000 -> "${(ns - 500_000_000) / 1_000_000_000} s "
      ns <= -999_500 -> "${(ns - 500_000) / 1_000_000} ms"
      ns <= 0 -> "${(ns - 500) / 1_000} µs"
      ns < 999_500 -> "${(ns + 500) / 1_000} µs"
      ns < 999_500_000 -> "${(ns + 500_000) / 1_000_000} ms"
      else -> "${(ns + 500_000_000) / 1_000_000_000} s "
    }
  return String.format("%6s", s)

  public void testOptimalSize() {
    for (int n = 1; n < 1000; n++) {
      for (double fpp = Double.MIN_VALUE; fpp < 1.0; fpp += 0.001) {
        assertThat(BloomFilter.optimalNumOfBits(n, fpp)).isAtLeast(0);
      }
    }

    // some random values
    Random random = new Random(0);
    for (int repeats = 0; repeats < 10000; repeats++) {

    /** The name of the file configuration (required, maximum 200 characters). */
    @Required
    @Size(max = 200)
    public String name;

    /** The description of the file configuration (maximum 1000 characters). */
    @Size(max = 1000)
    public String description;

    /** The file paths to crawl (required, must be valid file URIs). */
    @Required
    @UriType(protocolType = ProtocolType.FILE)

        assertFalse(loopback.isUsableForChannel());
    }

    @Test
    void testGetScore() {
        NetworkInterfaceInfo basic = new NetworkInterfaceInfo(testAddress, 1000);
        assertEquals(1000, basic.getScore()); // Base score is link speed

        NetworkInterfaceInfo fast = new NetworkInterfaceInfo(testAddress, 10000);
        assertTrue(fast.getScore() > basic.getScore());
    }

    @Test

						SparseHoles: []sparseEntry{{Offset: 1000, Length: 0}},
					}, nil},
					testWrite{strings.Repeat("0123456789", 100), 1000, nil},
					testClose{},
				},
			}, {
				file: "testdata/pax-nil-sparse-hole.tar",
				tests: []testFnc{
					testHeader{Header{
						Typeflag:    TypeReg,
						Name:        "sparse.db",
						Size:        1000,
						SparseHoles: []sparseEntry{{Offset: 0, Length: 1000}},