barrier.await(1, SECONDS);
      executor.execute(barrierTask);
      // timeout means the second task wasn't even tried
      barrier.await(1, SECONDS);
    } finally {
      service.shutdown();
    }
  }

  public void testRejectedExecutionThrownWithMultipleCalls() throws Exception {
    CountDownLatch latch = new CountDownLatch(1);

    }
    CyclicBarrier barrier =
        new CyclicBarrier(
            6 // for the setter threads
                + 50 // for the listeners
                + 50 // for the blocking get threads,
                + 1); // for the main thread
    ExecutorService executor = newFixedThreadPool(barrier.getParties());

                }
              });
      CyclicBarrier barrier = new CyclicBarrier(numThreads + 1);
      Runnable wrapper =
          new Runnable() {
            @Override
            public void run() {
              awaitUnchecked(barrier);
              task.run();
              awaitUnchecked(barrier);
            }
          };
      for (int j = 0; j < 10; j++) {

      barrier.await(1, SECONDS);
      executor.execute(barrierTask);
      // timeout means the second task wasn't even tried
      barrier.await(1, SECONDS);
    } finally {
      service.shutdown();
    }
  }

  public void testRejectedExecutionThrownWithMultipleCalls() throws Exception {
    CountDownLatch latch = new CountDownLatch(1);

    }
    CyclicBarrier barrier =
        new CyclicBarrier(
            6 // for the setter threads
                + 50 // for the listeners
                + 50 // for the blocking get threads,
                + 1); // for the main thread
    ExecutorService executor = newFixedThreadPool(barrier.getParties());

                public @Nullable Void call() throws Exception {
                  barrier.await();
                  Integer first = graph.nodes().iterator().next();
                  for (Integer node : graph.nodes()) {
                    Set<Integer> unused = graph.successors(node);
                  }
                  /*
                   * Also look up an earlier node so that, if the graph is using MapRetrievalCache,

    ExecutorService executor = newDirectExecutorService();
    CyclicBarrier barrier = new CyclicBarrier(2);

    FutureTask<@Nullable Void> otherTask =
        new FutureTask<>(
            () -> {
              Future<?> future =
                  executor.submit(
                      () -> {
                        // WAIT #1
                        barrier.await(1, SECONDS);

                        // WAIT #2

    ExecutorService executor = newDirectExecutorService();
    CyclicBarrier barrier = new CyclicBarrier(2);

    FutureTask<@Nullable Void> otherTask =
        new FutureTask<>(
            () -> {
              Future<?> future =
                  executor.submit(
                      () -> {
                        // WAIT #1
                        barrier.await(1, SECONDS);

                        // WAIT #2

                public @Nullable Void call() throws Exception {
                  barrier.await();
                  Integer first = graph.nodes().iterator().next();
                  for (Integer node : graph.nodes()) {
                    Set<Integer> unused = graph.successors(node);
                  }
                  /*
                   * Also look up an earlier node so that, if the graph is using MapRetrievalCache,

    dispatcher = Dispatcher.legacyAsync();

    CyclicBarrier barrier = new CyclicBarrier(2);
    CountDownLatch latch = new CountDownLatch(2);

    new Thread(
            new Runnable() {
              @Override
              public void run() {
                try {
                  barrier.await();
                } catch (Exception e) {
                  throw new AssertionError(e);