public void close() throws Exception {
        if (executorService != null) {
            try {
                executorService.shutdown();
                executorService.awaitTermination(60, TimeUnit.SECONDS);
            } catch (final InterruptedException e) {
                if (logger.isDebugEnabled()) {
                    logger.debug("Executor shutdown interrupted", e);
                }
            } finally {

      assertTrue(
          IntMath.biggestBinomials[k] == Integer.MAX_VALUE
              || !fitsInInt(BigIntegerMath.binomial(IntMath.biggestBinomials[k] + 1, k)));
      // In the first case, any int is valid; in the second, we want to test that the next-bigger
      // int overflows.
    }
    assertFalse(
        fitsInInt(
            BigIntegerMath.binomial(

            }
        }
        return list.toArray(new Kind[list.size()]);
    }

    /**
     * Merges two suggest items.
     * @param item1 The first suggest item.
     * @param item2 The second suggest item.
     * @return The merged suggest item.
     */
    public static SuggestItem merge(final SuggestItem item1, final SuggestItem item2) {
        if (!item1.getId().equals(item2.getId())) {

    ImmutableList<TestDatum> second =
        ImmutableList.of(new TestDatum("A", 3), new TestDatum("A", 4));

    Comparator<TestDatum> comparator = Comparator.comparing(d -> d.letter);
    Iterator<TestDatum> merged =
        Iterators.mergeSorted(ImmutableList.of(first.iterator(), second.iterator()), comparator);

    )

    taskFaker.assertNoMoreTasks()
  }

  /**
   * This test performs two races:
   *
   *  * The first race is between plan0 and plan1, with a 250 ms head start for plan0.
   *  * The second race is between plan2 and plan3, with a 250 ms head start for plan2.
   *
   * We get plan0 and plan1 from the route planner.
   * We get plan2 as a follow-up to plan1, typically retry the same IP but different TLS.

    @Override
    public String toString() {
      return "Ordering.arbitrary()";
    }

    /*
     * We need to be able to mock identityHashCode() calls for tests, because it
     * can take 1-10 seconds to find colliding objects. Mocking frameworks that
     * can do magic to mock static method calls still can't do so for a system
     * class, so we need the indirection. In production, Hotspot should still

            fileFsFullSizeInfo.decode(buffer1.array(), 0, 32);
            long firstCapacity = fileFsFullSizeInfo.getCapacity();
            long firstFree = fileFsFullSizeInfo.getFree();

            // When - second decode with different values
            ByteBuffer buffer2 = ByteBuffer.allocate(32);
            buffer2.order(ByteOrder.LITTLE_ENDIAN);
            buffer2.putLong(2000L);
            buffer2.putLong(1500L);

 *     }
 *   }
 *
 *   protected void shutDown() throws Exception {
 *     saveUris(toCrawl);
 *   }
 *
 *   protected Scheduler scheduler() {
 *     return Scheduler.newFixedRateSchedule(0, 1, TimeUnit.SECONDS);
 *   }
 * }
 * }
 *
 * <p>This class uses the life cycle methods to read in a list of starting URIs and save the set of
 * outstanding URIs when shutting down. Also, it takes advantage of the scheduling functionality to

     * differences are found, making the execution time independent of the position
     * of differing characters.
     *
     * @param a first char array to compare
     * @param b second char array to compare
     * @return true if arrays are equal, false otherwise
     */
    private static boolean constantTimeEquals(char[] a, char[] b) {
        if (a == null && b == null) {
            return true;

        // This is possible when following both superClass -> enclosingClass
        // and enclosingclass -> superClass paths.
        // Since we follow the path of superclass first, enclosing second,
        // superclass mapping should take precedence.
        return;
      }
      // First, check whether var -> arg forms a cycle
      for (Type t = arg; t != null; t = mappings.get(TypeVariableKey.forLookup(t))) {