value="${f:h(maxSize)}" class="form-control"
                                               min="0" max="10000000">
                                    </div>
                                </div>
                                <div class="form-group row">

    assertThat(hasCycle(undirectedGraph)).isTrue();
  }

  @Test
  public void hasCycle_deepPathGraph() {
    for (MutableGraph<Integer> graph : graphsToTest) {
      for (int i = 0; i < 100000; i++) {
        graph.putEdge(i, i + 1);
      }
    }
    assertThat(hasCycle(directedNetwork)).isFalse();
    assertThat(hasCycle(undirectedNetwork)).isFalse();
  }

  @Test

    assertThat(bf.approximateElementCount()).isAtMost((long) (sizeGuess * 1.01));
  }

  public void testCreateAndCheckMitz32BloomFilterWithKnownFalsePositives() {
    int numInsertions = 1000000;
    BloomFilter<String> bf =
        BloomFilter.create(
            Funnels.unencodedCharsFunnel(),
            numInsertions,
            0.03,
            BloomFilterStrategies.MURMUR128_MITZ_32);

 *
 * @author Sverre Sundsdal
 */
@NullUnmarked
public class MinMaxPriorityQueueBenchmark {
  @Param private ComparatorType comparator;

  // TODO(kevinb): add 1000000 back when we have the ability to throw
  // NotApplicableException in the expensive comparator case.
  @Param({"100", "10000"})
  private int size;

  @Param private HeapType heap;

  private Queue<Integer> queue;

    /** Whether to use persistent handles for maximum reliability */
    protected boolean usePersistentHandles = false;
    /** Timeout for durable handles in milliseconds */
    protected long durableHandleTimeout = 120000; // 2 minutes
    /** Maximum number of retry attempts for handle reconnection */
    protected int handleReconnectRetries = 3;
    /** Directory to store persistent handle state */
    protected String handleStateDirectory;

        byte[] fileId = new byte[16];
        for (int i = 0; i < 16; i++) {
            fileId[i] = (byte) (i + 1);
        }

        testHandle = new HandleInfo("/test/file.txt", guid, fileId, HandleType.DURABLE_V2, 120000, null);
    }

    @Test
    public void testReconnectHandleSuccess() throws Exception {
        when(mockManager.getHandleForReconnect("/test/file.txt")).thenReturn(testHandle);

      this.multiset = multiset;
      this.keys = keys;
    }

    @Override
    public int[] call() {
      int iterations = 100000;
      int nKeys = keys.size();
      int[] deltas = new int[nKeys];
      Operation[] operations = Operation.values();
      for (int i = 0; i < iterations; i++) {
        int keyIndex = random.nextInt(nKeys);

        // Simulate various RDMA operations
        stats.recordRdmaRead(1024, 1000000); // 1KB in 1ms
        stats.recordRdmaWrite(2048, 2000000); // 2KB in 2ms
        stats.recordRdmaSend(512, 500000); // 512B in 0.5ms
        stats.recordRdmaReceive(1536, 1500000); // 1.5KB in 1.5ms
        stats.recordError();

        // Verify counters

                                               value="${f:h(sortOrder)}" class="form-control"
                                               min="0" max="100000">
                                    </div>
                                </div>
                                <div class="form-group row">

  @GwtIncompatible // Too slow in GWT (~3min fully optimized)
  public void testDivideRemainderEuclideanProperty() {
    // Use a seed so that the test is deterministic:
    Random r = new Random(0L);
    for (int i = 0; i < 1000000; i++) {
      int dividend = r.nextInt();
      int divisor = r.nextInt();
      // Test that the Euclidean property is preserved:
      assertThat(
              dividend